Circular queue in Typescript
Typescript implementation of queues, such as priority queue and circular queue.
Find the longest common subsequence.
Curated collection of data structures for the JavaScript/TypeScript.
Deterministic and safely JSON.stringify to quickly serialize JavaScript objects
Tiny queue data structure
Safely and quickly serialize JavaScript objects
Extremely fast double-ended queue implementation
string representations of objects in node and the browser
fast, tiny `queueMicrotask` shim for modern engines
A circular progress indicator component
A shim for the setImmediate efficient script yielding API
Promise queue with concurrency control
The smallest and simplest JavaScript priority queue
Priority queue.
A simple tool to keep requests to be executed in order.
The Material Components for the web circular progress component
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
Next tick shim that prefers process.nextTick over queueMicrotask for compat
Fastest deep equal comparison for React. Great for React.memo & shouldComponentUpdate. Also really fast general-purpose deep comparison.
Knuth shuffle
A algorithm based on minimax search and alpha-beta prune to solve gomoku game.
Lightweight dependency injection container for JavaScript/TypeScript
D3 sankey with circular links