gen-rs 0.2.3

a experimental library for probabilistic programming in Rust.
Documentation
use crate::{Trie,Trace,GenFn,GfDiff,TrieFnState};
use std::any::Any;
use std::rc::Rc;


/// 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`).
pub struct Unfold<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`.
    pub kernel: fn(&mut TrieFnState<(i64,State),State>, (i64,State)) -> State
}

impl<State> Unfold<State> {
    /// Dynamically construct an `Unfold` from a kernel at run-time.
    fn new(kernel: fn(&mut TrieFnState<(i64,State),State>, (i64,State)) -> State) -> Self {
        Unfold { kernel }
    }
}


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>> {
        let (T, mut state) = T_and_args;
        assert!(T >= 1);
        let mut vec_trace = Trace { args: (T, state.clone()), data: vec![], retv: Some(vec![]), logp: 0. };
        for t in 0..T {
            let mut g = TrieFnState::Simulate {
                trace: Trace { args: (t as i64, state.clone()), data: Trie::new(), retv: None, logp: 0. },
            };
            state = (self.kernel)(&mut g, (t as i64, state.clone()));
            let TrieFnState::Simulate {mut trace} = g else { unreachable!() };
            vec_trace.retv.as_mut().unwrap().push(state.clone());
            vec_trace.data.push(trace.data);
            vec_trace.logp += trace.logp;
        }
        vec_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)
    {
        let (T, mut state) = T_and_args;
        assert!(T >= 1);
        let mut vec_trace = Trace { args: (T, state.clone()), data: vec![], retv: Some(vec![]), logp: 0. };
        let mut gen_weight = 0.;
        for (t,constraints) in vec_constraints.into_iter().enumerate() {
            let mut g = TrieFnState::Generate {
                trace: Trace { args: (t as i64, state.clone()), data: Trie::new(), retv: None, logp: 0. },
                weight: 0.,
                constraints: constraints.into_unweighted()
            };
            state = (self.kernel)(&mut g, (t as i64, state.clone()));
            let TrieFnState::Generate {mut trace, weight, constraints} = g else { unreachable!() };
            assert!(constraints.is_empty());
            vec_trace.retv.as_mut().unwrap().push(state.clone());
            vec_trace.data.push(trace.data);
            vec_trace.logp += trace.logp;
            gen_weight += weight;
        }
        (vec_trace, gen_weight)
    }

    fn update(&self,
        mut 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) {
        let (T, _) = T_and_args;
        assert!(T >= 1);
        let prev_T = vec_trace.args.0;
        assert!(T - prev_T == vec_constraints.len() as i64);
        let mut state = vec_trace.retv.as_ref().unwrap().last().unwrap().clone();
        let mut update_weight = 0.;
        match diff {
            GfDiff::Extend => {
                for (t,constraints) in vec_constraints.into_iter().enumerate() {
                    let mut g = TrieFnState::Generate {
                        trace: Trace { args: (prev_T + (t as i64), state.clone()), data: Trie::new(), retv: None, logp: 0. },
                        weight: 0.,
                        constraints: constraints.into_unweighted()
                    };
                    state = (self.kernel)(&mut g, (prev_T + (t as i64), state.clone()));
                    let TrieFnState::Generate {mut trace, weight, constraints} = g else { unreachable!() };
                    assert!(constraints.is_empty());
                    vec_trace.args.0 += 1;
                    vec_trace.retv.as_mut().unwrap().push(state.clone());
                    vec_trace.data.push(trace.data);
                    vec_trace.logp += trace.logp;
                    update_weight += weight;
                }
            },
            _ => { panic!("Can't handle GF change type: {:?}", diff) },
        }
        (vec_trace, (prev_T..T).map(|_| Trie::new()).collect::<_>(), update_weight)
    }
}