pub struct MPSCQueue<T> { /* private fields */ }Expand description
A lock-free multi-producer single-consumer queue
§Example
let queue = frozen_core::mpscq::MPSCQueue::<usize>::default();
queue.push(1usize);
queue.push(2usize);
let batch = queue.drain();
assert_eq!(batch, vec![2usize, 1usize]);
drop(batch); // values is dropped hereImplementations§
Source§impl<T> MPSCQueue<T>
impl<T> MPSCQueue<T>
Sourcepub fn push(&self, value: T)
pub fn push(&self, value: T)
Push an entry into the MPSCQueue
§Ordering
The queue internally uses a linked list, therefore entries are stored in last-in-first-out (LIFO) order
§Example
let queue = frozen_core::mpscq::MPSCQueue::<usize>::default();
queue.push(1usize);
let batch = queue.drain();
assert_eq!(batch.len(), 1);
drop(batch); // values is dropped hereSourcepub fn drain(&self) -> Vec<T>
pub fn drain(&self) -> Vec<T>
Drain a batch of entries from MPSCQueue
§Ordering
The queue internally behaves like a stack, therefore entries are returned in last-in-first-out (LIFO) order when drained
§Example
let queue = frozen_core::mpscq::MPSCQueue::<usize>::default();
queue.push(1usize);
queue.push(2usize);
queue.push(3usize);
let batch = queue.drain();
assert_eq!(batch.len(), 3);
assert_eq!(batch, vec![3usize, 2usize, 1usize]);
drop(batch); // values is dropped hereTrait Implementations§
Auto Trait Implementations§
impl<T> !Freeze for MPSCQueue<T>
impl<T> RefUnwindSafe for MPSCQueue<T>
impl<T> Send for MPSCQueue<T>
impl<T> Sync for MPSCQueue<T>
impl<T> Unpin for MPSCQueue<T>
impl<T> UnsafeUnpin for MPSCQueue<T>
impl<T> UnwindSafe for MPSCQueue<T>where
T: RefUnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more