Reply to thread

Message

<blockquote data-quote="zerker24" data-source="post: 16087" data-attributes="member: 28218">Okay, this is a little pointless lol. It was a project of mine to help myself learn a little more, and I wanted to see what you guys think. Basically it works the same as the build in random class in about EVERY language, but I looked up the algorithms and wrote everything out myself. There is a few goodies in here as well.Features:<ul>
<li data-xf-list-type="ul">Generate a pseudo-randomized value.</li>
<li data-xf-list-type="ul">Generate a pseudo-randomized decimal (between 0 - 1) value.</li>
<li data-xf-list-type="ul">Generate a pseudo-randomized value between a Minimum and Maximum.</li>
<li data-xf-list-type="ul">Shuffle any array using the Fisher-Yates shuffle.</li>
<li data-xf-list-type="ul">Shuffle any List&lt;T&gt; with the Fisher-Yates shuffle.</li>
<li data-xf-list-type="ul">Generate an array of random values.</li>
<li data-xf-list-type="ul">Generate a List&lt;T&gt; of random value.</li>
</ul>[code]using System;using System.Collections;using System.Collections.Generic;namespace Random_Generator{&nbsp; &nbsp; public class ZerkRandom&nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; private int seed = 0;&nbsp; &nbsp; &nbsp; &nbsp; private double lastVal = 0;&nbsp; &nbsp; &nbsp; &nbsp; // A, M, and C based on Java&#039;s java.util.Random&nbsp; &nbsp; &nbsp; &nbsp; private double a = 25214903917;&nbsp; &nbsp; &nbsp; &nbsp; private double m = Math.Pow(2, 48);&nbsp; &nbsp; &nbsp; &nbsp; private double c = 11;&nbsp; &nbsp; &nbsp; &nbsp; public ZerkRandom(int seed)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; this.seed = seed;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; lastVal = seed;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; private List&lt;double&gt; FindFactors(double num)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;double&gt; result = new List&lt;double&gt;();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Take out the 2s.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while (num % 2 == 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result.Add(2);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; num /= 2;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Take out other primes.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; long factor = 3;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while (factor * factor &lt;= num)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (num % factor == 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // This is a factor.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result.Add(factor);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; num /= factor;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Go to the next odd number.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; factor += 2;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // If num is not 1, then whatever is left is prime.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (num &gt; 1) result.Add(num);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return result;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; public void SetAMC(double a, double m, double c)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; double tmpC = c;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; double tmpM = m;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Check if C and M are co-prime as per rule 1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while (tmpC != 0 &amp;&amp; tmpM != 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (tmpC &gt; tmpM)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tmpC %= tmpM;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tmpM %= tmpC;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (Math.Max(tmpC, tmpM) != 1)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; throw new Exception(&quot;C and M must be relatively prime or co-prime.&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //Get value of a - 1 for the next two rules&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; double aTmp = a - 1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //Make sure aTmp is divisable by the prime factors of m&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;double&gt; primes = FindFactors(m);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bool isPrime = true;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; foreach (double d in primes)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if ((aTmp % d) != 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; isPrime = false;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (!isPrime)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; throw new Exception(&quot;A - 1 must be divisible by all the prime factors of M.&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //If m is a multiple of 4, aTmp must be also.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bool isMultiple = m % 4 == 0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (isMultiple)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bool aIsMultiple = aTmp % 4 == 0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (!aIsMultiple)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; throw new Exception(&quot;If M is a multiple of 4, A - 1 must be also. &quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; this.a = a;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; this.m = m;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; this.c = c;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Gets gets an array of the bits in the value.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;value&quot;&gt;The value to convert.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;a byte array of bits.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; private byte[] GetBits(double value)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; byte[] bytes = BitConverter.GetBytes(value);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; BitArray bitArray = new BitArray(bytes);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;byte&gt; bits = new List&lt;byte&gt;();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; foreach (bool b in bitArray)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bits.Add(Convert.ToByte(b));&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return bits.ToArray();&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Takes a set number of bits, and turns them into a int32.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;bits&quot;&gt;The bits to start from.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;startingBit&quot;&gt;The bit to start from. Should be more than 32 bits away from the end.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;endingBit&quot;&gt;The bit to end on. Should be no more than 32 bits from the start.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; private int GetValue(byte[] bits, int startingBit, int endingBit)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; string bitString = &quot;&quot;;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int i = startingBit; i &lt; endingBit; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; bitString += bits[i];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return Convert.ToInt32(bitString, 2);&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates a random number using a linear congruential generator.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;A double.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public double Generate()&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Standard Linear Congruential Generator equation.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; double value = (a * lastVal + c) % m;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // This next part just helps the program be more random.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int rtnInt = GetValue(GetBits(value), 10, 42);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; lastVal = rtnInt;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return rtnInt;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates a random number using a linear congruential generator.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;A double.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public double Generate(bool PosativeOnly)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Standard Linear Congruential Generator equation.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; double value = (a * lastVal + c) % m;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // This next part just helps the program be more random.&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int rtnInt = GetValue(GetBits(value), 10, 42);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; lastVal = rtnInt;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (PosativeOnly)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rtnInt = Math.Abs(rtnInt);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return rtnInt;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates a random number using a linear congruential generator.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;A double between 0 and 1.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public double GenerateDecimal()&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; double value = Generate(true);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; lastVal = value;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; value = value % 100;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return value / 100;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates a random number using a linear congruential generator.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;min&quot;&gt;The minimum number the generator will generate.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;max&quot;&gt;The highest number the generator will generate.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;A double between the values of min and max.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public double Generate(double min, double max)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; double diffRate = max - min;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; double value = 0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (min &gt;= 0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; value = Generate(true);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; value = Generate();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; lastVal = value;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return (value % diffRate) + min;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Shuffles a givin array randomly using the Fisher-Yates Shuffle.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;typeparam name=&quot;T&quot;&gt;The arrays object type.&lt;/typeparam&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;array&quot;&gt;The array to shuffle.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;A shuffled version of the supplied array.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public T[] ShuffleArray&lt;T&gt;(T[] array)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; T[] rtnArray = new T[array.Length];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Array.Copy(array, rtnArray, array.Length);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int n = rtnArray.Length;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; n; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int r = i + (int)(GenerateDecimal() * (n - i));&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; T t = rtnArray[r];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rtnArray[r] = rtnArray[i];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rtnArray[i] = t;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return rtnArray;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Shuffles a givin list randomly using the Fisher-Yates Shuffle.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;typeparam name=&quot;T&quot;&gt;The arrays object type.&lt;/typeparam&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;list&quot;&gt;The list to shuffle.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;A shuffled version of the supplied list.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public List&lt;T&gt; ShuffleList&lt;T&gt;(List&lt;T&gt; list)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;T&gt; rtnList = new List&lt;T&gt;();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; T[] array = list.ToArray();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int n = array.Length;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; n; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int r = i + (int)(GenerateDecimal() * (n - i));&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; T t = array[r];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; array[r] = array[i];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; array[i] = t;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; foreach (T t in array)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rtnList.Add(t);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return rtnList;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates an array of values.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;length&quot;&gt;The length of the return array.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;An array of random double values.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public double[] GenerateArray(int length)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;double&gt; data = new List&lt;double&gt;();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; length; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; data.Add(this.Generate());&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return data.ToArray();&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates an array of values.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;length&quot;&gt;The length of the return array.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;min&quot;&gt;The min value the system can generate.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;max&quot;&gt;The max value the system can generate.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;An array of random double values.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public double[] GenerateArray(int length, int min, int max)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;double&gt; data = new List&lt;double&gt;();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; length; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; data.Add(this.Generate(min, max));&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return data.ToArray();&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates an array of values.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;length&quot;&gt;The length of the return array.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;An array of random double values between 0 and 1.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public double[] GenerateDecimalArray(int length)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;double&gt; data = new List&lt;double&gt;();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; length; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; data.Add(this.GenerateDecimal());&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return data.ToArray();&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates an list of values.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;length&quot;&gt;The length of the return list.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;An array of random double values.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public List&lt;double&gt; GenerateList(int length)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;double&gt; data = new List&lt;double&gt;();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; length; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; data.Add(this.Generate());&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return data;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates an list of values.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;length&quot;&gt;The length of the return list.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;min&quot;&gt;The min value the system can generate.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;max&quot;&gt;The max value the system can generate.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;An list of random double values.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public List&lt;double&gt; GenerateList(int length, int min, int max)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;double&gt; data = new List&lt;double&gt;();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; length; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; data.Add(this.Generate(min, max));&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return data;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// Generates an list of values.&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;/summary&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;param name=&quot;length&quot;&gt;The length of the return list.&lt;/param&gt;&nbsp; &nbsp; &nbsp; &nbsp; /// &lt;returns&gt;An list of random double values between 0 and 1.&lt;/returns&gt;&nbsp; &nbsp; &nbsp; &nbsp; public List&lt;double&gt; GenerateDecimalList(int length)&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; List&lt;double&gt; data = new List&lt;double&gt;();&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (int i = 0; i &lt; length; i++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; data.Add(this.GenerateDecimal());&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return data;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }}[/code]</blockquote>

[QUOTE="zerker24, post: 16087, member: 28218"] Okay, this is a little pointless lol. It was a project of mine to help myself learn a little more, and I wanted to see what you guys think. Basically it works the same as the build in random class in about EVERY language, but I looked up the algorithms and wrote everything out myself. There is a few goodies in here as well. Features: [LIST] [*]Generate a pseudo-randomized value. [*]Generate a pseudo-randomized decimal (between 0 - 1) value. [*]Generate a pseudo-randomized value between a Minimum and Maximum. [*]Shuffle any array using the Fisher-Yates shuffle. [*]Shuffle any List<T> with the Fisher-Yates shuffle. [*]Generate an array of random values. [*]Generate a List<T> of random value. [/LIST] [code] using System; using System.Collections; using System.Collections.Generic; namespace Random_Generator { public class ZerkRandom { private int seed = 0; private double lastVal = 0; // A, M, and C based on Java's java.util.Random private double a = 25214903917; private double m = Math.Pow(2, 48); private double c = 11; public ZerkRandom(int seed) { this.seed = seed; lastVal = seed; } private List<double> FindFactors(double num) { List<double> result = new List<double>(); // Take out the 2s. while (num % 2 == 0) { result.Add(2); num /= 2; } // Take out other primes. long factor = 3; while (factor * factor <= num) { if (num % factor == 0) { // This is a factor. result.Add(factor); num /= factor; } else { // Go to the next odd number. factor += 2; } } // If num is not 1, then whatever is left is prime. if (num > 1) result.Add(num); return result; } public void SetAMC(double a, double m, double c) { double tmpC = c; double tmpM = m; // Check if C and M are co-prime as per rule 1; while (tmpC != 0 && tmpM != 0) { if (tmpC > tmpM) tmpC %= tmpM; else tmpM %= tmpC; } if (Math.Max(tmpC, tmpM) != 1) throw new Exception("C and M must be relatively prime or co-prime."); //Get value of a - 1 for the next two rules double aTmp = a - 1; //Make sure aTmp is divisable by the prime factors of m List<double> primes = FindFactors(m); bool isPrime = true; foreach (double d in primes) { if ((aTmp % d) != 0) { isPrime = false; return; } } if (!isPrime) throw new Exception("A - 1 must be divisible by all the prime factors of M."); //If m is a multiple of 4, aTmp must be also. bool isMultiple = m % 4 == 0; if (isMultiple) { bool aIsMultiple = aTmp % 4 == 0; if (!aIsMultiple) throw new Exception("If M is a multiple of 4, A - 1 must be also. "); } this.a = a; this.m = m; this.c = c; } /// <summary> /// Gets gets an array of the bits in the value. /// </summary> /// <param name="value">The value to convert.</param> /// <returns>a byte array of bits.</returns> private byte[] GetBits(double value) { byte[] bytes = BitConverter.GetBytes(value); BitArray bitArray = new BitArray(bytes); List<byte> bits = new List<byte>(); foreach (bool b in bitArray) bits.Add(Convert.ToByte(b)); return bits.ToArray(); } /// <summary> /// Takes a set number of bits, and turns them into a int32. /// </summary> /// <param name="bits">The bits to start from.</param> /// <param name="startingBit">The bit to start from. Should be more than 32 bits away from the end.</param> /// <param name="endingBit">The bit to end on. Should be no more than 32 bits from the start.</param> /// <returns></returns> private int GetValue(byte[] bits, int startingBit, int endingBit) { string bitString = ""; for (int i = startingBit; i < endingBit; i++) bitString += bits[i]; return Convert.ToInt32(bitString, 2); } /// <summary> /// Generates a random number using a linear congruential generator. /// </summary> /// <returns>A double.</returns> public double Generate() { // Standard Linear Congruential Generator equation. double value = (a * lastVal + c) % m; // This next part just helps the program be more random. int rtnInt = GetValue(GetBits(value), 10, 42); lastVal = rtnInt; return rtnInt; } /// <summary> /// Generates a random number using a linear congruential generator. /// </summary> /// <returns>A double.</returns> public double Generate(bool PosativeOnly) { // Standard Linear Congruential Generator equation. double value = (a * lastVal + c) % m; // This next part just helps the program be more random. int rtnInt = GetValue(GetBits(value), 10, 42); lastVal = rtnInt; if (PosativeOnly) rtnInt = Math.Abs(rtnInt); return rtnInt; } /// <summary> /// Generates a random number using a linear congruential generator. /// </summary> /// <returns>A double between 0 and 1.</returns> public double GenerateDecimal() { double value = Generate(true); lastVal = value; value = value % 100; return value / 100; } /// <summary> /// Generates a random number using a linear congruential generator. /// </summary> /// <param name="min">The minimum number the generator will generate.</param> /// <param name="max">The highest number the generator will generate.</param> /// <returns>A double between the values of min and max.</returns> public double Generate(double min, double max) { double diffRate = max - min; double value = 0; if (min >= 0) value = Generate(true); else value = Generate(); lastVal = value; return (value % diffRate) + min; } /// <summary> /// Shuffles a givin array randomly using the Fisher-Yates Shuffle. /// </summary> /// <typeparam name="T">The arrays object type.</typeparam> /// <param name="array">The array to shuffle.</param> /// <returns>A shuffled version of the supplied array.</returns> public T[] ShuffleArray<T>(T[] array) { T[] rtnArray = new T[array.Length]; Array.Copy(array, rtnArray, array.Length); int n = rtnArray.Length; for (int i = 0; i < n; i++) { int r = i + (int)(GenerateDecimal() * (n - i)); T t = rtnArray[r]; rtnArray[r] = rtnArray[i]; rtnArray[i] = t; } return rtnArray; } /// <summary> /// Shuffles a givin list randomly using the Fisher-Yates Shuffle. /// </summary> /// <typeparam name="T">The arrays object type.</typeparam> /// <param name="list">The list to shuffle.</param> /// <returns>A shuffled version of the supplied list.</returns> public List<T> ShuffleList<T>(List<T> list) { List<T> rtnList = new List<T>(); T[] array = list.ToArray(); int n = array.Length; for (int i = 0; i < n; i++) { int r = i + (int)(GenerateDecimal() * (n - i)); T t = array[r]; array[r] = array[i]; array[i] = t; } foreach (T t in array) rtnList.Add(t); return rtnList; } /// <summary> /// Generates an array of values. /// </summary> /// <param name="length">The length of the return array.</param> /// <returns>An array of random double values.</returns> public double[] GenerateArray(int length) { List<double> data = new List<double>(); for (int i = 0; i < length; i++) data.Add(this.Generate()); return data.ToArray(); } /// <summary> /// Generates an array of values. /// </summary> /// <param name="length">The length of the return array.</param> /// <param name="min">The min value the system can generate.</param> /// <param name="max">The max value the system can generate.</param> /// <returns>An array of random double values.</returns> public double[] GenerateArray(int length, int min, int max) { List<double> data = new List<double>(); for (int i = 0; i < length; i++) data.Add(this.Generate(min, max)); return data.ToArray(); } /// <summary> /// Generates an array of values. /// </summary> /// <param name="length">The length of the return array.</param> /// <returns>An array of random double values between 0 and 1.</returns> public double[] GenerateDecimalArray(int length) { List<double> data = new List<double>(); for (int i = 0; i < length; i++) data.Add(this.GenerateDecimal()); return data.ToArray(); } /// <summary> /// Generates an list of values. /// </summary> /// <param name="length">The length of the return list.</param> /// <returns>An array of random double values.</returns> public List<double> GenerateList(int length) { List<double> data = new List<double>(); for (int i = 0; i < length; i++) data.Add(this.Generate()); return data; } /// <summary> /// Generates an list of values. /// </summary> /// <param name="length">The length of the return list.</param> /// <param name="min">The min value the system can generate.</param> /// <param name="max">The max value the system can generate.</param> /// <returns>An list of random double values.</returns> public List<double> GenerateList(int length, int min, int max) { List<double> data = new List<double>(); for (int i = 0; i < length; i++) data.Add(this.Generate(min, max)); return data; } /// <summary> /// Generates an list of values. /// </summary> /// <param name="length">The length of the return list.</param> /// <returns>An list of random double values between 0 and 1.</returns> public List<double> GenerateDecimalList(int length) { List<double> data = new List<double>(); for (int i = 0; i < length; i++) data.Add(this.GenerateDecimal()); return data; } } } [/code] [/QUOTE]

Verification

Reply to thread

Forum statistics

Share this page