Struct TinySetQueuePow2 

pub struct TinySetQueuePow2<'a, T, S>
where
    S: SetBacking + ?Sized,
{ /* private fields */ }

A power-of-two capacity variant that uses bit masking for wrap-around.

As with TinySetQueue, membership is direct-mapped: the membership backing must be large enough to cover the entire domain addressable by T::into().

Implementations

impl<'a, T, S> TinySetQueuePow2<'a, T, S>

where T: Copy + Into<usize>, S: SetBacking + ?Sized,

pub fn new( buf: &'a mut [T], in_queue: &'a mut S, mode: MembershipMode, order: ProcessingOrder, ) -> Self

Constructs a queue backed by power-of-two-sized storage.

Panics

Panics if buf.len() is not a power of two.

pub fn clear(&mut self)

Clears the queue without freeing any backing storage.

pub fn capacity(&self) -> usize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn is_full(&self) -> bool

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

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