Struct BitStringPrior 

pub struct BitStringPrior { /* private fields */ }

Independent Bernoulli(p) prior on every bit of a BitString.

Implementations

impl BitStringPrior

pub fn new(p_one: f64, len: usize) -> Self

Prior over len-bit strings with per-bit probability p_one of a set bit. p_one must lie in (0, 1) so every string has support.

pub fn uniform(len: usize) -> Self

Uniform prior over len-bit strings (p = 1/2 per bit).

Trait Implementations

impl Clone for BitStringPrior

fn clone(&self) -> BitStringPrior

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for BitStringPrior

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl GenomePrior for BitStringPrior

type Genome = BitString

The genome type this prior generates.

fn model(&self) -> Model<BitString>

The generative program p(x).

fn trace_of(&self, genome: &Self::Genome) -> Trace

Encode a genome as a trace under this prior’s address scheme — the inverse direction of running Self::model. The default delegates to the genome’s canonical TraceGenome::to_trace encoding, which is correct whenever the prior samples exactly the canonical sites (all the vector priors here). Priors with their own generative scheme — e.g. ArithmeticGrammarPrior’s tree-path grammar — override this so that scoring, weighted traces, and chain warm-starts work for any genome the prior can express.