pub struct Injector<T> {
head: CachePadded<Position<T>>,
tail: CachePadded<Position<T>>,
_marker: PhantomData<T>,
}
Expand description
An injector queue.
This is a FIFO queue that can be shared among multiple threads. Task schedulers typically have a single injector queue, which is the entry point for new tasks.
§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);
Fields§
§head: CachePadded<Position<T>>
§tail: CachePadded<Position<T>>
§_marker: PhantomData<T>
Implementations§
§impl<T> Injector<T>
impl<T> Injector<T>
pub fn new() -> Injector<T>
pub fn new() -> Injector<T>
Creates a new injector queue.
§Examples
use crossbeam_deque::Injector;
let q = Injector::<i32>::new();
pub fn push(&self, task: T)
pub fn push(&self, task: T)
Pushes a task into the queue.
§Examples
use crossbeam_deque::Injector;
let w = Injector::new();
w.push(1);
w.push(2);
pub fn steal(&self) -> Steal<T>
pub fn steal(&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);
pub fn steal_batch(&self, dest: &Worker<T>) -> Steal<()>
pub fn steal_batch(&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));
pub fn steal_batch_with_limit(
&self,
dest: &Worker<T>,
limit: usize
) -> Steal<()>
pub fn steal_batch_with_limit( &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);
pub fn steal_batch_and_pop(&self, dest: &Worker<T>) -> Steal<T>
pub fn steal_batch_and_pop(&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));
pub fn steal_batch_with_limit_and_pop(
&self,
dest: &Worker<T>,
limit: usize
) -> Steal<T>
pub fn steal_batch_with_limit_and_pop( &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);
Trait Implementations§
impl<T> Send for Injector<T>where
T: Send,
impl<T> Sync for Injector<T>where
T: Send,
Auto Trait Implementations§
impl<T> !Freeze for Injector<T>
impl<T> RefUnwindSafe for Injector<T>where
T: RefUnwindSafe,
impl<T> Unpin for Injector<T>where
T: Unpin,
impl<T> !UnwindSafe for Injector<T>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CheckedAs for T
impl<T> CheckedAs for T
source§fn checked_as<Dst>(self) -> Option<Dst>where
T: CheckedCast<Dst>,
fn checked_as<Dst>(self) -> Option<Dst>where
T: CheckedCast<Dst>,
source§impl<Src, Dst> CheckedCastFrom<Src> for Dstwhere
Src: CheckedCast<Dst>,
impl<Src, Dst> CheckedCastFrom<Src> for Dstwhere
Src: CheckedCast<Dst>,
source§fn checked_cast_from(src: Src) -> Option<Dst>
fn checked_cast_from(src: Src) -> Option<Dst>
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T
in a tonic::Request