#queue #buffer #ring #random-access


RingBuffer is a queue with added random access

11 releases (6 stable)

2.0.2 Jul 2, 2021
2.0.0 Jul 1, 2021
1.0.2 Jul 1, 2021
1.0.0 Jun 1, 2021
0.1.1 Jul 13, 2019

#1012 in Algorithms

Used in gpcas_simulator


831 lines


pipeline status

RingBuffer is a mix of a vector and a queue. It allows for direct element access as well as pushing and popping elements like a queue.


use ringbuffer::RingBuffer;

fn main() {
    let mut buffer = RingBuffer::new();
    let first_index = buffer.push(42);
    let second_index = buffer.push(9001);
    println!("{} == {}", buffer.get_relative(0),
    println!("{} == {}", buffer.get_relative(1),

Why use this?

The features of RingBuffer come in handy when processing a stream of elements while also needing to access elements at random.


Licensed under either of Apache License, Version 2.0 or MIT license at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in this crate by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

No runtime deps