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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
/*
* DSI utilities
*
* Copyright (C) 2013-2022 Sebastiano Vigna
*
* This program and the accompanying materials are made available under the
* terms of the GNU Lesser General Public License v2.1 or later,
* which is available at
* http://www.gnu.org/licenses/old-licenses/lgpl-2.1-standalone.html,
* or the Apache Software License 2.0, which is available at
* https://www.apache.org/licenses/LICENSE-2.0.
*
* 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.
*
* SPDX-License-Identifier: LGPL-2.1-or-later OR Apache-2.0
*/
package it.unimi.dsi.util;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertTrue;
import org.junit.Test;
public class XorShift1024StarPhiRandomGeneratorTest {
private final static long seeds[] = { 0, 1, 1024, 0x5555555555555555L };
@Test
public void testNextFloat() {
for (final long seed : seeds) {
final XorShift1024StarPhiRandomGenerator xorShift = new XorShift1024StarPhiRandomGenerator(seed);
double avg = 0;
for (int i = 1000000; i-- != 0;) {
final float d = xorShift.nextFloat();
assertTrue(d < 1);
assertTrue(d >= 0);
avg += d;
}
assertEquals(500000, avg, 500);
}
}
@Test
public void testNextDouble() {
for (final long seed : seeds) {
final XorShift1024StarPhiRandomGenerator xorShift = new XorShift1024StarPhiRandomGenerator(seed);
double avg = 0;
for (int i = 1000000; i-- != 0;) {
final double d = xorShift.nextDouble();
assertTrue(d < 1);
assertTrue(d >= 0);
avg += d;
}
assertEquals(500000, avg, 500);
}
}
@Test
public void testNextDoubleFast() {
for (final long seed : seeds) {
final XorShift1024StarPhiRandomGenerator xorShift = new XorShift1024StarPhiRandomGenerator(seed);
double avg = 0;
for (int i = 1000000; i-- != 0;) {
final double d = xorShift.nextDoubleFast();
assertTrue(d < 1);
assertTrue(d >= 0);
avg += d;
}
assertEquals(500000, avg, 500);
}
}
@Test
public void testNextInt() {
for (final long seed : seeds) {
final XorShift1024StarPhiRandomGenerator xorShift = new XorShift1024StarPhiRandomGenerator(seed);
double avg = 0;
for (int i = 100000000; i-- != 0;) {
final int d = xorShift.nextInt(101);
assertTrue(d <= 100);
assertTrue(d >= 0);
avg += d;
}
assertEquals(5000000000L, avg, 600000);
}
}
@Test
public void testNextInt2() {
for (final long seed : seeds) {
final XorShift1024StarPhiRandomGenerator xorShift = new XorShift1024StarPhiRandomGenerator(seed);
final int[] count = new int[32];
long change = 0;
int prev = 0;
for (int i = 1000000; i-- != 0;) {
final int d = xorShift.nextInt();
change += Long.bitCount(d ^ prev);
for (int b = 32; b-- != 0;)
if ((d & (1 << b)) != 0) count[b]++;
prev = d;
}
assertEquals(32 * 1000000L, change, 60000);
for (int b = 32; b-- != 0;) assertEquals(500000, count[b], 1600);
}
}
@Test
public void testNextInt3() {
final XorShift1024StarPhiRandomGenerator xorShiftRandom = new XorShift1024StarPhiRandomGenerator(0);
for(int i = 0; i < 100; i++) assertTrue(xorShiftRandom.nextInt(16) < 16);
}
@Test
public void testNextInt4() {
final XorShift1024StarPhiRandomGenerator xorShift = new XorShift1024StarPhiRandomGenerator(0);
assertEquals(0, xorShift.nextInt(1));
}
@Test
public void testNextLong() {
for (final long seed : seeds) {
final XorShift1024StarPhiRandomGenerator xorShift = new XorShift1024StarPhiRandomGenerator(seed);
final int[] count = new int[64];
long change = 0;
long prev = 0;
for (int i = 1000000; i-- != 0;) {
final long d = xorShift.nextLong();
change += Long.bitCount(d ^ prev);
for (int b = 64; b-- != 0;)
if ((d & (1L << b)) != 0) count[b]++;
prev = d;
}
assertEquals(32 * 1000000L, change, 10000);
for (int b = 64; b-- != 0;) assertEquals(500000, count[b], 1800);
}
}
@Test
public void testSameAsRandom() {
final XorShift1024StarPhiRandom xorShiftStarRandom = new XorShift1024StarPhiRandom(0);
final XorShift1024StarPhiRandomGenerator xorShiftStar = new XorShift1024StarPhiRandomGenerator(0);
for(int i = 1000000; i-- != 0;) {
assertEquals(xorShiftStar.nextLong(), xorShiftStarRandom.nextLong());
assertEquals(0, xorShiftStar.nextDouble(), xorShiftStarRandom.nextDouble());
assertEquals(xorShiftStar.nextInt(), xorShiftStarRandom.nextInt());
assertEquals(xorShiftStar.nextInt(99), xorShiftStarRandom.nextInt(99));
assertEquals(xorShiftStar.nextInt(128), xorShiftStarRandom.nextInt(128));
}
}
@Test
public void testJump() {
final XorShift1024StarPhiRandomGenerator xorShiftRandom0 = new XorShift1024StarPhiRandomGenerator(0), xorShiftRandom1 = new XorShift1024StarPhiRandomGenerator(0);
xorShiftRandom0.nextLong();
xorShiftRandom0.jump();
xorShiftRandom1.jump();
xorShiftRandom1.nextLong();
assertEquals(xorShiftRandom0.nextLong(), xorShiftRandom1.nextLong());
}
}
|
