ring_buffer

Crates.ioring_buffer
lib.rsring_buffer
version2.0.2
sourcesrc
created_at2019-07-13 00:57:38.382274
updated_at2021-07-02 10:38:16.231657
descriptionRingBuffer is a queue with added random access.
homepagehttps://crates.io/crates/ring_buffer
repositoryhttps://git.h3n.eu/Kulasko/ring_buffer
max_upload_size
id148660
size62,429
(Kulasko)

documentation

https://docs.rs/ring_buffer

README

ring_buffer

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.

Example

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),
        buffer.get_absolute(first_index));
    
    println!("{} == {}", buffer.get_relative(1),
        buffer.get_absolute(second_index));
}

Why use this?

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

License

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.
Commit count: 0

cargo fmt