Struct QueueInner 

pub struct QueueInner<T, S: Storage> { /* private fields */ }

Base struct for Queue and QueueView, generic over the Storage.

In most cases you should use Queue or QueueView directly. Only use this struct if you want to write code that’s generic over both.

Implementations

impl<T, const N: usize> QueueInner<T, OwnedStorage<N>>

pub const fn new() -> Self

Creates an empty queue.

impl<T, S: Storage> QueueInner<T, S>

pub fn capacity(&self) -> usize

Returns the maximum number of elements the queue can hold.

pub fn as_view(&self) -> &QueueView<T>

Get a reference to the Queue, erasing the N const-generic.

let queue: Queue<u8, 2> = Queue::new();
let view: &QueueView<u8> = queue.as_view();

It is often preferable to do the same through type coerction, since Queue<T, N> implements Unsize<QueueView<T>>:

let queue: Queue<u8, 2> = Queue::new();
let view: &QueueView<u8> = &queue;

pub fn as_mut_view(&mut self) -> &mut QueueView<T>

Get a mutable reference to the Queue, erasing the N const-generic.

let mut queue: Queue<u8, 2> = Queue::new();
let view: &mut QueueView<u8> = queue.as_mut_view();

It is often preferable to do the same through type coerction, since Queue<T, N> implements Unsize<QueueView<T>>:

let mut queue: Queue<u8, 2> = Queue::new();
let view: &mut QueueView<u8> = &mut queue;

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

Returns the item in the front of the queue, or None if the queue is empty.

pub fn enqueue(&self, item: T) -> Result<(), T>

Adds an item to the end of the queue.

Returns back the item if the queue is full.

Trait Implementations

impl<T, S: Storage> Drop for QueueInner<T, S>

fn drop(&mut self)

Executes the destructor for this type.

impl<T, S: Storage> Sync for QueueInner<T, S>

where T: Send,