aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
internalNode.cpp
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
52
53#define ALLOCATE(x) SmallObjectAllocator::instance().allocate(x)
54#define DEALLOCATE(x, y) SmallObjectAllocator::instance().deallocate(x, y)
55
56namespace gum {
57
58 // ============================================================================
59 // Constructors
60 // ============================================================================
62 GUM_CONSTRUCTOR(InternalNode);
63 _nodeVar_ = nullptr;
64 }
65
67 GUM_CONSTRUCTOR(InternalNode);
68 _setNodeVar_(v);
69 }
70
72 GUM_CONSTRUCTOR(InternalNode);
73 _nodeVar_ = v;
74 _nodeSons_ = sons;
75 }
76
77 // ============================================================================
78 // Destructors
79 // ============================================================================
84
85 // ============================================================================
86 // Allocates a table of nodeid of the size given in parameter
87 // ============================================================================
89 NodeId* sons = static_cast< NodeId* >(ALLOCATE(sizeof(NodeId) * v->domainSize()));
90 for (gum::Idx i = 0; i < v->domainSize(); ++i)
91 sons[i] = 0;
92 return sons;
93 }
94
95 // ============================================================================
96 // Deallocates a NodeSons table
97 // ============================================================================
99 DEALLOCATE(s, sizeof(NodeId) * v->domainSize());
100 }
101
102 // ============================================================================
103 // Node handlers
104 // ============================================================================
107 _nodeVar_ = v;
108 _nodeSons_ = sons;
109 }
110
111 // ============================================================================
112 // Var handlers
113 // ============================================================================
118
123
124 // ============================================================================
125 // Parent handlers
126 // ============================================================================
127 void InternalNode::addParent(NodeId parent, Idx modality) {
128 _nodeParents_.addLink(Parent(parent, modality));
129 }
130
131 void InternalNode::removeParent(NodeId parent, Idx modality) {
132 _nodeParents_.searchAndRemoveLink(Parent(parent, modality));
133 }
134
135} // namespace gum
136
137#ifdef GUM_NO_INLINE
139#endif /* GUM_NO_INLINE */
Base class for discrete random variable.
virtual Size domainSize() const =0
InternalNode()
Default Constructor Creates an empty node with no variable attached.
void setNodeVar(const DiscreteVariable *v)
Set the node variable.
void setNode(const DiscreteVariable *v, NodeId *sons)
Allows you to respecify the node, changing its attached variable as well as its son map.
void _setNodeVar_(const DiscreteVariable *v)
Set the node variable.
NodeId * _nodeSons_
Table of sons of the node.
const DiscreteVariable * _nodeVar_
Variable associated to such node.
void addParent(NodeId parent, Idx modality)
Adds a parent.
~InternalNode()
Class destructors.
static NodeId * allocateNodeSons(const DiscreteVariable *v)
Allocates a table of nodeid of the size given in parameter.
static void deallocateNodeSons(const DiscreteVariable *v, NodeId *s)
Deallocates a NodeSons table.
void removeParent(NodeId parent, Idx modality)
Removes a parent.
LinkedList< Parent > _nodeParents_
The list of the node's parent.
Size Idx
Type for indexes.
Definition types.h:79
Size NodeId
Type for node ids.
#define DEALLOCATE(x, y)
#define ALLOCATE(x)
Headers of the InternalNode class.
Inline implementation of the InternalNode class.
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
Represent a node's parent.