Struct smallqueue::SmallQueue

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

A FIFO queue which stores its data in-place when containing 0 or 1 elements, but expands to a dynamically sized heap allocation when more elements are inserted, and can free its heap allocation if the size returns later to 1 or 0.

Implementations

impl<T> SmallQueue<T>

pub fn new() -> Self

New, empty queue.

pub fn of(elem: T) -> Self

New queue with a single element.

pub fn add(&mut self, elem: T)

Insert an element in insertion end.

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

Remove an element from the removal end.

pub fn is_empty(&self) -> bool

Whether the queue is empty.

Trait Implementations

impl<T: Debug> Debug for SmallQueue<T>

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

Formats the value using the given formatter.