Struct ArrayQueue 

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

A bounded lock-free queue, from the kovan-queue crate: see its docs. A bounded multi-producer multi-consumer queue.

Implementations

impl<T> ArrayQueue<T>

pub fn new(cap: usize) -> ArrayQueue<T>

Creates a new bounded queue with the given capacity.

The capacity will be rounded up to the next power of two.

pub fn push(&self, value: T) -> Result<(), T>

Pushes an element into the queue.

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

Pops an element from the queue.

pub fn capacity(&self) -> usize

Returns the capacity of the queue.

pub fn is_empty(&self) -> bool

Returns true if the queue is empty.

pub fn is_full(&self) -> bool

Returns true if the queue is full.

Trait Implementations

impl<T> Drop for ArrayQueue<T>

Drop all remaining values in the queue when it is dropped.

Without this, T values sitting in initialized slots would have their memory freed (the Box<[Slot<T>]> backing is released) without ever calling T::drop(), leaking resources such as file handles or locks.

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl<T> Send for ArrayQueue<T>

where T: Send,

impl<T> Sync for ArrayQueue<T>

where T: Send,