Struct Pending

pub struct Pending<E>(/* private fields */);

Event iterator that never produces an event and never finishes

This event iterator is created by the pending() function. See its documentation for more.

Trait Implementations

impl<E> Debug for Pending<E>

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

Formats the value using the given formatter.

impl<E> EventIterator for Pending<E>

type Event<'me> = E where Self: 'me

The type of the events being iterated over

fn poll_next<'a>( self: Pin<&'a Self>, _cx: &mut Context<'_>, ) -> Poll<Option<Self::Event<'a>>>

Attempt to pull out the next event of this event iterator, registering the current task for wakeup if the value is not yet available, and returning None if the event iterator is exhausted.

fn next<'a>(self: Pin<&'a Self>) -> Next<'a, Self>

where Self: Sized,

Create a future that resolves to the next event in the event iterator.

fn next_unpinned(&self) -> Next<'_, Self>

where Self: Sized + Unpin,

Create a future that resolves to the next event in the event iterator.

fn size_hint(&self) -> (usize, Option<usize>)

Return the bounds on the remaining length of the event iterator.

fn map<B, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: for<'me> FnMut(Self::Event<'me>) -> B,

Take a closure and create an event iterator which calls that closure on each event.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: for<'me> FnMut(&Self::Event<'me>) -> bool,

Create an event iterator which uses a closure to determine if an event should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>

where Self: Sized, F: for<'me> FnMut(Self::Event<'me>) -> Option<B>,

Create an event iterator that both filters and maps.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: for<'me> FnMut(&Self::Event<'me>),

Do something with each event of an event iterator, passing the value on.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Create an event iterator which gives the current iteration count as well as the next event.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Create an event iterator which ends after the first Ready(None).

fn tear(self) -> Tear<Self>

where Self: Sized,

Create an event iterator which ends after the first Ready(None).

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Create an event iterator that yields the first n events, or fewer if the underlying event iterator ends sooner.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: for<'me> FnMut(&Self::Event<'me>) -> bool,

Create an event iterator that yields elements based on a predicate.