aGrUM
0.20.3
a C++ library for (probabilistic) graphical models
simpleUTGenerator.cpp
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 Source implementation of SimpleUTGenerator.
24
*
25
* @author Pierre-Henri WUILLEMIN(@LIP6) and Jean-Christophe MAGNAN and Christophe
26
* GONZALES(@AMU)
27
*
28
*/
29
#
include
<
agrum
/
ID
/
generator
/
simpleUTGenerator
.
h
>
30
31
namespace
gum
{
32
33
// Default constructor.
34
SimpleUTGenerator
::
SimpleUTGenerator
() {
35
GUM_CONSTRUCTOR
(
SimpleUTGenerator
);
36
;
37
}
38
39
// Destructor.
40
SimpleUTGenerator
::~
SimpleUTGenerator
() {
41
GUM_DESTRUCTOR
(
SimpleUTGenerator
);
42
;
43
}
44
45
// Generates a UT using floats.
46
// @param varID The variable id of the UT owner.
47
// @param ut A reference on the UT to fill.
48
void
SimpleUTGenerator
::
generateUT
(
const
Idx
&
varId
,
const
Potential
<
float
>&
ut
) {
49
std
::
vector
<
float
>
v
;
50
51
for
(
Size
i
= 0;
i
<
ut
.
domainSize
(); ++
i
)
52
v
.
push_back
((
float
)
rand
() * 1000);
53
54
ut
.
populate
(
v
);
55
}
56
57
// Generates a UT using doubles.
58
// @param varID The variable id of the UT owner.
59
// @param ut A reference on the UT to fill.
60
void
SimpleUTGenerator
::
generateUT
(
const
Idx
&
varId
,
const
Potential
<
double
>&
ut
) {
61
std
::
vector
<
double
>
v
;
62
63
for
(
Size
i
= 0;
i
<
ut
.
domainSize
(); ++
i
)
64
v
.
push_back
((
double
)
rand
() * 1000);
65
66
ut
.
populate
(
v
);
67
}
68
69
}
/* namespace gum */
gum::Set::emplace
INLINE void emplace(Args &&... args)
Definition:
set_tpl.h:643