aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
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
44
45namespace gum {
46
47
48 template < typename GUM_ELEMENT >
52
53 template < typename GUM_ELEMENT >
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 >
62 if (_map_.exists(n)) _map_.erase(n);
63 }
64
65 template < typename GUM_ELEMENT >
67 for (auto nodeIter = _map_.beginSafe(); nodeIter != _map_.endSafe(); ++nodeIter)
68 delete nodeIter.val();
69 _map_.clear();
70 }
72 template < typename GUM_ELEMENT >
74 return _map_.exists(n);
75 }
76
77 template < typename GUM_ELEMENT >
79 const GUM_ELEMENT& v) const {
80 return terminalNodeId(v) != 0;
81 }
83 template < typename GUM_ELEMENT >
84 const GUM_ELEMENT&
86 return *(_map_[n]);
87 }
88
89 template < typename GUM_ELEMENT >
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 >
98 _mappy_ = _map_.cbeginSafe();
99 }
100
101 template < typename GUM_ELEMENT >
103 return _mappy_ != _map_.cendSafe();
104 }
105
106 template < typename GUM_ELEMENT >
110
111 template < typename GUM_ELEMENT >
113 return *(_mappy_.val());
114 }
115
116 template < typename GUM_ELEMENT >
118 return _mappy_.key();
119 }
120
121} // namespace gum
Headers of the ITerminalNodePolicy.
bool existsTerminalNodeWithValue(const GUM_ELEMENT &v) const
Returns true if a terminal node matching this value exists.
const GUM_ELEMENT & value() const
Returns the value of the current terminal nodes pointed by the constant safe iterator.
HashTableConstIteratorSafe< NodeId, GUM_ELEMENT * > _mappy_
The mapping between NodeIds and Value Sets.
const NodeId jocker
The mapping between NodeIds and Value Sets.
void addTerminalNode(const NodeId &n, const GUM_ELEMENT &v)
Insert a new terminal node with given value.
HashTable< NodeId, GUM_ELEMENT * > _map_
The mapping between NodeIds and Value Sets.
bool hasValue() const
Indicates if constant safe iterator has reach end of terminal nodes list.
void clearAllTerminalNodes()
Erase all terminal nodes.
void beginValues() const
Initializes the constant safe iterator on terminal nodes.
void eraseTerminalNode(const NodeId &n)
Remove node matching given id.
const NodeId & terminalNodeId(const gum::ActionSet &v) const
const NodeId & id() const
Returns the id of the current terminal nodes pointed by the constant safe iterator.
void nextValue() const
Increments the constant safe iterator.
const GUM_ELEMENT & terminalNodeValue(const NodeId &n) const
Returns the value of the terminal node that has the given id.
bool existsTerminalNodeWithId(const NodeId &n) const
Returns true if a terminal node matching this id exists.
Size NodeId
Type for node ids.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46