aGrUM
0.21.0
a C++ library for (probabilistic) graphical models
nodeGraphPart_tpl.h
Go to the documentation of this file.
1
/**
2
*
3
* Copyright (c) 2005-2021 by Pierre-Henri WUILLEMIN(@LIP6) & Christophe GONZALES(@AMU)
4
* info_at_agrum_dot_org
5
*
6
* This library is free software: you can redistribute it and/or modify
7
* it under the terms of the GNU Lesser General Public License as published by
8
* the Free Software Foundation, either version 3 of the License, or
9
* (at your option) any later version.
10
*
11
* This library is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU Lesser General Public License for more details.
15
*
16
* You should have received a copy of the GNU Lesser General Public License
17
* along with this library. If not, see <http://www.gnu.org/licenses/>.
18
*
19
*/
20
21
22
/** @file
23
* @brief Implementation of the NodeGraphPart
24
*
25
* @author Christophe GONZALES(@AMU) and Pierre-Henri WUILLEMIN(@LIP6)
26
*/
27
28
#
ifndef
DOXYGEN_SHOULD_SKIP_THIS
29
30
// to ease parsing by IDE
31
#
include
<
agrum
/
tools
/
graphs
/
parts
/
nodeGraphPart
.
h
>
32
33
namespace
gum
{
34
35
template
<
typename
VAL >
36
INLINE NodeProperty<
VAL
>
NodeGraphPart
::
nodesProperty
(
VAL
(*
f
)(
const
NodeId
&),
37
Size
size
)
const
{
38
return
asNodeSet
().
hashMap
(
f
,
size
);
39
}
40
41
template
<
typename
VAL
>
42
INLINE
NodeProperty
<
VAL
>
NodeGraphPart
::
nodesProperty
(
const
VAL
&
val
,
Size
size
)
const
{
43
return
asNodeSet
().
hashMap
(
val
,
size
);
44
}
45
46
template
<
typename
VAL >
47
INLINE List<
VAL
>
NodeGraphPart
::
listMapNodes
(
VAL
(*
f
)(
const
NodeId
&))
const
{
48
return
asNodeSet
().
listMap
(
f
);
49
}
50
51
template
<
typename
T
>
52
void
NodeGraphPart
::
populateNodesFromProperty
(
const
NodeProperty
<
T
>&
h
) {
53
clear
();
54
55
for
(
const
auto
iter
=
h
.
begin
();
iter
!=
h
.
end
(); ++
iter
) {
56
NodeId
new_one
=
iter
.
key
();
57
58
if
(
existsNode
(
new_one
)) {
59
GUM_ERROR
(
DuplicateElement
,
new_one
<<
" already exists in the graph"
)
60
}
61
62
addNodeWithId
(
new_one
);
63
}
64
}
65
66
}
/* namespace gum */
67
68
#
endif
// DOXYGEN_SHOULD_SKIP_THIS
gum::Set::emplace
INLINE void emplace(Args &&... args)
Definition:
set_tpl.h:643