Struct EvolutionChain 

pub struct EvolutionChain<P, L>
where
    P: GenomePrior,
    L: GenomeLikelihood<P::Genome>,
{ /* private fields */ }

An MH chain over the fixed-β Boltzmann target π_β ∝ p(x)·exp(β·f(x)).

Implementations

impl<P, L> EvolutionChain<P, L>

where P: GenomePrior, L: GenomeLikelihood<P::Genome>,

pub fn new(model: EvolutionModel<P, L>) -> Self

Create a chain over the model’s fixed-β target.

pub fn target_rate(self, rate: f64) -> Self

Set the adaptation’s target acceptance rate (default 0.44).

pub fn override_site(self, addr: Address, proposal: SiteProposal) -> Self

Force a specific f64 proposal for one address (e.g. SiteProposal::Reflect { lower, upper } for a bounded coordinate).

pub fn model(&self) -> &EvolutionModel<P, L>

The underlying model.

pub fn init<R: Rng>(&self, rng: &mut R) -> Trace

Draw an initial state: a prior sample’s fully-scored trace.

pub fn init_from(&self, genome: &P::Genome) -> Option<Trace>

Warm-start the chain from a given genome: encode it under the model’s prior (GenomePrior::trace_of) and score it through the target program. Works for any prior — including grammar priors over trees — so a classic GA/GP result can seed an inference chain. Returns None if the genome is outside the prior’s support (its target density is −∞, which can never be left by an MH chain).

pub fn step<R: Rng>( &mut self, rng: &mut R, current: &Trace, ) -> (P::Genome, Trace)

One π_β-invariant transition. Moves ANY site type.

pub fn run_chain<R: Rng>( &self, rng: &mut R, n: usize, warmup: usize, ) -> Vec<(P::Genome, Trace)>

where P::Genome: Clone,

Full warmup-then-frozen chain: warmup adaptive iterations are discarded, then n samples are collected from the frozen kernel. Returns decoded genomes with their traces.