Rand.java

package maximusvladimir.dagen;

import java.awt.Color;
import java.io.Serializable;

public class Rand implements Serializable{
	private static final long serialVersionUID = 1L;
	long localkey = 0L;
	long original = 0L;
	long calculations = 0L;
	private static Rand _self;
	public static Rand getInstance() {
		if (_self == null)
			_self = new Rand();
		return _self;
	}
	public Rand() {
		init(System.currentTimeMillis());
	}
	public Rand(long seed) {
		init(seed);
	}
	public Rand(String key) {
		long start = 10000L;
		for (int v = 0; v < key.length(); v++) {
			char cas = key.charAt(v);
			if (v % 2 == 0) {
				start -= (int)cas;
			}
			else if (v % 3 == 0) {
				start += (int)(cas * v);
			}
			else {
				start -= (cas & v);
			}
		}
		init(start);
	}
	private void init(long key) {
		original = key;
		localkey = (key ^ 0x5DEECE66DL) & ((1L << 48) - 1);;
	}
	public void setSeed(long seed) {
		init(seed);
	}
	public Color nextColor() {
		return new Color(nextInt(255),nextInt(255),nextInt(255));
	}
	public Color nextColor(int targetRed, int targetGreen, int targetBlue, int targetAlpha, int tolerance) {
		int r = nextInt(-tolerance,tolerance)+targetRed;
		int g = nextInt(-tolerance,tolerance)+targetGreen;
		int b = nextInt(-tolerance,tolerance)+targetBlue;
		int a = nextInt(-tolerance,tolerance)+targetAlpha;
		if (r > 255)
			r = 255;
		if (g > 255)
			g = 255;
		if (b > 255)
			b = 255;
		if (a > 255)
			a = 255;
		if (r < 0)
			r = 0;
		if (g < 0)
			g = 0;
		if (b < 0)
			b = 0;
		if (a < 0)
			a = 0;
		return new Color(r,g,b,a);
	}
	public Color nextColor(int targetRed, int targetGreen, int targetBlue, int tolerance) {
		int r = nextInt(-tolerance,tolerance)+targetRed;
		int g = nextInt(-tolerance,tolerance)+targetGreen;
		int b = nextInt(-tolerance,tolerance)+targetBlue;
		if (r > 255)
			r = 255;
		if (g > 255)
			g = 255;
		if (b > 255)
			b = 255;
		if (r < 0)
			r = 0;
		if (g < 0)
			g = 0;
		if (b < 0)
			b = 0;
		return new Color(r,g,b);
	}
	public long getSeed() {
		return original;
	}
	private int getNextBit(int bits) {
		localkey = (localkey * 0x5DEECE66DL + 0xBL) & ((1L << 48) - 1);
		return (int) (localkey >>> (48 - bits));
	}
	public short nextShort() {
		calculations++;
		return (short)getNextBit(16);
	}
	public short nextShort(short min, short max) {
		return (short)nextInt((short)min,(short)max);
	}
	public short nextShort(short max) {
		return nextShort((short)0,max);
	}
	
	public byte nextByte() {
		calculations++;
		return (byte)getNextBit(8);
	}
	public String nextString() {
		int length = nextInt(5,25);
		String s = "";
		for (int c = 0; c < length; c++) {
			s += alphabet.charAt(nextInt(alphabet.length()));
			calculations--;
		}
		return s;
	}
	public String nextString(int maxlength) {
		int length = nextInt(5,maxlength);
		String s = "";
		for (int c = 0; c < length; c++) {
			s += alphabet.charAt(nextInt(alphabet.length()));
			calculations--;
		}
		return s;
	}
	public String nextString(int minlength, int maxlength) {
		if (minlength >= maxlength) {
			throw new IllegalArgumentException("Lengths are not proper. Minlength may be larger than Maxlength.");
		}
		int length = nextInt(minlength,maxlength);
		String s = "";
		for (int c = 0; c < length; c++) {
			s += alphabet.charAt(nextInt(alphabet.length()));
			calculations--;
		}
		return s;
	}
	private static final String alphabet = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
	public int nextInt() {
		calculations++;
		return getNextBit(32);
	}
	public int nextInt(int n) {
	     if (n<=0)
			throw new IllegalArgumentException("n must be positive");
	     
	     calculations++;
	     
	     if ((n & -n) == n)
	         return (int)((n * (long)getNextBit(31)) >> 31);

	     int bits, val;
	     do {
	         bits = getNextBit(31);
	         val = bits % n;
	     }
	     while(bits - val + (n-1) < 0);
	     return val;
	 }
	public double nextDouble() {
		calculations++;
		return (((long)getNextBit(26) << 27) + getNextBit(27)) / (double)(1L << 53);
	}
	public boolean nextBoolean() {
		calculations++;
		return getNextBit(1) != 0;
	}
	public long nextLong() {
		calculations++;
		return ((long)getNextBit(32) << 32) + getNextBit(32);
	}
	public float nextFloat() {
		return (float)nextDouble();
	}
	public int nextInt(int min, int max) {
		return nextInt(max-min)+min;
	}
	public double nextDouble(double min, double max) {
		double sample = nextDouble();
		if (min < 1.0 && max < 1.0) {
			double st =((double)nextInt((int)(min*1000000),(int)(max*1000000)))/1000000;
			sample = 0;
			sample = st;
		}
		else
			sample += (double)nextInt((int)(min),(int)(max));
		//sample *= (max+min);
		//sample -= min;
		calculations--;
		return sample;
	}
	public byte nextByte(byte min, byte max) {
		return (byte)nextInt(min,max);
	}
	public void fillArray(double[] array, double min, double max) {
		if (array == null) 
			return;
		for (int c = 0; c < array.length; c++) {
			array[c] = nextDouble(min,max);
		}
	}
	public void fillArray(short[] array, int min, int max) {
		if (array == null) 
			return;
		for (int c = 0; c < array.length; c++) {
			array[c] = nextShort((short)min,(short)max);
		}
	}
	public void fillArray(byte[] array, byte min, byte max) {
		if (array == null) 
			return;
		for (int c = 0; c < array.length; c++) {
			array[c] = nextByte(min,max);
		}
	}
	public void fillArray(int[] array, int min, int max) {
		if (array == null) 
			return;
		for (int c = 0; c < array.length; c++) {
			array[c] = nextInt(min,max);
		}
	}
	public void fillArray(float[] array, float min, float max) {
		if (array == null) 
			return;
		for (int c = 0; c < array.length; c++) {
			array[c] = nextFloat(min,max);
		}
	}
	public float nextFloat(float min, float max) {
		return (float)nextDouble(min,max);
	}
	public long getNumCalculated() {
		return calculations;
	}
}