aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
pseudoCount_inl.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 by *
5 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
6 * - Christophe GONZALES(_at_AMU) *
7 * *
8 * The aGrUM/pyAgrum library is free software; you can redistribute it *
9 * and/or modify it under the terms of either : *
10 * *
11 * - the GNU Lesser General Public License as published by *
12 * the Free Software Foundation, either version 3 of the License, *
13 * or (at your option) any later version, *
14 * - the MIT license (MIT), *
15 * - or both in dual license, as here. *
16 * *
17 * (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18 * *
19 * This aGrUM/pyAgrum library is distributed in the hope that it will be *
20 * useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26 * OTHER DEALINGS IN THE SOFTWARE. *
27 * *
28 * See LICENCES for more details. *
29 * *
30 * SPDX-FileCopyrightText: Copyright 2005-2025 *
31 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
32 * - Christophe GONZALES(_at_AMU) *
33 * SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34 * *
35 * Contact : info_at_agrum_dot_org *
36 * homepage : http://agrum.gitlab.io *
37 * gitlab : https://gitlab.com/agrumery/agrum *
38 * *
39 ****************************************************************************/
40#pragma once
41
42
50
51#ifndef DOXYGEN_SHOULD_SKIP_THIS
52
53namespace gum {
54
55 namespace learning {
56
58 INLINE
60 const Prior& prior,
61 const std::vector< std::pair< std::size_t, std::size_t > >& ranges,
62 const Bijection< NodeId, std::size_t >& nodeId2columns) :
63 prior_(prior.clone()), counter_(parser, ranges, nodeId2columns) {
64 GUM_CONSTRUCTOR(PseudoCount);
65 }
66
68 INLINE PseudoCount::PseudoCount(const DBRowGeneratorParser& parser,
69 const Prior& prior,
70 const Bijection< NodeId, std::size_t >& nodeId2columns) :
71 prior_(prior.clone()), counter_(parser, nodeId2columns) {
72 GUM_CONSTRUCTOR(PseudoCount);
73 }
74
76 INLINE PseudoCount::PseudoCount(const PseudoCount& from) :
77 prior_(from.prior_->clone()), counter_(from.counter_) {
78 GUM_CONS_CPY(PseudoCount);
79 }
80
82 INLINE PseudoCount::PseudoCount(PseudoCount&& from) :
83 prior_(from.prior_), counter_(std::move(from.counter_)) {
84 from.prior_ = nullptr;
85 GUM_CONS_MOV(PseudoCount);
86 }
87
89 INLINE PseudoCount::~PseudoCount() {
90 if (prior_ != nullptr) delete prior_;
91 GUM_DESTRUCTOR(PseudoCount);
92 }
93
95 INLINE void PseudoCount::setNumberOfThreads(Size nb) { counter_.setNumberOfThreads(nb); }
96
98 INLINE Size PseudoCount::getNumberOfThreads() const { return counter_.getNumberOfThreads(); }
99
101 INLINE bool PseudoCount::isGumNumberOfThreadsOverriden() const {
102 return counter_.isGumNumberOfThreadsOverriden();
103 }
104
107 INLINE void PseudoCount::setMinNbRowsPerThread(const std::size_t nb) const {
108 counter_.setMinNbRowsPerThread(nb);
109 }
110
112 INLINE std::size_t PseudoCount::minNbRowsPerThread() const {
113 return counter_.minNbRowsPerThread();
114 }
115
117 INLINE const std::vector< std::pair< std::size_t, std::size_t > >& PseudoCount::ranges() const {
118 return counter_.ranges();
119 }
120
122 INLINE void PseudoCount::clear() { counter_.clear(); }
123
125 INLINE const Bijection< NodeId, std::size_t >& PseudoCount::nodeId2Columns() const {
126 return counter_.nodeId2Columns();
127 }
128
130 INLINE const DatabaseTable& PseudoCount::database() const { return counter_.database(); }
131
132
133 } /* namespace learning */
134
135} /* namespace gum */
136
137#endif /* DOXYGEN_SHOULD_SKIP_THIS */
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
Definition prior.h:83
PseudoCount(const DBRowGeneratorParser &parser, const Prior &external_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
A class used by learning caches to represent uniquely sets of variables.
include the inlined functions if necessary
Definition CSVParser.h:54
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
STL namespace.
the base class for all the independence tests used for learning