impl<T> Injector<T>

fn new() -> Injector<T>

Creates a new injector queue.

Examples

use crossbeam_deque::Injector;

let q = Injector::<i32>::new();

fn push(self: &Self, task: T)

Pushes a task into the queue.

Examples

use crossbeam_deque::Injector;

let w = Injector::new();
w.push(1);
w.push(2);

fn steal(self: &Self) -> Steal<T>

Steals a task from the queue.

Examples

use crossbeam_deque::{Injector, Steal};

let q = Injector::new();
q.push(1);
q.push(2);

assert_eq!(q.steal(), Steal::Success(1));
assert_eq!(q.steal(), Steal::Success(2));
assert_eq!(q.steal(), Steal::Empty);

fn steal_batch(self: &Self, dest: &Worker<T>) -> Steal<()>

Steals a batch of tasks and pushes them into a worker.

How many tasks exactly will be stolen is not specified. That said, this method will try to steal around half of the tasks in the queue, but also not more than some constant limit.

Examples

use crossbeam_deque::{Injector, Worker};

let q = Injector::new();
q.push(1);
q.push(2);
q.push(3);
q.push(4);

let w = Worker::new_fifo();
let _ = q.steal_batch(&w);
assert_eq!(w.pop(), Some(1));
assert_eq!(w.pop(), Some(2));

fn steal_batch_with_limit(self: &Self, dest: &Worker<T>, limit: usize) -> Steal<()>

Steals no more than of tasks and pushes them into a worker.

How many tasks exactly will be stolen is not specified. That said, this method will try to steal around half of the tasks in the queue, but also not more than some constant limit.

Examples

use crossbeam_deque::{Injector, Worker};

let q = Injector::new();
q.push(1);
q.push(2);
q.push(3);
q.push(4);
q.push(5);
q.push(6);

let w = Worker::new_fifo();
let _ = q.steal_batch_with_limit(&w, 2);
assert_eq!(w.pop(), Some(1));
assert_eq!(w.pop(), Some(2));
assert_eq!(w.pop(), None);

q.push(7);
q.push(8);
// Setting a large limit does not guarantee that all elements will be popped. In this case,
// half of the elements are currently popped, but the number of popped elements is considered
// an implementation detail that may be changed in the future.
let _ = q.steal_batch_with_limit(&w, std::usize::MAX);
assert_eq!(w.len(), 3);

fn steal_batch_and_pop(self: &Self, dest: &Worker<T>) -> Steal<T>

Steals a batch of tasks, pushes them into a worker, and pops a task from that worker.

How many tasks exactly will be stolen is not specified. That said, this method will try to steal around half of the tasks in the queue, but also not more than some constant limit.

Examples

use crossbeam_deque::{Injector, Steal, Worker};

let q = Injector::new();
q.push(1);
q.push(2);
q.push(3);
q.push(4);

let w = Worker::new_fifo();
assert_eq!(q.steal_batch_and_pop(&w), Steal::Success(1));
assert_eq!(w.pop(), Some(2));

fn steal_batch_with_limit_and_pop(self: &Self, dest: &Worker<T>, limit: usize) -> Steal<T>

Steals no more than limit of tasks, pushes them into a worker, and pops a task from that worker.

How many tasks exactly will be stolen is not specified. That said, this method will try to steal around half of the tasks in the queue, but also not more than the given limit.

Examples

use crossbeam_deque::{Injector, Steal, Worker};

let q = Injector::new();
q.push(1);
q.push(2);
q.push(3);
q.push(4);
q.push(5);
q.push(6);

let w = Worker::new_fifo();
assert_eq!(q.steal_batch_with_limit_and_pop(&w, 2), Steal::Success(1));
assert_eq!(w.pop(), Some(2));
assert_eq!(w.pop(), None);

q.push(7);
// Setting a large limit does not guarantee that all elements will be popped. In this case,
// half of the elements are currently popped, but the number of popped elements is considered
// an implementation detail that may be changed in the future.
assert_eq!(q.steal_batch_with_limit_and_pop(&w, std::usize::MAX), Steal::Success(3));
assert_eq!(w.pop(), Some(4));
assert_eq!(w.pop(), Some(5));
assert_eq!(w.pop(), None);

fn is_empty(self: &Self) -> bool

Returns true if the queue is empty.

Examples

use crossbeam_deque::Injector;

let q = Injector::new();

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

fn len(self: &Self) -> usize

Returns the number of tasks in the queue.

Examples

use crossbeam_deque::Injector;

let q = Injector::new();

assert_eq!(q.len(), 0);
q.push(1);
assert_eq!(q.len(), 1);
q.push(1);
assert_eq!(q.len(), 2);

impl<T> Any for Injector<T>

fn type_id(self: &Self) -> TypeId

impl<T> Borrow for Injector<T>

fn borrow(self: &Self) -> &T

impl<T> BorrowMut for Injector<T>

fn borrow_mut(self: &mut Self) -> &mut T

impl<T> Debug for Injector<T>

fn fmt(self: &Self, f: &mut fmt::Formatter<'_>) -> fmt::Result

impl<T> Default for Injector<T>

fn default() -> Self

impl<T> Drop for Injector<T>

fn drop(self: &mut Self)

impl<T> Freeze for Injector<T>

impl<T> From for Injector<T>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> Pointable for Injector<T>

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> RefUnwindSafe for Injector<T>

impl<T> Unpin for Injector<T>

impl<T> UnwindSafe for Injector<T>

impl<T, U> Into for Injector<T>

fn into(self: Self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

impl<T, U> TryFrom for Injector<T>

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto for Injector<T>

fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T: Send> Send for Injector<T>

impl<T: Send> Sync for Injector<T>