20 template<
typename HYP,
typename Grammar_t,
typename Enumerator>
26 typename HYP::data_t*
data;
34 Enumerator ge(this->grammar);
39 auto n = ge.toNode(nxt, grammar->start());
EnumerationInference(Grammar_t *g, typename HYP::data_t *d)
Definition: EnumerationInference.h:28
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...
Definition: Bayesable.h:140
Definition: EnumerationInference.h:21
Grammar_t * grammar
Definition: EnumerationInference.h:25
std::atomic< uintmax_t > enumeration_steps(0)
we don't need inputs/outputs for out MyHypothesis
Definition: MyHypothesis.h:6
void start()
Definition: Control.h:54
This manages multiple threads for running inference. This requires a subclass to define run_thread...
Definition: generator.hpp:21
generator< HYP & > run_thread(Control &ctl) override
Definition: EnumerationInference.h:32
unsigned long next_index()
Return the next index to operate on (in a thread-safe way).
Definition: ThreadedInferenceInterface.h:45
Definition: ThreadedInferenceInterface.h:22
bool running()
Definition: Control.h:63
size_t enumerationidx_t
Definition: IntegerizedStack.h:3
This class has all the information for running MCMC or MCTS in a little package. It defaultly constru...
HYP::data_t * data
Definition: EnumerationInference.h:26