Struct WorkStealQueue 

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

A simple work-stealing queue for task-parallel scheduling.

Internally backed by a VecT` with a front/back cursor pair. “Stealing” takes from the front (like a deque), while the owner pushes/pops from the back.

Implementations

impl<T: Send> WorkStealQueue<T>

pub fn new() -> Self

Create an empty work-steal queue.

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

Push a task onto the owner end (back).

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

Pop a task from the owner end (back). Returns None if empty.

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

Steal a task from the thief end (front). Returns None if empty.

pub fn len(&self) -> usize

Number of pending tasks.

pub fn is_empty(&self) -> bool

Whether the queue is empty.

Trait Implementations

impl<T: Send> Default for WorkStealQueue<T>

fn default() -> Self

Returns the “default value” for a type.