aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
leafPair.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
48
49// =========================================================================
50#ifndef GUM_LEAF_PAIR_H
51#define GUM_LEAF_PAIR_H
52// =========================================================================
53// =========================================================================
55
56// =========================================================================
57
58namespace gum {
59
67
68
69 class LeafPair {
70 public:
71 // ==========================================================================
73 // ==========================================================================
75
76 // ###################################################################
78 // ###################################################################
80
81 // ###################################################################
83 // ###################################################################
84 ~LeafPair();
85
86 // ============================================================================
88 // ============================================================================
89 void* operator new(size_t s);
90
91 void operator delete(void* p);
92
94
95 // ==========================================================================
97 // ==========================================================================
99
100 // ###################################################################
102 // ###################################################################
103 void updateLikelyhood();
104
105 // ###################################################################
107 // ###################################################################
108 double likelyhood();
109
111
112 // ###################################################################
114 // ###################################################################
116
118
119 // ###################################################################
121 // ###################################################################
122 bool contains(NodeId testedId);
123
124 // ###################################################################
126 // ###################################################################
127 AbstractLeaf* convert2Leaf(NodeId leafId) const;
128
130
131 std::string toString();
132
133 private:
136
139 };
140
141
142} /* namespace gum */
143
144#ifndef GUM_NO_INLINE
146#endif // GUM_NO_INLINE
147#endif // GUM_LEAF_PAIR_H
<agrum/FMDP/learning/datastructure/leaves/abstractLeaf.h>
AbstractLeaf * secondLeaf()
LeafPair(AbstractLeaf *l1, AbstractLeaf *l2)
Default constructor.
AbstractLeaf * firstLeaf()
double _likelyhood1_
Definition leafPair.h:137
bool contains(NodeId testedId)
Returns true if pair has leaf in it.
double _likelyhood2_
Definition leafPair.h:138
AbstractLeaf * otherLeaf(AbstractLeaf *l) const
void updateLikelyhood()
Updates GStatistic.
Definition leafPair.cpp:68
AbstractLeaf * _l1_
Definition leafPair.h:134
~LeafPair()
Default destructor.
std::string toString()
Definition leafPair.cpp:106
AbstractLeaf * _l2_
Definition leafPair.h:135
double likelyhood()
Updates GStatistic.
Definition leafPair.cpp:99
AbstractLeaf * convert2Leaf(NodeId leafId) const
Returns a leaf matching data and having given id as id.
Headers of the abstract leaf class.
Size NodeId
Type for node ids.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46