-
Notifications
You must be signed in to change notification settings - Fork 0
/
rng_test.cpp
111 lines (102 loc) · 4.41 KB
/
rng_test.cpp
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
//---------------------------------------------------------------------------
/*
RosindellEtAl2008, refactoring an extension of Rosindel at al., 2008 [1]
Copyright (C) 2015 Richel Bilderbeek
Original version by James Rosindell
This program 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.
This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*/
//---------------------------------------------------------------------------
//From http://www.richelbilderbeek.nl/ToolRosindellEtAl2008.htm
//
//Article with original code:
//
// [1] Rosindell, James, Yan Wong, and Rampal S. Etienne.
// "A coalescence approach to spatial neutral ecology."
// Ecological Informatics 3.3 (2008): 259-271.
//---------------------------------------------------------------------------
#ifndef NDEBUG
#include "rng.h"
#include <algorithm>
#include <cassert>
#include <iostream>
#include "testtimer.h"
void Rng::Test() noexcept
{
{
static bool is_tested{false};
if (is_tested) return;
is_tested = true;
}
const ribi::TestTimer test_timer(__func__,__FILE__,1.0);
Rng a(0,Type::rosindell);
Rng b(0,Type::bilderbeek);
//GetRandomInt
{
//Should have same minimum, maximum and mean
std::vector<int> v;
std::vector<int> w;
const int min{0};
const int max{10};
const int n{1000};
const double mean{static_cast<double>(min + max) / 2.0};
for (int i=0; i!=n; ++i)
{
v.emplace_back(a.GetRandomInt(max));
w.emplace_back(b.GetRandomInt(max));
}
const int sum_a{std::accumulate(std::begin(v),std::end(v),0)};
const int sum_b{std::accumulate(std::begin(w),std::end(w),0)};
const int min_a{*std::min_element(std::begin(v),std::end(v))};
const int min_b{*std::min_element(std::begin(w),std::end(w))};
const int max_a{*std::max_element(std::begin(v),std::end(v))};
const int max_b{*std::max_element(std::begin(w),std::end(w))};
const double mean_a{static_cast<double>(sum_a)/static_cast<double>(n)};
const double mean_b{static_cast<double>(sum_b)/static_cast<double>(n)};
assert(std::abs(mean_a - mean) < 0.11);