47#ifndef GUM_LEARNING_PRIOR_NO_prior_H
48#define GUM_LEARNING_PRIOR_NO_prior_H
The class representing a tabular database as used by learning tasks.
A class for storing a pair of sets of NodeIds, the second one corresponding to a conditional set.
void addConditioningPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vectordefined over the right hand side of the idset
void addJointPseudoCount(const IdCondSet &idset, std::vector< double > &counts) final
adds the prior to a counting vector corresponding to the idset
PriorType getType() const final
returns the type of the prior
void setWeight(const double weight) final
sets the weight of the a prior(kind of effective sample size)
NoPrior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
bool isInformative() const final
indicates whether the prior is tensorly informative
NoPrior(NoPrior &&from)
move constructor
NoPrior(const NoPrior &from)
copy constructor
NoPrior & operator=(NoPrior &&from)
move operator
NoPrior & operator=(const NoPrior &from)
copy operator
virtual ~NoPrior()
destructor
virtual NoPrior * clone() const
virtual copy constructor
Prior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
double weight() const
returns the weight assigned to the prior
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the no a priorclass: corresponds to 0 weight-sample
the base class for all a priori