Double Ended Queue Datastructure - ordered collection with optimized access from its endpoints
A performant double-ended queue (deque) implementation in javascript.
deque cauldron pattern library styles
Deque
Fully accessible react components library for Deque Cauldron
Deques are a generalization of stacks and queues
Python's deque data structure for JavaScript
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.
Production-ready TypeScript data structures: Heap, Deque, Trie, Graph, Red-Black Tree, TreeMap, TreeSet, and more. Zero dependencies, type-safe, with getRank/getByRank/rangeByRank support.
deque datastructure
[](https://www.npmjs.com/package/@zimtsui/deque)
Observable deque (linked list).
Wrapper package for double-ended-queue
Just the cutest and tiniest queue/deque implementation!
Extremely fast double-ended queue implementation
A spiral deque - high performance and dynamic queue size
Consistent ESLint standards for Deque product development
Deque implementation in JavaScript
A head-tail linked list, or deque, implementation in Javascript
Array-backed implementation of a deque. Supports O(1) random access, and amortized O(1) insertion and removal at the front and back of the deque
jest accessibility matching utilities with deque axe
Stream powered by Deque circular queue for blazing fast performance
A simple double-ended queue (deque) implementation in TypeScript
javascript standard data structure library which benchmark against C++ STL
A (mostly) lock-free concurrent work-stealing deque
Fixed-capacity circular buffer implementations: heap-allocated ArrayDeque and stack-allocated StackArrayDeque. Efficient O(1) operations, no_std support.
A fixed size VecDeque to match Python Deque
A fixed-capacity, stack-allocated double-ended queue (deque) backed by generic-array
A OS based timer and timer queue which implements timeout queues of different types.
A high-performance double-ended queue, inspired by BOOST deque. Every element in this deque is pinned until its popping.
Two terminal queue based on slotmap
A production-ready Rust crate for lock-free concurrent data structures with performance monitoring
A fixed size deque implementation
Deque with stable index values
Deque implemented by array.
BareMetalDeque is a deque implementation intended for no_std use
A Deque is a queue type data structure that allows efficient insertion and deletion from both ends of the queue. This implementation wrapps the standard C++ structure of the same name.
Adds Redis::Deque class which can be used as Distributed-Deque based on Redis. Redis is often used as a messaging server to implement processing of background jobs or other kinds of messaging tasks. It implements Reliable-queue pattern decribed here: http://redis.io/commands/rpoplpush
Heap, Priority Queue, Deque, Stack, Queue, Red-Black Trees, Splay Trees, sorting algorithms, and more
The gem contains various implementations of known and uknown data structures and algorithms. /Currently the gem contains: #stack, #queue, #deque, #binary_heap, #priority_queue, #linked_list, #double_linked_list/
Heap, Priority Queue, Deque, Stack, Queue, Red-Black Trees, Splay Trees, sorting algorithms, and more
Heap, Priority Queue, Deque, Stack, Queue, Red-Black Trees, Splay Trees, sorting algorithms, and more
Provides MinHeap, MaxHeap, PriorityQueue, Deque, Trie, UnionFind, and LinkedList — data structures commonly needed for coding interviews but missing from Ruby's stdlib.
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.
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.