A queue (the abstract data structure) implemented using a fixed size circular buffer
Fixed ring buffer that allows non-consuming iteration both ways
Fixed-capacity circular buffer implementations: heap-allocated ArrayDeque and stack-allocated StackArrayDeque. Efficient O(1) operations, no_std support.
Nifty Simple Ring Buffer (aka circular buffer) is a no_std library that provides 2 macros to easily create fixed circular buffer on the stack.
A fixed size deque implementation
A fixed-size circular buffer
Efficient, fixed-size, overwriting circular buffer
Rust fixed size circular (ring) buffer
A ring buffer with a fixed capacity, which can be stored on the stack.
A custom utils library for some common unsafe operations
A fixed-size, zero-allocation circular buffer for Rust.
A high-performance ring buffer implementation of the LMAX Disruptor pattern
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.