51#ifndef DOXYGEN_SHOULD_SKIP_THIS
62 const std::vector< std::pair< std::size_t, std::size_t > >& ranges,
63 const Bijection< NodeId, std::size_t >& nodeId2columns) :
64 Score(parser, prior, ranges, nodeId2columns),
65 _internal_prior_(parser.database(), nodeId2columns) {
66 GUM_CONSTRUCTOR(ScorefNML);
70 INLINE ScorefNML::ScorefNML(
const DBRowGeneratorParser& parser,
72 const Bijection< NodeId, std::size_t >& nodeId2columns) :
73 Score(parser, prior, nodeId2columns), _internal_prior_(parser.database(), nodeId2columns) {
74 GUM_CONSTRUCTOR(ScorefNML);
78 INLINE ScorefNML::ScorefNML(
const ScorefNML& from) :
79 Score(from), _internal_prior_(from._internal_prior_) {
80 GUM_CONS_CPY(ScorefNML);
84 INLINE ScorefNML::ScorefNML(ScorefNML&& from) :
85 Score(
std::move(from)), _internal_prior_(
std::move(from._internal_prior_)) {
86 GUM_CONS_MOV(ScorefNML);
90 INLINE ScorefNML* ScorefNML::clone()
const {
return new ScorefNML(*
this); }
93 INLINE ScorefNML::~ScorefNML() { GUM_DESTRUCTOR(ScorefNML); }
96 INLINE std::string ScorefNML::isPriorCompatible(
const Prior& prior) {
97 return isPriorCompatible(prior.getType(), prior.weight());
101 INLINE std::string ScorefNML::isPriorCompatible()
const {
102 return isPriorCompatible(*(this->prior_));
106 INLINE
const Prior& ScorefNML::internalPrior()
const {
return _internal_prior_; }
the class used to read a row in the database and to transform it into a set of DBRow instances that c...
the base class for all a priori
The base class for all the scores used for learning (BIC, BDeu, etc).
ScorefNML(const DBRowGeneratorParser &parser, const Prior &prior, const std::vector< std::pair< std::size_t, std::size_t > > &ranges, const Bijection< NodeId, std::size_t > &nodeId2columns=Bijection< NodeId, std::size_t >())
default constructor
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
the class for computing fNML scores