Struct TQueue

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

Unbounded queue using two vectors.

This implementation writes to one vector and reads from the other until the reads vector becomes empty and the two need to be swapped. Again reads don’t block writes most of the time. It has an amortised cost of O(1).

Implementations

impl<T> TQueue<T>

where T: Any + Sync + Send + Clone,

pub fn new() -> TQueue<T>

Create an empty TQueue.

Trait Implementations

impl<T: Clone> Clone for TQueue<T>

fn clone(&self) -> TQueue<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Any + Send + Sync + Clone> Default for TQueue<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> TQueueLike<T> for TQueue<T>

where T: Any + Sync + Send + Clone,

fn write(&self, value: T) -> Stm<()>

Push to the end of the queue.

fn read(&self) -> Stm<T>

Pop the head of the queue, or retry until there is an element if it’s empty.

fn is_empty(&self) -> Stm<bool>

Check if the queue is empty.