Struct rupta::util::chunked_queue::ChunkedQueue

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

This queue is implemented as a linked list of chunks, where each chunk is a small buffer that can hold a handful of elements. Chunks need to be dynamically allocated as elements get pushed. This queue is supposed to be faster thanthan LinkedList.

Implementations

impl<T> ChunkedQueue<T>

pub fn new() -> Self

Creates an empty ChunkedQueue.

pub fn len(&self) -> usize

Returns the length of the ChunkedQueue.

pub fn is_empty(&self) -> bool

Returns true if the ChunkedQueue is empty.

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

Appends an element to the back of a queue.

pub fn iter(&self) -> Iter<'_, T>

Provides a forward iterator.

impl<T: Copy> ChunkedQueue<T>

pub fn iter_copied(&self) -> IterCopied<T>

Provides a forward copied iterator.

Trait Implementations

impl<T: Debug> Debug for ChunkedQueue<T>

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

Formats the value using the given formatter.

impl<T> Default for ChunkedQueue<T>

fn default() -> Self

Creates an empty ChunkedQueue<T>.

impl<T> Drop for ChunkedQueue<T>

fn drop(&mut self)

Executes the destructor for this type.