pub struct Queue<T> { /* private fields */ }Expand description
A simple, threadsafe, queue of items of type T
This is a sort of channel where any thread can push to a queue and any thread can pop from a queue.
This supports both bounded and unbounded operations. push will never block,
and allows the queue to grow without bounds. push_bounded will block if the
queue is over capacity, and will resume once there is enough capacity.
Implementations
sourceimpl<T> Queue<T>
impl<T> Queue<T>
pub fn new(bound: usize) -> Queue<T>
pub fn push(&self, item: T)
sourcepub fn push_bounded(&self, item: T)
pub fn push_bounded(&self, item: T)
Pushes an item onto the queue, blocking if the queue is full.
pub fn pop(&self, timeout: Duration) -> Option<T>
pub fn try_pop_all(&self) -> Vec<T>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
A: Allocator,
Auto Trait Implementations
impl<T> !RefUnwindSafe for Queue<T>
impl<T> Send for Queue<T> where
T: Send,
impl<T> Sync for Queue<T> where
T: Send,
impl<T> Unpin for Queue<T> where
T: Unpin,
impl<T> UnwindSafe for Queue<T>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more