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
|
// FastRandomTest.cpp
// Tests the randomness of cFastRandom
#include "Globals.h"
#include "../TestHelpers.h"
#include "FastRandom.h"
static void TestInts(void)
{
cFastRandom rnd;
int sum = 0;
const int BUCKETS = 8;
int Counts[BUCKETS] = {0};
const int ITER = 10000;
for (int i = 0; i < ITER; i++)
{
int v = rnd.RandInt(1000);
TEST_GREATER_THAN_OR_EQUAL(v, 0);
TEST_LESS_THAN_OR_EQUAL(v, 1000);
Counts[v % BUCKETS]++;
sum += v;
}
double avg = static_cast<double>(sum) / ITER;
LOG("avg: %f", avg);
for (int i = 0; i < BUCKETS; i++)
{
LOG(" bucket %d: %d", i, Counts[i]);
}
}
static void TestFloats(void)
{
cFastRandom rnd;
float sum = 0;
const int BUCKETS = 8;
int Counts[BUCKETS] = {0};
const int ITER = 10000;
for (int i = 0; i < ITER; i++)
{
float v = rnd.RandReal(1000.0f);
TEST_GREATER_THAN_OR_EQUAL(v, 0);
TEST_LESS_THAN_OR_EQUAL(v, 1000);
Counts[static_cast<int>(v) % BUCKETS]++;
sum += v;
}
sum = sum / ITER;
LOG("avg: %f", sum);
for (int i = 0; i < BUCKETS; i++)
{
LOG(" bucket %d: %d", i, Counts[i]);
}
}
/** Checks whether re-creating the cFastRandom class produces the same initial number over and over (#2935) */
static void TestReCreation(void)
{
const int ITER = 10000;
int lastVal = 0;
int numSame = 0;
int maxNumSame = 0;
for (int i = 0; i < ITER; ++i)
{
cFastRandom rnd;
int val = rnd.RandInt(9);
if (val == lastVal)
{
numSame += 1;
}
else
{
if (numSame > maxNumSame)
{
maxNumSame = numSame;
}
numSame = 0;
lastVal = val;
}
}
if (numSame > maxNumSame)
{
maxNumSame = numSame;
}
LOG("Out of %d creations, there was a chain of at most %d same numbers generated.", ITER, maxNumSame);
}
IMPLEMENT_TEST_MAIN("FastRandom",
TestInts();
TestFloats();
TestReCreation();
)
|
