aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
SetTerminalNodePolicy.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
41
50#ifndef GUM_MULTI_DIM_FUNCTION_GRAPH_SET_TERMINAL_NODE_POLICY_H
51#define GUM_MULTI_DIM_FUNCTION_GRAPH_SET_TERMINAL_NODE_POLICY_H
52
54
55namespace gum {
56
57 // clang-format off
66 // clang-format on
67
68 template < typename GUM_SCALAR >
70 public:
72
73 // ============================================================================
75 // ============================================================================
77
79 void addTerminalNode(const NodeId& n, const GUM_SCALAR& v) {
80 if (_map_.exists(n)) *(_map_[n]) += v;
81 _map_.insert(n, new GUM_SCALAR(v));
82 }
83
85 void eraseTerminalNode(const NodeId& n) {
86 if (_map_.exists(n)) _map_.erase(n);
87 }
88
91 for (auto nodeIter = _map_.beginSafe(); nodeIter != _map_.endSafe(); ++nodeIter)
92 delete nodeIter.val();
93 _map_.clear();
94 }
95
97 // ============================================================================
99 // ============================================================================
101
103 bool existsTerminalNodeWithId(const NodeId& n) const { return _map_.exists(n); }
104
106 bool existsTerminalNodeWithValue(const GUM_SCALAR& v) const { return terminalNodeId(v) != 0; }
107
109 // ============================================================================
111 // ============================================================================
113
115 const GUM_SCALAR& terminalNodeValue(const NodeId& n) const { return *(_map_[n]); }
116
118 const NodeId& terminalNodeId(const GUM_SCALAR& v) const {
119 for (auto nodeIter = _map_.beginSafe(); nodeIter != _map_.endSafe(); ++nodeIter)
120 if (*(nodeIter.val()) == v) return nodeIter.key();
121 return jocker;
122 }
123
125 // ============================================================================
127 // ============================================================================
129
131 void beginValues() const { _mappy_ = _map_.cbeginSafe(); }
132
134 bool hasValue() const { return _mappy_ != _map_.cendSafe(); }
135
137 void nextValue() const { ++_mappy_; }
138
141 const GUM_SCALAR& value() const { return *(_mappy_.val()); }
142
145 const NodeId& id() const { return _mappy_.key(); }
146
147 private:
151
152 const NodeId jocker = 0;
153 };
154
155} // End of namespace gum
156
157#endif /* GUM_MULTI_DIM_FUNCTION_GRAPH_SET_TERMINAL_NODE_POLICY_H */
Safe Const Iterators for hashtables.
Definition hashTable.h:1602
The class for generic Hash Tables.
Definition hashTable.h:637
Implementation of a Terminal Node Policy that maps nodeid to a set of value.
void clearAllTerminalNodes()
Erase all terminal nodes.
void addTerminalNode(const NodeId &n, const GUM_SCALAR &v)
Insert a new terminal node with given value.
const GUM_SCALAR & terminalNodeValue(const NodeId &n) const
Returns the value of the terminal node that has the given id.
const NodeId & id() const
Returns the id of the current terminal nodes pointed by the constant safe iterator.
HashTable< NodeId, GUM_SCALAR * > _map_
The mapping between NodeIds and Value Sets.
void eraseTerminalNode(const NodeId &n)
Remove node matching given id.
void beginValues() const
Initializes the constant safe iterator on terminal nodes.
HashTableConstIteratorSafe< NodeId, GUM_SCALAR * > _mappy_
The mapping between NodeIds and Value Sets.
const NodeId & terminalNodeId(const GUM_SCALAR &v) const
Returns the id of the terminal node that has the given value.
bool existsTerminalNodeWithValue(const GUM_SCALAR &v) const
Returns true if a terminal node matching this value exists.
const NodeId jocker
The mapping between NodeIds and Value Sets.
bool existsTerminalNodeWithId(const NodeId &n) const
Returns true if a terminal node matching this id exists.
const GUM_SCALAR & value() const
Returns the value of the current terminal nodes pointed by the constant safe iterator.
void nextValue() const
Increments the constant safe iterator.
bool hasValue() const
Indicates if constant safe iterator has reach end of terminal nodes list.
Size NodeId
Type for node ids.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
Base node set class for graphs.