Struct PooledStaticQueue 

pub struct PooledStaticQueue<T, const N: usize, S = Auto>
where
    S: SlotType<ItemHandle<T>>,
{ /* private fields */ }

A pooled MPMCQueue with capacity N.

Unlike StaticQueue, this queue may store any item at the cost of higher runtime and higher memory.

Only available on feature pool

Implementations

impl<T, const N: usize> PooledStaticQueue<T, N, Auto>

pub fn new() -> Self

Constructs a new PooledStaticQueue with slot type Auto

pub fn with_slot<S>() -> PooledStaticQueue<T, N, S>

where S: SlotType<ItemHandle<T>>,

Constructs a new PooledStaticQueue with slot type S

Trait Implementations

impl<T, const N: usize> Default for PooledStaticQueue<T, N, Auto>

fn default() -> Self

Returns the “default value” for a type.

impl<T, const N: usize, S> MPMCQueue for PooledStaticQueue<T, N, S>

where S: SlotType<ItemHandle<T>>,

type Item = T

The item stored in the queue

fn push(&self, item: Self::Item) -> Result<(), Self::Item>

Attempts to push an item into the queue. Returns the item as an error if the queue is full.

fn pop(&self) -> Option<Self::Item>

Attempts to pop an item from the queue. Returns None if the queue was empty.

fn len(&self) -> usize

Returns the current len of the queue. The returned value may be stale under concurrent access and should not be used for synchronization.

fn capacity(&self) -> usize

Returns the total capacity of the queue.

fn is_empty(&self) -> bool

Indicates whether the queue is empty. The returned value may be stale under concurrent access and should not be used for synchronization.

fn is_full(&self) -> bool

Indicates whether the queue is full. The returned value may be stale under concurrent access and should not be used for synchronization.

fn force_push(&self, item: Self::Item) -> Option<Self::Item>

Pushes an item into the queue, removing an existing item if the queue is full.

fn force_push_and_do<F>(&self, item: Self::Item, f: F)

where F: FnMut(Self::Item),

Pushes an item into the queue, removing an existing item if the queue is full.