Function crossbeam_deque::fifo

pub fn fifo<T>() -> (Worker<T>, Stealer<T>)

Creates a work-stealing deque with the first-in first-out strategy.

Elements are pushed into the back, popped from the front, and stolen from the front. In other words, the worker side behaves as a FIFO queue.

Examples

use crossbeam_deque::{self as deque, Pop, Steal};

let (w, s) = deque::fifo::<i32>();
w.push(1);
w.push(2);
w.push(3);

assert_eq!(s.steal(), Steal::Data(1));
assert_eq!(w.pop(), Pop::Data(2));
assert_eq!(w.pop(), Pop::Data(3));