yocto-queue
Tiny queue data structure
Tiny queue data structure
Priority queue data structures
Priority queue data structures
Queues using linked list, faster than array.shift(), support enqueue,dequeue,enqueue all, dequeue all, clear, forEach, first, last
A simple and fast FIFO collection for enqueuing and dequeuing items.
A small ES6 package for execute functions sequentially.
A spiral deque - high performance and dynamic queue size
observable sequence
deq (dequeue) places records in a redis queue for high throughput and dequeues them into your choice of (slower write-speed) datastore
Queue + Stack ADTs.
Fast performance queue implementation
A pretty small ES6 API for Queue and Stack ADTs.
Collection of elements where insert, delete happens only at the ends.
dequeue
indexed dequeue
Priority queue data structures
This is a package containing multiple **datastructures** and some **graph algorithms** written in typescript with no dependencies usable with commonjs, esm and in the browser. Also some other handy utility function are contained in this package.
Queue data structure with enqueue, dequeue, peek, size and flush methods
Tiny queue data structure
Lightweight, type-safe, and memory-efficient queue for resource-sensitive applications.