pub struct Parker {
unparker: Unparker,
_marker: PhantomData<*const ()>,
}
Expand description
A thread parking primitive.
Conceptually, each Parker
has an associated token which is initially not present:
-
The
park
method blocks the current thread unless or until the token is available, at which point it automatically consumes the token. -
The
park_timeout
andpark_deadline
methods work the same aspark
, but block for a specified maximum time. -
The
unpark
method atomically makes the token available if it wasn’t already. Because the token is initially absent,unpark
followed bypark
will result in the second call returning immediately.
In other words, each Parker
acts a bit like a spinlock that can be locked and unlocked using
park
and unpark
.
§Examples
use std::thread;
use std::time::Duration;
use crossbeam_utils::sync::Parker;
let p = Parker::new();
let u = p.unparker().clone();
// Make the token available.
u.unpark();
// Wakes up immediately and consumes the token.
p.park();
thread::spawn(move || {
thread::sleep(Duration::from_millis(500));
u.unpark();
});
// Wakes up when `u.unpark()` provides the token.
p.park();
Fields§
§unparker: Unparker
§_marker: PhantomData<*const ()>
Implementations§
§impl Parker
impl Parker
pub fn park(&self)
pub fn park(&self)
Blocks the current thread until the token is made available.
§Examples
use crossbeam_utils::sync::Parker;
let p = Parker::new();
let u = p.unparker().clone();
// Make the token available.
u.unpark();
// Wakes up immediately and consumes the token.
p.park();
pub fn park_timeout(&self, timeout: Duration)
pub fn park_timeout(&self, timeout: Duration)
Blocks the current thread until the token is made available, but only for a limited time.
§Examples
use std::time::Duration;
use crossbeam_utils::sync::Parker;
let p = Parker::new();
// Waits for the token to become available, but will not wait longer than 500 ms.
p.park_timeout(Duration::from_millis(500));
pub fn park_deadline(&self, deadline: Instant)
pub fn park_deadline(&self, deadline: Instant)
Blocks the current thread until the token is made available, or until a certain deadline.
§Examples
use std::time::{Duration, Instant};
use crossbeam_utils::sync::Parker;
let p = Parker::new();
let deadline = Instant::now() + Duration::from_millis(500);
// Waits for the token to become available, but will not wait longer than 500 ms.
p.park_deadline(deadline);
pub fn unparker(&self) -> &Unparker
pub fn unparker(&self) -> &Unparker
Returns a reference to an associated Unparker
.
The returned Unparker
doesn’t have to be used by reference - it can also be cloned.
§Examples
use crossbeam_utils::sync::Parker;
let p = Parker::new();
let u = p.unparker().clone();
// Make the token available.
u.unpark();
// Wakes up immediately and consumes the token.
p.park();
pub fn into_raw(this: Parker) -> *const ()
pub fn into_raw(this: Parker) -> *const ()
Converts a Parker
into a raw pointer.
§Examples
use crossbeam_utils::sync::Parker;
let p = Parker::new();
let raw = Parker::into_raw(p);
pub unsafe fn from_raw(ptr: *const ()) -> Parker
pub unsafe fn from_raw(ptr: *const ()) -> Parker
Converts a raw pointer into a Parker
.
§Safety
This method is safe to use only with pointers returned by Parker::into_raw
.
§Examples
use crossbeam_utils::sync::Parker;
let p = Parker::new();
let raw = Parker::into_raw(p);
let p = unsafe { Parker::from_raw(raw) };
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Parker
impl RefUnwindSafe for Parker
impl !Sync for Parker
impl Unpin for Parker
impl UnwindSafe for Parker
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> 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