Repository navigation
Expand file tree
/
Copy pathMain.c
More file actions
104 lines (82 loc) · 2.82 KB
/
Copy pathMain.c
File metadata and controls
104 lines (82 loc) · 2.82 KB
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
#include <stdio.h>
#include <time.h>
#include "Super.h"
/*
This is free and unencumbered software released into the public domain.
Anyone is free to copy, modify, publish, use, compile, sell, or
distribute this software, either in source code form or as a compiled
binary, for any purpose, commercial or non-commercial, and by any
means.
In jurisdictions that recognize copyright laws, the author or authors
of this software dedicate any and all copyright interest in the
software to the public domain. We make this dedication for the benefit
of the public at large and to the detriment of our heirs and
successors. We intend this dedication to be an overt act of
relinquishment in perpetuity of all present and future rights to this
software under copyright law.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
For more information, please refer to <http://unlicense.org/>
*/
#ifndef NDEBUG
static void check(union Super *a) {
// Check the header for the expected values and bounds of each call
for(uint64_t i = 1; i < 1000; i++) {
const uint64_t n = Super_Range(a, i);
assert(n < i);
}
for(int i = 0; i < 10000; i++) {
uint64_t n = Super_Between(a, 10, 1000);
assert(n >= 10 && n < 1000);
}
for(int i = 0; i < 1000; i++) {
double n = Super_Uniform(a);
assert(n >= 0.0 && n <= 1.0);
}
for(int i = 0; i < 1000; i++) {
float n = Super_Uniformf(a);
assert(n >= 0.0f && n <= 1.0f);
}
for(int i = 0; i < 1000; i++) {
double n = Super_Gaussian(a);
assert(n >= -6.0 && n <= 6.0);
}
for(int i = 0; i < 1000; i++) {
float n = Super_Gaussianf(a);
assert(n >= -6.0f && n <= 6.0f);
}
// Random array test
uint8_t temp[31];
const int size = sizeof(temp);
for(size_t i = 0; i < size; i++) {
temp[i] = 0;
}
Super_Copy(a, temp, size);
uint8_t freq = 0;
for(size_t i = 0; i < size; i++) {
if(temp[i] == 0x00) {
freq++;
}
}
assert(freq <= 2); // More than two zeroes could happen, but would be very rare
}
#endif
int main(void) {
union Super a;
a.seed = 1;
Super(&a); // Needed when the seed has a low number value (such as above)
assert(Super(&a) == 0xC56596C6E3EA6717); // Correctness check, known good value (when seed = 1)
// a.seed = (__uint128_t) time(NULL); // An "okay" source of randomness
// Super(&a);
for(int i = 0; i < 10; i++) {
printf("%08X\n", (int) Super(&a));
}
#ifndef NDEBUG
check(&a);
#endif
}