Struct Recursion 

pub struct Recursion<F>(/* private fields */);

A recursive call of an async algorithm.

The callee lives on the heap, like a Box::pin of it would, and every poll of it runs through on_sufficient_stack, so polling a chain of nested calls cannot exhaust the native stack.

Implementations

impl<F> Recursion<F>

pub fn new(callee: F) -> Self

Wraps the recursive call callee.

Trait Implementations

impl<F: Future> Future for Recursion<F>

type Output = <F as Future>::Output

The type of value produced on completion.

fn poll(self: Pin<&mut Self>, cx: &mut TaskContext<'_>) -> 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.