Struct Unfold 

pub struct Unfold<State> {
    pub kernel: fn(&mut TrieFnState<(i64, State), State>, (i64, State)) -> State,
}

Combinator struct for kernels that use the TrieFnState DSL (sample_at and trace_at) and automatically implement the GFI. Supports memory-efficient extension via the GfDiff::Extend flag (eg. as passed during a ParticleSystem::step).

Fields

kernel: fn(&mut TrieFnState<(i64, State), State>, (i64, State)) -> State

A random kernel that takes in a mutable reference to a TrieFnState<A,T> and some State, effectfully mutates it, and produces a new State.

Trait Implementations

impl<State: Clone> GenFn<(i64, State), Vec<Trie<(Rc<dyn Any>, f64)>>, Vec<State>> for Unfold<State>

fn simulate( &self, T_and_args: (i64, State), ) -> Trace<(i64, State), Vec<Trie<(Rc<dyn Any>, f64)>>, Vec<State>>

Execute the generative function and return a sampled trace.

fn generate( &self, T_and_args: (i64, State), vec_constraints: Vec<Trie<(Rc<dyn Any>, f64)>>, ) -> (Trace<(i64, State), Vec<Trie<(Rc<dyn Any>, f64)>>, Vec<State>>, f64)

Execute the generative function consistent with constraints. Return the log probability log[p(t; args) / q(t; constraints, args)]

fn update( &self, vec_trace: Trace<(i64, State), Vec<Trie<(Rc<dyn Any>, f64)>>, Vec<State>>, T_and_args: (i64, State), diff: GfDiff, vec_constraints: Vec<Trie<(Rc<dyn Any>, f64)>>, ) -> (Trace<(i64, State), Vec<Trie<(Rc<dyn Any>, f64)>>, Vec<State>>, Vec<Trie<(Rc<dyn Any>, f64)>>, f64)

Update a trace

fn call(&self, args: Args) -> Ret

Call a generative function and return the output.

fn propose(&self, args: Args) -> (Data, f64)

Use a generative function to propose some data.

fn assess(&self, args: Args, constraints: Data) -> f64

Assess the conditional probability of some proposed constraints under a generative function.