A circular buffer-like queue.
a limited queue that overrides the oldest data if trying to push a data when the queue is full.
A structure that holds the last N items pushed to it.
A double-ended queue implemented using a vector that reuses space after elements are removed.
A self-expanding ring buffer similar to VecDeque optimized for working with slices of data
A simple fixed-length ring buffer implementation, intended to be no-frills and easy to use, especially for embedded applications.
A tri-partite ring buffer
A queue (the abstract data structure) implemented using a fixed size circular buffer
Efficient, fixed-size, overwriting circular buffer
A crate for common data structures and algorithms
rustgym solutions
ARM SMMU v3 (System Memory Management Unit) implementation - Production-grade translation engine
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.