Enum LazyStream 

pub enum LazyStream<T> {
    Nil,
    Cons(T, Box<dyn FnOnce() -> LazyStream<T>>),
}

A lazy stream (coinductive list) implemented as a linked structure of thunks.

Models the cofree comonad / productive corecursion pattern.

Variants

Nil

Empty stream.

Cons(T, Box<dyn FnOnce() -> LazyStream<T>>)

A head value paired with a lazily-computed tail.

Implementations

impl<T: Clone> LazyStream<T>

pub fn nil() -> Self

Construct an empty stream.

pub fn cons<F: FnOnce() -> LazyStream<T> + 'static>(head: T, tail: F) -> Self

Construct a cons cell.

pub fn take(self, n: usize) -> Vec<T>

Force the stream and collect up to n elements.

pub fn is_nil(&self) -> bool

Check if the stream is empty (without forcing the tail).