Extremely fast double-ended queue implementation
JavaScript
619
45
MIT License
This project provides an extremely fast, GC-friendly double-ended queue implementation in JavaScript using a circular buffer. It's designed for performance-critical applications where constant-time `O(1)` insertions and removals at both ends are needed, serving as a high-performance alternative to arrays for queue and stack operations.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of petkaantonov/deque
The JavaScript Task Runner
ECMAScript parser
simple, flexible, fun test framework
Full featured Promises/A+ implementation with exceptionally good performance
Support the repos that depend on this repository
Top contributors
petkaantonov
7 contributions
TheSisb
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet