A simple double ended queue datastructure
An iterator to iterate an array in random order with controls to requeue or dequeue elements during the iteration
Queues using linked list, faster than array.shift(), support enqueue,dequeue,enqueue all, dequeue all, clear, forEach, first, last
dequeue
indexed dequeue
A high-performance priority queue with O(1) enqueue/dequeue and FIFO ordering within priority levels.
Tiny queue data structure
Task and Message Queues with Multiple Providers
This library has a Queue with the following methods: enqueue and dequeue. Enqueue adds item(s) to end of the Queue. Dequeue removes and returns the first item from the beginning of the queue.
Promise-based dequeue
Dequeue implementation for TypeScript.
A modular and efficient implementation of a Priority Queue with enqueue-optimized and dequeue-optimized strategies.
Queue data structure with enqueue, dequeue, peek, size and flush methods
This module implements the abstract data type Queue. All the standard Queue operations have been implemented (create, enqueue, dequeue, front & isEmpty).
A simple queue for JavaScript containing operations like enqueue, dequeue, etc
Extremely fast double-ended queue implementation
Priority queue data structures
deq (dequeue) places records in a redis queue for high throughput and dequeues them into your choice of (slower write-speed) datastore
A queue that will dequeue (call a provided function) at a given rate and has a max number concurrent (active functions running)
Create lazy module that enqueue calls while the original module is loading and dequeue calls when it is loaded.
Add things to [queue](<https://en.wikipedia.org/wiki/Queue_(abstract_data_type)>) and have them dequeue sequentially (FIFO) based on their defined expiration (ttl). Read head of the queue as a [store](https://github.com/marianmeres/store) value.
Queue sync or async functions with max concurrency, max size, max age, and fifo/lifo ordering
Type-script based library for efficient implementation of some of the standard data structures like Stack, Queue, Dequeue, etc.
A message dequeuer for nodezoo
Task execution runtime for CeleRS with concurrency control and health checks
A Bucket Queue data structure that can be used as a Priority Queue.
A wrapper crate of queue-file for bincode serializable structs.
A buffering MPSC queue.
A procedural macro for creating ring buffer (circular buffer) data structures at compile time
SQL database broker implementation for CeleRS (MySQL)
Tokio async adapter for firq-core
Core multi-tenant scheduler with DRR fairness, deadlines, and backpressure
Tower middleware integration for Firq scheduling
A production-shaped Rust job queue: Axum API + async workers + Postgres SKIP LOCKED dequeue, retries with decorrelated jitter, idempotency, cooperative cancellation, OpenAPI, Prometheus metrics.
helper type and traits for passing context through dyn Error trait objects
Purely Functional Data Structures
A de-duplicating priority queue that uses mongodb as the storage engine.
Program to an interface, not an implementation - hides Redis (used as a queue) behind a simple interface
Provides simple enqueue/dequeue facilities for Amazon SQS.
Remotely enqueueing and dequeueing jobs across Redis namespaces should be simpler. BJ Neilsen laid a solid foundation for this gem, which is forked off of his gem resque-remote. That said, these two gems provide a different set of methods for remote enqueueing and dequeueing. If all you need is remote enqueueing within the same namespace, use resque-remote.
A thread safe, Redis backed queue with the ability to delay items from being dequeued
a very simplistic queue server and agent
Thread-safe queue and stack data structures with configurable capacity limits, blocking enqueue/dequeue with timeouts, and peek operations. Uses Mutex and ConditionVariable for safe concurrent access.
It supports the usual enqueue and dequeue operations, along with methods for peeking at the first item, testing if the queue is empty and counting the number of items in the queue.
FilesystemQueue is a Ruby gem that provides a persistent queue system using the local filesystem.It allows you to enqueue and dequeue jobs, and keeps track of completed and failed jobs.
CollectionUtils provide with basic collection templates like stack(push, pop, peek), queues(enqueue, dequeue), heaps/tree(MinHeap, MaxHeap, BST) and HashDeserializedObject(Converts a hash into object for easy access. All the keys will become attributes of the object). Check out the wiki at https://github.com/deeshugupta/collection_utils/wiki
A simple elaboration on Ruby's native SizedQueue which allows using the queue object to re-awaken a blocked thread and cause it to abandon its blocking enqueue/dequeue operation. Useful for simplifying program logic, reducing the need for external flags/Muteces (yes, I said Muteces), and for cleanly resolving queues on program termination without risk of data loss or deadlock. Why use this queue? There are two reasons. For one thing, under several circumstances it is _considerably_ faster than Ruby's native SizedQueue. I admit I'm not entirely sure why, but I have tested this on multiple platforms and it seems to hold true as a generality. You can feel free to confirm or dispel that this advantage holds for your use case at your own leisure. The second reason is the aforementioned simplification of program logic. In the case that all data passing through the queues must be preserved on program termination, SizedQueue can require some elaborate trickery to ensure that even the most remote possibility of deadlock is removed. ImprovedSizedQueue solves this problem by making it possible to use the queue to pass control messages between threads, irrespective of the queue's actual content.
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.