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 |
R David Murray | e3e1c17 | 2013-04-02 12:47:23 -0400 | [diff] [blame] | 4 | import unittest.mock |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 5 | import random |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 6 | import time |
Raymond Hettinger | 5f078ff | 2003-06-24 20:29:04 +0000 | [diff] [blame] | 7 | import pickle |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 8 | import warnings |
R David Murray | e3e1c17 | 2013-04-02 12:47:23 -0400 | [diff] [blame] | 9 | from functools import partial |
Georg Brandl | 1b37e87 | 2010-03-14 10:45:50 +0000 | [diff] [blame] | 10 | from math import log, exp, pi, fsum, sin |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 11 | from test import support |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 12 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 13 | class TestBasicOps(unittest.TestCase): |
| 14 | # Superclass with tests common to all generators. |
| 15 | # Subclasses must arrange for self.gen to retrieve the Random instance |
| 16 | # to be tested. |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 17 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 18 | def randomlist(self, n): |
| 19 | """Helper function to make a list of random numbers""" |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 20 | return [self.gen.random() for i in range(n)] |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 21 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 22 | def test_autoseed(self): |
| 23 | self.gen.seed() |
| 24 | state1 = self.gen.getstate() |
Raymond Hettinger | 3081d59 | 2003-08-09 18:30:57 +0000 | [diff] [blame] | 25 | time.sleep(0.1) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 26 | self.gen.seed() # diffent seeds at different times |
| 27 | state2 = self.gen.getstate() |
| 28 | self.assertNotEqual(state1, state2) |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 29 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 30 | def test_saverestore(self): |
| 31 | N = 1000 |
| 32 | self.gen.seed() |
| 33 | state = self.gen.getstate() |
| 34 | randseq = self.randomlist(N) |
| 35 | self.gen.setstate(state) # should regenerate the same sequence |
| 36 | self.assertEqual(randseq, self.randomlist(N)) |
| 37 | |
| 38 | def test_seedargs(self): |
Mark Dickinson | 95aeae0 | 2012-06-24 11:05:30 +0100 | [diff] [blame] | 39 | # Seed value with a negative hash. |
| 40 | class MySeed(object): |
| 41 | def __hash__(self): |
| 42 | return -1729 |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 43 | 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] | 44 | 3.14, 1+2j, 'a', tuple('abc'), MySeed()]: |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 45 | self.gen.seed(arg) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 46 | for arg in [list(range(3)), dict(one=1)]: |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 47 | self.assertRaises(TypeError, self.gen.seed, arg) |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 48 | self.assertRaises(TypeError, self.gen.seed, 1, 2, 3, 4) |
Raymond Hettinger | 5833587 | 2004-07-09 14:26:18 +0000 | [diff] [blame] | 49 | self.assertRaises(TypeError, type(self.gen), []) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 50 | |
R David Murray | e3e1c17 | 2013-04-02 12:47:23 -0400 | [diff] [blame] | 51 | @unittest.mock.patch('random._urandom') # os.urandom |
| 52 | def test_seed_when_randomness_source_not_found(self, urandom_mock): |
| 53 | # Random.seed() uses time.time() when an operating system specific |
| 54 | # randomness source is not found. To test this on machines were it |
| 55 | # exists, run the above test, test_seedargs(), again after mocking |
| 56 | # os.urandom() so that it raises the exception expected when the |
| 57 | # randomness source is not available. |
| 58 | urandom_mock.side_effect = NotImplementedError |
| 59 | self.test_seedargs() |
| 60 | |
Antoine Pitrou | 5e39433 | 2012-11-04 02:10:33 +0100 | [diff] [blame] | 61 | def test_shuffle(self): |
| 62 | shuffle = self.gen.shuffle |
| 63 | lst = [] |
| 64 | shuffle(lst) |
| 65 | self.assertEqual(lst, []) |
| 66 | lst = [37] |
| 67 | shuffle(lst) |
| 68 | self.assertEqual(lst, [37]) |
| 69 | seqs = [list(range(n)) for n in range(10)] |
| 70 | shuffled_seqs = [list(range(n)) for n in range(10)] |
| 71 | for shuffled_seq in shuffled_seqs: |
| 72 | shuffle(shuffled_seq) |
| 73 | for (seq, shuffled_seq) in zip(seqs, shuffled_seqs): |
| 74 | self.assertEqual(len(seq), len(shuffled_seq)) |
| 75 | self.assertEqual(set(seq), set(shuffled_seq)) |
| 76 | |
| 77 | # The above tests all would pass if the shuffle was a |
| 78 | # no-op. The following non-deterministic test covers that. It |
| 79 | # asserts that the shuffled sequence of 1000 distinct elements |
| 80 | # must be different from the original one. Although there is |
| 81 | # mathematically a non-zero probability that this could |
| 82 | # actually happen in a genuinely random shuffle, it is |
| 83 | # completely negligible, given that the number of possible |
| 84 | # permutations of 1000 objects is 1000! (factorial of 1000), |
| 85 | # which is considerably larger than the number of atoms in the |
| 86 | # universe... |
| 87 | lst = list(range(1000)) |
| 88 | shuffled_lst = list(range(1000)) |
| 89 | shuffle(shuffled_lst) |
| 90 | self.assertTrue(lst != shuffled_lst) |
| 91 | shuffle(lst) |
| 92 | self.assertTrue(lst != shuffled_lst) |
| 93 | |
Raymond Hettinger | dc4872e | 2010-09-07 10:06:56 +0000 | [diff] [blame] | 94 | def test_choice(self): |
| 95 | choice = self.gen.choice |
| 96 | with self.assertRaises(IndexError): |
| 97 | choice([]) |
| 98 | self.assertEqual(choice([50]), 50) |
| 99 | self.assertIn(choice([25, 75]), [25, 75]) |
| 100 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 101 | def test_sample(self): |
| 102 | # For the entire allowable range of 0 <= k <= N, validate that |
| 103 | # the sample is of the correct length and contains only unique items |
| 104 | N = 100 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 105 | population = range(N) |
| 106 | for k in range(N+1): |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 107 | s = self.gen.sample(population, k) |
| 108 | self.assertEqual(len(s), k) |
Raymond Hettinger | a690a99 | 2003-11-16 16:17:49 +0000 | [diff] [blame] | 109 | uniq = set(s) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 110 | self.assertEqual(len(uniq), k) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 111 | self.assertTrue(uniq <= set(population)) |
Raymond Hettinger | 8ec7881 | 2003-01-04 05:55:11 +0000 | [diff] [blame] | 112 | self.assertEqual(self.gen.sample([], 0), []) # test edge case N==k==0 |
R David Murray | e3e1c17 | 2013-04-02 12:47:23 -0400 | [diff] [blame] | 113 | # Exception raised if size of sample exceeds that of population |
| 114 | self.assertRaises(ValueError, self.gen.sample, population, N+1) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 115 | |
Raymond Hettinger | 7b0cf76 | 2003-01-17 17:23:23 +0000 | [diff] [blame] | 116 | def test_sample_distribution(self): |
| 117 | # For the entire allowable range of 0 <= k <= N, validate that |
| 118 | # sample generates all possible permutations |
| 119 | n = 5 |
| 120 | pop = range(n) |
| 121 | trials = 10000 # large num prevents false negatives without slowing normal case |
| 122 | def factorial(n): |
Guido van Rossum | 89da5d7 | 2006-08-22 00:21:25 +0000 | [diff] [blame] | 123 | if n == 0: |
| 124 | return 1 |
| 125 | return n * factorial(n - 1) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 126 | for k in range(n): |
Raymond Hettinger | ffdb8bb | 2004-09-27 15:29:05 +0000 | [diff] [blame] | 127 | expected = factorial(n) // factorial(n-k) |
Raymond Hettinger | 7b0cf76 | 2003-01-17 17:23:23 +0000 | [diff] [blame] | 128 | perms = {} |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 129 | for i in range(trials): |
Raymond Hettinger | 7b0cf76 | 2003-01-17 17:23:23 +0000 | [diff] [blame] | 130 | perms[tuple(self.gen.sample(pop, k))] = None |
| 131 | if len(perms) == expected: |
| 132 | break |
| 133 | else: |
| 134 | self.fail() |
| 135 | |
Raymond Hettinger | 66d09f1 | 2003-09-06 04:25:54 +0000 | [diff] [blame] | 136 | def test_sample_inputs(self): |
| 137 | # SF bug #801342 -- population can be any iterable defining __len__() |
Raymond Hettinger | a690a99 | 2003-11-16 16:17:49 +0000 | [diff] [blame] | 138 | self.gen.sample(set(range(20)), 2) |
Raymond Hettinger | 66d09f1 | 2003-09-06 04:25:54 +0000 | [diff] [blame] | 139 | self.gen.sample(range(20), 2) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 140 | self.gen.sample(range(20), 2) |
Raymond Hettinger | 66d09f1 | 2003-09-06 04:25:54 +0000 | [diff] [blame] | 141 | self.gen.sample(str('abcdefghijklmnopqrst'), 2) |
| 142 | self.gen.sample(tuple('abcdefghijklmnopqrst'), 2) |
| 143 | |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 144 | def test_sample_on_dicts(self): |
Raymond Hettinger | 1acde19 | 2008-01-14 01:00:53 +0000 | [diff] [blame] | 145 | self.assertRaises(TypeError, self.gen.sample, dict.fromkeys('abcdef'), 2) |
Thomas Wouters | 49fd7fa | 2006-04-21 10:40:58 +0000 | [diff] [blame] | 146 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 147 | def test_gauss(self): |
| 148 | # Ensure that the seed() method initializes all the hidden state. In |
| 149 | # particular, through 2.2.1 it failed to reset a piece of state used |
| 150 | # by (and only by) the .gauss() method. |
| 151 | |
| 152 | for seed in 1, 12, 123, 1234, 12345, 123456, 654321: |
| 153 | self.gen.seed(seed) |
| 154 | x1 = self.gen.random() |
| 155 | y1 = self.gen.gauss(0, 1) |
| 156 | |
| 157 | self.gen.seed(seed) |
| 158 | x2 = self.gen.random() |
| 159 | y2 = self.gen.gauss(0, 1) |
| 160 | |
| 161 | self.assertEqual(x1, x2) |
| 162 | self.assertEqual(y1, y2) |
| 163 | |
Raymond Hettinger | 5f078ff | 2003-06-24 20:29:04 +0000 | [diff] [blame] | 164 | def test_pickling(self): |
| 165 | state = pickle.dumps(self.gen) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 166 | origseq = [self.gen.random() for i in range(10)] |
Raymond Hettinger | 5f078ff | 2003-06-24 20:29:04 +0000 | [diff] [blame] | 167 | newgen = pickle.loads(state) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 168 | restoredseq = [newgen.random() for i in range(10)] |
Raymond Hettinger | 5f078ff | 2003-06-24 20:29:04 +0000 | [diff] [blame] | 169 | self.assertEqual(origseq, restoredseq) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 170 | |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 171 | def test_bug_1727780(self): |
| 172 | # verify that version-2-pickles can be loaded |
| 173 | # fine, whether they are created on 32-bit or 64-bit |
| 174 | # platforms, and that version-3-pickles load fine. |
| 175 | files = [("randv2_32.pck", 780), |
| 176 | ("randv2_64.pck", 866), |
| 177 | ("randv3.pck", 343)] |
| 178 | for file, value in files: |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 179 | f = open(support.findfile(file),"rb") |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 180 | r = pickle.load(f) |
| 181 | f.close() |
Raymond Hettinger | 0515661 | 2010-09-07 04:44:52 +0000 | [diff] [blame] | 182 | self.assertEqual(int(r.random()*1000), value) |
| 183 | |
| 184 | def test_bug_9025(self): |
| 185 | # Had problem with an uneven distribution in int(n*random()) |
| 186 | # Verify the fix by checking that distributions fall within expectations. |
| 187 | n = 100000 |
| 188 | randrange = self.gen.randrange |
| 189 | k = sum(randrange(6755399441055744) % 3 == 2 for i in range(n)) |
| 190 | self.assertTrue(0.30 < k/n < .37, (k/n)) |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 191 | |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 192 | class SystemRandom_TestBasicOps(TestBasicOps): |
| 193 | gen = random.SystemRandom() |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 194 | |
| 195 | def test_autoseed(self): |
| 196 | # Doesn't need to do anything except not fail |
| 197 | self.gen.seed() |
| 198 | |
| 199 | def test_saverestore(self): |
| 200 | self.assertRaises(NotImplementedError, self.gen.getstate) |
| 201 | self.assertRaises(NotImplementedError, self.gen.setstate, None) |
| 202 | |
| 203 | def test_seedargs(self): |
| 204 | # Doesn't need to do anything except not fail |
| 205 | self.gen.seed(100) |
| 206 | |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 207 | def test_gauss(self): |
| 208 | self.gen.gauss_next = None |
| 209 | self.gen.seed(100) |
| 210 | self.assertEqual(self.gen.gauss_next, None) |
| 211 | |
| 212 | def test_pickling(self): |
| 213 | self.assertRaises(NotImplementedError, pickle.dumps, self.gen) |
| 214 | |
| 215 | def test_53_bits_per_float(self): |
| 216 | # This should pass whenever a C double has 53 bit precision. |
| 217 | span = 2 ** 53 |
| 218 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 219 | for i in range(100): |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 220 | cum |= int(self.gen.random() * span) |
| 221 | self.assertEqual(cum, span-1) |
| 222 | |
| 223 | def test_bigrand(self): |
| 224 | # The randrange routine should build-up the required number of bits |
| 225 | # in stages so that all bit positions are active. |
| 226 | span = 2 ** 500 |
| 227 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 228 | for i in range(100): |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 229 | r = self.gen.randrange(span) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 230 | self.assertTrue(0 <= r < span) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 231 | cum |= r |
| 232 | self.assertEqual(cum, span-1) |
| 233 | |
| 234 | def test_bigrand_ranges(self): |
| 235 | for i in [40,80, 160, 200, 211, 250, 375, 512, 550]: |
| 236 | start = self.gen.randrange(2 ** i) |
| 237 | stop = self.gen.randrange(2 ** (i-2)) |
| 238 | if stop <= start: |
| 239 | return |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 240 | self.assertTrue(start <= self.gen.randrange(start, stop) < stop) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 241 | |
| 242 | def test_rangelimits(self): |
| 243 | for start, stop in [(-2,0), (-(2**60)-2,-(2**60)), (2**60,2**60+2)]: |
| 244 | self.assertEqual(set(range(start,stop)), |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 245 | set([self.gen.randrange(start,stop) for i in range(100)])) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 246 | |
R David Murray | e3e1c17 | 2013-04-02 12:47:23 -0400 | [diff] [blame] | 247 | def test_randrange_nonunit_step(self): |
| 248 | rint = self.gen.randrange(0, 10, 2) |
| 249 | self.assertIn(rint, (0, 2, 4, 6, 8)) |
| 250 | rint = self.gen.randrange(0, 2, 2) |
| 251 | self.assertEqual(rint, 0) |
| 252 | |
| 253 | def test_randrange_errors(self): |
| 254 | raises = partial(self.assertRaises, ValueError, self.gen.randrange) |
| 255 | # Empty range |
| 256 | raises(3, 3) |
| 257 | raises(-721) |
| 258 | raises(0, 100, -12) |
| 259 | # Non-integer start/stop |
| 260 | raises(3.14159) |
| 261 | raises(0, 2.71828) |
| 262 | # Zero and non-integer step |
| 263 | raises(0, 42, 0) |
| 264 | raises(0, 42, 3.14159) |
| 265 | |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 266 | def test_genrandbits(self): |
| 267 | # Verify ranges |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 268 | for k in range(1, 1000): |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 269 | self.assertTrue(0 <= self.gen.getrandbits(k) < 2**k) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 270 | |
| 271 | # Verify all bits active |
| 272 | getbits = self.gen.getrandbits |
| 273 | for span in [1, 2, 3, 4, 31, 32, 32, 52, 53, 54, 119, 127, 128, 129]: |
| 274 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 275 | for i in range(100): |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 276 | cum |= getbits(span) |
| 277 | self.assertEqual(cum, 2**span-1) |
| 278 | |
| 279 | # Verify argument checking |
| 280 | self.assertRaises(TypeError, self.gen.getrandbits) |
| 281 | self.assertRaises(TypeError, self.gen.getrandbits, 1, 2) |
| 282 | self.assertRaises(ValueError, self.gen.getrandbits, 0) |
| 283 | self.assertRaises(ValueError, self.gen.getrandbits, -1) |
| 284 | self.assertRaises(TypeError, self.gen.getrandbits, 10.1) |
| 285 | |
| 286 | def test_randbelow_logic(self, _log=log, int=int): |
| 287 | # check bitcount transition points: 2**i and 2**(i+1)-1 |
| 288 | # show that: k = int(1.001 + _log(n, 2)) |
| 289 | # 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] | 290 | for i in range(1, 1000): |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 291 | n = 1 << i # check an exact power of two |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 292 | numbits = i+1 |
| 293 | k = int(1.00001 + _log(n, 2)) |
| 294 | self.assertEqual(k, numbits) |
Guido van Rossum | e61fd5b | 2007-07-11 12:20:59 +0000 | [diff] [blame] | 295 | self.assertEqual(n, 2**(k-1)) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 296 | |
| 297 | n += n - 1 # check 1 below the next power of two |
| 298 | k = int(1.00001 + _log(n, 2)) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 299 | self.assertIn(k, [numbits, numbits+1]) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 300 | self.assertTrue(2**k > n > 2**(k-2)) |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 301 | |
| 302 | n -= n >> 15 # check a little farther below the next power of two |
| 303 | k = int(1.00001 + _log(n, 2)) |
| 304 | self.assertEqual(k, numbits) # note the stronger assertion |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 305 | self.assertTrue(2**k > n > 2**(k-1)) # note the stronger assertion |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 306 | |
| 307 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 308 | class MersenneTwister_TestBasicOps(TestBasicOps): |
| 309 | gen = random.Random() |
| 310 | |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 311 | def test_guaranteed_stable(self): |
| 312 | # These sequences are guaranteed to stay the same across versions of python |
| 313 | self.gen.seed(3456147, version=1) |
| 314 | self.assertEqual([self.gen.random().hex() for i in range(4)], |
| 315 | ['0x1.ac362300d90d2p-1', '0x1.9d16f74365005p-1', |
| 316 | '0x1.1ebb4352e4c4dp-1', '0x1.1a7422abf9c11p-1']) |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 317 | self.gen.seed("the quick brown fox", version=2) |
| 318 | self.assertEqual([self.gen.random().hex() for i in range(4)], |
Raymond Hettinger | 3fcf002 | 2010-12-08 01:13:53 +0000 | [diff] [blame] | 319 | ['0x1.1239ddfb11b7cp-3', '0x1.b3cbb5c51b120p-4', |
| 320 | '0x1.8c4f55116b60fp-1', '0x1.63eb525174a27p-1']) |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 321 | |
Raymond Hettinger | 5833587 | 2004-07-09 14:26:18 +0000 | [diff] [blame] | 322 | def test_setstate_first_arg(self): |
| 323 | self.assertRaises(ValueError, self.gen.setstate, (1, None, None)) |
| 324 | |
| 325 | def test_setstate_middle_arg(self): |
| 326 | # Wrong type, s/b tuple |
| 327 | self.assertRaises(TypeError, self.gen.setstate, (2, None, None)) |
| 328 | # Wrong length, s/b 625 |
| 329 | self.assertRaises(ValueError, self.gen.setstate, (2, (1,2,3), None)) |
| 330 | # Wrong type, s/b tuple of 625 ints |
| 331 | self.assertRaises(TypeError, self.gen.setstate, (2, ('a',)*625, None)) |
| 332 | # Last element s/b an int also |
| 333 | self.assertRaises(TypeError, self.gen.setstate, (2, (0,)*624+('a',), None)) |
| 334 | |
R David Murray | e3e1c17 | 2013-04-02 12:47:23 -0400 | [diff] [blame] | 335 | # Little trick to make "tuple(x % (2**32) for x in internalstate)" |
| 336 | # raise ValueError. I cannot think of a simple way to achieve this, so |
| 337 | # I am opting for using a generator as the middle argument of setstate |
| 338 | # which attempts to cast a NaN to integer. |
| 339 | state_values = self.gen.getstate()[1] |
| 340 | state_values = list(state_values) |
| 341 | state_values[-1] = float('nan') |
| 342 | state = (int(x) for x in state_values) |
| 343 | self.assertRaises(TypeError, self.gen.setstate, (2, state, None)) |
| 344 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 345 | def test_referenceImplementation(self): |
| 346 | # Compare the python implementation with results from the original |
| 347 | # code. Create 2000 53-bit precision random floats. Compare only |
| 348 | # the last ten entries to show that the independent implementations |
| 349 | # are tracking. Here is the main() function needed to create the |
| 350 | # list of expected random numbers: |
| 351 | # void main(void){ |
| 352 | # int i; |
| 353 | # unsigned long init[4]={61731, 24903, 614, 42143}, length=4; |
| 354 | # init_by_array(init, length); |
| 355 | # for (i=0; i<2000; i++) { |
| 356 | # printf("%.15f ", genrand_res53()); |
| 357 | # if (i%5==4) printf("\n"); |
| 358 | # } |
| 359 | # } |
| 360 | expected = [0.45839803073713259, |
| 361 | 0.86057815201978782, |
| 362 | 0.92848331726782152, |
| 363 | 0.35932681119782461, |
| 364 | 0.081823493762449573, |
| 365 | 0.14332226470169329, |
| 366 | 0.084297823823520024, |
| 367 | 0.53814864671831453, |
| 368 | 0.089215024911993401, |
| 369 | 0.78486196105372907] |
| 370 | |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 371 | self.gen.seed(61731 + (24903<<32) + (614<<64) + (42143<<96)) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 372 | actual = self.randomlist(2000)[-10:] |
| 373 | for a, e in zip(actual, expected): |
| 374 | self.assertAlmostEqual(a,e,places=14) |
| 375 | |
| 376 | def test_strong_reference_implementation(self): |
| 377 | # Like test_referenceImplementation, but checks for exact bit-level |
| 378 | # equality. This should pass on any box where C double contains |
| 379 | # at least 53 bits of precision (the underlying algorithm suffers |
| 380 | # no rounding errors -- all results are exact). |
| 381 | from math import ldexp |
| 382 | |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 383 | expected = [0x0eab3258d2231f, |
| 384 | 0x1b89db315277a5, |
| 385 | 0x1db622a5518016, |
| 386 | 0x0b7f9af0d575bf, |
| 387 | 0x029e4c4db82240, |
| 388 | 0x04961892f5d673, |
| 389 | 0x02b291598e4589, |
| 390 | 0x11388382c15694, |
| 391 | 0x02dad977c9e1fe, |
| 392 | 0x191d96d4d334c6] |
| 393 | self.gen.seed(61731 + (24903<<32) + (614<<64) + (42143<<96)) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 394 | actual = self.randomlist(2000)[-10:] |
| 395 | for a, e in zip(actual, expected): |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 396 | self.assertEqual(int(ldexp(a, 53)), e) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 397 | |
| 398 | def test_long_seed(self): |
| 399 | # This is most interesting to run in debug mode, just to make sure |
| 400 | # nothing blows up. Under the covers, a dynamically resized array |
| 401 | # is allocated, consuming space proportional to the number of bits |
| 402 | # in the seed. Unfortunately, that's a quadratic-time algorithm, |
| 403 | # so don't make this horribly big. |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 404 | seed = (1 << (10000 * 8)) - 1 # about 10K bytes |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 405 | self.gen.seed(seed) |
| 406 | |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 407 | def test_53_bits_per_float(self): |
| 408 | # This should pass whenever a C double has 53 bit precision. |
| 409 | span = 2 ** 53 |
| 410 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 411 | for i in range(100): |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 412 | cum |= int(self.gen.random() * span) |
| 413 | self.assertEqual(cum, span-1) |
| 414 | |
| 415 | def test_bigrand(self): |
| 416 | # The randrange routine should build-up the required number of bits |
| 417 | # in stages so that all bit positions are active. |
| 418 | span = 2 ** 500 |
| 419 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 420 | for i in range(100): |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 421 | r = self.gen.randrange(span) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 422 | self.assertTrue(0 <= r < span) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 423 | cum |= r |
| 424 | self.assertEqual(cum, span-1) |
| 425 | |
| 426 | def test_bigrand_ranges(self): |
| 427 | for i in [40,80, 160, 200, 211, 250, 375, 512, 550]: |
| 428 | start = self.gen.randrange(2 ** i) |
| 429 | stop = self.gen.randrange(2 ** (i-2)) |
| 430 | if stop <= start: |
| 431 | return |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 432 | self.assertTrue(start <= self.gen.randrange(start, stop) < stop) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 433 | |
| 434 | def test_rangelimits(self): |
| 435 | 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] | 436 | self.assertEqual(set(range(start,stop)), |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 437 | set([self.gen.randrange(start,stop) for i in range(100)])) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 438 | |
| 439 | def test_genrandbits(self): |
| 440 | # Verify cross-platform repeatability |
| 441 | self.gen.seed(1234567) |
| 442 | self.assertEqual(self.gen.getrandbits(100), |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 443 | 97904845777343510404718956115) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 444 | # Verify ranges |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 445 | for k in range(1, 1000): |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 446 | self.assertTrue(0 <= self.gen.getrandbits(k) < 2**k) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 447 | |
| 448 | # Verify all bits active |
| 449 | getbits = self.gen.getrandbits |
| 450 | for span in [1, 2, 3, 4, 31, 32, 32, 52, 53, 54, 119, 127, 128, 129]: |
| 451 | cum = 0 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 452 | for i in range(100): |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 453 | cum |= getbits(span) |
| 454 | self.assertEqual(cum, 2**span-1) |
| 455 | |
Raymond Hettinger | 5833587 | 2004-07-09 14:26:18 +0000 | [diff] [blame] | 456 | # Verify argument checking |
| 457 | self.assertRaises(TypeError, self.gen.getrandbits) |
| 458 | self.assertRaises(TypeError, self.gen.getrandbits, 'a') |
| 459 | self.assertRaises(TypeError, self.gen.getrandbits, 1, 2) |
| 460 | self.assertRaises(ValueError, self.gen.getrandbits, 0) |
| 461 | self.assertRaises(ValueError, self.gen.getrandbits, -1) |
| 462 | |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 463 | def test_randbelow_logic(self, _log=log, int=int): |
| 464 | # check bitcount transition points: 2**i and 2**(i+1)-1 |
| 465 | # show that: k = int(1.001 + _log(n, 2)) |
| 466 | # 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] | 467 | for i in range(1, 1000): |
Guido van Rossum | e2a383d | 2007-01-15 16:59:06 +0000 | [diff] [blame] | 468 | n = 1 << i # check an exact power of two |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 469 | numbits = i+1 |
| 470 | k = int(1.00001 + _log(n, 2)) |
| 471 | self.assertEqual(k, numbits) |
Guido van Rossum | e61fd5b | 2007-07-11 12:20:59 +0000 | [diff] [blame] | 472 | self.assertEqual(n, 2**(k-1)) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 473 | |
| 474 | n += n - 1 # check 1 below the next power of two |
| 475 | k = int(1.00001 + _log(n, 2)) |
Benjamin Peterson | 577473f | 2010-01-19 00:09:57 +0000 | [diff] [blame] | 476 | self.assertIn(k, [numbits, numbits+1]) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 477 | self.assertTrue(2**k > n > 2**(k-2)) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 478 | |
| 479 | n -= n >> 15 # check a little farther below the next power of two |
| 480 | k = int(1.00001 + _log(n, 2)) |
| 481 | self.assertEqual(k, numbits) # note the stronger assertion |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 482 | self.assertTrue(2**k > n > 2**(k-1)) # note the stronger assertion |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 483 | |
R David Murray | e3e1c17 | 2013-04-02 12:47:23 -0400 | [diff] [blame] | 484 | @unittest.mock.patch('random.Random.random') |
| 485 | def test_randbelow_overriden_random(self, random_mock): |
| 486 | # Random._randbelow() can only use random() when the built-in one |
| 487 | # has been overridden but no new getrandbits() method was supplied. |
| 488 | random_mock.side_effect = random.SystemRandom().random |
| 489 | maxsize = 1<<random.BPF |
| 490 | with warnings.catch_warnings(): |
| 491 | warnings.simplefilter("ignore", UserWarning) |
| 492 | # Population range too large (n >= maxsize) |
| 493 | self.gen._randbelow(maxsize+1, maxsize = maxsize) |
| 494 | self.gen._randbelow(5640, maxsize = maxsize) |
| 495 | |
| 496 | # This might be going too far to test a single line, but because of our |
| 497 | # noble aim of achieving 100% test coverage we need to write a case in |
| 498 | # which the following line in Random._randbelow() gets executed: |
| 499 | # |
| 500 | # rem = maxsize % n |
| 501 | # limit = (maxsize - rem) / maxsize |
| 502 | # r = random() |
| 503 | # while r >= limit: |
| 504 | # r = random() # <== *This line* <==< |
| 505 | # |
| 506 | # Therefore, to guarantee that the while loop is executed at least |
| 507 | # once, we need to mock random() so that it returns a number greater |
| 508 | # than 'limit' the first time it gets called. |
| 509 | |
| 510 | n = 42 |
| 511 | epsilon = 0.01 |
| 512 | limit = (maxsize - (maxsize % n)) / maxsize |
| 513 | random_mock.side_effect = [limit + epsilon, limit - epsilon] |
| 514 | self.gen._randbelow(n, maxsize = maxsize) |
| 515 | |
Thomas Wouters | 902d6eb | 2007-01-09 23:18:33 +0000 | [diff] [blame] | 516 | def test_randrange_bug_1590891(self): |
| 517 | start = 1000000000000 |
| 518 | stop = -100000000000000000000 |
| 519 | step = -200 |
| 520 | x = self.gen.randrange(start, stop, step) |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 521 | self.assertTrue(stop < x <= start) |
Thomas Wouters | 902d6eb | 2007-01-09 23:18:33 +0000 | [diff] [blame] | 522 | self.assertEqual((x+stop)%step, 0) |
| 523 | |
Raymond Hettinger | 2d0c256 | 2009-02-19 09:53:18 +0000 | [diff] [blame] | 524 | def gamma(z, sqrt2pi=(2.0*pi)**0.5): |
| 525 | # Reflection to right half of complex plane |
| 526 | if z < 0.5: |
| 527 | return pi / sin(pi*z) / gamma(1.0-z) |
| 528 | # Lanczos approximation with g=7 |
| 529 | az = z + (7.0 - 0.5) |
| 530 | return az ** (z-0.5) / exp(az) * sqrt2pi * fsum([ |
| 531 | 0.9999999999995183, |
| 532 | 676.5203681218835 / z, |
| 533 | -1259.139216722289 / (z+1.0), |
| 534 | 771.3234287757674 / (z+2.0), |
| 535 | -176.6150291498386 / (z+3.0), |
| 536 | 12.50734324009056 / (z+4.0), |
| 537 | -0.1385710331296526 / (z+5.0), |
| 538 | 0.9934937113930748e-05 / (z+6.0), |
| 539 | 0.1659470187408462e-06 / (z+7.0), |
| 540 | ]) |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 541 | |
Raymond Hettinger | 15ec373 | 2003-01-05 01:08:34 +0000 | [diff] [blame] | 542 | class TestDistributions(unittest.TestCase): |
| 543 | def test_zeroinputs(self): |
| 544 | # Verify that distributions can handle a series of zero inputs' |
| 545 | g = random.Random() |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 546 | x = [g.random() for i in range(50)] + [0.0]*5 |
Raymond Hettinger | 15ec373 | 2003-01-05 01:08:34 +0000 | [diff] [blame] | 547 | g.random = x[:].pop; g.uniform(1,10) |
| 548 | g.random = x[:].pop; g.paretovariate(1.0) |
| 549 | g.random = x[:].pop; g.expovariate(1.0) |
| 550 | g.random = x[:].pop; g.weibullvariate(1.0, 1.0) |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 551 | g.random = x[:].pop; g.vonmisesvariate(1.0, 1.0) |
Raymond Hettinger | 15ec373 | 2003-01-05 01:08:34 +0000 | [diff] [blame] | 552 | g.random = x[:].pop; g.normalvariate(0.0, 1.0) |
| 553 | g.random = x[:].pop; g.gauss(0.0, 1.0) |
| 554 | g.random = x[:].pop; g.lognormvariate(0.0, 1.0) |
| 555 | g.random = x[:].pop; g.vonmisesvariate(0.0, 1.0) |
| 556 | g.random = x[:].pop; g.gammavariate(0.01, 1.0) |
| 557 | g.random = x[:].pop; g.gammavariate(1.0, 1.0) |
| 558 | g.random = x[:].pop; g.gammavariate(200.0, 1.0) |
| 559 | g.random = x[:].pop; g.betavariate(3.0, 3.0) |
Christian Heimes | fe337bf | 2008-03-23 21:54:12 +0000 | [diff] [blame] | 560 | 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] | 561 | |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 562 | def test_avg_std(self): |
| 563 | # Use integration to test distribution average and standard deviation. |
| 564 | # Only works for distributions which do not consume variates in pairs |
| 565 | g = random.Random() |
| 566 | N = 5000 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 567 | x = [i/float(N) for i in range(1,N)] |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 568 | for variate, args, mu, sigmasqrd in [ |
| 569 | (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] | 570 | (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] | 571 | (g.expovariate, (1.5,), 1/1.5, 1/1.5**2), |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 572 | (g.vonmisesvariate, (1.23, 0), pi, pi**2/3), |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 573 | (g.paretovariate, (5.0,), 5.0/(5.0-1), |
| 574 | 5.0/((5.0-1)**2*(5.0-2))), |
| 575 | (g.weibullvariate, (1.0, 3.0), gamma(1+1/3.0), |
| 576 | gamma(1+2/3.0)-gamma(1+1/3.0)**2) ]: |
| 577 | g.random = x[:].pop |
| 578 | y = [] |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 579 | for i in range(len(x)): |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 580 | try: |
| 581 | y.append(variate(*args)) |
| 582 | except IndexError: |
| 583 | pass |
| 584 | s1 = s2 = 0 |
| 585 | for e in y: |
| 586 | s1 += e |
| 587 | s2 += (e - mu) ** 2 |
| 588 | N = len(y) |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 589 | self.assertAlmostEqual(s1/N, mu, places=2, |
| 590 | msg='%s%r' % (variate.__name__, args)) |
| 591 | self.assertAlmostEqual(s2/(N-1), sigmasqrd, places=2, |
| 592 | msg='%s%r' % (variate.__name__, args)) |
| 593 | |
| 594 | def test_constant(self): |
| 595 | g = random.Random() |
| 596 | N = 100 |
| 597 | for variate, args, expected in [ |
| 598 | (g.uniform, (10.0, 10.0), 10.0), |
| 599 | (g.triangular, (10.0, 10.0), 10.0), |
| 600 | #(g.triangular, (10.0, 10.0, 10.0), 10.0), |
| 601 | (g.expovariate, (float('inf'),), 0.0), |
| 602 | (g.vonmisesvariate, (3.0, float('inf')), 3.0), |
| 603 | (g.gauss, (10.0, 0.0), 10.0), |
| 604 | (g.lognormvariate, (0.0, 0.0), 1.0), |
| 605 | (g.lognormvariate, (-float('inf'), 0.0), 0.0), |
| 606 | (g.normalvariate, (10.0, 0.0), 10.0), |
| 607 | (g.paretovariate, (float('inf'),), 1.0), |
| 608 | (g.weibullvariate, (10.0, float('inf')), 10.0), |
| 609 | (g.weibullvariate, (0.0, 10.0), 0.0), |
| 610 | ]: |
| 611 | for i in range(N): |
| 612 | self.assertEqual(variate(*args), expected) |
Raymond Hettinger | 3dd990c | 2003-01-05 09:20:06 +0000 | [diff] [blame] | 613 | |
Mark Dickinson | be5f919 | 2013-02-10 14:16:10 +0000 | [diff] [blame] | 614 | def test_von_mises_range(self): |
| 615 | # Issue 17149: von mises variates were not consistently in the |
| 616 | # range [0, 2*PI]. |
| 617 | g = random.Random() |
| 618 | N = 100 |
| 619 | for mu in 0.0, 0.1, 3.1, 6.2: |
| 620 | for kappa in 0.0, 2.3, 500.0: |
| 621 | for _ in range(N): |
| 622 | sample = g.vonmisesvariate(mu, kappa) |
| 623 | self.assertTrue( |
| 624 | 0 <= sample <= random.TWOPI, |
| 625 | msg=("vonmisesvariate({}, {}) produced a result {} out" |
| 626 | " of range [0, 2*pi]").format(mu, kappa, sample)) |
| 627 | |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 628 | def test_von_mises_large_kappa(self): |
| 629 | # Issue #17141: vonmisesvariate() was hang for large kappas |
| 630 | random.vonmisesvariate(0, 1e15) |
| 631 | random.vonmisesvariate(0, 1e100) |
| 632 | |
R David Murray | e3e1c17 | 2013-04-02 12:47:23 -0400 | [diff] [blame] | 633 | def test_gammavariate_errors(self): |
| 634 | # Both alpha and beta must be > 0.0 |
| 635 | self.assertRaises(ValueError, random.gammavariate, -1, 3) |
| 636 | self.assertRaises(ValueError, random.gammavariate, 0, 2) |
| 637 | self.assertRaises(ValueError, random.gammavariate, 2, 0) |
| 638 | self.assertRaises(ValueError, random.gammavariate, 1, -3) |
| 639 | |
| 640 | @unittest.mock.patch('random.Random.random') |
| 641 | def test_gammavariate_full_code_coverage(self, random_mock): |
| 642 | # There are three different possibilities in the current implementation |
| 643 | # of random.gammavariate(), depending on the value of 'alpha'. What we |
| 644 | # are going to do here is to fix the values returned by random() to |
| 645 | # generate test cases that provide 100% line coverage of the method. |
| 646 | |
| 647 | # #1: alpha > 1.0: we want the first random number to be outside the |
| 648 | # [1e-7, .9999999] range, so that the continue statement executes |
| 649 | # once. The values of u1 and u2 will be 0.5 and 0.3, respectively. |
| 650 | random_mock.side_effect = [1e-8, 0.5, 0.3] |
| 651 | returned_value = random.gammavariate(1.1, 2.3) |
| 652 | self.assertAlmostEqual(returned_value, 2.53) |
| 653 | |
| 654 | # #2: alpha == 1: first random number less than 1e-7 to that the body |
| 655 | # of the while loop executes once. Then random.random() returns 0.45, |
| 656 | # which causes while to stop looping and the algorithm to terminate. |
| 657 | random_mock.side_effect = [1e-8, 0.45] |
| 658 | returned_value = random.gammavariate(1.0, 3.14) |
| 659 | self.assertAlmostEqual(returned_value, 2.507314166123803) |
| 660 | |
| 661 | # #3: 0 < alpha < 1. This is the most complex region of code to cover, |
| 662 | # as there are multiple if-else statements. Let's take a look at the |
| 663 | # source code, and determine the values that we need accordingly: |
| 664 | # |
| 665 | # while 1: |
| 666 | # u = random() |
| 667 | # b = (_e + alpha)/_e |
| 668 | # p = b*u |
| 669 | # if p <= 1.0: # <=== (A) |
| 670 | # x = p ** (1.0/alpha) |
| 671 | # else: # <=== (B) |
| 672 | # x = -_log((b-p)/alpha) |
| 673 | # u1 = random() |
| 674 | # if p > 1.0: # <=== (C) |
| 675 | # if u1 <= x ** (alpha - 1.0): # <=== (D) |
| 676 | # break |
| 677 | # elif u1 <= _exp(-x): # <=== (E) |
| 678 | # break |
| 679 | # return x * beta |
| 680 | # |
| 681 | # First, we want (A) to be True. For that we need that: |
| 682 | # b*random() <= 1.0 |
| 683 | # r1 = random() <= 1.0 / b |
| 684 | # |
| 685 | # We now get to the second if-else branch, and here, since p <= 1.0, |
| 686 | # (C) is False and we take the elif branch, (E). For it to be True, |
| 687 | # so that the break is executed, we need that: |
| 688 | # r2 = random() <= _exp(-x) |
| 689 | # r2 <= _exp(-(p ** (1.0/alpha))) |
| 690 | # r2 <= _exp(-((b*r1) ** (1.0/alpha))) |
| 691 | |
| 692 | _e = random._e |
| 693 | _exp = random._exp |
| 694 | _log = random._log |
| 695 | alpha = 0.35 |
| 696 | beta = 1.45 |
| 697 | b = (_e + alpha)/_e |
| 698 | epsilon = 0.01 |
| 699 | |
| 700 | r1 = 0.8859296441566 # 1.0 / b |
| 701 | r2 = 0.3678794411714 # _exp(-((b*r1) ** (1.0/alpha))) |
| 702 | |
| 703 | # These four "random" values result in the following trace: |
| 704 | # (A) True, (E) False --> [next iteration of while] |
| 705 | # (A) True, (E) True --> [while loop breaks] |
| 706 | random_mock.side_effect = [r1, r2 + epsilon, r1, r2] |
| 707 | returned_value = random.gammavariate(alpha, beta) |
| 708 | self.assertAlmostEqual(returned_value, 1.4499999999997544) |
| 709 | |
| 710 | # Let's now make (A) be False. If this is the case, when we get to the |
| 711 | # second if-else 'p' is greater than 1, so (C) evaluates to True. We |
| 712 | # now encounter a second if statement, (D), which in order to execute |
| 713 | # must satisfy the following condition: |
| 714 | # r2 <= x ** (alpha - 1.0) |
| 715 | # r2 <= (-_log((b-p)/alpha)) ** (alpha - 1.0) |
| 716 | # r2 <= (-_log((b-(b*r1))/alpha)) ** (alpha - 1.0) |
| 717 | r1 = 0.8959296441566 # (1.0 / b) + epsilon -- so that (A) is False |
| 718 | r2 = 0.9445400408898141 |
| 719 | |
| 720 | # And these four values result in the following trace: |
| 721 | # (B) and (C) True, (D) False --> [next iteration of while] |
| 722 | # (B) and (C) True, (D) True [while loop breaks] |
| 723 | random_mock.side_effect = [r1, r2 + epsilon, r1, r2] |
| 724 | returned_value = random.gammavariate(alpha, beta) |
| 725 | self.assertAlmostEqual(returned_value, 1.5830349561760781) |
| 726 | |
| 727 | @unittest.mock.patch('random.Random.gammavariate') |
| 728 | def test_betavariate_return_zero(self, gammavariate_mock): |
| 729 | # betavariate() returns zero when the Gamma distribution |
| 730 | # that it uses internally returns this same value. |
| 731 | gammavariate_mock.return_value = 0.0 |
| 732 | self.assertEqual(0.0, random.betavariate(2.71828, 3.14159)) |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 733 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 734 | class TestModule(unittest.TestCase): |
| 735 | def testMagicConstants(self): |
| 736 | self.assertAlmostEqual(random.NV_MAGICCONST, 1.71552776992141) |
| 737 | self.assertAlmostEqual(random.TWOPI, 6.28318530718) |
| 738 | self.assertAlmostEqual(random.LOG4, 1.38629436111989) |
| 739 | self.assertAlmostEqual(random.SG_MAGICCONST, 2.50407739677627) |
| 740 | |
| 741 | def test__all__(self): |
| 742 | # tests validity but not completeness of the __all__ list |
Benjamin Peterson | c9c0f20 | 2009-06-30 23:06:06 +0000 | [diff] [blame] | 743 | self.assertTrue(set(random.__all__) <= set(dir(random))) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 744 | |
Thomas Wouters | b213704 | 2007-02-01 18:02:27 +0000 | [diff] [blame] | 745 | def test_random_subclass_with_kwargs(self): |
| 746 | # SF bug #1486663 -- this used to erroneously raise a TypeError |
| 747 | class Subclass(random.Random): |
| 748 | def __init__(self, newarg=None): |
| 749 | random.Random.__init__(self) |
| 750 | Subclass(newarg=1) |
| 751 | |
| 752 | |
Raymond Hettinger | 105b084 | 2003-02-04 05:47:30 +0000 | [diff] [blame] | 753 | def test_main(verbose=None): |
Raymond Hettinger | 28de64f | 2008-01-13 23:40:30 +0000 | [diff] [blame] | 754 | testclasses = [MersenneTwister_TestBasicOps, |
Raymond Hettinger | 15ec373 | 2003-01-05 01:08:34 +0000 | [diff] [blame] | 755 | TestDistributions, |
Raymond Hettinger | b871763 | 2004-09-04 20:13:29 +0000 | [diff] [blame] | 756 | TestModule] |
| 757 | |
Raymond Hettinger | c1c43ca | 2004-09-05 00:00:42 +0000 | [diff] [blame] | 758 | try: |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 759 | random.SystemRandom().random() |
Raymond Hettinger | c1c43ca | 2004-09-05 00:00:42 +0000 | [diff] [blame] | 760 | except NotImplementedError: |
| 761 | pass |
| 762 | else: |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 763 | testclasses.append(SystemRandom_TestBasicOps) |
Raymond Hettinger | b871763 | 2004-09-04 20:13:29 +0000 | [diff] [blame] | 764 | |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 765 | support.run_unittest(*testclasses) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 766 | |
Raymond Hettinger | 105b084 | 2003-02-04 05:47:30 +0000 | [diff] [blame] | 767 | # verify reference counting |
| 768 | import sys |
| 769 | if verbose and hasattr(sys, "gettotalrefcount"): |
Raymond Hettinger | 320a1b0 | 2003-05-02 22:44:59 +0000 | [diff] [blame] | 770 | counts = [None] * 5 |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 771 | for i in range(len(counts)): |
Benjamin Peterson | ee8712c | 2008-05-20 21:35:26 +0000 | [diff] [blame] | 772 | support.run_unittest(*testclasses) |
Raymond Hettinger | 320a1b0 | 2003-05-02 22:44:59 +0000 | [diff] [blame] | 773 | counts[i] = sys.gettotalrefcount() |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 774 | print(counts) |
Raymond Hettinger | 105b084 | 2003-02-04 05:47:30 +0000 | [diff] [blame] | 775 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 776 | if __name__ == "__main__": |
Raymond Hettinger | 105b084 | 2003-02-04 05:47:30 +0000 | [diff] [blame] | 777 | test_main(verbose=True) |