Struct TrieFn 

pub struct TrieFn<A, T> {
    pub func: fn(&mut TrieFnState<A, T>, A) -> T,
}

Wrapper struct for functions that use the TrieFnState DSL (sample_at and trace_at) and automatically implement the GFI.

Fields

func: fn(&mut TrieFnState<A, T>, A) -> T

A random function that takes in a mutable reference to a TrieFnState<A,T> and some args A, effectfully mutates the state, and produces a value T.

Implementations

impl<Args, Ret> TrieFn<Args, Ret>

pub fn new(func: fn(&mut TrieFnState<Args, Ret>, Args) -> Ret) -> Self

Dynamically construct a TrieFn from a function at run-time.

Trait Implementations

impl<Args: Clone + 'static, Ret: 'static> GenFn<Args, Trie<(Rc<dyn Any>, f64)>, Ret> for TrieFn<Args, Ret>

fn simulate(&self, args: Args) -> Trace<Args, Trie<(Rc<dyn Any>, f64)>, Ret>

Execute the generative function and return a sampled trace.

fn generate( &self, args: Args, constraints: Trie<(Rc<dyn Any>, f64)>, ) -> (Trace<Args, Trie<(Rc<dyn Any>, f64)>, Ret>, f64)

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

fn update( &self, trace: Trace<Args, Trie<(Rc<dyn Any>, f64)>, Ret>, args: Args, _: GfDiff, constraints: Trie<(Rc<dyn Any>, f64)>, ) -> (Trace<Args, Trie<(Rc<dyn Any>, f64)>, Ret>, 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.