aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
noPrior_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
48#ifndef DOXYGEN_SHOULD_SKIP_THIS
49
51
52namespace gum {
53
54 namespace learning {
55
57 INLINE
58 NoPrior::NoPrior(const DatabaseTable& database,
59 const Bijection< NodeId, std::size_t >& nodeId2columns) :
60 Prior(database, nodeId2columns) {
61 Prior::setWeight(0.0);
62 GUM_CONSTRUCTOR(NoPrior);
63 }
64
66 INLINE NoPrior::NoPrior(const NoPrior& from) : Prior(from) { GUM_CONS_CPY(NoPrior); }
67
69 INLINE NoPrior::NoPrior(NoPrior&& from) : Prior(std::move(from)) { GUM_CONS_MOV(NoPrior); }
70
72 INLINE NoPrior* NoPrior::clone() const { return new NoPrior(*this); }
73
75 INLINE NoPrior::~NoPrior() { GUM_DESTRUCTOR(NoPrior); }
76
78 INLINE NoPrior& NoPrior::operator=(const NoPrior& from) {
79 Prior::operator=(from);
80 return *this;
81 }
82
84 INLINE NoPrior& NoPrior::operator=(NoPrior&& from) {
85 Prior::operator=(std::move(from));
86 return *this;
87 }
88
90 INLINE void NoPrior::setWeight(const double) {}
91
93 INLINE PriorType NoPrior::getType() const { return PriorType::NoPriorType; }
94
96 INLINE bool NoPrior::isInformative() const { return false; }
97
99 INLINE void NoPrior::addJointPseudoCount(const IdCondSet& idset,
100 std::vector< double >& counts) {}
101
103 INLINE void NoPrior::addConditioningPseudoCount(const IdCondSet& idset,
104 std::vector< double >& counts) {}
105
106
107 } /* namespace learning */
108
109} /* namespace gum */
110
111#endif /* DOXYGEN_SHOULD_SKIP_THIS */
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
Definition prior.h:83
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 no a priorclass: corresponds to 0 weight-sample