test.it.unimi.dsi.util.XorShift1024StarRandomGeneratorTest Maven / Gradle / Ivy
package it.unimi.dsi.util;
/*
* DSI utilities
*
* Copyright (C) 2013-2017 Sebastiano Vigna
*
* This library is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by the Free
* Software Foundation; either version 3 of the License, or (at your option)
* any later version.
*
* This library 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 Lesser General Public License
* for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, see .
*
*/
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertTrue;
import org.junit.Test;
@Deprecated
public class XorShift1024StarRandomGeneratorTest {
private final static long seeds[] = { 0, 1, 1024, 0x5555555555555555L };
@Test
public void testNextFloat() {
for (long seed : seeds) {
XorShift1024StarRandomGenerator xorShift = new XorShift1024StarRandomGenerator(seed);
double avg = 0;
for (int i = 1000000; i-- != 0;) {
float d = xorShift.nextFloat();
assertTrue(d < 1);
assertTrue(d >= 0);
avg += d;
}
assertEquals(500000, avg, 500);
}
}
@Test
public void testNextDouble() {
for (long seed : seeds) {
XorShift1024StarRandomGenerator xorShift = new XorShift1024StarRandomGenerator(seed);
double avg = 0;
for (int i = 1000000; i-- != 0;) {
double d = xorShift.nextDouble();
assertTrue(d < 1);
assertTrue(d >= 0);
avg += d;
}
assertEquals(500000, avg, 500);
}
}
@Test
public void testNextInt() {
for (long seed : seeds) {
XorShift1024StarRandomGenerator xorShift = new XorShift1024StarRandomGenerator(seed);
double avg = 0;
for (int i = 100000000; i-- != 0;) {
int d = xorShift.nextInt(101);
assertTrue(d <= 100);
assertTrue(d >= 0);
avg += d;
}
assertEquals(5000000000L, avg, 500000);
}
}
@Test
public void testNextInt2() {
for (long seed : seeds) {
XorShift1024StarRandomGenerator xorShift = new XorShift1024StarRandomGenerator(seed);
final int[] count = new int[32];
long change = 0;
int prev = 0;
for (int i = 1000000; i-- != 0;) {
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 testNextLong() {
for (long seed : seeds) {
XorShift1024StarRandomGenerator xorShift = new XorShift1024StarRandomGenerator(seed);
final int[] count = new int[64];
long change = 0;
long prev = 0;
for (int i = 1000000; i-- != 0;) {
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() {
XorShift1024StarRandom xorShiftStarRandom = new XorShift1024StarRandom(0);
XorShift1024StarRandomGenerator xorShiftStar = new XorShift1024StarRandomGenerator(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() {
XorShift1024StarRandomGenerator xorShiftRandom0 = new XorShift1024StarRandomGenerator(0), xorShiftRandom1 = new XorShift1024StarRandomGenerator(0);
xorShiftRandom0.nextLong();
xorShiftRandom0.jump();
xorShiftRandom1.jump();
xorShiftRandom1.nextLong();
assertEquals(xorShiftRandom0.nextLong(), xorShiftRandom1.nextLong());
}
}