Struct WorkStealingQueue 

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

A per-worker work-stealing deque.

The owner pushes/pops from the back; thieves steal from the front.

Implementations

impl<T> WorkStealingQueue<T>

pub fn new() -> Self

Create an empty queue.

pub fn push(&mut self, item: T)

Push a task onto the local (owner’s) end.

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

Pop a task for the owner to execute.

Checks the stolen buffer first (so stolen tasks are prioritised), then falls back to the local deque (LIFO).

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

Steal a task from the front of the local deque (FIFO).

Returns None if the local deque is empty.

pub fn len(&self) -> usize

Number of tasks in the local deque (not counting stolen tasks).

pub fn is_empty(&self) -> bool

Returns true if both the local and stolen buffers are empty.

Trait Implementations

impl<T: Debug> Debug for WorkStealingQueue<T>

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

Formats the value using the given formatter.

impl<T> Default for WorkStealingQueue<T>

fn default() -> Self

Returns the “default value” for a type.