pub struct RingBuffer<T> {
    data: VecDeque<T>,
    offset: usize,
}
Expand description

A view onto a finite range of an infinitely long sequence of T.

The Ts are indexed 0..infinity. A RingBuffer begins as a view of elements 0..0 (i.e. nothing). The user of the RingBuffer advances its left and right position independently, although only in the positive direction, and only with left <= right at all times.

Holding a RingBuffer whose view is elements left..right gives the ability to use Index and IndexMut to access elements i in the infinitely long queue for which left <= i < right.

Fields§

§data: VecDeque<T>§offset: usize

Implementations§

source§

impl<T> RingBuffer<T>

source

pub fn new() -> Self

source

pub fn is_empty(&self) -> bool

source

pub fn push(&mut self, value: T) -> usize

source

pub fn clear(&mut self)

source

pub fn index_of_first(&self) -> usize

source

pub fn first(&self) -> Option<&T>

source

pub fn first_mut(&mut self) -> Option<&mut T>

source

pub fn pop_first(&mut self) -> Option<T>

source

pub fn last(&self) -> Option<&T>

source

pub fn last_mut(&mut self) -> Option<&mut T>

Trait Implementations§

source§

impl<T> Index<usize> for RingBuffer<T>

§

type Output = T

The returned type after indexing.
source§

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation. Read more
source§

impl<T> IndexMut<usize> for RingBuffer<T>

source§

fn index_mut(&mut self, index: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation. Read more

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for RingBuffer<T>where T: RefUnwindSafe,

§

impl<T> Send for RingBuffer<T>where T: Send,

§

impl<T> Sync for RingBuffer<T>where T: Sync,

§

impl<T> Unpin for RingBuffer<T>where T: Unpin,

§

impl<T> UnwindSafe for RingBuffer<T>where T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

Layout§

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 40 bytes