Struct StableQueue

pub struct StableQueue<T> { /* private fields */ }

As long as the element is not popped, the index returned by push_back will continue to point to the pushed element.

Implementations

impl<T> StableQueue<T>

pub fn new_unbounded() -> Self

pub fn with_fixed_capacity(cap: usize) -> Self

If initialized with a fixed capacity, the queue cannot grow beyond that capacity and the address in memory of elements inserted into the queue will not change.

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

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

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

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

pub fn push_back(&mut self, value: T) -> Result<StableIndex, T>

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get(&self, StableIndex: StableIndex) -> Option<&T>

pub fn get_mut(&mut self, StableIndex: StableIndex) -> Option<&mut T>

pub fn front_idx(&self) -> Option<StableIndex>

pub fn back_idx(&self) -> Option<StableIndex>

pub fn fixed_capacity(&self) -> Option<usize>

Trait Implementations

impl<T> Index<StableIndex> for StableQueue<T>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<T> IndexMut<StableIndex> for StableQueue<T>

fn index_mut(&mut self, idx: StableIndex) -> &mut Self::Output

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