Struct crossbeam_queue::SegQueue [−][src]
pub struct SegQueue<T> { /* fields omitted */ }
Expand description
An unbounded multi-producer multi-consumer queue.
This queue is implemented as a linked list of segments, where each segment is a small buffer
that can hold a handful of elements. There is no limit to how many elements can be in the queue
at a time. However, since segments need to be dynamically allocated as elements get pushed,
this queue is somewhat slower than ArrayQueue
.
Examples
use crossbeam_queue::SegQueue; let q = SegQueue::new(); q.push('a'); q.push('b'); assert_eq!(q.pop(), Some('a')); assert_eq!(q.pop(), Some('b')); assert!(q.pop().is_none());
Implementations
impl<T> SegQueue<T>
[src]
impl<T> SegQueue<T>
[src]pub const fn new() -> SegQueue<T>
[src]
pub const fn new() -> SegQueue<T>
[src]Creates a new unbounded queue.
Examples
use crossbeam_queue::SegQueue; let q = SegQueue::<i32>::new();
pub fn push(&self, value: T)
[src]
pub fn push(&self, value: T)
[src]Pushes an element into the queue.
Examples
use crossbeam_queue::SegQueue; let q = SegQueue::new(); q.push(10); q.push(20);
pub fn pop(&self) -> Option<T>
[src]
pub fn pop(&self) -> Option<T>
[src]Pops an element from the queue.
If the queue is empty, None
is returned.
Examples
use crossbeam_queue::SegQueue; let q = SegQueue::new(); q.push(10); assert_eq!(q.pop(), Some(10)); assert!(q.pop().is_none());
Trait Implementations
impl<T: Send> Send for SegQueue<T>
[src]
impl<T: Send> Sync for SegQueue<T>
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for SegQueue<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Unpin for SegQueue<T> where
T: Unpin,
T: Unpin,