High-performance Deque (Double-Ended Queue) for DSA practice with O(1) operations
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
JavaScript utility classes toolbox
High-performance Deque (Double-Ended Queue) for DSA practice with O(1) operations
Javascript common development toolkit
usingbytes-dsa is comprehensive JavaScript library for common data structures and algorithms. This library is designed to be both educational and practical, providing implementations of fundamental data structures and algorithms that can be used in a vari
A ring buffer with a fixed capacity, which can be stored on the stack.
Fixed-capacity circular buffer implementations: heap-allocated ArrayDeque and stack-allocated StackArrayDeque. Efficient O(1) operations, no_std support.
A fixed-capacity, stack-allocated double-ended queue (deque) backed by generic-array
Deque implemented by array.
Array- and slice-backed double-ended queues in 100% safe Rust.
Iterator Peekable with multi-forward-peek and multi-backward-peek
Array-based deque structures