On this page
Enum std::task::Poll
pub enum Poll<T> {
Ready(T),
Pending,
}
Indicates whether a value is available or if the current task has been scheduled to receive a wakeup instead.
Variants
Ready(T)
Represents that a value is immediately ready.
Pending
Represents that a value is not ready yet.
When a function returns Pending
, the function must also ensure that the current task is scheduled to be awoken when progress can be made.
Implementations
impl<T> Poll<T>
pub fn map<U, F>(self, f: F) -> Poll<U>
where
F: FnOnce(T) -> U,
Maps a Poll<T>
to Poll<U>
by applying a function to a contained value.
Examples
Converts a Poll<String>
into a Poll<usize>
, consuming the original:
let poll_some_string = Poll::Ready(String::from("Hello, World!"));
// `Poll::map` takes self *by value*, consuming `poll_some_string`
let poll_some_len = poll_some_string.map(|s| s.len());
assert_eq!(poll_some_len, Poll::Ready(13));
pub const fn is_ready(&self) -> bool
Returns true
if the poll is a Poll::Ready
value.
Examples
let x: Poll<u32> = Poll::Ready(2);
assert_eq!(x.is_ready(), true);
let x: Poll<u32> = Poll::Pending;
assert_eq!(x.is_ready(), false);
pub const fn is_pending(&self) -> bool
Returns true
if the poll is a Pending
value.
Examples
let x: Poll<u32> = Poll::Ready(2);
assert_eq!(x.is_pending(), false);
let x: Poll<u32> = Poll::Pending;
assert_eq!(x.is_pending(), true);
impl<T, E> Poll<Result<T, E>>
pub fn map_ok<U, F>(self, f: F) -> Poll<Result<U, E>>
where
F: FnOnce(T) -> U,
Maps a Poll<Result<T, E>>
to Poll<Result<U, E>>
by applying a function to a contained Poll::Ready(Ok)
value, leaving all other variants untouched.
This function can be used to compose the results of two functions.
Examples
let res: Poll<Result<u8, _>> = Poll::Ready("12".parse());
let squared = res.map_ok(|n| n * n);
assert_eq!(squared, Poll::Ready(Ok(144)));
pub fn map_err<U, F>(self, f: F) -> Poll<Result<T, U>>
where
F: FnOnce(E) -> U,
Maps a Poll::Ready<Result<T, E>>
to Poll::Ready<Result<T, F>>
by applying a function to a contained Poll::Ready(Err)
value, leaving all other variants untouched.
This function can be used to pass through a successful result while handling an error.
Examples
let res: Poll<Result<u8, _>> = Poll::Ready("oops".parse());
let res = res.map_err(|_| 0_u8);
assert_eq!(res, Poll::Ready(Err(0)));
impl<T, E> Poll<Option<Result<T, E>>>
pub fn map_ok<U, F>(self, f: F) -> Poll<Option<Result<U, E>>>
where
F: FnOnce(T) -> U,
Maps a Poll<Option<Result<T, E>>>
to Poll<Option<Result<U, E>>>
by applying a function to a contained Poll::Ready(Some(Ok))
value, leaving all other variants untouched.
This function can be used to compose the results of two functions.
Examples
let res: Poll<Option<Result<u8, _>>> = Poll::Ready(Some("12".parse()));
let squared = res.map_ok(|n| n * n);
assert_eq!(squared, Poll::Ready(Some(Ok(144))));
pub fn map_err<U, F>(self, f: F) -> Poll<Option<Result<T, U>>>
where
F: FnOnce(E) -> U,
Maps a Poll::Ready<Option<Result<T, E>>>
to Poll::Ready<Option<Result<T, F>>>
by applying a function to a contained Poll::Ready(Some(Err))
value, leaving all other variants untouched.
This function can be used to pass through a successful result while handling an error.
Examples
let res: Poll<Option<Result<u8, _>>> = Poll::Ready(Some("oops".parse()));
let res = res.map_err(|_| 0_u8);
assert_eq!(res, Poll::Ready(Some(Err(0))));
Trait Implementations
impl<T> Clone for Poll<T>
where
T: Clone,
fn clone(&self) -> Poll<T>
fn clone_from(&mut self, source: &Self)
source
. Read more
impl<T> Debug for Poll<T>
where
T: Debug,
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
impl<T> From<T> for Poll<T>
fn from(t: T) -> Poll<T>
Moves the value into a Poll::Ready
to make a Poll<T>
.
Example
assert_eq!(Poll::from(true), Poll::Ready(true));
impl<T, E, F> FromResidual<Result<Infallible, E>> for Poll<Option<Result<T, F>>>
where
F: From<E>,
fn from_residual(x: Result<Infallible, E>) -> Poll<Option<Result<T, F>>>
try_trait_v2
#84277)
Residual
type. Read more
impl<T, E, F> FromResidual<Result<Infallible, E>> for Poll<Result<T, F>>
where
F: From<E>,
fn from_residual(x: Result<Infallible, E>) -> Poll<Result<T, F>>
try_trait_v2
#84277)
Residual
type. Read more
impl<T> Hash for Poll<T>
where
T: Hash,
fn hash<__H>(&self, state: &mut __H)
where
__H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H)
where
H: Hasher,
Self: Sized,
impl<T> Ord for Poll<T>
where
T: Ord,
fn cmp(&self, other: &Poll<T>) -> Ordering
fn max(self, other: Self) -> Self
where
Self: Sized,
fn min(self, other: Self) -> Self
where
Self: Sized,
fn clamp(self, min: Self, max: Self) -> Self
where
Self: Sized + PartialOrd,
impl<T> PartialEq for Poll<T>
where
T: PartialEq,
fn eq(&self, other: &Poll<T>) -> bool
self
and other
values to be equal, and is used by ==
.
fn ne(&self, other: &Rhs) -> bool
!=
. The default implementation is almost always sufficient, and should not be overridden without very good reason.
impl<T> PartialOrd for Poll<T>
where
T: PartialOrd,
fn partial_cmp(&self, other: &Poll<T>) -> Option<Ordering>
fn lt(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read more
fn gt(&self, other: &Rhs) -> bool
fn ge(&self, other: &Rhs) -> bool
self
and other
) and is used by the >=
operator. Read more
impl<T, E> Try for Poll<Option<Result<T, E>>>
type Output = Poll<Option<T>>
try_trait_v2
#84277)
?
when not short-circuiting.
type Residual = Result<Infallible, E>
try_trait_v2
#84277)
FromResidual::from_residual
as part of ?
when short-circuiting. Read more
fn from_output(
c: <Poll<Option<Result<T, E>>> as Try>::Output
) -> Poll<Option<Result<T, E>>>
try_trait_v2
#84277)
Output
type. Read more
fn branch(
self
) -> ControlFlow<<Poll<Option<Result<T, E>>> as Try>::Residual, <Poll<Option<Result<T, E>>> as Try>::Output>
try_trait_v2
#84277)
?
to decide whether the operator should produce a value (because this returned ControlFlow::Continue
) or propagate a value back to the caller (because this returned ControlFlow::Break
). Read more
impl<T, E> Try for Poll<Result<T, E>>
type Output = Poll<T>
try_trait_v2
#84277)
?
when not short-circuiting.
type Residual = Result<Infallible, E>
try_trait_v2
#84277)
FromResidual::from_residual
as part of ?
when short-circuiting. Read more
fn from_output(c: <Poll<Result<T, E>> as Try>::Output) -> Poll<Result<T, E>>
try_trait_v2
#84277)
Output
type. Read more
fn branch(
self
) -> ControlFlow<<Poll<Result<T, E>> as Try>::Residual, <Poll<Result<T, E>> as Try>::Output>
try_trait_v2
#84277)
?
to decide whether the operator should produce a value (because this returned ControlFlow::Continue
) or propagate a value back to the caller (because this returned ControlFlow::Break
). Read more
impl<T> Copy for Poll<T>
where
T: Copy,
impl<T> Eq for Poll<T>
where
T: Eq,
impl<T> StructuralEq for Poll<T>
impl<T> StructuralPartialEq for Poll<T>
Auto Trait Implementations
impl<T> RefUnwindSafe for Poll<T>
where
T: RefUnwindSafe,
impl<T> Send for Poll<T>
where
T: Send,
impl<T> Sync for Poll<T>
where
T: Sync,
impl<T> Unpin for Poll<T>
where
T: Unpin,
impl<T> UnwindSafe for Poll<T>
where
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T
where
T: 'static + ?Sized,
impl<T> Borrow<T> for T
where
T: ?Sized,
impl<T> BorrowMut<T> for T
where
T: ?Sized,
impl<T> From<!> for T
fn from(t: !) -> T
impl<T> From<T> for T
fn from(t: T) -> T
Returns the argument unchanged.
impl<T, U> Into<U> for T
where
U: From<T>,
fn into(self) -> U
Calls U::from(self)
.
That is, this conversion is whatever the implementation of From<T> for U
chooses to do.
impl<T> ToOwned for T
where
T: Clone,
type Owned = T
fn to_owned(&self) -> T
fn clone_into(&self, target: &mut T)
impl<T, U> TryFrom<U> for T
where
U: Into<T>,
type Error = Infallible
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto<U> for T
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/task/enum.Poll.html