1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration |
\\ / A nd | Copyright (C) 2012-2013 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
Application
Test-BinSum
Description
Test BinSum container
\*---------------------------------------------------------------------------*/
#include "List.H"
#include "BinSum.H"
#include "IOstreams.H"
#include "Random.H"
#include "scalarField.H"
using namespace Foam;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
int main(int argc, char *argv[])
{
Random rndGen(0);
scalarField samples(10000000);
forAll(samples, i)
{
samples[i] = rndGen.scalar01();
}
const scalar min = 0;
const scalar max = 1;
const scalar delta = 0.1;
BinSum<scalar, scalarField> count(min, max, delta);
BinSum<scalar, scalarField> sum(min, max, delta);
forAll(samples, i)
{
count.add(samples[i], 1);
sum.add(samples[i], samples[i]);
}
Info<< "sum : " << sum << endl;
Info<< "count : " << count << endl;
Info<< "average: " << sum/count << endl;
Info<< "End\n" << endl;
return 0;
}
// ************************************************************************* //
|
