A simple tool to keep requests to be executed in order.
Collection of basic layout algorithms for graphology.
Convert an object or array into a formatted string
Simple FIFO queue implementation to avoid having to do shift() on an array, which is slow.
Power Assert output formatter
asynchronous function queue with adjustable concurrency
Remove circular references from objects
The Material Components for the web circular progress component
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
Fastest deep equal comparison for React. Great for React.memo & shouldComponentUpdate. Also really fast general-purpose deep comparison.
Prevent defined property getters from throwing errors
Next tick shim that prefers process.nextTick over queueMicrotask for compat
Lightweight dependency injection container for JavaScript/TypeScript
Priority queue data structures
Circular Buffer JavaScript implementation
A NodeJS simple circular buffer implementation supporting indexing
TSLint plugin to detect and warn about circular imports
React Native component for creating animated, circular progress with react-native-svg
Create graphs from module dependencies.
Promise-based queue
LRU Queue
Detect modules with circular dependencies when bundling with webpack.
Simple JS queue with auto run for node and browsers
Like an array, but rounder.