All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.jqwik.engine.SourceOfRandomness Maven / Gradle / Ivy

The newest version!
package net.jqwik.engine;

import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;

import net.jqwik.api.*;

public class SourceOfRandomness {

	private SourceOfRandomness() {
	}

	private static final Supplier RNG = ThreadLocalRandom::current;

	private static final ThreadLocal current = ThreadLocal.withInitial(SourceOfRandomness::newRandom);

	public static String createRandomSeed() {
		return Long.toString(RNG.get().nextLong());
	}

	public static Random create(String seed) {
		try {
			Random random = newRandom(Long.parseLong(seed));
			current.set(random);
			return random;
		} catch (NumberFormatException nfe) {
			throw new JqwikException(String.format("[%s] is not a valid random seed.", seed));
		}
	}

	public static Random newRandom() {
		return new XORShiftRandom();
	}

	public static Random newRandom(final long seed) {
		return new XORShiftRandom(seed);
	}

	public static Random current() {
		return current.get();
	}

	/**
	 * A faster but not thread safe implementation of {@linkplain java.util.Random}.
	 * It also has a period of 2^n - 1 and better statistical randomness.
	 *
	 * See for details: https://www.javamex.com/tutorials/random_numbers/xorshift.shtml
	 *
	 * 

* For further performance improvements within jqwik, consider to override: *

    *
  • nextDouble()
  • *
  • nextBytes(int)
  • *
*/ private static class XORShiftRandom extends Random { private long seed; private XORShiftRandom() { this(System.nanoTime()); } private XORShiftRandom(long seed) { this.seed = mix64(seed); if (this.seed == 0) { // 0 is invalid for XorShift seed, so we set it to a non-zero value this.seed = 0xbf58476d1ce4e5b9L; } } /** * See Better Bit Mixing - Improving on MurmurHash3's 64-bit Finalizer */ private static long mix64(long z) { z = (z ^ (z >>> 30)) * 0xbf58476d1ce4e5b9L; z = (z ^ (z >>> 27)) * 0x94d049bb133111ebL; return z ^ (z >>> 31); } @Override protected int next(int nbits) { long x = nextLong(); x &= ((1L << nbits) - 1); return (int) x; } /** * Will never generate 0L */ @Override public long nextLong() { long x = this.seed; x ^= (x << 21); x ^= (x >>> 35); x ^= (x << 4); this.seed = x; return x; } } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy