aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
ExactTerminalNodePolicy.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_EXACT_TERMINAL_NODE_POLICY_H
51#define GUM_MULTI_DIM_FUNCTION_GRAPH_EXACT_TERMINAL_NODE_POLICY_H
52
55
56namespace gum {
57
58 // clang-format off
67 // clang-format on
68
69 template < typename GUM_SCALAR >
70 class ExactTerminalNodePolicy: public ITerminalNodePolicy< GUM_SCALAR > {
71 public:
72 // ============================================================================
74 // ============================================================================
76
78 void addTerminalNode(const NodeId& n, const GUM_SCALAR& v) { _map_.insert(n, v); }
79
81 void eraseTerminalNode(const NodeId& n) { _map_.eraseFirst(n); }
82
84 void clearAllTerminalNodes() { _map_.clear(); }
85
87 // ============================================================================
89 // ============================================================================
91
93 bool existsTerminalNodeWithId(const NodeId& n) const { return _map_.existsFirst(n); }
94
96 bool existsTerminalNodeWithValue(const GUM_SCALAR& v) const { return _map_.existsSecond(v); }
97
99 // ============================================================================
101 // ============================================================================
103
105 const GUM_SCALAR& terminalNodeValue(const NodeId& n) const { return _map_.second(n); }
106
108 const NodeId& terminalNodeId(const GUM_SCALAR& v) const { return _map_.first(v); }
109
111 // ============================================================================
113 // ============================================================================
115
117 void beginValues() const { _mappy_ = _map_.beginSafe(); }
118
120 bool hasValue() const { return _mappy_ != _map_.endSafe(); }
121
123 void nextValue() const { ++_mappy_; }
124
127 const GUM_SCALAR& value() const { return _mappy_.second(); }
128
131 const NodeId& id() const { return _mappy_.first(); }
132
134
135 private:
138 };
139
140} // End of namespace gum
141
142#endif /* GUM_MULTI_DIM_FUNCTION_GRAPH_EXACT_TERMINAL_NODE_POLICY_H */
Headers of the ITerminalNodePolicy.
Set of pairs of elements with fast search for both elements.
Implementation of a Terminal Node Policy that maps nodeid directly to value.
void eraseTerminalNode(const NodeId &n)
Remove node matching given id.
const GUM_SCALAR & terminalNodeValue(const NodeId &n) const
Returns the value of the terminal node that has the given id.
void addTerminalNode(const NodeId &n, const GUM_SCALAR &v)
Insert a new terminal node with given value.
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.
void beginValues() const
Initializes the constant safe iterator on terminal nodes.
bool existsTerminalNodeWithValue(const GUM_SCALAR &v) const
Returns true if a terminal node matching this value exists.
BijectionIteratorSafe< NodeId, GUM_SCALAR > _mappy_
const NodeId & terminalNodeId(const GUM_SCALAR &v) const
Returns the id of the terminal node that has the given value.
bool hasValue() const
Indicates if constant safe iterator has reach end of terminal nodes list.
Bijection< NodeId, GUM_SCALAR > _map_
const GUM_SCALAR & value() const
Returns the value of the current terminal nodes pointed by the constant safe iterator.
void clearAllTerminalNodes()
Erase all terminal nodes.
bool existsTerminalNodeWithId(const NodeId &n) const
Returns true if a terminal node matching this id exists.
Interface specifying the methods to be implemented by any TerminalNodePolicy.
Size NodeId
Type for node ids.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46