Struct work_steal_queue::LocalQueue

#[repr(C)]
pub struct LocalQueue<'l, T> { /* private fields */ }

Implementations

impl<'l, T> LocalQueue<'l, T>

pub fn is_empty(&self) -> bool

pub fn is_full(&self) -> bool

pub fn len(&self) -> usize

pub fn push_back(&self, item: T)

If the queue is full, first push half to global, then push the item to global.

Examples

use work_steal_queue::WorkStealQueue;

let queue = WorkStealQueue::new(1, 2);
let local = queue.local_queue();
for i in 0..4 {
    local.push_back(i);
}
assert_eq!(local.pop_front(), Some(3));
assert_eq!(local.pop_front(), Some(0));
assert_eq!(local.pop_front(), Some(1));
assert_eq!(local.pop_front(), Some(2));
assert_eq!(local.pop_front(), None);

pub fn pop_front(&self) -> Option<T>

If the queue is empty, first try steal from global, then try steal from siblings.

Examples

use work_steal_queue::WorkStealQueue;

let queue = WorkStealQueue::new(1, 32);
queue.push(1);
queue.push(2);
let local = queue.local_queue();
assert_eq!(local.pop_front(), Some(1));
assert_eq!(local.pop_front(), Some(2));
assert_eq!(local.pop_front(), None);

Examples

use work_steal_queue::WorkStealQueue;
let queue = WorkStealQueue::new(2, 64);
let local0 = queue.local_queue();
local0.push_back(2);
local0.push_back(3);
let local1 = queue.local_queue();
local1.push_back(0);
local1.push_back(1);
for i in 0..4 {
    assert_eq!(local1.pop_front(), Some(i));
}
assert_eq!(local0.pop_front(), None);
assert_eq!(local1.pop_front(), None);
assert_eq!(queue.pop(), None);

Trait Implementations

impl<'l, T: Debug> Debug for LocalQueue<'l, T>

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

Formats the value using the given formatter.

impl<T> Drop for LocalQueue<'_, T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Send> Send for LocalQueue<'_, T>

impl<T: Send> Sync for LocalQueue<'_, T>