Struct UnboundedFullHandle

pub struct UnboundedFullHandle<'a, T> { /* private fields */ }

A full handle to an UnboundedQueue, allowing for bulk enqueues efficiently. Internally, the unbounded queue manages the queue of bounded queues with hazard pointers to avoid the ABA problem, this allows minimizing the creation of these hazard pointers.

Example

use lfqueue::UnboundedQueue;

let queue = UnboundedQueue::<usize>::new();
let mut handle = queue.full_handle();
handle.enqueue(3);

assert_eq!(handle.dequeue(), Some(3));
assert!(handle.dequeue().is_none());

Implementations

impl<'a, T> UnboundedFullHandle<'a, T>

where T: Send + Sync,

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

Enqueues an item on the underlying queue.

Example

use lfqueue::{UnboundedFullHandle, UnboundedQueue};

let queue = UnboundedQueue::<usize>::new();
let mut handle = queue.full_handle();
handle.enqueue(3);

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

Enqueues an item on the underlying queue.

Example

use lfqueue::{UnboundedFullHandle, UnboundedQueue};

let queue = UnboundedQueue::<usize>::new();
let mut handle = queue.full_handle();
handle.enqueue(3);

assert_eq!(handle.dequeue(), Some(3));