Struct FixThunk 

pub struct FixThunk<T: Clone> { /* private fields */ }

A fixed-point computation using memoized thunks.

Implements fix f = f (fix f) lazily: each call to compute evaluates one step, caching the result. Useful for lazy recursive definitions.

Implementations

impl<T: Clone> FixThunk<T>

pub fn new<F>(f: F) -> Self

where F: Fn(usize, &dyn Fn(usize) -> T) -> T + 'static,

Create a new fixed-point thunk.

f receives the current index and a reference to compute so it can look up previously computed values recursively.

pub fn compute(&mut self, n: usize) -> T

Compute the value at index n, caching and reusing previous results.