aGrUM
3.3.2
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
concreteLeaf_tpl.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
#include <
agrum/FMDP/learning/datastructure/leaves/concreteLeaf.h
>
44
45
namespace
gum
{
46
47
48
template
< TESTNAME AttributeSelection,
bool
isScalar >
49
ConcreteLeaf< AttributeSelection, isScalar >::ConcreteLeaf
(
50
NodeId
leafId,
51
NodeDatabase< AttributeSelection, isScalar >
* n1,
52
const
Sequence< ValueType >
* valueDomain) :
53
AbstractLeaf
(leafId),
_n1_
(n1),
_valueDomain_
(valueDomain) {
54
GUM_CONSTRUCTOR(
ConcreteLeaf
);
55
}
56
57
template
< TESTNAME AttributeSelection,
bool
isScalar >
58
ConcreteLeaf< AttributeSelection, isScalar >::~ConcreteLeaf
() {
59
GUM_DESTRUCTOR(
ConcreteLeaf
);
60
;
61
}
62
63
template
< TESTNAME AttributeSelection,
bool
isScalar >
64
void
*
ConcreteLeaf< AttributeSelection, isScalar >::operator
new
(
size_t
s) {
65
return
SmallObjectAllocator::instance
().
allocate
(s);
66
}
67
68
template
< TESTNAME AttributeSelection,
bool
isScalar >
69
void
ConcreteLeaf< AttributeSelection, isScalar >::operator
delete
(
void
* p) {
70
SmallObjectAllocator::instance
().
deallocate
(p,
sizeof
(
ConcreteLeaf
));
71
}
72
73
template
< TESTNAME AttributeSelection,
bool
isScalar >
74
double
ConcreteLeaf< AttributeSelection, isScalar >::effectif
(
Idx
moda)
const
{
75
return
_effectif_
(moda,
Int2Type< isScalar >
());
76
}
77
78
template
< TESTNAME AttributeSelection,
bool
isScalar >
79
double
ConcreteLeaf< AttributeSelection, isScalar >::_effectif_
(
Idx
moda,
80
Int2Type< true >
)
const
{
81
return
(
double
)
_n1_
->effectif(
Idx
(
_valueDomain_
->atPos(moda)));
82
}
83
84
template
< TESTNAME AttributeSelection,
bool
isScalar >
85
double
ConcreteLeaf< AttributeSelection, isScalar >::_effectif_
(
Idx
moda,
86
Int2Type< false >
)
const
{
87
return
(
double
)
_n1_
->effectif(moda);
88
}
89
90
template
< TESTNAME AttributeSelection,
bool
isScalar >
91
double
ConcreteLeaf< AttributeSelection, isScalar >::total
()
const
{
92
return
double
(
_n1_
->nbObservation());
93
}
94
95
template
< TESTNAME AttributeSelection,
bool
isScalar >
96
Idx
ConcreteLeaf< AttributeSelection, isScalar >::nbModa
()
const
{
97
return
_nbModa_
(
Int2Type< isScalar >
());
98
}
99
100
template
< TESTNAME AttributeSelection,
bool
isScalar >
101
Idx
ConcreteLeaf< AttributeSelection, isScalar >::_nbModa_
(
Int2Type< true >
)
const
{
102
return
_valueDomain_
->size();
103
}
104
105
template
< TESTNAME AttributeSelection,
bool
isScalar >
106
Idx
ConcreteLeaf< AttributeSelection, isScalar >::_nbModa_
(
Int2Type< false >
)
const
{
107
return
_n1_
->valueDomain();
108
}
109
110
template
< TESTNAME AttributeSelection,
bool
isScalar >
111
std::string
ConcreteLeaf< AttributeSelection, isScalar >::toString
() {
112
return
std::format(
"{{ Id : {}}}"
, this->
id
());
113
}
114
115
}
// namespace gum
double
gum::AbstractLeaf::AbstractLeaf
AbstractLeaf(NodeId leafId)
Default constructor.
Definition
abstractLeaf_inl.h:48
gum::ConcreteLeaf::_valueDomain_
const Sequence< ValueType > * _valueDomain_
Definition
concreteLeaf.h:129
gum::ConcreteLeaf::toString
std::string toString() override
Definition
concreteLeaf_tpl.h:111
gum::ConcreteLeaf::_n1_
NodeDatabase< AttributeSelection, isScalar > * _n1_
Definition
concreteLeaf.h:128
gum::ConcreteLeaf::total
double total() const override
Definition
concreteLeaf_tpl.h:91
gum::ConcreteLeaf::_effectif_
double _effectif_(Idx moda, Int2Type< true >) const
Definition
concreteLeaf_tpl.h:79
gum::ConcreteLeaf::~ConcreteLeaf
~ConcreteLeaf() override
Default destructor.
Definition
concreteLeaf_tpl.h:58
gum::ConcreteLeaf::_nbModa_
Idx _nbModa_(Int2Type< true >) const
Definition
concreteLeaf_tpl.h:101
gum::ConcreteLeaf::effectif
double effectif(Idx moda) const override
Gaves the leaf effectif for given modality.
Definition
concreteLeaf_tpl.h:74
gum::ConcreteLeaf::nbModa
Idx nbModa() const override
Definition
concreteLeaf_tpl.h:96
gum::ConcreteLeaf::ConcreteLeaf
ConcreteLeaf(NodeId leafId, NodeDatabase< AttributeSelection, isScalar > *n1, const Sequence< ValueType > *valueDomain)
Default constructor.
Definition
concreteLeaf_tpl.h:49
gum::NodeDatabase
<agrum/FMDP/learning/datastructure/nodeDatabase.h>
Definition
nodeDatabase.h:75
gum::Sequence< ValueType >
gum::SmallObjectAllocator::instance
static SmallObjectAllocator & instance()
Definition
smallObjectAllocator_inl.h:96
gum::SmallObjectAllocator::allocate
void * allocate(const size_t &objectSize)
Allocates a block.
Definition
smallObjectAllocator.cpp:72
gum::SmallObjectAllocator::deallocate
void deallocate(void *pDeallocatedObject, const size_t &objectSize)
Deallocates an object.
Definition
smallObjectAllocator_inl.h:116
concreteLeaf.h
Headers of the Concrete Leaf class.
gum::Idx
Size Idx
Type for indexes.
Definition
types.h:79
gum::NodeId
Size NodeId
Type for node ids.
Definition
graphElements.h:117
gum
gum is the global namespace for all aGrUM entities
Definition
agrum.h:46
gum::Int2Type
Definition
templateStrategy.h:56
aGrUM
3.3.2
© PHW&CG&others - 2022
DoXyGeN 1.18.0