aGrUM
3.2.0
a C++ library for (probabilistic) graphical models
Toggle main menu visibility
SetTerminalNodePolicy_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/base/multidim/utils/FunctionGraphUtilities/terminalNodePolicies/SetTerminalNodePolicy.h
>
44
45
namespace
gum
{
46
47
48
template
<
typename
GUM_ELEMENT >
49
SetTerminalNodePolicy< GUM_ELEMENT >::~SetTerminalNodePolicy
() {
50
clearAllTerminalNodes
();
51
}
52
53
template
<
typename
GUM_ELEMENT >
54
void
SetTerminalNodePolicy< GUM_ELEMENT >::addTerminalNode
(
const
NodeId
& n,
55
const
GUM_ELEMENT& v) {
56
if
(
_map_
.exists(n)) *(
_map_
[n]) += v;
57
_map_
.insert(n,
new
GUM_ELEMENT(v));
58
}
59
60
template
<
typename
GUM_ELEMENT >
61
void
SetTerminalNodePolicy< GUM_ELEMENT >::eraseTerminalNode
(
const
NodeId
& n) {
62
if
(
_map_
.exists(n))
_map_
.erase(n);
63
}
64
65
template
<
typename
GUM_ELEMENT >
66
void
SetTerminalNodePolicy< GUM_ELEMENT >::clearAllTerminalNodes
() {
67
for
(
auto
nodeIter =
_map_
.beginSafe(); nodeIter !=
_map_
.endSafe(); ++nodeIter)
68
delete
nodeIter.val();
69
_map_
.clear();
70
}
71
72
template
<
typename
GUM_ELEMENT >
73
bool
SetTerminalNodePolicy< GUM_ELEMENT >::existsTerminalNodeWithId
(
const
NodeId
& n)
const
{
74
return
_map_
.exists(n);
75
}
76
77
template
<
typename
GUM_ELEMENT >
78
bool
SetTerminalNodePolicy< GUM_ELEMENT >::existsTerminalNodeWithValue
(
79
const
GUM_ELEMENT& v)
const
{
80
return
terminalNodeId
(v) != 0;
81
}
82
83
template
<
typename
GUM_ELEMENT >
84
const
GUM_ELEMENT&
85
SetTerminalNodePolicy< GUM_ELEMENT >::terminalNodeValue
(
const
NodeId
& n)
const
{
86
return
*(
_map_
[n]);
87
}
88
89
template
<
typename
GUM_ELEMENT >
90
const
NodeId
&
SetTerminalNodePolicy< GUM_ELEMENT >::terminalNodeId
(
const
GUM_ELEMENT& v)
const
{
91
for
(
auto
nodeIter =
_map_
.beginSafe(); nodeIter !=
_map_
.endSafe(); ++nodeIter)
92
if
(*(nodeIter.val()) == v)
return
nodeIter.key();
93
return
jocker
;
94
}
95
96
template
<
typename
GUM_ELEMENT >
97
void
SetTerminalNodePolicy< GUM_ELEMENT >::beginValues
()
const
{
98
_mappy_
=
_map_
.cbeginSafe();
99
}
100
101
template
<
typename
GUM_ELEMENT >
102
bool
SetTerminalNodePolicy< GUM_ELEMENT >::hasValue
()
const
{
103
return
_mappy_
!=
_map_
.cendSafe();
104
}
105
106
template
<
typename
GUM_ELEMENT >
107
void
SetTerminalNodePolicy< GUM_ELEMENT >::nextValue
()
const
{
108
++
_mappy_
;
109
}
110
111
template
<
typename
GUM_ELEMENT >
112
const
GUM_ELEMENT&
SetTerminalNodePolicy< GUM_ELEMENT >::value
()
const
{
113
return
*(
_mappy_
.val());
114
}
115
116
template
<
typename
GUM_ELEMENT >
117
const
NodeId
&
SetTerminalNodePolicy< GUM_ELEMENT >::id
()
const
{
118
return
_mappy_
.key();
119
}
120
121
}
// namespace gum
SetTerminalNodePolicy.h
Headers of the ITerminalNodePolicy.
gum::SetTerminalNodePolicy::existsTerminalNodeWithValue
bool existsTerminalNodeWithValue(const GUM_ELEMENT &v) const
Returns true if a terminal node matching this value exists.
Definition
SetTerminalNodePolicy_tpl.h:78
gum::SetTerminalNodePolicy::value
const GUM_ELEMENT & value() const
Returns the value of the current terminal nodes pointed by the constant safe iterator.
Definition
SetTerminalNodePolicy_tpl.h:112
gum::SetTerminalNodePolicy::_mappy_
HashTableConstIteratorSafe< NodeId, GUM_ELEMENT * > _mappy_
The mapping between NodeIds and Value Sets.
Definition
SetTerminalNodePolicy.h:137
gum::SetTerminalNodePolicy::jocker
const NodeId jocker
The mapping between NodeIds and Value Sets.
Definition
SetTerminalNodePolicy.h:139
gum::SetTerminalNodePolicy::addTerminalNode
void addTerminalNode(const NodeId &n, const GUM_ELEMENT &v)
Insert a new terminal node with given value.
Definition
SetTerminalNodePolicy_tpl.h:54
gum::SetTerminalNodePolicy::_map_
HashTable< NodeId, GUM_ELEMENT * > _map_
The mapping between NodeIds and Value Sets.
Definition
SetTerminalNodePolicy.h:136
gum::SetTerminalNodePolicy::hasValue
bool hasValue() const
Indicates if constant safe iterator has reach end of terminal nodes list.
Definition
SetTerminalNodePolicy_tpl.h:102
gum::SetTerminalNodePolicy::clearAllTerminalNodes
void clearAllTerminalNodes()
Erase all terminal nodes.
Definition
SetTerminalNodePolicy_tpl.h:66
gum::SetTerminalNodePolicy::beginValues
void beginValues() const
Initializes the constant safe iterator on terminal nodes.
Definition
SetTerminalNodePolicy_tpl.h:97
gum::SetTerminalNodePolicy::eraseTerminalNode
void eraseTerminalNode(const NodeId &n)
Remove node matching given id.
Definition
SetTerminalNodePolicy_tpl.h:61
gum::SetTerminalNodePolicy< gum::ActionSet >::terminalNodeId
const NodeId & terminalNodeId(const gum::ActionSet &v) const
Definition
SetTerminalNodePolicy_tpl.h:90
gum::SetTerminalNodePolicy::id
const NodeId & id() const
Returns the id of the current terminal nodes pointed by the constant safe iterator.
Definition
SetTerminalNodePolicy_tpl.h:117
gum::SetTerminalNodePolicy::~SetTerminalNodePolicy
~SetTerminalNodePolicy()
Definition
SetTerminalNodePolicy_tpl.h:49
gum::SetTerminalNodePolicy::nextValue
void nextValue() const
Increments the constant safe iterator.
Definition
SetTerminalNodePolicy_tpl.h:107
gum::SetTerminalNodePolicy::terminalNodeValue
const GUM_ELEMENT & terminalNodeValue(const NodeId &n) const
Returns the value of the terminal node that has the given id.
Definition
SetTerminalNodePolicy_tpl.h:85
gum::SetTerminalNodePolicy::existsTerminalNodeWithId
bool existsTerminalNodeWithId(const NodeId &n) const
Returns true if a terminal node matching this id exists.
Definition
SetTerminalNodePolicy_tpl.h:73
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
aGrUM
3.2.0
© PHW&CG&others - 2022
DoXyGeN 1.18.0