Struct heron::rapier_plugin::rapier2d::crossbeam::deque::Worker [−]
pub struct Worker<T> { /* fields omitted */ }
Expand description
A worker queue.
This is a FIFO or LIFO queue that is owned by a single thread, but other threads may steal tasks from it. Task schedulers typically create a single worker queue per thread.
Examples
A FIFO worker:
use crossbeam_deque::{Steal, Worker};
let w = Worker::new_fifo();
let s = w.stealer();
w.push(1);
w.push(2);
w.push(3);
assert_eq!(s.steal(), Steal::Success(1));
assert_eq!(w.pop(), Some(2));
assert_eq!(w.pop(), Some(3));
A LIFO worker:
use crossbeam_deque::{Steal, Worker};
let w = Worker::new_lifo();
let s = w.stealer();
w.push(1);
w.push(2);
w.push(3);
assert_eq!(s.steal(), Steal::Success(1));
assert_eq!(w.pop(), Some(3));
assert_eq!(w.pop(), Some(2));
Implementations
impl<T> Worker<T>
impl<T> Worker<T>
Creates a FIFO worker queue.
Tasks are pushed and popped from opposite ends.
Examples
use crossbeam_deque::Worker;
let w = Worker::<i32>::new_fifo();
Creates a LIFO worker queue.
Tasks are pushed and popped from the same end.
Examples
use crossbeam_deque::Worker;
let w = Worker::<i32>::new_lifo();
Creates a stealer for this queue.
The returned stealer can be shared among threads and cloned.
Examples
use crossbeam_deque::Worker;
let w = Worker::<i32>::new_lifo();
let s = w.stealer();
Returns true
if the queue is empty.
use crossbeam_deque::Worker;
let w = Worker::new_lifo();
assert!(w.is_empty());
w.push(1);
assert!(!w.is_empty());
Returns the number of tasks in the deque.
use crossbeam_deque::Worker;
let w = Worker::new_lifo();
assert_eq!(w.len(), 0);
w.push(1);
assert_eq!(w.len(), 1);
w.push(1);
assert_eq!(w.len(), 2);
Trait Implementations
Auto Trait Implementations
impl<T> !RefUnwindSafe for Worker<T>
impl<T> UnwindSafe for Worker<T> where
T: RefUnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
Convert 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
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more