Struct PollAll 

pub(crate) struct PollAll<'a, const N: usize, T> {
    inner: SmallVec<[Pin<Box<dyn Future<Output = T> + Send + 'a>>; N]>,
}

Helper for driving multiple futures in lockstep.

When .awaited, a PollAll will unconditionally poll all of its underlying futures, in the order they were pushed, until one or more of them resolves. Any remaining unresolved futures will be dropped. An empty PollAll will resolve immediately, yielding an empty list.

PollAll resolves to an ordered list of results, obtained from polling the futures in insertion order. Because some of the futures may not get a chance to resolve, the number of results will always be less than or equal to the number of inserted futures.

Because PollAll drives the futures in lockstep, if one future becomes ready, all of the futures will get polled, even if they didn’t generate a wakeup notification.

Invariants

All of the futures inserted into this set must be cancellation safe.

Fields

inner: SmallVec<[Pin<Box<dyn Future<Output = T> + Send + 'a>>; N]>

The futures to drive in lockstep.

Implementations

impl<'a, const N: usize, T> PollAll<'a, N, T>

pub(crate) fn new() -> Self

Create an empty PollAll.

pub(crate) fn push<S: Future<Output = T> + Send + 'a>(&mut self, item: S)

Add a future to this PollAll.

Trait Implementations

impl<'a, const N: usize, T: Default> Default for PollAll<'a, N, T>

fn default() -> PollAll<'a, N, T>

Returns the “default value” for a type.

impl<'a, const N: usize, T> Future for PollAll<'a, N, T>

type Output = SmallVec<[T; N]>

The type of value produced on completion.

fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output>

Attempts to resolve the future to a final value, registering the current task for wakeup if the value is not yet available.