A fast fifo implementation similar to the one powering nextTick in Node.js core
TypeScript definitions for fast-fifo
A fast FIFO queue implementation.
A simple and fast FIFO collection for enqueuing and dequeuing items.
Train a fast (FIFO) queue with a rollback mechanism. Behind the scenes it uses 2 arrays to simulate and perform fast shifting and popping operations without using the Array#shift() method..
Fast FIFO queue backed by a singly-linked list of fixed-size circular buffers. Adapted from Node.js's internal `fixed_queue.js`.
A fast FIFO implementation purely based on Node Buffers
A tiny, simple and fast FIFO queue.
Promised First-In-First-Out buffer. Await on push to be told when a value is consumed and await on shift for a value to consume when the buffer is empty.
LRU and FIFO caches for Client or Server
FIFO queue implemented using a double linked-list
A simple double ended queue datastructure
tar for node
A fifo rdf-resolve-hypermedia-links-queue actor
SQS adapter for message-queue-toolkit
SNS adapter for message-queue-toolkit
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Fast deep equal
Fastest deep equal comparison for React. Great for React.memo & shouldComponentUpdate. Also really fast general-purpose deep comparison.
a simple fifo queue
Property based testing framework for JavaScript (like QuickCheck)
Javascript implementation of a queue data structure
React is a JavaScript library for building user interfaces.
Validate XML, Parse XML, Build XML without C/C++ based libraries
Fast hash-like fixed size cache class with FIFO functionality which removes oldest or less accessed records based on implicit heap.
|> Distributed locks with "prioritized lock acquisition queue" capabilities based on the Redis Database. |> Each lock request is put into the request queue (each lock is hosted by its own queue separately from other queues) and processed in order of their priority (FIFO). |> Each lock request lives some period of time (RTTL) (with requeue capabilities) which guarantees the request queue will never be stacked. |> In addition to the classic `queued` (FIFO) strategy RQL supports `random` (RANDOM) lock obtaining strategy when any acquirer from the lock queue can obtain the lock regardless the position in the queue. |> Provides flexible invocation flow, parametrized limits (lock request ttl, lock ttl, queue ttl, lock attempts limit, fast failing, etc), logging and instrumentation.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.