diff options
author | Raymond Hettinger <python@rcn.com> | 2016-10-29 23:57:09 (GMT) |
---|---|---|
committer | Raymond Hettinger <python@rcn.com> | 2016-10-29 23:57:09 (GMT) |
commit | ba25f6149052aea017df5fa328867d090bb89d1c (patch) | |
tree | a85f1c3e775ef3b1255a021751cb25e943c072e6 /Lib | |
parent | 7ca671532cee6e8ed80dbd6e461f1de50ee93a3b (diff) | |
parent | 30d00e54dde47b11f5b338aaba17760b641e1705 (diff) | |
download | cpython-ba25f6149052aea017df5fa328867d090bb89d1c.zip cpython-ba25f6149052aea017df5fa328867d090bb89d1c.tar.gz cpython-ba25f6149052aea017df5fa328867d090bb89d1c.tar.bz2 |
merge
Diffstat (limited to 'Lib')
-rw-r--r-- | Lib/random.py | 7 | ||||
-rw-r--r-- | Lib/test/test_random.py | 16 |
2 files changed, 20 insertions, 3 deletions
diff --git a/Lib/random.py b/Lib/random.py index ef8cb05..a047444 100644 --- a/Lib/random.py +++ b/Lib/random.py @@ -344,10 +344,12 @@ class Random(_random.Random): the selections are made with equal probability. """ + random = self.random if cum_weights is None: if weights is None: - choice = self.choice - return [choice(population) for i in range(k)] + _int = int + total = len(population) + return [population[_int(random() * total)] for i in range(k)] else: cum_weights = list(_itertools.accumulate(weights)) elif weights is not None: @@ -355,7 +357,6 @@ class Random(_random.Random): if len(cum_weights) != len(population): raise ValueError('The number of weights does not match the population') bisect = _bisect.bisect - random = self.random total = cum_weights[-1] return [population[bisect(cum_weights, random() * total)] for i in range(k)] diff --git a/Lib/test/test_random.py b/Lib/test/test_random.py index d061829..77d92e8 100644 --- a/Lib/test/test_random.py +++ b/Lib/test/test_random.py @@ -625,6 +625,22 @@ class MersenneTwister_TestBasicOps(TestBasicOps, unittest.TestCase): self.assertTrue(stop < x <= start) self.assertEqual((x+stop)%step, 0) + def test_choices_algorithms(self): + # The various ways of specifing weights should produce the same results + choices = self.gen.choices + n = 13132817 + + self.gen.seed(8675309) + a = self.gen.choices(range(n), k=10000) + + self.gen.seed(8675309) + b = self.gen.choices(range(n), [1]*n, k=10000) + self.assertEqual(a, b) + + self.gen.seed(8675309) + c = self.gen.choices(range(n), cum_weights=range(1, n+1), k=10000) + self.assertEqual(a, c) + def gamma(z, sqrt2pi=(2.0*pi)**0.5): # Reflection to right half of complex plane if z < 0.5: |