Guido van Rossum | e7b146f | 2000-02-04 15:28:42 +0000 | [diff] [blame] | 1 | """Random variable generators. |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 2 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 3 | integers |
| 4 | -------- |
| 5 | uniform within range |
| 6 | |
| 7 | sequences |
| 8 | --------- |
| 9 | pick random element |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 10 | pick random sample |
Raymond Hettinger | e8f1e00 | 2016-09-06 17:15:29 -0700 | [diff] [blame] | 11 | pick weighted random sample |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 12 | generate random permutation |
| 13 | |
Guido van Rossum | e7b146f | 2000-02-04 15:28:42 +0000 | [diff] [blame] | 14 | distributions on the real line: |
| 15 | ------------------------------ |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 16 | uniform |
Christian Heimes | fe337bf | 2008-03-23 21:54:12 +0000 | [diff] [blame] | 17 | triangular |
Guido van Rossum | e7b146f | 2000-02-04 15:28:42 +0000 | [diff] [blame] | 18 | normal (Gaussian) |
| 19 | lognormal |
| 20 | negative exponential |
| 21 | gamma |
| 22 | beta |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 23 | pareto |
| 24 | Weibull |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 25 | |
Guido van Rossum | e7b146f | 2000-02-04 15:28:42 +0000 | [diff] [blame] | 26 | distributions on the circle (angles 0 to 2pi) |
| 27 | --------------------------------------------- |
| 28 | circular uniform |
| 29 | von Mises |
| 30 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 31 | General notes on the underlying Mersenne Twister core generator: |
Guido van Rossum | e7b146f | 2000-02-04 15:28:42 +0000 | [diff] [blame] | 32 | |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 33 | * The period is 2**19937-1. |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 34 | * It is one of the most extensively tested generators in existence. |
Thomas Wouters | 0e3f591 | 2006-08-11 14:57:12 +0000 | [diff] [blame] | 35 | * The random() method is implemented in C, executes in a single Python step, |
| 36 | and is, therefore, threadsafe. |
Tim Peters | e360d95 | 2001-01-26 10:00:39 +0000 | [diff] [blame] | 37 | |
Guido van Rossum | e7b146f | 2000-02-04 15:28:42 +0000 | [diff] [blame] | 38 | """ |
Guido van Rossum | d03e119 | 1998-05-29 17:51:31 +0000 | [diff] [blame] | 39 | |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 40 | from warnings import warn as _warn |
| 41 | from types import MethodType as _MethodType, BuiltinMethodType as _BuiltinMethodType |
Raymond Hettinger | 91e27c2 | 2005-08-19 01:36:35 +0000 | [diff] [blame] | 42 | from math import log as _log, exp as _exp, pi as _pi, e as _e, ceil as _ceil |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 43 | from math import sqrt as _sqrt, acos as _acos, cos as _cos, sin as _sin |
Raymond Hettinger | c1c43ca | 2004-09-05 00:00:42 +0000 | [diff] [blame] | 44 | from os import urandom as _urandom |
Christian Heimes | f1dc3ee | 2013-10-13 02:04:20 +0200 | [diff] [blame] | 45 | from _collections_abc import Set as _Set, Sequence as _Sequence |
Raymond Hettinger | 3fcf002 | 2010-12-08 01:13:53 +0000 | [diff] [blame] | 46 | from hashlib import sha512 as _sha512 |
Raymond Hettinger | e8f1e00 | 2016-09-06 17:15:29 -0700 | [diff] [blame] | 47 | import itertools as _itertools |
| 48 | import bisect as _bisect |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 49 | |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 50 | __all__ = ["Random","seed","random","uniform","randint","choice","sample", |
Skip Montanaro | 0de6580 | 2001-02-15 22:15:14 +0000 | [diff] [blame] | 51 | "randrange","shuffle","normalvariate","lognormvariate", |
Christian Heimes | fe337bf | 2008-03-23 21:54:12 +0000 | [diff] [blame] | 52 | "expovariate","vonmisesvariate","gammavariate","triangular", |
Raymond Hettinger | f8a52d3 | 2003-08-05 12:23:19 +0000 | [diff] [blame] | 53 | "gauss","betavariate","paretovariate","weibullvariate", |
Raymond Hettinger | 28aa4a0 | 2016-09-07 00:08:44 -0700 | [diff] [blame] | 54 | "getstate","setstate", "getrandbits", "choices", |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 55 | "SystemRandom"] |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 56 | |
| 57 | NV_MAGICCONST = 4 * _exp(-0.5)/_sqrt(2.0) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 58 | TWOPI = 2.0*_pi |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 59 | LOG4 = _log(4.0) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 60 | SG_MAGICCONST = 1.0 + _log(4.5) |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 61 | BPF = 53 # Number of bits in a float |
Tim Peters | 7c2a85b | 2004-08-31 02:19:55 +0000 | [diff] [blame] | 62 | RECIP_BPF = 2**-BPF |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 63 | |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 64 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 65 | # Translated by Guido van Rossum from C source provided by |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 66 | # Adrian Baddeley. Adapted by Raymond Hettinger for use with |
Raymond Hettinger | 3fa19d7 | 2004-08-31 01:05:15 +0000 | [diff] [blame] | 67 | # the Mersenne Twister and os.urandom() core generators. |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 68 | |
Raymond Hettinger | 145a4a0 | 2003-01-07 10:25:55 +0000 | [diff] [blame] | 69 | import _random |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 70 | |
Raymond Hettinger | 145a4a0 | 2003-01-07 10:25:55 +0000 | [diff] [blame] | 71 | class Random(_random.Random): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 72 | """Random number generator base class used by bound module functions. |
| 73 | |
| 74 | Used to instantiate instances of Random to get generators that don't |
Raymond Hettinger | 28de64f | 2008-01-13 23:40:30 +0000 | [diff] [blame] | 75 | share state. |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 76 | |
| 77 | Class Random can also be subclassed if you want to use a different basic |
| 78 | generator of your own devising: in that case, override the following |
Raymond Hettinger | 28de64f | 2008-01-13 23:40:30 +0000 | [diff] [blame] | 79 | methods: random(), seed(), getstate(), and setstate(). |
Benjamin Peterson | d18de0e | 2008-07-31 20:21:46 +0000 | [diff] [blame] | 80 | Optionally, implement a getrandbits() method so that randrange() |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 81 | can cover arbitrarily large ranges. |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 82 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 83 | """ |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 84 | |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 85 | VERSION = 3 # used by getstate/setstate |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 86 | |
| 87 | def __init__(self, x=None): |
| 88 | """Initialize an instance. |
| 89 | |
| 90 | Optional argument x controls seeding, as for Random.seed(). |
| 91 | """ |
| 92 | |
| 93 | self.seed(x) |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 94 | self.gauss_next = None |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 95 | |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 96 | def seed(self, a=None, version=2): |
Tim Peters | 0de88fc | 2001-02-01 04:59:18 +0000 | [diff] [blame] | 97 | """Initialize internal state from hashable object. |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 98 | |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 99 | None or no argument seeds from current time or from an operating |
| 100 | system specific randomness source if available. |
Tim Peters | 0de88fc | 2001-02-01 04:59:18 +0000 | [diff] [blame] | 101 | |
Raymond Hettinger | 183cd1f | 2010-09-08 18:48:21 +0000 | [diff] [blame] | 102 | If *a* is an int, all bits are used. |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 103 | |
Raymond Hettinger | 16eb827 | 2016-09-04 11:17:28 -0700 | [diff] [blame] | 104 | For version 2 (the default), all of the bits are used if *a* is a str, |
| 105 | bytes, or bytearray. For version 1 (provided for reproducing random |
| 106 | sequences from older versions of Python), the algorithm for str and |
| 107 | bytes generates a narrower range of seeds. |
| 108 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 109 | """ |
| 110 | |
Raymond Hettinger | c7bab7c | 2016-08-31 15:01:08 -0700 | [diff] [blame] | 111 | if version == 1 and isinstance(a, (str, bytes)): |
| 112 | x = ord(a[0]) << 7 if a else 0 |
| 113 | for c in a: |
| 114 | x = ((1000003 * x) ^ ord(c)) & 0xFFFFFFFFFFFFFFFF |
| 115 | x ^= len(a) |
| 116 | a = -2 if x == -1 else x |
| 117 | |
Raymond Hettinger | 2f9cc7a | 2016-08-31 23:00:32 -0700 | [diff] [blame] | 118 | if version == 2 and isinstance(a, (str, bytes, bytearray)): |
| 119 | if isinstance(a, str): |
| 120 | a = a.encode() |
| 121 | a += _sha512(a).digest() |
| 122 | a = int.from_bytes(a, 'big') |
Raymond Hettinger | f763a72 | 2010-09-07 00:38:15 +0000 | [diff] [blame] | 123 | |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 124 | super().seed(a) |
Tim Peters | 46c04e1 | 2002-05-05 20:40:00 +0000 | [diff] [blame] | 125 | self.gauss_next = None |
| 126 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 127 | def getstate(self): |
| 128 | """Return internal state; can be passed to setstate() later.""" |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 129 | return self.VERSION, super().getstate(), self.gauss_next |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 130 | |
| 131 | def setstate(self, state): |
| 132 | """Restore internal state from object returned by getstate().""" |
| 133 | version = state[0] |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 134 | if version == 3: |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 135 | version, internalstate, self.gauss_next = state |
Guido van Rossum | cd16bf6 | 2007-06-13 18:07:49 +0000 | [diff] [blame] | 136 | super().setstate(internalstate) |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 137 | elif version == 2: |
| 138 | version, internalstate, self.gauss_next = state |
| 139 | # In version 2, the state was saved as signed ints, which causes |
| 140 | # inconsistencies between 32/64-bit systems. The state is |
| 141 | # really unsigned 32-bit ints, so we convert negative ints from |
| 142 | # version 2 to positive longs for version 3. |
| 143 | try: |
Raymond Hettinger | c585eec | 2010-09-07 15:00:15 +0000 | [diff] [blame] | 144 | internalstate = tuple(x % (2**32) for x in internalstate) |
Christian Heimes | cbf3b5c | 2007-12-03 21:02:03 +0000 | [diff] [blame] | 145 | except ValueError as e: |
| 146 | raise TypeError from e |
Raymond Hettinger | 183cd1f | 2010-09-08 18:48:21 +0000 | [diff] [blame] | 147 | super().setstate(internalstate) |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 148 | else: |
| 149 | raise ValueError("state with version %s passed to " |
| 150 | "Random.setstate() of version %s" % |
| 151 | (version, self.VERSION)) |
| 152 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 153 | ## ---- Methods below this point do not need to be overridden when |
| 154 | ## ---- subclassing for the purpose of using a different core generator. |
| 155 | |
| 156 | ## -------------------- pickle support ------------------- |
| 157 | |
R David Murray | d9ebf4d | 2013-04-02 13:10:52 -0400 | [diff] [blame] | 158 | # Issue 17489: Since __reduce__ was defined to fix #759889 this is no |
| 159 | # longer called; we leave it here because it has been here since random was |
| 160 | # rewritten back in 2001 and why risk breaking something. |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 161 | def __getstate__(self): # for pickle |
| 162 | return self.getstate() |
| 163 | |
| 164 | def __setstate__(self, state): # for pickle |
| 165 | self.setstate(state) |
| 166 | |
Raymond Hettinger | 5f078ff | 2003-06-24 20:29:04 +0000 | [diff] [blame] | 167 | def __reduce__(self): |
| 168 | return self.__class__, (), self.getstate() |
| 169 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 170 | ## -------------------- integer methods ------------------- |
| 171 | |
Raymond Hettinger | 8fe47c3 | 2013-10-05 21:48:21 -0700 | [diff] [blame] | 172 | def randrange(self, start, stop=None, step=1, _int=int): |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 173 | """Choose a random item from range(start, stop[, step]). |
| 174 | |
| 175 | This fixes the problem with randint() which includes the |
| 176 | endpoint; in Python this is usually not what you want. |
Raymond Hettinger | 3051cc3 | 2010-09-07 00:48:40 +0000 | [diff] [blame] | 177 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 178 | """ |
| 179 | |
| 180 | # This code is a bit messy to make it fast for the |
Tim Peters | 9146f27 | 2002-08-16 03:41:39 +0000 | [diff] [blame] | 181 | # common case while still doing adequate error checking. |
Raymond Hettinger | 8fe47c3 | 2013-10-05 21:48:21 -0700 | [diff] [blame] | 182 | istart = _int(start) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 183 | if istart != start: |
Collin Winter | ce36ad8 | 2007-08-30 01:19:48 +0000 | [diff] [blame] | 184 | raise ValueError("non-integer arg 1 for randrange()") |
Raymond Hettinger | 3051cc3 | 2010-09-07 00:48:40 +0000 | [diff] [blame] | 185 | if stop is None: |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 186 | if istart > 0: |
Raymond Hettinger | 0515661 | 2010-09-07 04:44:52 +0000 | [diff] [blame] | 187 | return self._randbelow(istart) |
Collin Winter | ce36ad8 | 2007-08-30 01:19:48 +0000 | [diff] [blame] | 188 | raise ValueError("empty range for randrange()") |
Tim Peters | 9146f27 | 2002-08-16 03:41:39 +0000 | [diff] [blame] | 189 | |
| 190 | # stop argument supplied. |
Raymond Hettinger | 8fe47c3 | 2013-10-05 21:48:21 -0700 | [diff] [blame] | 191 | istop = _int(stop) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 192 | if istop != stop: |
Collin Winter | ce36ad8 | 2007-08-30 01:19:48 +0000 | [diff] [blame] | 193 | raise ValueError("non-integer stop for randrange()") |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 194 | width = istop - istart |
| 195 | if step == 1 and width > 0: |
Raymond Hettinger | c324697 | 2010-09-07 09:32:57 +0000 | [diff] [blame] | 196 | return istart + self._randbelow(width) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 197 | if step == 1: |
Collin Winter | ce36ad8 | 2007-08-30 01:19:48 +0000 | [diff] [blame] | 198 | raise ValueError("empty range for randrange() (%d,%d, %d)" % (istart, istop, width)) |
Tim Peters | 9146f27 | 2002-08-16 03:41:39 +0000 | [diff] [blame] | 199 | |
| 200 | # Non-unit step argument supplied. |
Raymond Hettinger | 8fe47c3 | 2013-10-05 21:48:21 -0700 | [diff] [blame] | 201 | istep = _int(step) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 202 | if istep != step: |
Collin Winter | ce36ad8 | 2007-08-30 01:19:48 +0000 | [diff] [blame] | 203 | raise ValueError("non-integer step for randrange()") |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 204 | if istep > 0: |
Raymond Hettinger | ffdb8bb | 2004-09-27 15:29:05 +0000 | [diff] [blame] | 205 | n = (width + istep - 1) // istep |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 206 | elif istep < 0: |
Raymond Hettinger | ffdb8bb | 2004-09-27 15:29:05 +0000 | [diff] [blame] | 207 | n = (width + istep + 1) // istep |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 208 | else: |
Collin Winter | ce36ad8 | 2007-08-30 01:19:48 +0000 | [diff] [blame] | 209 | raise ValueError("zero step for randrange()") |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 210 | |
| 211 | if n <= 0: |
Collin Winter | ce36ad8 | 2007-08-30 01:19:48 +0000 | [diff] [blame] | 212 | raise ValueError("empty range for randrange()") |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 213 | |
Raymond Hettinger | 0515661 | 2010-09-07 04:44:52 +0000 | [diff] [blame] | 214 | return istart + istep*self._randbelow(n) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 215 | |
| 216 | def randint(self, a, b): |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 217 | """Return random integer in range [a, b], including both end points. |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 218 | """ |
| 219 | |
| 220 | return self.randrange(a, b+1) |
| 221 | |
Raymond Hettinger | e4a3e99 | 2010-09-08 00:30:28 +0000 | [diff] [blame] | 222 | def _randbelow(self, n, int=int, maxsize=1<<BPF, type=type, |
Raymond Hettinger | 05a505f | 2010-09-07 19:19:33 +0000 | [diff] [blame] | 223 | Method=_MethodType, BuiltinMethod=_BuiltinMethodType): |
Raymond Hettinger | e4a3e99 | 2010-09-08 00:30:28 +0000 | [diff] [blame] | 224 | "Return a random int in the range [0,n). Raises ValueError if n==0." |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 225 | |
Raymond Hettinger | f77cdbe | 2013-10-05 17:18:36 -0700 | [diff] [blame] | 226 | random = self.random |
Raymond Hettinger | c324697 | 2010-09-07 09:32:57 +0000 | [diff] [blame] | 227 | getrandbits = self.getrandbits |
| 228 | # Only call self.getrandbits if the original random() builtin method |
| 229 | # has not been overridden or if a new getrandbits() was supplied. |
Raymond Hettinger | f77cdbe | 2013-10-05 17:18:36 -0700 | [diff] [blame] | 230 | if type(random) is BuiltinMethod or type(getrandbits) is Method: |
Raymond Hettinger | e4a3e99 | 2010-09-08 00:30:28 +0000 | [diff] [blame] | 231 | k = n.bit_length() # don't use (n-1) here because n can be 1 |
Raymond Hettinger | f015b3f | 2010-09-07 20:04:42 +0000 | [diff] [blame] | 232 | r = getrandbits(k) # 0 <= r < 2**k |
Raymond Hettinger | c324697 | 2010-09-07 09:32:57 +0000 | [diff] [blame] | 233 | while r >= n: |
| 234 | r = getrandbits(k) |
| 235 | return r |
Martin Panter | e26da7c | 2016-06-02 10:07:09 +0000 | [diff] [blame] | 236 | # There's an overridden random() method but no new getrandbits() method, |
Raymond Hettinger | 05a505f | 2010-09-07 19:19:33 +0000 | [diff] [blame] | 237 | # so we can only use random() from here. |
Raymond Hettinger | e4a3e99 | 2010-09-08 00:30:28 +0000 | [diff] [blame] | 238 | if n >= maxsize: |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 239 | _warn("Underlying random() generator does not supply \n" |
Raymond Hettinger | f015b3f | 2010-09-07 20:04:42 +0000 | [diff] [blame] | 240 | "enough bits to choose from a population range this large.\n" |
| 241 | "To remove the range limitation, add a getrandbits() method.") |
Raymond Hettinger | e4a3e99 | 2010-09-08 00:30:28 +0000 | [diff] [blame] | 242 | return int(random() * n) |
| 243 | rem = maxsize % n |
| 244 | limit = (maxsize - rem) / maxsize # int(limit * maxsize) % n == 0 |
| 245 | r = random() |
| 246 | while r >= limit: |
| 247 | r = random() |
| 248 | return int(r*maxsize) % n |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 249 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 250 | ## -------------------- sequence methods ------------------- |
| 251 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 252 | def choice(self, seq): |
| 253 | """Choose a random element from a non-empty sequence.""" |
Raymond Hettinger | dc4872e | 2010-09-07 10:06:56 +0000 | [diff] [blame] | 254 | try: |
| 255 | i = self._randbelow(len(seq)) |
| 256 | except ValueError: |
| 257 | raise IndexError('Cannot choose from an empty sequence') |
| 258 | return seq[i] |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 259 | |
Raymond Hettinger | 8fe47c3 | 2013-10-05 21:48:21 -0700 | [diff] [blame] | 260 | def shuffle(self, x, random=None): |
Antoine Pitrou | 5e39433 | 2012-11-04 02:10:33 +0100 | [diff] [blame] | 261 | """Shuffle list x in place, and return None. |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 262 | |
Antoine Pitrou | 5e39433 | 2012-11-04 02:10:33 +0100 | [diff] [blame] | 263 | Optional argument random is a 0-argument function returning a |
| 264 | random float in [0.0, 1.0); if it is the default None, the |
| 265 | standard random.random will be used. |
Senthil Kumaran | f8ce51a | 2013-09-11 22:54:31 -0700 | [diff] [blame] | 266 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 267 | """ |
| 268 | |
Raymond Hettinger | 8fe47c3 | 2013-10-05 21:48:21 -0700 | [diff] [blame] | 269 | if random is None: |
| 270 | randbelow = self._randbelow |
| 271 | for i in reversed(range(1, len(x))): |
| 272 | # pick an element in x[:i+1] with which to exchange x[i] |
| 273 | j = randbelow(i+1) |
| 274 | x[i], x[j] = x[j], x[i] |
| 275 | else: |
| 276 | _int = int |
| 277 | for i in reversed(range(1, len(x))): |
| 278 | # pick an element in x[:i+1] with which to exchange x[i] |
| 279 | j = _int(random() * (i+1)) |
| 280 | x[i], x[j] = x[j], x[i] |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 281 | |
Raymond Hettinger | fdbe522 | 2003-06-13 07:01:51 +0000 | [diff] [blame] | 282 | def sample(self, population, k): |
Raymond Hettinger | 1acde19 | 2008-01-14 01:00:53 +0000 | [diff] [blame] | 283 | """Chooses k unique random elements from a population sequence or set. |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 284 | |
Raymond Hettinger | c0b4034 | 2002-11-13 15:26:37 +0000 | [diff] [blame] | 285 | Returns a new list containing elements from the population while |
| 286 | leaving the original population unchanged. The resulting list is |
| 287 | in selection order so that all sub-slices will also be valid random |
| 288 | samples. This allows raffle winners (the sample) to be partitioned |
| 289 | into grand prize and second place winners (the subslices). |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 290 | |
Raymond Hettinger | c0b4034 | 2002-11-13 15:26:37 +0000 | [diff] [blame] | 291 | Members of the population need not be hashable or unique. If the |
| 292 | population contains repeats, then each occurrence is a possible |
| 293 | selection in the sample. |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 294 | |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 295 | To choose a sample in a range of integers, use range as an argument. |
Raymond Hettinger | c0b4034 | 2002-11-13 15:26:37 +0000 | [diff] [blame] | 296 | This is especially fast and space efficient for sampling from a |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 297 | large population: sample(range(10000000), 60) |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 298 | """ |
| 299 | |
Raymond Hettinger | c0b4034 | 2002-11-13 15:26:37 +0000 | [diff] [blame] | 300 | # Sampling without replacement entails tracking either potential |
Raymond Hettinger | 91e27c2 | 2005-08-19 01:36:35 +0000 | [diff] [blame] | 301 | # selections (the pool) in a list or previous selections in a set. |
Raymond Hettinger | c0b4034 | 2002-11-13 15:26:37 +0000 | [diff] [blame] | 302 | |
Jeremy Hylton | 2b55d35 | 2004-02-23 17:27:57 +0000 | [diff] [blame] | 303 | # When the number of selections is small compared to the |
| 304 | # population, then tracking selections is efficient, requiring |
Raymond Hettinger | 91e27c2 | 2005-08-19 01:36:35 +0000 | [diff] [blame] | 305 | # only a small set and an occasional reselection. For |
Jeremy Hylton | 2b55d35 | 2004-02-23 17:27:57 +0000 | [diff] [blame] | 306 | # a larger number of selections, the pool tracking method is |
| 307 | # preferred since the list takes less space than the |
Raymond Hettinger | 91e27c2 | 2005-08-19 01:36:35 +0000 | [diff] [blame] | 308 | # set and it doesn't suffer from frequent reselections. |
Raymond Hettinger | c0b4034 | 2002-11-13 15:26:37 +0000 | [diff] [blame] | 309 | |
Raymond Hettinger | 57d1a88 | 2011-02-23 00:46:28 +0000 | [diff] [blame] | 310 | if isinstance(population, _Set): |
Raymond Hettinger | 1acde19 | 2008-01-14 01:00:53 +0000 | [diff] [blame] | 311 | population = tuple(population) |
Raymond Hettinger | 57d1a88 | 2011-02-23 00:46:28 +0000 | [diff] [blame] | 312 | if not isinstance(population, _Sequence): |
| 313 | raise TypeError("Population must be a sequence or set. For dicts, use list(d).") |
Raymond Hettinger | 05a505f | 2010-09-07 19:19:33 +0000 | [diff] [blame] | 314 | randbelow = self._randbelow |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 315 | n = len(population) |
| 316 | if not 0 <= k <= n: |
Raymond Hettinger | 1acde19 | 2008-01-14 01:00:53 +0000 | [diff] [blame] | 317 | raise ValueError("Sample larger than population") |
Raymond Hettinger | c0b4034 | 2002-11-13 15:26:37 +0000 | [diff] [blame] | 318 | result = [None] * k |
Raymond Hettinger | 91e27c2 | 2005-08-19 01:36:35 +0000 | [diff] [blame] | 319 | setsize = 21 # size of a small set minus size of an empty list |
| 320 | if k > 5: |
Tim Peters | 9e34c04 | 2005-08-26 15:20:46 +0000 | [diff] [blame] | 321 | setsize += 4 ** _ceil(_log(k * 3, 4)) # table size for big sets |
Raymond Hettinger | 1acde19 | 2008-01-14 01:00:53 +0000 | [diff] [blame] | 322 | if n <= setsize: |
| 323 | # An n-length list is smaller than a k-length set |
Raymond Hettinger | 311f419 | 2002-11-18 09:01:24 +0000 | [diff] [blame] | 324 | pool = list(population) |
Guido van Rossum | 805365e | 2007-05-07 22:24:25 +0000 | [diff] [blame] | 325 | for i in range(k): # invariant: non-selected at [0,n-i) |
Raymond Hettinger | 05a505f | 2010-09-07 19:19:33 +0000 | [diff] [blame] | 326 | j = randbelow(n-i) |
Raymond Hettinger | 311f419 | 2002-11-18 09:01:24 +0000 | [diff] [blame] | 327 | result[i] = pool[j] |
Raymond Hettinger | 8b9aa8d | 2003-01-04 05:20:33 +0000 | [diff] [blame] | 328 | pool[j] = pool[n-i-1] # move non-selected item into vacancy |
Raymond Hettinger | c0b4034 | 2002-11-13 15:26:37 +0000 | [diff] [blame] | 329 | else: |
Raymond Hettinger | 1acde19 | 2008-01-14 01:00:53 +0000 | [diff] [blame] | 330 | selected = set() |
| 331 | selected_add = selected.add |
| 332 | for i in range(k): |
Raymond Hettinger | 05a505f | 2010-09-07 19:19:33 +0000 | [diff] [blame] | 333 | j = randbelow(n) |
Raymond Hettinger | 1acde19 | 2008-01-14 01:00:53 +0000 | [diff] [blame] | 334 | while j in selected: |
Raymond Hettinger | 05a505f | 2010-09-07 19:19:33 +0000 | [diff] [blame] | 335 | j = randbelow(n) |
Raymond Hettinger | 1acde19 | 2008-01-14 01:00:53 +0000 | [diff] [blame] | 336 | selected_add(j) |
| 337 | result[i] = population[j] |
Raymond Hettinger | 311f419 | 2002-11-18 09:01:24 +0000 | [diff] [blame] | 338 | return result |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 339 | |
Raymond Hettinger | 9016f28 | 2016-09-26 21:45:57 -0700 | [diff] [blame] | 340 | def choices(self, population, weights=None, *, cum_weights=None, k=1): |
Raymond Hettinger | e8f1e00 | 2016-09-06 17:15:29 -0700 | [diff] [blame] | 341 | """Return a k sized list of population elements chosen with replacement. |
| 342 | |
| 343 | If the relative weights or cumulative weights are not specified, |
| 344 | the selections are made with equal probability. |
| 345 | |
| 346 | """ |
Raymond Hettinger | 30d00e5 | 2016-10-29 16:55:36 -0700 | [diff] [blame] | 347 | random = self.random |
Raymond Hettinger | e8f1e00 | 2016-09-06 17:15:29 -0700 | [diff] [blame] | 348 | if cum_weights is None: |
| 349 | if weights is None: |
Raymond Hettinger | 30d00e5 | 2016-10-29 16:55:36 -0700 | [diff] [blame] | 350 | _int = int |
| 351 | total = len(population) |
| 352 | return [population[_int(random() * total)] for i in range(k)] |
Raymond Hettinger | 8567e58 | 2016-11-01 22:23:11 -0700 | [diff] [blame^] | 353 | cum_weights = list(_itertools.accumulate(weights)) |
Raymond Hettinger | e8f1e00 | 2016-09-06 17:15:29 -0700 | [diff] [blame] | 354 | elif weights is not None: |
| 355 | raise TypeError('Cannot specify both weights and cumulative_weights') |
| 356 | if len(cum_weights) != len(population): |
| 357 | raise ValueError('The number of weights does not match the population') |
| 358 | bisect = _bisect.bisect |
Raymond Hettinger | e8f1e00 | 2016-09-06 17:15:29 -0700 | [diff] [blame] | 359 | total = cum_weights[-1] |
| 360 | return [population[bisect(cum_weights, random() * total)] for i in range(k)] |
| 361 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 362 | ## -------------------- real-valued distributions ------------------- |
| 363 | |
| 364 | ## -------------------- uniform distribution ------------------- |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 365 | |
| 366 | def uniform(self, a, b): |
Raymond Hettinger | be40db0 | 2009-06-11 23:12:14 +0000 | [diff] [blame] | 367 | "Get a random number in the range [a, b) or [a, b] depending on rounding." |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 368 | return a + (b-a) * self.random() |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 369 | |
Christian Heimes | fe337bf | 2008-03-23 21:54:12 +0000 | [diff] [blame] | 370 | ## -------------------- triangular -------------------- |
| 371 | |
| 372 | def triangular(self, low=0.0, high=1.0, mode=None): |
| 373 | """Triangular distribution. |
| 374 | |
| 375 | Continuous distribution bounded by given lower and upper limits, |
| 376 | and having a given mode value in-between. |
| 377 | |
| 378 | http://en.wikipedia.org/wiki/Triangular_distribution |
| 379 | |
| 380 | """ |
| 381 | u = self.random() |
Raymond Hettinger | 978c6ab | 2014-05-25 17:25:27 -0700 | [diff] [blame] | 382 | try: |
| 383 | c = 0.5 if mode is None else (mode - low) / (high - low) |
| 384 | except ZeroDivisionError: |
| 385 | return low |
Christian Heimes | fe337bf | 2008-03-23 21:54:12 +0000 | [diff] [blame] | 386 | if u > c: |
| 387 | u = 1.0 - u |
| 388 | c = 1.0 - c |
| 389 | low, high = high, low |
| 390 | return low + (high - low) * (u * c) ** 0.5 |
| 391 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 392 | ## -------------------- normal distribution -------------------- |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 393 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 394 | def normalvariate(self, mu, sigma): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 395 | """Normal distribution. |
| 396 | |
| 397 | mu is the mean, and sigma is the standard deviation. |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 398 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 399 | """ |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 400 | # mu = mean, sigma = standard deviation |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 401 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 402 | # Uses Kinderman and Monahan method. Reference: Kinderman, |
| 403 | # A.J. and Monahan, J.F., "Computer generation of random |
| 404 | # variables using the ratio of uniform deviates", ACM Trans |
| 405 | # Math Software, 3, (1977), pp257-260. |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 406 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 407 | random = self.random |
Raymond Hettinger | 42406e6 | 2005-04-30 09:02:51 +0000 | [diff] [blame] | 408 | while 1: |
Tim Peters | 0c9886d | 2001-01-15 01:18:21 +0000 | [diff] [blame] | 409 | u1 = random() |
Raymond Hettinger | 73ced7e | 2003-01-04 09:26:32 +0000 | [diff] [blame] | 410 | u2 = 1.0 - random() |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 411 | z = NV_MAGICCONST*(u1-0.5)/u2 |
| 412 | zz = z*z/4.0 |
| 413 | if zz <= -_log(u2): |
| 414 | break |
| 415 | return mu + z*sigma |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 416 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 417 | ## -------------------- lognormal distribution -------------------- |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 418 | |
| 419 | def lognormvariate(self, mu, sigma): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 420 | """Log normal distribution. |
| 421 | |
| 422 | If you take the natural logarithm of this distribution, you'll get a |
| 423 | normal distribution with mean mu and standard deviation sigma. |
| 424 | mu can have any value, and sigma must be greater than zero. |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 425 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 426 | """ |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 427 | return _exp(self.normalvariate(mu, sigma)) |
| 428 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 429 | ## -------------------- exponential distribution -------------------- |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 430 | |
| 431 | def expovariate(self, lambd): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 432 | """Exponential distribution. |
| 433 | |
Mark Dickinson | 2f94736 | 2009-01-07 17:54:07 +0000 | [diff] [blame] | 434 | lambd is 1.0 divided by the desired mean. It should be |
| 435 | nonzero. (The parameter would be called "lambda", but that is |
| 436 | a reserved word in Python.) Returned values range from 0 to |
| 437 | positive infinity if lambd is positive, and from negative |
| 438 | infinity to 0 if lambd is negative. |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 439 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 440 | """ |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 441 | # lambd: rate lambd = 1/mean |
| 442 | # ('lambda' is a Python reserved word) |
| 443 | |
Raymond Hettinger | 5279fb9 | 2011-06-25 11:30:53 +0200 | [diff] [blame] | 444 | # we use 1-random() instead of random() to preclude the |
| 445 | # possibility of taking the log of zero. |
| 446 | return -_log(1.0 - self.random())/lambd |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 447 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 448 | ## -------------------- von Mises distribution -------------------- |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 449 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 450 | def vonmisesvariate(self, mu, kappa): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 451 | """Circular data distribution. |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 452 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 453 | mu is the mean angle, expressed in radians between 0 and 2*pi, and |
| 454 | kappa is the concentration parameter, which must be greater than or |
| 455 | equal to zero. If kappa is equal to zero, this distribution reduces |
| 456 | to a uniform random angle over the range 0 to 2*pi. |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 457 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 458 | """ |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 459 | # mu: mean angle (in radians between 0 and 2*pi) |
| 460 | # kappa: concentration parameter kappa (>= 0) |
| 461 | # if kappa = 0 generate uniform random angle |
| 462 | |
| 463 | # Based upon an algorithm published in: Fisher, N.I., |
| 464 | # "Statistical Analysis of Circular Data", Cambridge |
| 465 | # University Press, 1993. |
| 466 | |
| 467 | # Thanks to Magnus Kessler for a correction to the |
| 468 | # implementation of step 4. |
| 469 | |
| 470 | random = self.random |
| 471 | if kappa <= 1e-6: |
| 472 | return TWOPI * random() |
| 473 | |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 474 | s = 0.5 / kappa |
| 475 | r = s + _sqrt(1.0 + s * s) |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 476 | |
Raymond Hettinger | 42406e6 | 2005-04-30 09:02:51 +0000 | [diff] [blame] | 477 | while 1: |
Tim Peters | 0c9886d | 2001-01-15 01:18:21 +0000 | [diff] [blame] | 478 | u1 = random() |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 479 | z = _cos(_pi * u1) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 480 | |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 481 | d = z / (r + z) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 482 | u2 = random() |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 483 | if u2 < 1.0 - d * d or u2 <= (1.0 - d) * _exp(d): |
Tim Peters | 0c9886d | 2001-01-15 01:18:21 +0000 | [diff] [blame] | 484 | break |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 485 | |
Serhiy Storchaka | 6c22b1d | 2013-02-10 19:28:56 +0200 | [diff] [blame] | 486 | q = 1.0 / r |
| 487 | f = (q + z) / (1.0 + q * z) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 488 | u3 = random() |
| 489 | if u3 > 0.5: |
Mark Dickinson | be5f919 | 2013-02-10 14:16:10 +0000 | [diff] [blame] | 490 | theta = (mu + _acos(f)) % TWOPI |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 491 | else: |
Mark Dickinson | be5f919 | 2013-02-10 14:16:10 +0000 | [diff] [blame] | 492 | theta = (mu - _acos(f)) % TWOPI |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 493 | |
| 494 | return theta |
| 495 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 496 | ## -------------------- gamma distribution -------------------- |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 497 | |
| 498 | def gammavariate(self, alpha, beta): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 499 | """Gamma distribution. Not the gamma function! |
| 500 | |
| 501 | Conditions on the parameters are alpha > 0 and beta > 0. |
| 502 | |
Raymond Hettinger | a8e4d6e | 2011-03-22 15:55:51 -0700 | [diff] [blame] | 503 | The probability distribution function is: |
| 504 | |
| 505 | x ** (alpha - 1) * math.exp(-x / beta) |
| 506 | pdf(x) = -------------------------------------- |
| 507 | math.gamma(alpha) * beta ** alpha |
| 508 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 509 | """ |
Tim Peters | 8ac1495 | 2002-05-23 15:15:30 +0000 | [diff] [blame] | 510 | |
Raymond Hettinger | b760efb | 2002-05-14 06:40:34 +0000 | [diff] [blame] | 511 | # alpha > 0, beta > 0, mean is alpha*beta, variance is alpha*beta**2 |
Tim Peters | 8ac1495 | 2002-05-23 15:15:30 +0000 | [diff] [blame] | 512 | |
Guido van Rossum | 570764d | 2002-05-14 14:08:12 +0000 | [diff] [blame] | 513 | # Warning: a few older sources define the gamma distribution in terms |
| 514 | # of alpha > -1.0 |
| 515 | if alpha <= 0.0 or beta <= 0.0: |
Collin Winter | ce36ad8 | 2007-08-30 01:19:48 +0000 | [diff] [blame] | 516 | raise ValueError('gammavariate: alpha and beta must be > 0.0') |
Tim Peters | 8ac1495 | 2002-05-23 15:15:30 +0000 | [diff] [blame] | 517 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 518 | random = self.random |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 519 | if alpha > 1.0: |
| 520 | |
| 521 | # Uses R.C.H. Cheng, "The generation of Gamma |
| 522 | # variables with non-integral shape parameters", |
| 523 | # Applied Statistics, (1977), 26, No. 1, p71-74 |
| 524 | |
Raymond Hettinger | ca6cdc2 | 2002-05-13 23:40:14 +0000 | [diff] [blame] | 525 | ainv = _sqrt(2.0 * alpha - 1.0) |
| 526 | bbb = alpha - LOG4 |
| 527 | ccc = alpha + ainv |
Tim Peters | 8ac1495 | 2002-05-23 15:15:30 +0000 | [diff] [blame] | 528 | |
Raymond Hettinger | 42406e6 | 2005-04-30 09:02:51 +0000 | [diff] [blame] | 529 | while 1: |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 530 | u1 = random() |
Raymond Hettinger | 73ced7e | 2003-01-04 09:26:32 +0000 | [diff] [blame] | 531 | if not 1e-7 < u1 < .9999999: |
| 532 | continue |
| 533 | u2 = 1.0 - random() |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 534 | v = _log(u1/(1.0-u1))/ainv |
| 535 | x = alpha*_exp(v) |
| 536 | z = u1*u1*u2 |
| 537 | r = bbb+ccc*v-x |
| 538 | if r + SG_MAGICCONST - 4.5*z >= 0.0 or r >= _log(z): |
Raymond Hettinger | b760efb | 2002-05-14 06:40:34 +0000 | [diff] [blame] | 539 | return x * beta |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 540 | |
| 541 | elif alpha == 1.0: |
| 542 | # expovariate(1) |
| 543 | u = random() |
| 544 | while u <= 1e-7: |
| 545 | u = random() |
Raymond Hettinger | b760efb | 2002-05-14 06:40:34 +0000 | [diff] [blame] | 546 | return -_log(u) * beta |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 547 | |
| 548 | else: # alpha is between 0 and 1 (exclusive) |
| 549 | |
| 550 | # Uses ALGORITHM GS of Statistical Computing - Kennedy & Gentle |
| 551 | |
Raymond Hettinger | 42406e6 | 2005-04-30 09:02:51 +0000 | [diff] [blame] | 552 | while 1: |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 553 | u = random() |
| 554 | b = (_e + alpha)/_e |
| 555 | p = b*u |
| 556 | if p <= 1.0: |
Raymond Hettinger | 42406e6 | 2005-04-30 09:02:51 +0000 | [diff] [blame] | 557 | x = p ** (1.0/alpha) |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 558 | else: |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 559 | x = -_log((b-p)/alpha) |
| 560 | u1 = random() |
Raymond Hettinger | 42406e6 | 2005-04-30 09:02:51 +0000 | [diff] [blame] | 561 | if p > 1.0: |
| 562 | if u1 <= x ** (alpha - 1.0): |
| 563 | break |
| 564 | elif u1 <= _exp(-x): |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 565 | break |
Raymond Hettinger | b760efb | 2002-05-14 06:40:34 +0000 | [diff] [blame] | 566 | return x * beta |
| 567 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 568 | ## -------------------- Gauss (faster alternative) -------------------- |
Guido van Rossum | 95bfcda | 1994-03-09 14:21:05 +0000 | [diff] [blame] | 569 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 570 | def gauss(self, mu, sigma): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 571 | """Gaussian distribution. |
| 572 | |
| 573 | mu is the mean, and sigma is the standard deviation. This is |
| 574 | slightly faster than the normalvariate() function. |
| 575 | |
| 576 | Not thread-safe without a lock around calls. |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 577 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 578 | """ |
Guido van Rossum | cc32ac9 | 1994-03-15 16:10:24 +0000 | [diff] [blame] | 579 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 580 | # When x and y are two variables from [0, 1), uniformly |
| 581 | # distributed, then |
| 582 | # |
| 583 | # cos(2*pi*x)*sqrt(-2*log(1-y)) |
| 584 | # sin(2*pi*x)*sqrt(-2*log(1-y)) |
| 585 | # |
| 586 | # are two *independent* variables with normal distribution |
| 587 | # (mu = 0, sigma = 1). |
| 588 | # (Lambert Meertens) |
| 589 | # (corrected version; bug discovered by Mike Miller, fixed by LM) |
Guido van Rossum | cc32ac9 | 1994-03-15 16:10:24 +0000 | [diff] [blame] | 590 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 591 | # Multithreading note: When two threads call this function |
| 592 | # simultaneously, it is possible that they will receive the |
| 593 | # same return value. The window is very small though. To |
| 594 | # avoid this, you have to use a lock around all calls. (I |
| 595 | # didn't want to slow this down in the serial case by using a |
| 596 | # lock here.) |
Guido van Rossum | d03e119 | 1998-05-29 17:51:31 +0000 | [diff] [blame] | 597 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 598 | random = self.random |
| 599 | z = self.gauss_next |
| 600 | self.gauss_next = None |
| 601 | if z is None: |
| 602 | x2pi = random() * TWOPI |
| 603 | g2rad = _sqrt(-2.0 * _log(1.0 - random())) |
| 604 | z = _cos(x2pi) * g2rad |
| 605 | self.gauss_next = _sin(x2pi) * g2rad |
Guido van Rossum | cc32ac9 | 1994-03-15 16:10:24 +0000 | [diff] [blame] | 606 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 607 | return mu + z*sigma |
Guido van Rossum | 95bfcda | 1994-03-09 14:21:05 +0000 | [diff] [blame] | 608 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 609 | ## -------------------- beta -------------------- |
Tim Peters | 85e2e47 | 2001-01-26 06:49:56 +0000 | [diff] [blame] | 610 | ## See |
Ezio Melotti | 20f53f1 | 2011-04-15 08:25:16 +0300 | [diff] [blame] | 611 | ## http://mail.python.org/pipermail/python-bugs-list/2001-January/003752.html |
Tim Peters | 85e2e47 | 2001-01-26 06:49:56 +0000 | [diff] [blame] | 612 | ## for Ivan Frohne's insightful analysis of why the original implementation: |
| 613 | ## |
| 614 | ## def betavariate(self, alpha, beta): |
| 615 | ## # Discrete Event Simulation in C, pp 87-88. |
| 616 | ## |
| 617 | ## y = self.expovariate(alpha) |
| 618 | ## z = self.expovariate(1.0/beta) |
| 619 | ## return z/(y+z) |
| 620 | ## |
| 621 | ## was dead wrong, and how it probably got that way. |
Guido van Rossum | 95bfcda | 1994-03-09 14:21:05 +0000 | [diff] [blame] | 622 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 623 | def betavariate(self, alpha, beta): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 624 | """Beta distribution. |
| 625 | |
Thomas Wouters | b213704 | 2007-02-01 18:02:27 +0000 | [diff] [blame] | 626 | Conditions on the parameters are alpha > 0 and beta > 0. |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 627 | Returned values range between 0 and 1. |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 628 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 629 | """ |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 630 | |
Tim Peters | 85e2e47 | 2001-01-26 06:49:56 +0000 | [diff] [blame] | 631 | # This version due to Janne Sinkkonen, and matches all the std |
| 632 | # texts (e.g., Knuth Vol 2 Ed 3 pg 134 "the beta distribution"). |
Raymond Hettinger | 650c1c9 | 2016-06-25 05:36:42 +0300 | [diff] [blame] | 633 | y = self.gammavariate(alpha, 1.0) |
Tim Peters | 85e2e47 | 2001-01-26 06:49:56 +0000 | [diff] [blame] | 634 | if y == 0: |
| 635 | return 0.0 |
| 636 | else: |
Raymond Hettinger | 650c1c9 | 2016-06-25 05:36:42 +0300 | [diff] [blame] | 637 | return y / (y + self.gammavariate(beta, 1.0)) |
Guido van Rossum | 95bfcda | 1994-03-09 14:21:05 +0000 | [diff] [blame] | 638 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 639 | ## -------------------- Pareto -------------------- |
Guido van Rossum | cf4559a | 1997-12-02 02:47:39 +0000 | [diff] [blame] | 640 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 641 | def paretovariate(self, alpha): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 642 | """Pareto distribution. alpha is the shape parameter.""" |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 643 | # Jain, pg. 495 |
Guido van Rossum | cf4559a | 1997-12-02 02:47:39 +0000 | [diff] [blame] | 644 | |
Raymond Hettinger | 73ced7e | 2003-01-04 09:26:32 +0000 | [diff] [blame] | 645 | u = 1.0 - self.random() |
Raymond Hettinger | 8ff1099 | 2010-09-08 18:58:33 +0000 | [diff] [blame] | 646 | return 1.0 / u ** (1.0/alpha) |
Guido van Rossum | cf4559a | 1997-12-02 02:47:39 +0000 | [diff] [blame] | 647 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 648 | ## -------------------- Weibull -------------------- |
Guido van Rossum | cf4559a | 1997-12-02 02:47:39 +0000 | [diff] [blame] | 649 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 650 | def weibullvariate(self, alpha, beta): |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 651 | """Weibull distribution. |
| 652 | |
| 653 | alpha is the scale parameter and beta is the shape parameter. |
Raymond Hettinger | ef4d4bd | 2002-05-23 23:58:17 +0000 | [diff] [blame] | 654 | |
Raymond Hettinger | c32f033 | 2002-05-23 19:44:49 +0000 | [diff] [blame] | 655 | """ |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 656 | # Jain, pg. 499; bug fix courtesy Bill Arms |
Guido van Rossum | cf4559a | 1997-12-02 02:47:39 +0000 | [diff] [blame] | 657 | |
Raymond Hettinger | 73ced7e | 2003-01-04 09:26:32 +0000 | [diff] [blame] | 658 | u = 1.0 - self.random() |
Raymond Hettinger | 183cd1f | 2010-09-08 18:48:21 +0000 | [diff] [blame] | 659 | return alpha * (-_log(u)) ** (1.0/beta) |
Guido van Rossum | 6c395ba | 1999-08-18 13:53:28 +0000 | [diff] [blame] | 660 | |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 661 | ## --------------- Operating System Random Source ------------------ |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 662 | |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 663 | class SystemRandom(Random): |
| 664 | """Alternate random number generator using sources provided |
| 665 | by the operating system (such as /dev/urandom on Unix or |
| 666 | CryptGenRandom on Windows). |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 667 | |
| 668 | Not available on all systems (see os.urandom() for details). |
| 669 | """ |
| 670 | |
| 671 | def random(self): |
| 672 | """Get the next random number in the range [0.0, 1.0).""" |
Raymond Hettinger | 183cd1f | 2010-09-08 18:48:21 +0000 | [diff] [blame] | 673 | return (int.from_bytes(_urandom(7), 'big') >> 3) * RECIP_BPF |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 674 | |
| 675 | def getrandbits(self, k): |
Serhiy Storchaka | 9594942 | 2013-08-27 19:40:23 +0300 | [diff] [blame] | 676 | """getrandbits(k) -> x. Generates an int with k random bits.""" |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 677 | if k <= 0: |
| 678 | raise ValueError('number of bits must be greater than zero') |
| 679 | if k != int(k): |
| 680 | raise TypeError('number of bits should be an integer') |
Raymond Hettinger | 63b1767 | 2010-09-08 19:27:59 +0000 | [diff] [blame] | 681 | numbytes = (k + 7) // 8 # bits / 8 and rounded up |
| 682 | x = int.from_bytes(_urandom(numbytes), 'big') |
| 683 | return x >> (numbytes * 8 - k) # trim excess bits |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 684 | |
Raymond Hettinger | 28de64f | 2008-01-13 23:40:30 +0000 | [diff] [blame] | 685 | def seed(self, *args, **kwds): |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 686 | "Stub method. Not used for a system random number generator." |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 687 | return None |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 688 | |
| 689 | def _notimplemented(self, *args, **kwds): |
Raymond Hettinger | 23f1241 | 2004-09-13 22:23:21 +0000 | [diff] [blame] | 690 | "Method should not be called for a system random number generator." |
| 691 | raise NotImplementedError('System entropy source does not have state.') |
Raymond Hettinger | 356a459 | 2004-08-30 06:14:31 +0000 | [diff] [blame] | 692 | getstate = setstate = _notimplemented |
| 693 | |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 694 | ## -------------------- test program -------------------- |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 695 | |
Raymond Hettinger | 6229713 | 2003-08-30 01:24:19 +0000 | [diff] [blame] | 696 | def _test_generator(n, func, args): |
Tim Peters | 0c9886d | 2001-01-15 01:18:21 +0000 | [diff] [blame] | 697 | import time |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 698 | print(n, 'times', func.__name__) |
Raymond Hettinger | b98154e | 2003-05-24 17:26:02 +0000 | [diff] [blame] | 699 | total = 0.0 |
Tim Peters | 0c9886d | 2001-01-15 01:18:21 +0000 | [diff] [blame] | 700 | sqsum = 0.0 |
| 701 | smallest = 1e10 |
| 702 | largest = -1e10 |
| 703 | t0 = time.time() |
| 704 | for i in range(n): |
Raymond Hettinger | 6229713 | 2003-08-30 01:24:19 +0000 | [diff] [blame] | 705 | x = func(*args) |
Raymond Hettinger | b98154e | 2003-05-24 17:26:02 +0000 | [diff] [blame] | 706 | total += x |
Tim Peters | 0c9886d | 2001-01-15 01:18:21 +0000 | [diff] [blame] | 707 | sqsum = sqsum + x*x |
| 708 | smallest = min(x, smallest) |
| 709 | largest = max(x, largest) |
| 710 | t1 = time.time() |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 711 | print(round(t1-t0, 3), 'sec,', end=' ') |
Raymond Hettinger | b98154e | 2003-05-24 17:26:02 +0000 | [diff] [blame] | 712 | avg = total/n |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 713 | stddev = _sqrt(sqsum/n - avg*avg) |
Raymond Hettinger | 1f54814 | 2014-05-19 20:21:43 +0100 | [diff] [blame] | 714 | print('avg %g, stddev %g, min %g, max %g\n' % \ |
Guido van Rossum | be19ed7 | 2007-02-09 05:37:30 +0000 | [diff] [blame] | 715 | (avg, stddev, smallest, largest)) |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 716 | |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 717 | |
| 718 | def _test(N=2000): |
Raymond Hettinger | 6229713 | 2003-08-30 01:24:19 +0000 | [diff] [blame] | 719 | _test_generator(N, random, ()) |
| 720 | _test_generator(N, normalvariate, (0.0, 1.0)) |
| 721 | _test_generator(N, lognormvariate, (0.0, 1.0)) |
| 722 | _test_generator(N, vonmisesvariate, (0.0, 1.0)) |
| 723 | _test_generator(N, gammavariate, (0.01, 1.0)) |
| 724 | _test_generator(N, gammavariate, (0.1, 1.0)) |
| 725 | _test_generator(N, gammavariate, (0.1, 2.0)) |
| 726 | _test_generator(N, gammavariate, (0.5, 1.0)) |
| 727 | _test_generator(N, gammavariate, (0.9, 1.0)) |
| 728 | _test_generator(N, gammavariate, (1.0, 1.0)) |
| 729 | _test_generator(N, gammavariate, (2.0, 1.0)) |
| 730 | _test_generator(N, gammavariate, (20.0, 1.0)) |
| 731 | _test_generator(N, gammavariate, (200.0, 1.0)) |
| 732 | _test_generator(N, gauss, (0.0, 1.0)) |
| 733 | _test_generator(N, betavariate, (3.0, 3.0)) |
Christian Heimes | fe337bf | 2008-03-23 21:54:12 +0000 | [diff] [blame] | 734 | _test_generator(N, triangular, (0.0, 1.0, 1.0/3.0)) |
Tim Peters | cd80410 | 2001-01-25 20:25:57 +0000 | [diff] [blame] | 735 | |
Tim Peters | 715c4c4 | 2001-01-26 22:56:56 +0000 | [diff] [blame] | 736 | # Create one instance, seeded from current time, and export its methods |
Raymond Hettinger | 40f6217 | 2002-12-29 23:03:38 +0000 | [diff] [blame] | 737 | # as module-level functions. The functions share state across all uses |
| 738 | #(both in the user's code and in the Python libraries), but that's fine |
| 739 | # for most programs and is easier for the casual user than making them |
| 740 | # instantiate their own Random() instance. |
| 741 | |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 742 | _inst = Random() |
| 743 | seed = _inst.seed |
| 744 | random = _inst.random |
| 745 | uniform = _inst.uniform |
Christian Heimes | fe337bf | 2008-03-23 21:54:12 +0000 | [diff] [blame] | 746 | triangular = _inst.triangular |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 747 | randint = _inst.randint |
| 748 | choice = _inst.choice |
| 749 | randrange = _inst.randrange |
Raymond Hettinger | f24eb35 | 2002-11-12 17:41:57 +0000 | [diff] [blame] | 750 | sample = _inst.sample |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 751 | shuffle = _inst.shuffle |
Raymond Hettinger | 28aa4a0 | 2016-09-07 00:08:44 -0700 | [diff] [blame] | 752 | choices = _inst.choices |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 753 | normalvariate = _inst.normalvariate |
| 754 | lognormvariate = _inst.lognormvariate |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 755 | expovariate = _inst.expovariate |
| 756 | vonmisesvariate = _inst.vonmisesvariate |
| 757 | gammavariate = _inst.gammavariate |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 758 | gauss = _inst.gauss |
| 759 | betavariate = _inst.betavariate |
| 760 | paretovariate = _inst.paretovariate |
| 761 | weibullvariate = _inst.weibullvariate |
| 762 | getstate = _inst.getstate |
| 763 | setstate = _inst.setstate |
Raymond Hettinger | 2f726e9 | 2003-10-05 09:09:15 +0000 | [diff] [blame] | 764 | getrandbits = _inst.getrandbits |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 765 | |
Guido van Rossum | ff03b1a | 1994-03-09 12:55:02 +0000 | [diff] [blame] | 766 | if __name__ == '__main__': |
Tim Peters | d7b5e88 | 2001-01-25 03:36:26 +0000 | [diff] [blame] | 767 | _test() |