Struct Inner 

struct Inner<T> {
    front: AtomicIsize,
    back: AtomicIsize,
    buffer: CachePadded<Atomic<Buffer<T>>>,
}

Internal queue data shared between the worker and stealers.

The implementation is based on the following work:

1. Chase and Lev. Dynamic circular work-stealing deque. SPAA 2005.
2. Le, Pop, Cohen, and Nardelli. Correct and efficient work-stealing for weak memory models. PPoPP 2013.
3. Norris and Demsky. CDSchecker: checking concurrent data structures written with C/C++ atomics. OOPSLA 2013.

Fields

front: AtomicIsize

The front index.

back: AtomicIsize

The back index.

buffer: CachePadded<Atomic<Buffer<T>>>

The underlying buffer.

Trait Implementations

impl<T> Drop for Inner<T>

fn drop(&mut self)

Executes the destructor for this type.