summaryrefslogtreecommitdiff
path: root/mcs/class/corlib/System/Random.cs
blob: 0bf5c7462786937e531a85562a07afe45cec7c5e (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
//
// System.Random.cs
//
// Authors:
//   Bob Smith (bob@thestuff.net)
//   Ben Maurer (bmaurer@users.sourceforge.net)
//   Sebastien Pouliot  <sebastien@xamarin.com>
//
// (C) 2001 Bob Smith.  http://www.thestuff.net
// (C) 2003 Ben Maurer
// Copyright (C) 2004 Novell, Inc (http://www.novell.com)
// Copyright 2013 Xamarin Inc. (http://www.xamarin.com)
//
// 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.Runtime.InteropServices;

namespace System
{
	[Serializable]
	[ComVisible (true)]
	public class Random
	{
		uint x;
		uint y;
		uint z;
		uint c;

		public Random ()
			: this (Environment.TickCount)
		{
		}

		public Random (int Seed)
		{
			x = (uint) Seed;
			y = (uint) 987654321;
			z = (uint) 43219876;
			c = (uint) 6543217;
		}

		uint JKiss ()
		{
			x = 314527869 * x + 1234567;
			y ^= y << 5;
			y ^= y >> 7;
			y ^= y << 22;
			ulong t = ((ulong) 4294584393 * z + c);
			c = (uint) (t >> 32);
			z = (uint) t;
			return (x + y + z);
		}

		public virtual int Next (int minValue, int maxValue)
		{
			if (minValue > maxValue)
				throw new ArgumentOutOfRangeException ("Maximum value is less than minimal value.");

			// special case: a difference of one (or less) will always return the minimum
			// e.g. -1,-1 or -1,0 will always return -1
			uint diff = (uint) (maxValue - minValue);
			if (diff <= 1)
				return minValue;

			return minValue + ((int) (JKiss () % diff));
		}

		public virtual int Next (int maxValue)
		{
			if (maxValue < 0)
				throw new ArgumentOutOfRangeException ("Maximum value is less than minimal value.");

			return maxValue > 0 ? (int)(JKiss () % maxValue) : 0;
		}

		public virtual int Next ()
		{
			// returns a non-negative, [0 - Int32.MacValue], random number
			// but we want to avoid calls to Math.Abs (call cost and branching cost it requires)
			// and the fact it would throw for Int32.MinValue (so roughly 1 time out of 2^32)
			int random = (int) JKiss ();
			while (random == Int32.MinValue)
				random = (int) JKiss ();
			int mask = random >> 31;
			random ^= mask;
			return random + (mask & 1);
		}

		public virtual void NextBytes (byte [] buffer)
		{
			if (buffer == null)
				throw new ArgumentNullException ("buffer");

			// each random `int` can fill 4 bytes
			int p = 0;
			uint random;
			for (int i = 0; i < (buffer.Length >> 2); i++) {
				random = JKiss ();
				buffer [p++] = (byte) (random >> 24);
				buffer [p++] = (byte) (random >> 16);
				buffer [p++] = (byte) (random >> 8);
				buffer [p++] = (byte) random;
			}
			if (p == buffer.Length)
				return;

			// complete the array
			random = JKiss ();
			while (p < buffer.Length) {
				buffer [p++] = (byte) random;
				random >>= 8;
			}
		}

		public virtual double NextDouble ()
		{
			// return a double value between [0,1]
			return Sample ();
		}

		protected virtual double Sample ()
		{
			// a single 32 bits random value is not enough to create a random double value
			uint a = JKiss () >> 6;	// Upper 26 bits
			uint b = JKiss () >> 5;	// Upper 27 bits
			return (a * 134217728.0 + b) / 9007199254740992.0;
		}
	}
}