#queue #deque #array #circular #ring

no-std array_buf

Highly optimized fixed-capacity deque buffer stored on stack

1 unstable release

Uses new Rust 2024

0.1.0 Jan 14, 2026

#1203 in Data structures


Used in 3 crates (via alphabet_detector)

MIT/Apache

40KB
799 lines

Array Buffer

Crate API

Highly optimized fixed-capacity deque buffer stored on stack.

Todo:

  • iter() is not implemented, but there is as_slices();
  • Can become a true ring buffer. It can overwrite an old element, but it needs to drop it (for not plain). Increment both start and end (start == end);

No runtime deps

Features