Simple utilities solution.
Queue data structure with expiration
Two-array implementation of a queue
JavaScript Data Structure written in TypeScript
A priority queue and consumer
TypeScript async producer-consumer queue with backpressure control, similar to Go channels or .NET Channel<T>
queue
in-memory only nostr relay
mjs_structs is a base package for working with common data structures easier than manually.
Transport adapters over the shared runtime.
Node.js host for @bratsos/workflow-engine command kernel
Lightweight, optimized, and efficient implementations for FIFO (queue) data structure
Making post requests to KV is slow. Our workers spend most of the time waiting for the POST requests to finish. We want them to run faster. So that we can avoid hitting the timeout limit of 15 minutes. When the workers hit the timelimit the entire job cra
Get objects only after timeout, sorted by timeout (longest expiration first).
A user management system written in node
A collection of clean, testable data structures in modern TypeScript
Useful data structures with no dependencies
in-memory israeli-queue influenced by: http://www.math.tau.ac.il/~uriy/Papers/IQ-with-Priorities.pdf
Collection library
CSS Rules manipulation, the jQuery way
A JS memory to Set/Get, Queues and Pub/Sub solutions
Priority Queue data structure implementation in JavaScript for efficient data handling and retrieval.
Personal AI workflow harness with Kent Beck's Augmented Coding principles
> Tiny queue data structure