50#ifndef DOXYGEN_SHOULD_SKIP_THIS
61 const Bijection< NodeId, std::size_t >& nodeId2columns) :
62 Prior(database, nodeId2columns) {
63 Prior::setWeight(0.0);
64 GUM_CONSTRUCTOR(NoPrior);
68 INLINE NoPrior::NoPrior(
const NoPrior& from) : Prior(from) { GUM_CONS_CPY(NoPrior); }
71 INLINE NoPrior::NoPrior(NoPrior&& from) : Prior(
std::move(from)) { GUM_CONS_MOV(NoPrior); }
74 INLINE NoPrior* NoPrior::clone()
const {
return new NoPrior(*
this); }
77 INLINE NoPrior::~NoPrior() { GUM_DESTRUCTOR(NoPrior); }
80 INLINE NoPrior& NoPrior::operator=(
const NoPrior& from) =
default;
83 INLINE NoPrior& NoPrior::operator=(NoPrior&& from) {
84 Prior::operator=(std::move(from));
89 INLINE
void NoPrior::setWeight(
const double) {}
92 INLINE
PriorType NoPrior::getType()
const {
return PriorType::NoPriorType; }
95 INLINE
bool NoPrior::isInformative()
const {
return false; }
98 INLINE
void NoPrior::addJointPseudoCount(
const IdCondSet& idset,
99 std::vector< double >& counts) {}
102 INLINE
void NoPrior::addConditioningPseudoCount(
const IdCondSet& idset,
103 std::vector< double >& counts) {}
The class representing a tabular database as used by learning tasks.
NoPrior(const DatabaseTable &database, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
the base class for all a priori
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the no a priorclass: corresponds to 0 weight-sample