Struct eff::lazy::Lazy

pub struct Lazy<F>(_);

A lazy computation with no effects

Trait Implementations

impl<T, F> Effectful for Lazy<F> where
    F: FnOnce() -> T, 

type Output = T

The type of the final result

type Effect = !

The type of the effects this computation will produce

fn poll(self: Pin<&mut Self>, _cx: &Context) -> Poll<Self::Output, Self::Effect>

Execute the computation

Panics

Panics if the task is polled again after completion

fn handle<H, HC, Effect, I>(self, handler: H) -> Handled<Self, H, HC, Effect, I> where
    Self: Sized,
    HC: Effectful,
    H: FnMut(Event<Self::Output, Effect>) -> HC,
    Self::Effect: Subset<Effect, I>, 

Takes a value handler and an effect handler and creates an effectful computation with the effects handled

fn embed<Target, Indices>(self) -> EmbedEffect<Self, Target, Indices> where
    Self: Sized, 

Creates an effectful computation whose effect is a superset of that of this one

fn left<R>(self) -> Either<Self, R> where
    Self: Sized, 

Combine this and the other computation with the same signature

fn right<L>(self) -> Either<L, Self> where
    Self: Sized, 

Combine this and the other computation with the same signature

fn boxed<'a>(
    self
) -> Pin<Box<dyn Effectful<Output = Self::Output, Effect = Self::Effect> + 'a>> where
    Self: Sized + 'a, 

Create a boxed computation

fn output<T>(self) -> Self where
    Self: Effectful<Output = T> + Sized, 

fn effect<E>(self) -> Self where
    Self: Effectful<Effect = E> + Sized, 

Important traits for IntoFuture<C>

impl<C> Future for IntoFuture<C> where
    C: Effectful<Effect = !>,  type Output = C::Output;

fn into_future(self) -> IntoFuture<Self> where
    Self: Effectful<Effect = !> + Sized, 

fn block_on(self) -> Self::Output where
    Self: Sized + Effectful<Effect = !>, 

Run the computation to completion on the current thread

fn next_event(self) -> NextEvent<Self> where
    Self: Sized, 

Create a computation which polls this until the first event occures.

impl<F> Unpin for Lazy<F>