A simple async queue that yields to IO under load.
fast, tiny `queueMicrotask` shim for modern engines
datastructures: simple and fast queue and priority queue
A shim for the setImmediate efficient script yielding API
Tiny queue data structure
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.
A lightweight and fast queue database server with WebSocket support for real-time data streaming
Fast Queue implementation in javascript
Fast, in memory work queue
A fast queue for integers.
Fast heap-based priority queue in JavaScript
Extremely fast double-ended queue implementation
Useful TypeScript utilities.
Promise queue with concurrency control
A simple tool to keep requests to be executed in order.
queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often
High-priority task queue for Node.js and browsers
The smallest and simplest JavaScript priority queue
A simple, fast, robust job/task queue, backed by Redis.
Next tick shim that prefers process.nextTick over queueMicrotask for compat
Specialized fast async file writer
Promise-based queue
Better Stack JavaScript logging tools (formerly Logtail)
LRU Queue
A blazzingly fast implementation of priority queue using Rust + Ruru
Fast priority queue implementation (c++ wrapper, see README.md for a comparison with other libraries)
Cloudist is a simple, highly scalable job queue for Ruby applications, it can run within Rails, DaemonKit or your own custom application. Refer to github page for examples
Fast and simple job queue microservice for Ruby.
A C extension implementation of a d-ary heap data structure, suitable for use in e.g. priority queues or Djikstra's algorithm.
River is a fast job queue for Go. Use this gem in conjunction with gems riverqueue-activerecord or riverqueue-sequel to insert jobs in Ruby which will be worked from Go.
Brokerless Message Queue
Edamame combines the Beanstalk priority queue with a Tokyo Tyrant database and God monitoring to produce a persistent distributed priority job queue system. Like beanstalk, it is fast, lightweight, distributed, priority queuing, reliable scheduling; it adds persistence, named jobs and job querying/enumeration.
Fast priority queue implementation (c++ wrapper, see README.md for a comparison with other libraries)
Edamame combines the Beanstalk priority queue with a Tokyo Tyrant database and God monitoring to produce a persistent distributed priority job queue system. Like beanstalk, it is fast, lightweight, distributed, priority queuing, reliable scheduling; it adds persistence, named jobs and job querying/enumeration.
A SQLite based, lightning fast, super efficient and dead simple to setup and use database, cache and job queue for Ruby and Rails applications!
The project implements a queue system with a server and some client apis. This project wants to be a fast and lightweight implementation with most of the features of MQS or ActiveMQ.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.