Enum ThunkTree 

pub enum ThunkTree<T> {
    Leaf(T),
    Node(Box<dyn Fn() -> Vec<ThunkTree<T>>>),
}

A lazy tree structure where children are computed on demand.

Variants

Leaf(T)

A leaf node.

Node(Box<dyn Fn() -> Vec<ThunkTree<T>>>)

A lazy node whose children are thunked.

Implementations

impl<T: Clone> ThunkTree<T>

pub fn leaf(value: T) -> Self

Create a leaf.

pub fn node<F: Fn() -> Vec<ThunkTree<T>> + 'static>(f: F) -> Self

Create a lazy node.

pub fn leaves(&self) -> Vec<T>

where T: Clone,

Collect all leaves by forcing the tree recursively.

pub fn is_leaf(&self) -> bool

Check if this is a leaf.