Enum TrieFnState 

pub enum TrieFnState<A, T> {
    Simulate {
        trace: Trace<A, Trie<(Rc<dyn Any>, f64)>, T>,
    },
    Generate {
        trace: Trace<A, Trie<(Rc<dyn Any>, f64)>, T>,
        weight: f64,
        constraints: Trie<Rc<dyn Any>>,
    },
    Update {
        trace: Trace<A, Trie<(Rc<dyn Any>, f64)>, T>,
        constraints: Trie<Rc<dyn Any>>,
        weight: f64,
        discard: Trie<Rc<dyn Any>>,
        visitor: AddrTrie,
    },
}

Incremental computational state of a trace during the execution of the different GenFn methods with a TrieFn.

Variants

Simulate

State for executing GenFn::simulate in a TrieFn.

Fields

trace: Trace<A, Trie<(Rc<dyn Any>, f64)>, T>

Generate

State for executing GenFn::generate in a TrieFn.

Fields

trace: Trace<A, Trie<(Rc<dyn Any>, f64)>, T>

weight: f64

constraints: Trie<Rc<dyn Any>>

Update

State for executing GenFn::update in a TrieFn.

Fields

trace: Trace<A, Trie<(Rc<dyn Any>, f64)>, T>

constraints: Trie<Rc<dyn Any>>

weight: f64

discard: Trie<Rc<dyn Any>>

visitor: AddrTrie

Implementations

impl<A: 'static, T: 'static> TrieFnState<A, T>

pub fn sample_at<V: Clone + 'static, W: Clone + 'static>( &mut self, dist: &impl Distribution<V, W>, args: W, addr: &str, ) -> V

Sample a random value from a distribution and insert it into the self.trace.data trie as a weighted leaf node.

Return a clone of the sampled value.

pub fn trace_at<X: Clone + 'static, Y: Clone + 'static>( &mut self, gen_fn: &impl GenFn<X, Trie<(Rc<dyn Any>, f64)>, Y>, args: X, addr: &str, ) -> Y

Recursively sample a trace from another gen_fn.

Insert its subtrace.data trie as a weighted internal node of the current trace.data trie. Insert its retv as a (zero-weighted) internal node of the current trace.data trie.

Return a clone of the retv.

pub fn gc(self) -> Self

For all addr present in self.trace.data, but not present in self.visitor, remove addr from self.trace.data and merge into self.discard.

Panics if self is not the Self::Update variant.