Struct CircularQueue 

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

Implementations

impl<T> CircularQueue<T>

pub fn new(capacity: usize) -> Result<Self, QueueError>

Trait Implementations

impl<T> CircularQueueLike<T> for CircularQueue<T>

type Error = QueueError

fn capacity(&self) -> usize

fn at(&self, index: isize) -> Option<&T>

fn resize(&mut self, new_capacity: usize) -> Result<(), Self::Error>

fn rearrange(&mut self)

impl<T> Collection for CircularQueue<T>

type Item = T

type Iter<'a> = Iter<'a, T> where Self: 'a

fn iter(&self) -> Self::Iter<'_>

fn size(&self) -> usize

fn clear(&mut self)

fn retain<F>(&mut self, f: F) -> usize

where F: FnMut(&Self::Item) -> bool,

fn count<F>(&self, filter: F) -> usize

where F: FnMut(&Self::Item) -> bool,

fn collect_into<C>(&self, out: &mut C)

where C: Extend<Self::Item>, Self::Item: Clone,

fn collect(&self) -> Vec<Self::Item>

where Self::Item: Clone,

fn is_empty(&self) -> bool

impl<T: Debug> Debug for CircularQueue<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> DequeLike<T> for CircularQueue<T>

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

fn enqueue_front(&mut self, element: T)

fn dequeue_back(&mut self) -> Option<T>

fn enqueues_front<I>(&mut self, elements: I)

where I: IntoIterator<Item = T>,

fn replace_back(&mut self, new_front: T) -> Option<T>

impl<T> Disposable for CircularQueue<T>

fn dispose(&mut self)

fn is_disposed(&self) -> bool

impl<'a, T> IntoIterator for &'a CircularQueue<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> QueueLike<T> for CircularQueue<T>

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

fn enqueue(&mut self, element: T)

fn dequeue(&mut self) -> Option<T>

fn enqueues<I>(&mut self, elements: I)

where I: IntoIterator<Item = T>,

fn replace_front(&mut self, new_back: T) -> Option<T>