[−][src]Struct crossbeam_queue::SegQueue

[+] Show declaration

pub struct SegQueue<T> { /* fields omitted */ }

[−]

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::{PopError, SegQueue};

let q = SegQueue::new();

q.push('a');
q.push('b');

assert_eq!(q.pop(), Ok('a'));
assert_eq!(q.pop(), Ok('b'));
assert_eq!(q.pop(), Err(PopError));

Methods

`impl<T> SegQueue<T>`[src][−]

`pub 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][−]

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) -> Result<T, PopError>`[src][−]

Pops an element from the queue.

If the queue is empty, an error is returned.

Examples

use crossbeam_queue::{PopError, SegQueue};

let q = SegQueue::new();

q.push(10);
assert_eq!(q.pop(), Ok(10));
assert_eq!(q.pop(), Err(PopError));

`pub fn is_empty(&self) -> bool`[src][−]

Returns true if the queue is empty.

Examples

use crossbeam_queue::SegQueue;

let q = SegQueue::new();

assert!(q.is_empty());
q.push(1);
assert!(!q.is_empty());

`pub fn len(&self) -> usize`[src][−]

Returns the number of elements in the queue.

Examples

use crossbeam_queue::{SegQueue, PopError};

let q = SegQueue::new();
assert_eq!(q.len(), 0);

q.push(10);
assert_eq!(q.len(), 1);

q.push(20);
assert_eq!(q.len(), 2);