Benjamin Peterson | 90f5ba5 | 2010-03-11 22:53:45 +0000 | [diff] [blame] | 1 | #!/usr/bin/env python3 |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 2 | |
| 3 | import unittest |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 4 | import random |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 5 | import time |
Raymond Hettinger | 5f078ff | 2003-06-24 20:29:04 +0000 | [diff] [blame] | 6 | import pickle |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 7 | import warnings |
Georg Brandl | 1b37e87 | 2010-03-14 10:45:50 +0000 | [diff] [blame] | 8 | from math import log, exp, pi, fsum, sin |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 9 | from test import support |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 10 | |
Ezio Melotti | 3e4a98b | 2013-04-19 05:45:27 +0300 | [diff] [blame] | 11 | class TestBasicOps: |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 12 | # Superclass with tests common to all generators. |
| 13 | # Subclasses must arrange for self.gen to retrieve the Random instance |
| 14 | # to be tested. |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 15 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 16 | def randomlist(self, n): |
| 17 | """Helper function to make a list of random numbers""" |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 18 | return [self.gen.random() for i in range(n)] |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 19 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 20 | def test_autoseed(self): |
| 21 | self.gen.seed() |
| 22 | state1 = self.gen.getstate() |
Raymond Hettinger | 3081d59 | 2003-08-09 18:30:57 +0000 | [diff] [blame] | 23 | time.sleep(0.1) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 24 | self.gen.seed() # diffent seeds at different times |
| 25 | state2 = self.gen.getstate() |
| 26 | self.assertNotEqual(state1, state2) |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 27 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 28 | def test_saverestore(self): |
| 29 | N = 1000 |
| 30 | self.gen.seed() |
| 31 | state = self.gen.getstate() |
| 32 | randseq = self.randomlist(N) |
| 33 | self.gen.setstate(state) # should regenerate the same sequence |
| 34 | self.assertEqual(randseq, self.randomlist(N)) |
| 35 | |
| 36 | def test_seedargs(self): |
Mark Dickinson | 95aeae0 | 2012-06-24 11:05:30 +0100 | [diff] [blame] | 37 | # Seed value with a negative hash. |
| 38 | class MySeed(object): |
| 39 | def __hash__(self): |
| 40 | return -1729 |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 41 | for arg in [None, 0, 0, 1, 1, -1, -1, 10**20, -(10**20), |
Mark Dickinson | 95aeae0 | 2012-06-24 11:05:30 +0100 | [diff] [blame] | 42 | 3.14, 1+2j, 'a', tuple('abc'), MySeed()]: |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 43 | self.gen.seed(arg) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 44 | for arg in [list(range(3)), dict(one=1)]: |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 45 | self.assertRaises(TypeError, self.gen.seed, arg) |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 46 | self.assertRaises(TypeError, self.gen.seed, 1, 2, 3, 4) |
Raymond Hettinger | 5833587 | 2004-07-09 14:26:18 +0000 | [diff] [blame] | 47 | self.assertRaises(TypeError, type(self.gen), []) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 48 | |
Raymond Hettinger | dc4872e | 2010-09-07 10:06:56 +0000 | [diff] [blame] | 49 | def test_choice(self): |
| 50 | choice = self.gen.choice |
| 51 | with self.assertRaises(IndexError): |
| 52 | choice([]) |
| 53 | self.assertEqual(choice([50]), 50) |
| 54 | self.assertIn(choice([25, 75]), [25, 75]) |
| 55 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 56 | def test_sample(self): |
| 57 | # For the entire allowable range of 0 <= k <= N, validate that |
| 58 | # the sample is of the correct length and contains only unique items |
| 59 | N = 100 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 60 | population = range(N) |
| 61 | for k in range(N+1): |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 62 | s = self.gen.sample(population, k) |
| 63 | self.assertEqual(len(s), k) |
Raymond Hettinger | a690a99 | 2003-11-16 16:17:49 +0000 | [diff] [blame] | 64 | uniq = set(s) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 65 | self.assertEqual(len(uniq), k) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 66 | self.assertTrue(uniq <= set(population)) |
Raymond Hettinger | 8ec7881 | 2003-01-04 05:55:11 +0000 | [diff] [blame] | 67 | self.assertEqual(self.gen.sample([], 0), []) # test edge case N==k==0 |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 68 | |
Raymond Hettinger | 7b0cf76 | 2003-01-17 17:23:23 +0000 | [diff] [blame] | 69 | def test_sample_distribution(self): |
| 70 | # For the entire allowable range of 0 <= k <= N, validate that |
| 71 | # sample generates all possible permutations |
| 72 | n = 5 |
| 73 | pop = range(n) |
| 74 | trials = 10000 # large num prevents false negatives without slowing normal case |
| 75 | def factorial(n): |
Guido van Rossum | 89da5d7 | 2006-08-22 00:21:25 +0000 | [diff] [blame] | 76 | if n == 0: |
| 77 | return 1 |
| 78 | return n * factorial(n - 1) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 79 | for k in range(n): |
Raymond Hettinger | ffdb8bb | 2004-09-27 15:29:05 +0000 | [diff] [blame] | 80 | expected = factorial(n) // factorial(n-k) |
Raymond Hettinger | 7b0cf76 | 2003-01-17 17:23:23 +0000 | [diff] [blame] | 81 | perms = {} |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 82 | for i in range(trials): |
Raymond Hettinger | 7b0cf76 | 2003-01-17 17:23:23 +0000 | [diff] [blame] | 83 | perms[tuple(self.gen.sample(pop, k))] = None |
| 84 | if len(perms) == expected: |
| 85 | break |
| 86 | else: |
| 87 | self.fail() |
| 88 | |
Raymond Hettinger | 66d09f1 | 2003-09-06 04:25:54 +0000 | [diff] [blame] | 89 | def test_sample_inputs(self): |
| 90 | # SF bug #801342 -- population can be any iterable defining __len__() |
Raymond Hettinger | a690a99 | 2003-11-16 16:17:49 +0000 | [diff] [blame] | 91 | self.gen.sample(set(range(20)), 2) |
Raymond Hettinger | 66d09f1 | 2003-09-06 04:25:54 +0000 | [diff] [blame] | 92 | self.gen.sample(range(20), 2) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 93 | self.gen.sample(range(20), 2) |
Raymond Hettinger | 66d09f1 | 2003-09-06 04:25:54 +0000 | [diff] [blame] | 94 | self.gen.sample(str('abcdefghijklmnopqrst'), 2) |
| 95 | self.gen.sample(tuple('abcdefghijklmnopqrst'), 2) |
| 96 | |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 97 | def test_sample_on_dicts(self): |
Raymond Hettinger | 1acde19 | 2008-01-14 01:00:53 +0000 | [diff] [blame] | 98 | self.assertRaises(TypeError, self.gen.sample, dict.fromkeys('abcdef'), 2) |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 99 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 100 | def test_gauss(self): |
| 101 | # Ensure that the seed() method initializes all the hidden state. In |
| 102 | # particular, through 2.2.1 it failed to reset a piece of state used |
| 103 | # by (and only by) the .gauss() method. |
| 104 | |
| 105 | for seed in 1, 12, 123, 1234, 12345, 123456, 654321: |
| 106 | self.gen.seed(seed) |
| 107 | x1 = self.gen.random() |
| 108 | y1 = self.gen.gauss(0, 1) |
| 109 | |
| 110 | self.gen.seed(seed) |
| 111 | x2 = self.gen.random() |
| 112 | y2 = self.gen.gauss(0, 1) |
| 113 | |
| 114 | self.assertEqual(x1, x2) |
| 115 | self.assertEqual(y1, y2) |
| 116 | |
Raymond Hettinger | 5f078ff | 2003-06-24 20:29:04 +0000 | [diff] [blame] | 117 | def test_pickling(self): |
| 118 | state = pickle.dumps(self.gen) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 119 | origseq = [self.gen.random() for i in range(10)] |
Raymond Hettinger | 5f078ff | 2003-06-24 20:29:04 +0000 | [diff] [blame] | 120 | newgen = pickle.loads(state) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 121 | restoredseq = [newgen.random() for i in range(10)] |
Raymond Hettinger | 5f078ff | 2003-06-24 20:29:04 +0000 | [diff] [blame] | 122 | self.assertEqual(origseq, restoredseq) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 123 | |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 124 | def test_bug_1727780(self): |
| 125 | # verify that version-2-pickles can be loaded |
| 126 | # fine, whether they are created on 32-bit or 64-bit |
| 127 | # platforms, and that version-3-pickles load fine. |
| 128 | files = [("randv2_32.pck", 780), |
| 129 | ("randv2_64.pck", 866), |
| 130 | ("randv3.pck", 343)] |
| 131 | for file, value in files: |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 132 | f = open(support.findfile(file),"rb") |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 133 | r = pickle.load(f) |
| 134 | f.close() |
Raymond Hettinger | 0515661 | 2010-09-07 04:44:52 +0000 | [diff] [blame] | 135 | self.assertEqual(int(r.random()*1000), value) |
| 136 | |
| 137 | def test_bug_9025(self): |
| 138 | # Had problem with an uneven distribution in int(n*random()) |
| 139 | # Verify the fix by checking that distributions fall within expectations. |
| 140 | n = 100000 |
| 141 | randrange = self.gen.randrange |
| 142 | k = sum(randrange(6755399441055744) % 3 == 2 for i in range(n)) |
| 143 | self.assertTrue(0.30 < k/n < .37, (k/n)) |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 144 | |
Ezio Melotti | 3e4a98b | 2013-04-19 05:45:27 +0300 | [diff] [blame] | 145 | try: |
| 146 | random.SystemRandom().random() |
| 147 | except NotImplementedError: |
| 148 | SystemRandom_available = False |
| 149 | else: |
| 150 | SystemRandom_available = True |
| 151 | |
| 152 | @unittest.skipUnless(SystemRandom_available, "random.SystemRandom not available") |
| 153 | class SystemRandom_TestBasicOps(TestBasicOps, unittest.TestCase): |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 154 | gen = random.SystemRandom() |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 155 | |
| 156 | def test_autoseed(self): |
| 157 | # Doesn't need to do anything except not fail |
| 158 | self.gen.seed() |
| 159 | |
| 160 | def test_saverestore(self): |
| 161 | self.assertRaises(NotImplementedError, self.gen.getstate) |
| 162 | self.assertRaises(NotImplementedError, self.gen.setstate, None) |
| 163 | |
| 164 | def test_seedargs(self): |
| 165 | # Doesn't need to do anything except not fail |
| 166 | self.gen.seed(100) |
| 167 | |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 168 | def test_gauss(self): |
| 169 | self.gen.gauss_next = None |
| 170 | self.gen.seed(100) |
| 171 | self.assertEqual(self.gen.gauss_next, None) |
| 172 | |
| 173 | def test_pickling(self): |
| 174 | self.assertRaises(NotImplementedError, pickle.dumps, self.gen) |
| 175 | |
| 176 | def test_53_bits_per_float(self): |
| 177 | # This should pass whenever a C double has 53 bit precision. |
| 178 | span = 2 ** 53 |
| 179 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 180 | for i in range(100): |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 181 | cum |= int(self.gen.random() * span) |
| 182 | self.assertEqual(cum, span-1) |
| 183 | |
| 184 | def test_bigrand(self): |
| 185 | # The randrange routine should build-up the required number of bits |
| 186 | # in stages so that all bit positions are active. |
| 187 | span = 2 ** 500 |
| 188 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 189 | for i in range(100): |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 190 | r = self.gen.randrange(span) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 191 | self.assertTrue(0 <= r < span) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 192 | cum |= r |
| 193 | self.assertEqual(cum, span-1) |
| 194 | |
| 195 | def test_bigrand_ranges(self): |
| 196 | for i in [40,80, 160, 200, 211, 250, 375, 512, 550]: |
| 197 | start = self.gen.randrange(2 ** i) |
| 198 | stop = self.gen.randrange(2 ** (i-2)) |
| 199 | if stop <= start: |
| 200 | return |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 201 | self.assertTrue(start <= self.gen.randrange(start, stop) < stop) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 202 | |
| 203 | def test_rangelimits(self): |
| 204 | for start, stop in [(-2,0), (-(2**60)-2,-(2**60)), (2**60,2**60+2)]: |
| 205 | self.assertEqual(set(range(start,stop)), |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 206 | set([self.gen.randrange(start,stop) for i in range(100)])) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 207 | |
| 208 | def test_genrandbits(self): |
| 209 | # Verify ranges |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 210 | for k in range(1, 1000): |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 211 | self.assertTrue(0 <= self.gen.getrandbits(k) < 2**k) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 212 | |
| 213 | # Verify all bits active |
| 214 | getbits = self.gen.getrandbits |
| 215 | for span in [1, 2, 3, 4, 31, 32, 32, 52, 53, 54, 119, 127, 128, 129]: |
| 216 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 217 | for i in range(100): |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 218 | cum |= getbits(span) |
| 219 | self.assertEqual(cum, 2**span-1) |
| 220 | |
| 221 | # Verify argument checking |
| 222 | self.assertRaises(TypeError, self.gen.getrandbits) |
| 223 | self.assertRaises(TypeError, self.gen.getrandbits, 1, 2) |
| 224 | self.assertRaises(ValueError, self.gen.getrandbits, 0) |
| 225 | self.assertRaises(ValueError, self.gen.getrandbits, -1) |
| 226 | self.assertRaises(TypeError, self.gen.getrandbits, 10.1) |
| 227 | |
| 228 | def test_randbelow_logic(self, _log=log, int=int): |
| 229 | # check bitcount transition points: 2**i and 2**(i+1)-1 |
| 230 | # show that: k = int(1.001 + _log(n, 2)) |
| 231 | # is equal to or one greater than the number of bits in n |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 232 | for i in range(1, 1000): |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 233 | n = 1 << i # check an exact power of two |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 234 | numbits = i+1 |
| 235 | k = int(1.00001 + _log(n, 2)) |
| 236 | self.assertEqual(k, numbits) |
Guido van Rossum | e61fd5b | 2007-07-11 12:20:59 +0000 | [diff] [blame] | 237 | self.assertEqual(n, 2**(k-1)) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 238 | |
| 239 | n += n - 1 # check 1 below the next power of two |
| 240 | k = int(1.00001 + _log(n, 2)) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 241 | self.assertIn(k, [numbits, numbits+1]) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 242 | self.assertTrue(2**k > n > 2**(k-2)) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 243 | |
| 244 | n -= n >> 15 # check a little farther below the next power of two |
| 245 | k = int(1.00001 + _log(n, 2)) |
| 246 | self.assertEqual(k, numbits) # note the stronger assertion |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 247 | self.assertTrue(2**k > n > 2**(k-1)) # note the stronger assertion |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 248 | |
| 249 | |
Ezio Melotti | 3e4a98b | 2013-04-19 05:45:27 +0300 | [diff] [blame] | 250 | class MersenneTwister_TestBasicOps(TestBasicOps, unittest.TestCase): |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 251 | gen = random.Random() |
| 252 | |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 253 | def test_guaranteed_stable(self): |
| 254 | # These sequences are guaranteed to stay the same across versions of python |
| 255 | self.gen.seed(3456147, version=1) |
| 256 | self.assertEqual([self.gen.random().hex() for i in range(4)], |
| 257 | ['0x1.ac362300d90d2p-1', '0x1.9d16f74365005p-1', |
| 258 | '0x1.1ebb4352e4c4dp-1', '0x1.1a7422abf9c11p-1']) |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 259 | self.gen.seed("the quick brown fox", version=2) |
| 260 | self.assertEqual([self.gen.random().hex() for i in range(4)], |
Raymond Hettinger | 3fcf002 | 2010-12-08 01:13:53 +0000 | [diff] [blame] | 261 | ['0x1.1239ddfb11b7cp-3', '0x1.b3cbb5c51b120p-4', |
| 262 | '0x1.8c4f55116b60fp-1', '0x1.63eb525174a27p-1']) |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 263 | |
Raymond Hettinger | 5833587 | 2004-07-09 14:26:18 +0000 | [diff] [blame] | 264 | def test_setstate_first_arg(self): |
| 265 | self.assertRaises(ValueError, self.gen.setstate, (1, None, None)) |
| 266 | |
| 267 | def test_setstate_middle_arg(self): |
| 268 | # Wrong type, s/b tuple |
| 269 | self.assertRaises(TypeError, self.gen.setstate, (2, None, None)) |
| 270 | # Wrong length, s/b 625 |
| 271 | self.assertRaises(ValueError, self.gen.setstate, (2, (1,2,3), None)) |
| 272 | # Wrong type, s/b tuple of 625 ints |
| 273 | self.assertRaises(TypeError, self.gen.setstate, (2, ('a',)*625, None)) |
| 274 | # Last element s/b an int also |
| 275 | self.assertRaises(TypeError, self.gen.setstate, (2, (0,)*624+('a',), None)) |
| 276 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 277 | def test_referenceImplementation(self): |
| 278 | # Compare the python implementation with results from the original |
| 279 | # code. Create 2000 53-bit precision random floats. Compare only |
| 280 | # the last ten entries to show that the independent implementations |
| 281 | # are tracking. Here is the main() function needed to create the |
| 282 | # list of expected random numbers: |
| 283 | # void main(void){ |
| 284 | # int i; |
| 285 | # unsigned long init[4]={61731, 24903, 614, 42143}, length=4; |
| 286 | # init_by_array(init, length); |
| 287 | # for (i=0; i<2000; i++) { |
| 288 | # printf("%.15f ", genrand_res53()); |
| 289 | # if (i%5==4) printf("\n"); |
| 290 | # } |
| 291 | # } |
| 292 | expected = [0.45839803073713259, |
| 293 | 0.86057815201978782, |
| 294 | 0.92848331726782152, |
| 295 | 0.35932681119782461, |
| 296 | 0.081823493762449573, |
| 297 | 0.14332226470169329, |
| 298 | 0.084297823823520024, |
| 299 | 0.53814864671831453, |
| 300 | 0.089215024911993401, |
| 301 | 0.78486196105372907] |
| 302 | |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 303 | self.gen.seed(61731 + (24903<<32) + (614<<64) + (42143<<96)) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 304 | actual = self.randomlist(2000)[-10:] |
| 305 | for a, e in zip(actual, expected): |
| 306 | self.assertAlmostEqual(a,e,places=14) |
| 307 | |
| 308 | def test_strong_reference_implementation(self): |
| 309 | # Like test_referenceImplementation, but checks for exact bit-level |
| 310 | # equality. This should pass on any box where C double contains |
| 311 | # at least 53 bits of precision (the underlying algorithm suffers |
| 312 | # no rounding errors -- all results are exact). |
| 313 | from math import ldexp |
| 314 | |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 315 | expected = [0x0eab3258d2231f, |
| 316 | 0x1b89db315277a5, |
| 317 | 0x1db622a5518016, |
| 318 | 0x0b7f9af0d575bf, |
| 319 | 0x029e4c4db82240, |
| 320 | 0x04961892f5d673, |
| 321 | 0x02b291598e4589, |
| 322 | 0x11388382c15694, |
| 323 | 0x02dad977c9e1fe, |
| 324 | 0x191d96d4d334c6] |
| 325 | self.gen.seed(61731 + (24903<<32) + (614<<64) + (42143<<96)) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 326 | actual = self.randomlist(2000)[-10:] |
| 327 | for a, e in zip(actual, expected): |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 328 | self.assertEqual(int(ldexp(a, 53)), e) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 329 | |
| 330 | def test_long_seed(self): |
| 331 | # This is most interesting to run in debug mode, just to make sure |
| 332 | # nothing blows up. Under the covers, a dynamically resized array |
| 333 | # is allocated, consuming space proportional to the number of bits |
| 334 | # in the seed. Unfortunately, that's a quadratic-time algorithm, |
| 335 | # so don't make this horribly big. |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 336 | seed = (1 << (10000 * 8)) - 1 # about 10K bytes |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 337 | self.gen.seed(seed) |
| 338 | |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 339 | def test_53_bits_per_float(self): |
| 340 | # This should pass whenever a C double has 53 bit precision. |
| 341 | span = 2 ** 53 |
| 342 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 343 | for i in range(100): |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 344 | cum |= int(self.gen.random() * span) |
| 345 | self.assertEqual(cum, span-1) |
| 346 | |
| 347 | def test_bigrand(self): |
| 348 | # The randrange routine should build-up the required number of bits |
| 349 | # in stages so that all bit positions are active. |
| 350 | span = 2 ** 500 |
| 351 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 352 | for i in range(100): |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 353 | r = self.gen.randrange(span) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 354 | self.assertTrue(0 <= r < span) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 355 | cum |= r |
| 356 | self.assertEqual(cum, span-1) |
| 357 | |
| 358 | def test_bigrand_ranges(self): |
| 359 | for i in [40,80, 160, 200, 211, 250, 375, 512, 550]: |
| 360 | start = self.gen.randrange(2 ** i) |
| 361 | stop = self.gen.randrange(2 ** (i-2)) |
| 362 | if stop <= start: |
| 363 | return |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 364 | self.assertTrue(start <= self.gen.randrange(start, stop) < stop) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 365 | |
| 366 | def test_rangelimits(self): |
| 367 | for start, stop in [(-2,0), (-(2**60)-2,-(2**60)), (2**60,2**60+2)]: |
Raymond Hettinger | a690a99 | 2003-11-16 16:17:49 +0000 | [diff] [blame] | 368 | self.assertEqual(set(range(start,stop)), |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 369 | set([self.gen.randrange(start,stop) for i in range(100)])) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 370 | |
| 371 | def test_genrandbits(self): |
| 372 | # Verify cross-platform repeatability |
| 373 | self.gen.seed(1234567) |
| 374 | self.assertEqual(self.gen.getrandbits(100), |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 375 | 97904845777343510404718956115) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 376 | # Verify ranges |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 377 | for k in range(1, 1000): |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 378 | self.assertTrue(0 <= self.gen.getrandbits(k) < 2**k) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 379 | |
| 380 | # Verify all bits active |
| 381 | getbits = self.gen.getrandbits |
| 382 | for span in [1, 2, 3, 4, 31, 32, 32, 52, 53, 54, 119, 127, 128, 129]: |
| 383 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 384 | for i in range(100): |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 385 | cum |= getbits(span) |
| 386 | self.assertEqual(cum, 2**span-1) |
| 387 | |
Raymond Hettinger | 5833587 | 2004-07-09 14:26:18 +0000 | [diff] [blame] | 388 | # Verify argument checking |
| 389 | self.assertRaises(TypeError, self.gen.getrandbits) |
| 390 | self.assertRaises(TypeError, self.gen.getrandbits, 'a') |
| 391 | self.assertRaises(TypeError, self.gen.getrandbits, 1, 2) |
| 392 | self.assertRaises(ValueError, self.gen.getrandbits, 0) |
| 393 | self.assertRaises(ValueError, self.gen.getrandbits, -1) |
| 394 | |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 395 | def test_randbelow_logic(self, _log=log, int=int): |
| 396 | # check bitcount transition points: 2**i and 2**(i+1)-1 |
| 397 | # show that: k = int(1.001 + _log(n, 2)) |
| 398 | # is equal to or one greater than the number of bits in n |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 399 | for i in range(1, 1000): |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 400 | n = 1 << i # check an exact power of two |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 401 | numbits = i+1 |
| 402 | k = int(1.00001 + _log(n, 2)) |
| 403 | self.assertEqual(k, numbits) |
Guido van Rossum | e61fd5b | 2007-07-11 12:20:59 +0000 | [diff] [blame] | 404 | self.assertEqual(n, 2**(k-1)) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 405 | |
| 406 | n += n - 1 # check 1 below the next power of two |
| 407 | k = int(1.00001 + _log(n, 2)) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 408 | self.assertIn(k, [numbits, numbits+1]) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 409 | self.assertTrue(2**k > n > 2**(k-2)) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 410 | |
| 411 | n -= n >> 15 # check a little farther below the next power of two |
| 412 | k = int(1.00001 + _log(n, 2)) |
| 413 | self.assertEqual(k, numbits) # note the stronger assertion |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 414 | self.assertTrue(2**k > n > 2**(k-1)) # note the stronger assertion |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 415 | |
Thomas Wouters | 902d6eb | 2007-01-09 23:18:33 +0000 | [diff] [blame] | 416 | def test_randrange_bug_1590891(self): |
| 417 | start = 1000000000000 |
| 418 | stop = -100000000000000000000 |
| 419 | step = -200 |
| 420 | x = self.gen.randrange(start, stop, step) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 421 | self.assertTrue(stop < x <= start) |
Thomas Wouters | 902d6eb | 2007-01-09 23:18:33 +0000 | [diff] [blame] | 422 | self.assertEqual((x+stop)%step, 0) |
| 423 | |
Raymond Hettinger | 2d0c256 | 2009-02-19 09:53:18 +0000 | [diff] [blame] | 424 | def gamma(z, sqrt2pi=(2.0*pi)**0.5): |
| 425 | # Reflection to right half of complex plane |
| 426 | if z < 0.5: |
| 427 | return pi / sin(pi*z) / gamma(1.0-z) |
| 428 | # Lanczos approximation with g=7 |
| 429 | az = z + (7.0 - 0.5) |
| 430 | return az ** (z-0.5) / exp(az) * sqrt2pi * fsum([ |
| 431 | 0.9999999999995183, |
| 432 | 676.5203681218835 / z, |
| 433 | -1259.139216722289 / (z+1.0), |
| 434 | 771.3234287757674 / (z+2.0), |
| 435 | -176.6150291498386 / (z+3.0), |
| 436 | 12.50734324009056 / (z+4.0), |
| 437 | -0.1385710331296526 / (z+5.0), |
| 438 | 0.9934937113930748e-05 / (z+6.0), |
| 439 | 0.1659470187408462e-06 / (z+7.0), |
| 440 | ]) |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 441 | |
Raymond Hettinger | 15ec373 | 2003-01-05 01:08:34 +0000 | [diff] [blame] | 442 | class TestDistributions(unittest.TestCase): |
| 443 | def test_zeroinputs(self): |
| 444 | # Verify that distributions can handle a series of zero inputs' |
| 445 | g = random.Random() |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 446 | x = [g.random() for i in range(50)] + [0.0]*5 |
Raymond Hettinger | 15ec373 | 2003-01-05 01:08:34 +0000 | [diff] [blame] | 447 | g.random = x[:].pop; g.uniform(1,10) |
| 448 | g.random = x[:].pop; g.paretovariate(1.0) |
| 449 | g.random = x[:].pop; g.expovariate(1.0) |
| 450 | g.random = x[:].pop; g.weibullvariate(1.0, 1.0) |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 451 | g.random = x[:].pop; g.vonmisesvariate(1.0, 1.0) |
Raymond Hettinger | 15ec373 | 2003-01-05 01:08:34 +0000 | [diff] [blame] | 452 | g.random = x[:].pop; g.normalvariate(0.0, 1.0) |
| 453 | g.random = x[:].pop; g.gauss(0.0, 1.0) |
| 454 | g.random = x[:].pop; g.lognormvariate(0.0, 1.0) |
| 455 | g.random = x[:].pop; g.vonmisesvariate(0.0, 1.0) |
| 456 | g.random = x[:].pop; g.gammavariate(0.01, 1.0) |
| 457 | g.random = x[:].pop; g.gammavariate(1.0, 1.0) |
| 458 | g.random = x[:].pop; g.gammavariate(200.0, 1.0) |
| 459 | g.random = x[:].pop; g.betavariate(3.0, 3.0) |
Christian Heimes | fe337bf | 2008-03-23 21:54:12 +0000 | [diff] [blame] | 460 | g.random = x[:].pop; g.triangular(0.0, 1.0, 1.0/3.0) |
Raymond Hettinger | 15ec373 | 2003-01-05 01:08:34 +0000 | [diff] [blame] | 461 | |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 462 | def test_avg_std(self): |
| 463 | # Use integration to test distribution average and standard deviation. |
| 464 | # Only works for distributions which do not consume variates in pairs |
| 465 | g = random.Random() |
| 466 | N = 5000 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 467 | x = [i/float(N) for i in range(1,N)] |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 468 | for variate, args, mu, sigmasqrd in [ |
| 469 | (g.uniform, (1.0,10.0), (10.0+1.0)/2, (10.0-1.0)**2/12), |
Christian Heimes | fe337bf | 2008-03-23 21:54:12 +0000 | [diff] [blame] | 470 | (g.triangular, (0.0, 1.0, 1.0/3.0), 4.0/9.0, 7.0/9.0/18.0), |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 471 | (g.expovariate, (1.5,), 1/1.5, 1/1.5**2), |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 472 | (g.vonmisesvariate, (1.23, 0), pi, pi**2/3), |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 473 | (g.paretovariate, (5.0,), 5.0/(5.0-1), |
| 474 | 5.0/((5.0-1)**2*(5.0-2))), |
| 475 | (g.weibullvariate, (1.0, 3.0), gamma(1+1/3.0), |
| 476 | gamma(1+2/3.0)-gamma(1+1/3.0)**2) ]: |
| 477 | g.random = x[:].pop |
| 478 | y = [] |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 479 | for i in range(len(x)): |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 480 | try: |
| 481 | y.append(variate(*args)) |
| 482 | except IndexError: |
| 483 | pass |
| 484 | s1 = s2 = 0 |
| 485 | for e in y: |
| 486 | s1 += e |
| 487 | s2 += (e - mu) ** 2 |
| 488 | N = len(y) |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 489 | self.assertAlmostEqual(s1/N, mu, places=2, |
| 490 | msg='%s%r' % (variate.__name__, args)) |
| 491 | self.assertAlmostEqual(s2/(N-1), sigmasqrd, places=2, |
| 492 | msg='%s%r' % (variate.__name__, args)) |
| 493 | |
| 494 | def test_constant(self): |
| 495 | g = random.Random() |
| 496 | N = 100 |
| 497 | for variate, args, expected in [ |
| 498 | (g.uniform, (10.0, 10.0), 10.0), |
| 499 | (g.triangular, (10.0, 10.0), 10.0), |
Andrew Svetlov | b4fd468 | 2013-04-13 18:00:04 +0300 | [diff] [blame] | 500 | #(g.triangular, (10.0, 10.0, 10.0), 10.0), |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 501 | (g.expovariate, (float('inf'),), 0.0), |
| 502 | (g.vonmisesvariate, (3.0, float('inf')), 3.0), |
| 503 | (g.gauss, (10.0, 0.0), 10.0), |
| 504 | (g.lognormvariate, (0.0, 0.0), 1.0), |
| 505 | (g.lognormvariate, (-float('inf'), 0.0), 0.0), |
| 506 | (g.normalvariate, (10.0, 0.0), 10.0), |
| 507 | (g.paretovariate, (float('inf'),), 1.0), |
| 508 | (g.weibullvariate, (10.0, float('inf')), 10.0), |
| 509 | (g.weibullvariate, (0.0, 10.0), 0.0), |
| 510 | ]: |
| 511 | for i in range(N): |
| 512 | self.assertEqual(variate(*args), expected) |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 513 | |
Mark Dickinson | be5f919 | 2013-02-10 14:16:10 +0000 | [diff] [blame] | 514 | def test_von_mises_range(self): |
| 515 | # Issue 17149: von mises variates were not consistently in the |
| 516 | # range [0, 2*PI]. |
| 517 | g = random.Random() |
| 518 | N = 100 |
| 519 | for mu in 0.0, 0.1, 3.1, 6.2: |
| 520 | for kappa in 0.0, 2.3, 500.0: |
| 521 | for _ in range(N): |
| 522 | sample = g.vonmisesvariate(mu, kappa) |
| 523 | self.assertTrue( |
| 524 | 0 <= sample <= random.TWOPI, |
| 525 | msg=("vonmisesvariate({}, {}) produced a result {} out" |
| 526 | " of range [0, 2*pi]").format(mu, kappa, sample)) |
| 527 | |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 528 | def test_von_mises_large_kappa(self): |
| 529 | # Issue #17141: vonmisesvariate() was hang for large kappas |
| 530 | random.vonmisesvariate(0, 1e15) |
| 531 | random.vonmisesvariate(0, 1e100) |
| 532 | |
| 533 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 534 | class TestModule(unittest.TestCase): |
| 535 | def testMagicConstants(self): |
| 536 | self.assertAlmostEqual(random.NV_MAGICCONST, 1.71552776992141) |
| 537 | self.assertAlmostEqual(random.TWOPI, 6.28318530718) |
| 538 | self.assertAlmostEqual(random.LOG4, 1.38629436111989) |
| 539 | self.assertAlmostEqual(random.SG_MAGICCONST, 2.50407739677627) |
| 540 | |
| 541 | def test__all__(self): |
| 542 | # tests validity but not completeness of the __all__ list |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 543 | self.assertTrue(set(random.__all__) <= set(dir(random))) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 544 | |
Thomas Wouters | b213704 | 2007-02-01 18:02:27 +0000 | [diff] [blame] | 545 | def test_random_subclass_with_kwargs(self): |
| 546 | # SF bug #1486663 -- this used to erroneously raise a TypeError |
| 547 | class Subclass(random.Random): |
| 548 | def __init__(self, newarg=None): |
| 549 | random.Random.__init__(self) |
| 550 | Subclass(newarg=1) |
| 551 | |
| 552 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 553 | if __name__ == "__main__": |
Ezio Melotti | 3e4a98b | 2013-04-19 05:45:27 +0300 | [diff] [blame] | 554 | unittest.main() |