aGrUM 3.1.1
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-2026 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-2026 *
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
41#pragma once
42
43
51
52#ifndef DOXYGEN_SHOULD_SKIP_THIS
53
54namespace gum {
55
56 namespace learning {
57
59 INLINE
61 const Prior& prior,
62 const std::vector< std::pair< std::size_t, std::size_t > >& ranges,
63 const Bijection< NodeId, std::size_t >& nodeId2columns) :
64 prior_(prior.clone()), counter_(parser, ranges, nodeId2columns) {
65 GUM_CONSTRUCTOR(PseudoCount);
66 }
67
69 INLINE PseudoCount::PseudoCount(const DBRowGeneratorParser& parser,
70 const Prior& prior,
71 const Bijection< NodeId, std::size_t >& nodeId2columns) :
72 prior_(prior.clone()), counter_(parser, nodeId2columns) {
73 GUM_CONSTRUCTOR(PseudoCount);
74 }
75
77 INLINE PseudoCount::PseudoCount(const PseudoCount& from) :
78 prior_(from.prior_->clone()), counter_(from.counter_) {
79 GUM_CONS_CPY(PseudoCount);
80 }
81
83 INLINE PseudoCount::PseudoCount(PseudoCount&& from) :
84 prior_(from.prior_), counter_(std::move(from.counter_)) {
85 from.prior_ = nullptr;
86 GUM_CONS_MOV(PseudoCount);
87 }
88
90 INLINE PseudoCount::~PseudoCount() {
91 if (prior_ != nullptr) delete prior_;
92 GUM_DESTRUCTOR(PseudoCount);
93 }
94
96 INLINE void PseudoCount::setNumberOfThreads(Size nb) { counter_.setNumberOfThreads(nb); }
97
99 INLINE Size PseudoCount::getNumberOfThreads() const { return counter_.getNumberOfThreads(); }
100
102 INLINE bool PseudoCount::isGumNumberOfThreadsOverriden() const {
103 return counter_.isGumNumberOfThreadsOverriden();
104 }
105
108 INLINE void PseudoCount::setMinNbRowsPerThread(const std::size_t nb) const {
109 counter_.setMinNbRowsPerThread(nb);
110 }
111
113 INLINE std::size_t PseudoCount::minNbRowsPerThread() const {
114 return counter_.minNbRowsPerThread();
115 }
116
118 INLINE const std::vector< std::pair< std::size_t, std::size_t > >& PseudoCount::ranges() const {
119 return counter_.ranges();
120 }
121
123 INLINE void PseudoCount::clear() { counter_.clear(); }
124
126 INLINE const Bijection< NodeId, std::size_t >& PseudoCount::nodeId2Columns() const {
127 return counter_.nodeId2Columns();
128 }
129
131 INLINE const DatabaseTable& PseudoCount::database() const { return counter_.database(); }
132
133
134 } /* namespace learning */
135
136} /* namespace gum */
137
138#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:81
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:55
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