Deque data structure
JavaScript
27
5
MIT License
The `@datastructures-js/deque` project provides a Deque (double-ended queue) data structure implementation in JavaScript, offering efficient insertion and removal operations at both ends of the queue. It's designed for developers and engineers who need a performant, flexible queue-like structure for algorithms, data processing, or applications requiring bidirectional access to elements.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of datastructures-js/deque
BDD/TDD assertion library for node.js and the browser. Test framework agnostic.
Airbnb's base JS ESLint config, following our styleguide
Import with sanity.
The JavaScript Task Runner
Almost config-free Istanbul code coverage reporter for Mocha usage in Grunt
A grunt task for running server side mocha tests
Yet another JS code coverage tool that computes statement, line, function and branch coverage with module loader hooks to transparently add coverage when running tests. Supports all JS coverage use cases including unit tests, server side functional tests and browser tests. Built for scale
simple, flexible, fun test framework
Support the repos that depend on datastructures-js/deque
Top contributors
eyas-ranjous
58 contributions
rsolohor
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet