#include <Lexicon.h>

Inheritance diagram for Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >:

Collaboration diagram for Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >:

Public Types
using	Grammar_t = typename INNER::Grammar_t

using	input_t = _input_t

using	output_t = _output_t

using	key_t = _key_t

using	VirtualMachineState_t = _VirtualMachineState_t

Public Types inherited from Bayesable< Args... >
typedef Args...	datum_t

typedef std::vector< Args... >	data_t

Public Member Functions
	Lexicon ()

size_t	nfactors () const
	Return the number of factors. More...

auto &	get_value ()

const auto &	get_value () const

INNER &	at (const key_t &k)

const INNER &	at (const key_t &k) const

INNER &	operator[] (const key_t &k)

const INNER &	operator[] (const key_t &k) const

bool	contains (const key_t &key)

Grammar_t *	get_grammar ()

virtual std::string	string (std::string prefix="") const override

virtual size_t	hash () const override

virtual bool	operator== (const this_t &l) const override
	Equality checks equality on each part. More...

virtual void	push_program (Program< VirtualMachineState_t > &s, const key_t k) override
	A lexicon has valid indices if calls to op_RECURSE, op_MEM_RECURSE, op_SAFE_RECURSE, and op_SAFE_MEM_RECURSE all have arguments that are less than the size. (So this places no restrictions on the calling earlier factors) More...

virtual void	complete () override
	Fill in all the holes in this hypothesis, at random, modifying self. NOTE for LOTHypotheses this will also compile, which is what we need to do for a LOTHypothesis. More...

virtual double	compute_prior () override

virtual std::optional< std::pair< this_t, double > >	propose () const override
	This proposal guarantees that there will be at least one factor that is proposed to. Each individual factor is proposed to with p_factor_propose. More...

virtual this_t	restart () const override

int	neighbors () const override
	Count the number of neighbors that are possible. (This should be size_t but int is more convenient.) More...

void	expand_to_neighbor (int k) override
	Modify this hypothesis to become the k'th neighbor. NOTE This does not compile since it might not be complete. More...

virtual double	neighbor_prior (int k) override
	What is the prior of the k'th neighbor? This does not need to return the full prior, only relative (among ks) More...

bool	is_evaluable () const override
	Check if we can evaluate this node (meaning compute a prior and posterior). NOTE that this is not the same as whether it has zero neighbors, since lexica might have neighbors but be evalable. More...

virtual DiscreteDistribution< output_t >	call (const key_t k, const input_t x, const output_t &err=output_t{})

virtual std::string	serialize () const override

Public Member Functions inherited from MCMCable< this_t, datum_t >
	MCMCable ()

virtual bool	operator!= (const this_t &h) const

Public Member Functions inherited from Bayesable< Args... >
	Bayesable ()

virtual double	compute_single_likelihood (const datum_t &datum)
	Compute the likelihood of a single data point. More...

virtual void	clear_bayes ()

virtual double	compute_likelihood (const data_t &data, const double breakout=-infinity)
	Compute the likelihood of a collection of data, by calling compute_single_likelihood on each. This stops if our likelihood falls below breakout. More...

virtual double	compute_posterior (const data_t &data, const std::pair< double, double > breakoutpair=std::make_pair(-infinity, 1.0))
	Compute the posterior, by calling prior and likelihood. This includes only a little bit of fanciness, which is that if our prior is -inf, then we don't both computing the likelihood. More...

virtual double	at_temperature (double t) const

auto	operator (const Bayesable< datum_t, data_t > &other) const

virtual void	show (std::string prefix="")

Public Member Functions inherited from Searchable< this_t, _input_t, _output_t >
virtual this_t	make_neighbor (int k) const
	Return a new hypothesis which is the k'th neighbor (just calls expand_to_neighbor) NOTE This does not compile since it might not be complete. More...

Public Member Functions inherited from ProgramLoader< _VirtualMachineState_t >
virtual void	push_program (Program< _VirtualMachineState_t > &s)

virtual void	push_program (Program< _VirtualMachineState_t > &s, const short a)

virtual void	push_program (Program< _VirtualMachineState_t > &s, const int a)

virtual void	push_program (Program< _VirtualMachineState_t > &s, const std::string k)

Static Public Member Functions
static this_t	sample (std::initializer_list< key_t > lst)
	Sample with n factors. More...

static this_t	sample (const std::vector< key_t > &lst)

template<typename... A>
static this_t	make (A... a)

static this_t	deserialize (const std::string s)

Static Public Member Functions inherited from MCMCable< this_t, datum_t >
static this_t	sample ()
	Static function for making a hypothesis. Be careful using this with references because they may not foward right (for reasons that are unclear to me) More...

Static Public Member Functions inherited from Serializable< this_t >
static this_t	deserialize (const std::string &)

Public Attributes
std::map< key_t, INNER >	factors

Public Attributes inherited from Bayesable< Args... >
double	prior

double	likelihood

double	posterior

uintmax_t	born

size_t	born_chain_idx

Public Attributes inherited from ProgramLoader< _VirtualMachineState_t >
bool	was_called

Static Public Attributes
static const char	FactorDelimiter = '\|'

static double	p_factor_propose = 0.5

Detailed Description

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>
class Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >

Author: piantado

Date: 29/01/20

Member Typedef Documentation

◆ Grammar_t

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

using Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::Grammar_t = typename INNER::Grammar_t

◆ input_t

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

using Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::input_t = _input_t

◆ key_t

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

using Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::key_t = _key_t

◆ output_t

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

using Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::output_t = _output_t

◆ VirtualMachineState_t

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

using Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::VirtualMachineState_t = _VirtualMachineState_t

Constructor & Destructor Documentation

◆ Lexicon()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::Lexicon ( )

inline

Member Function Documentation

◆ at() [1/2]

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

INNER& Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::at ( const key_t & k )

inline

◆ at() [2/2]

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

const INNER& Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::at ( const key_t & k ) const

inline

◆ call()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual DiscreteDistribution<output_t> Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::call	(	const key_t	k,
		const input_t	x,
		const output_t &	err = `output_t{}`
	)

inlinevirtual

◆ complete()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual void Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::complete ( )

inlineoverridevirtual

Fill in all the holes in this hypothesis, at random, modifying self. NOTE for LOTHypotheses this will also compile, which is what we need to do for a LOTHypothesis.

Implements Searchable< this_t, _input_t, _output_t >.

◆ compute_prior()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual double Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::compute_prior ( )

inlineoverridevirtual

Implements Bayesable< Args... >.

Reimplemented in MyHypothesis, MyHypothesis, and MyHypothesis.

◆ contains()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

bool Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::contains ( const key_t & key )

inline

◆ deserialize()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

static this_t Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::deserialize ( const std::string s )

inlinestatic

Convert a string to a lexicon of this type

Parameters

g
s

Returns

◆ expand_to_neighbor()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

void Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::expand_to_neighbor ( int k )

inlineoverridevirtual

Modify this hypothesis to become the k'th neighbor. NOTE This does not compile since it might not be complete.

Parameters

k

Implements Searchable< this_t, _input_t, _output_t >.

◆ get_grammar()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

Grammar_t* Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::get_grammar ( )

inline

◆ get_value() [1/2]

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

auto& Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::get_value ( )

inline

◆ get_value() [2/2]

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

const auto& Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::get_value ( ) const

inline

◆ hash()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual size_t Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::hash ( ) const

inlineoverridevirtual

Hash a Lexicon by hashing each part

Returns

Implements Bayesable< Args... >.

◆ is_evaluable()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

bool Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::is_evaluable ( ) const

inlineoverridevirtual

Check if we can evaluate this node (meaning compute a prior and posterior). NOTE that this is not the same as whether it has zero neighbors, since lexica might have neighbors but be evalable.

Implements Searchable< this_t, _input_t, _output_t >.

◆ make()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

template<typename... A>

static this_t Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::make ( A... a )

inlinestatic

◆ neighbor_prior()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual double Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::neighbor_prior ( int k )

inlineoverridevirtual

What is the prior of the k'th neighbor? This does not need to return the full prior, only relative (among ks)

Parameters

k

Implements Searchable< this_t, _input_t, _output_t >.

◆ neighbors()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

int Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::neighbors ( ) const

inlineoverridevirtual

Count the number of neighbors that are possible. (This should be size_t but int is more convenient.)

Implements Searchable< this_t, _input_t, _output_t >.

◆ nfactors()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

size_t Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::nfactors ( ) const

inline

Return the number of factors.

Returns

◆ operator==()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual bool Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::operator== ( const this_t & l ) const

inlineoverridevirtual

Equality checks equality on each part.

Parameters

l

Returns

Implements MCMCable< this_t, datum_t >.

◆ operator[]() [1/2]

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

INNER& Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::operator[] ( const key_t & k )

inline

◆ operator[]() [2/2]

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

const INNER& Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::operator[] ( const key_t & k ) const

inline

◆ propose()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual std::optional<std::pair<this_t,double> > Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::propose ( ) const

inlineoverridevirtual

This proposal guarantees that there will be at least one factor that is proposed to. Each individual factor is proposed to with p_factor_propose.

Returns

Implements MCMCable< this_t, datum_t >.

Reimplemented in MyHypothesis.

◆ push_program()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual void Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::push_program	(	Program< VirtualMachineState_t > &	s,
		const key_t	k
	)

inlineoverridevirtual

A lexicon has valid indices if calls to op_RECURSE, op_MEM_RECURSE, op_SAFE_RECURSE, and op_SAFE_MEM_RECURSE all have arguments that are less than the size. (So this places no restrictions on the calling earlier factors)

Returns: Check if the last factor call everything else transitively (e.g. are we "wasting" factors) We do this by making a graph of what factors call which others and then computing the transitive closure. NOTE that this requires the key_type and assumes that a rule of that type can be gotten directly from the first child of a recursive call (e.g. a terminal); Dispatch key k – push its program onto the stack.

Parameters

s
k

◆ restart()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual this_t Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::restart ( ) const

inlineoverridevirtual

Implements MCMCable< this_t, datum_t >.

◆ sample() [1/2]

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

static this_t Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::sample ( std::initializer_list< key_t > lst )

inlinestatic

Sample with n factors.

Parameters

n

Returns

◆ sample() [2/2]

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

static this_t Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::sample ( const std::vector< key_t > & lst )

inlinestatic

◆ serialize()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual std::string Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::serialize ( ) const

inlineoverridevirtual

Convert to a parseable format (using a delimiter for each factor)

Returns

Implements Serializable< this_t >.

◆ string()

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

virtual std::string Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::string ( std::string prefix = "" ) const

inlineoverridevirtual

Convert a lexicon to a string – defaultly includes all arguments.

Returns

Implements Bayesable< Args... >.

Reimplemented in MyHypothesis.

Member Data Documentation

◆ FactorDelimiter

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

const char Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::FactorDelimiter = '|'

static

◆ factors

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

std::map<key_t,INNER> Lexicon< this_t, _key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::factors

◆ p_factor_propose

template<typename this_t, typename _key_t, typename INNER, typename _input_t, typename _output_t, typename datum_t = defaultdatum_t<_input_t, _output_t>, typename _VirtualMachineState_t = typename INNER::Grammar_t::VirtualMachineState_t>

double Lexicon< this_t, key_t, INNER, _input_t, _output_t, datum_t, _VirtualMachineState_t >::p_factor_propose = 0.5

static

The documentation for this class was generated from the following file:

src/Hypotheses/Lexicon.h

Public Types

Public Member Functions

Static Public Member Functions

Public Attributes

Static Public Attributes

Detailed Description

Member Typedef Documentation

◆ Grammar_t

◆ input_t

◆ key_t

◆ output_t

◆ VirtualMachineState_t

Constructor & Destructor Documentation

◆ Lexicon()

Member Function Documentation

◆ at() [1/2]

◆ at() [2/2]

◆ call()

◆ complete()

◆ compute_prior()

◆ contains()

◆ deserialize()

◆ expand_to_neighbor()

◆ get_grammar()

◆ get_value() [1/2]

◆ get_value() [2/2]

◆ hash()

◆ is_evaluable()

◆ make()

◆ neighbor_prior()

◆ neighbors()

◆ nfactors()

◆ operator==()

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ propose()

◆ push_program()

◆ restart()

◆ sample() [1/2]

◆ sample() [2/2]

◆ serialize()

◆ string()

Member Data Documentation

◆ FactorDelimiter

◆ factors

◆ p_factor_propose