Struct crossbeam_epoch::sync::queue::Queue

pub(crate) struct Queue<T> {
    head: CachePadded<Atomic<Node<T>>>,
    tail: CachePadded<Atomic<Node<T>>>,
}

Fields

head: CachePadded<Atomic<Node<T>>>

tail: CachePadded<Atomic<Node<T>>>

Implementations

impl<T> Queue<T>

pub(crate) fn new() -> Queue<T>

Create a new, empty queue.

fn push_internal( &self, onto: Shared<'_, Node<T>>, new: Shared<'_, Node<T>>, guard: &Guard, ) -> bool

Attempts to atomically place n into the next pointer of onto, and returns true on success. The queue’s tail pointer may be updated.

pub(crate) fn push(&self, t: T, guard: &Guard)

Adds t to the back of the queue, possibly waking up threads blocked on pop.

fn pop_internal(&self, guard: &Guard) -> Result<Option<T>, ()>

Attempts to pop a data node. Ok(None) if queue is empty; Err(()) if lost race to pop.

fn pop_if_internal<F>( &self, condition: F, guard: &Guard, ) -> Result<Option<T>, ()>

where T: Sync, F: Fn(&T) -> bool,

Attempts to pop a data node, if the data satisfies the given condition. Ok(None) if queue is empty or the data does not satisfy the condition; Err(()) if lost race to pop.

pub(crate) fn try_pop(&self, guard: &Guard) -> Option<T>

Attempts to dequeue from the front.

Returns None if the queue is observed to be empty.

pub(crate) fn try_pop_if<F>(&self, condition: F, guard: &Guard) -> Option<T>

where T: Sync, F: Fn(&T) -> bool,

Attempts to dequeue from the front, if the item satisfies the given condition.

Returns None if the queue is observed to be empty, or the head does not satisfy the given condition.

Trait Implementations

impl<T: Debug> Debug for Queue<T>

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

Formats the value using the given formatter.

impl<T> Drop for Queue<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Send> Send for Queue<T>

impl<T: Send> Sync for Queue<T>