21 packages found
Tiny queue data structure
Priority queue data structures
A simple and fast FIFO collection for enqueuing and dequeuing items.
Priority queue data structures
This library has a Queue with the following methods: enqueue and dequeue. Enqueue adds item(s) to end of the Queue. Dequeue removes and returns the first item from the beginning of the queue.
Queue data structure with enqueue, dequeue, peek, size and flush methods
A spiral deque - high performance and dynamic queue size
Tiny queue data structure
Fast Queue implementation in javascript
Fast performance queue implementation
Tiny queue data structure
Queue + Stack ADTs.
Just the cutest and tiniest queue/deque implementation!
Some Basic Data Structures for use in JavaScript
A small ES6 package for execute functions sequentially.
Queues using linked list, faster than array.shift(), support enqueue,dequeue,enqueue all, dequeue all, clear, forEach, first, last
Collection of elements where insert, delete happens only at the ends.