Lightweight SQLite-backed key-value server with HTTP API, atomic transactions, TTL, queue, and TypeScript client SDK.
[](https://www.npmjs.com/package/@zimtsui/ttl-queue)
Headless CLI client for the Agent Client Protocol (ACP) — talk to coding agents from the command line
Tiny queue data structure
Missing keepalive http.Agent
A cache object that deletes the least-recently-used items.
fast, tiny `queueMicrotask` shim for modern engines
A simple queue node that store incoming messages in memory queue and uses a feedback from a following action or trigger message to release the next message stored in the queue.
A shim for the setImmediate efficient script yielding API
Like a JavaScript Set, but with a TTL on entries
Promise queue with concurrency control
A simple tool to keep requests to be executed in order.
The smallest and simplest JavaScript priority queue
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
High Performance Layer 1 / Layer 2 Caching with Keyv Storage
Next tick shim that prefers process.nextTick over queueMicrotask for compat
In memory queue system prioritizing tasks
Promise-based queue
The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.
Sequential asynchronous lock-based queue for promises
Simple JS queue with auto run for node and browsers
LRU Queue
asynchronous function queue with adjustable concurrency
Simple JS queue with auto run for node and browsers
Delay queue keeps it's elements ordered by a timestamp, popping off the items with the lowest timestamp first
|> 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.
Thermos is a Rails caching library that keeps your cache always warm by automatically rebuilding it in the background when ActiveRecord models change. No more stale data from TTL expiration, no more slow cold cache hits, and no need to 'touch' associated models. Works with any ActiveJob backend (Sidekiq, Solid Queue, etc.) and any cache store (Redis, Memcached, Solid Cache, etc.). Perfect for API responses, JSON serialization, and view caching.
No description provided.
No description provided.
No description provided.