#if NET_2_0 /* Copyright (c) 2003-2006 Niels Kokholm and Peter Sestoft Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. 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 OR COPYRIGHT HOLDERS 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. */ using System; using System.Diagnostics; using SCG = System.Collections.Generic; namespace C5 { /// /// A modern random number generator based on G. Marsaglia: /// Seeds for Random Number Generators, Communications of the /// ACM 46, 5 (May 2003) 90-93; and a posting by Marsaglia to /// comp.lang.c on 2003-04-03. /// public class C5Random : Random { private uint[] Q = new uint[16]; private uint c = 362436, i = 15; private uint Cmwc() { ulong t, a = 487198574UL; uint x, r = 0xfffffffe; i = (i + 1) & 15; t = a * Q[i] + c; c = (uint)(t >> 32); x = (uint)(t + c); if (x < c) { x++; c++; } return Q[i] = r - x; } /// /// Get a new random System.Double value /// /// The random double public override double NextDouble() { return Cmwc() / 4294967296.0; } /// /// Get a new random System.Double value /// /// The random double protected override double Sample() { return NextDouble(); } /// /// Get a new random System.Int32 value /// /// The random int public override int Next() { return (int)Cmwc(); } /// /// Get a random non-negative integer less than a given upper bound /// /// If max is negative /// The upper bound (exclusive) /// public override int Next(int max) { if (max < 0) throw new ArgumentException("max must be non-negative"); return (int)(Cmwc() / 4294967296.0 * max); } /// /// Get a random integer between two given bounds /// /// If max is less than min /// The lower bound (inclusive) /// The upper bound (exclusive) /// public override int Next(int min, int max) { if (min > max) throw new ArgumentException("min must be less than or equal to max"); return min + (int)(Cmwc() / 4294967296.0 * (max - min)); } /// /// Fill a array of byte with random bytes /// /// The array to fill public override void NextBytes(byte[] buffer) { for (int i = 0, length = buffer.Length; i < length; i++) buffer[i] = (byte)Cmwc(); } /// /// Create a random number generator seed by system time. /// public C5Random() : this(DateTime.Now.Ticks) { } /// /// Create a random number generator with a given seed /// /// If seed is zero /// The seed public C5Random(long seed) { if (seed == 0) throw new ArgumentException("Seed must be non-zero"); uint j = (uint)(seed & 0xFFFFFFFF); for (int i = 0; i < 16; i++) { j ^= j << 13; j ^= j >> 17; j ^= j << 5; Q[i] = j; } Q[15] = (uint)(seed ^ (seed >> 32)); } /// /// Create a random number generator with a specified internal start state. /// /// If Q is not of length exactly 16 /// The start state. Must be a collection of random bits given by an array of exactly 16 uints. public C5Random(uint[] Q) { if (Q.Length != 16) throw new ArgumentException("Q must have length 16, was " + Q.Length); Array.Copy(Q, this.Q, 16); } } } #endif