[−][src]Struct eiz::rt_queue::MpscQueue
A simple bounded multiple producer, single consumer queue.
The consumer side has a wait-free try_pop that always succeeds if there is data in the
buffer. Synchronization is otherwise via a parking_lot mutex and condition variable.
Methods
impl<T: Send> MpscQueue<T>[src]
pub fn new(length: usize) -> (MpscQueueReader<T>, MpscQueueWriter<T>)[src]
Returns a new queue with a bound of at least length. In practice, it's rounded to the
next power of two.
Auto Trait Implementations
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> UnwindSafe for MpscQueue<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,