blob: 0b82bf47bb69986b449659f6d175cd7fb0885ee7 [file] [log] [blame]
Georg Brandl116aa622007-08-15 14:28:22 +00001
2:mod:`random` --- Generate pseudo-random numbers
3================================================
4
5.. module:: random
6 :synopsis: Generate pseudo-random numbers with various common distributions.
7
8
9This module implements pseudo-random number generators for various
10distributions.
11
12For integers, uniform selection from a range. For sequences, uniform selection
13of a random element, a function to generate a random permutation of a list
14in-place, and a function for random sampling without replacement.
15
16On the real line, there are functions to compute uniform, normal (Gaussian),
17lognormal, negative exponential, gamma, and beta distributions. For generating
18distributions of angles, the von Mises distribution is available.
19
20Almost all module functions depend on the basic function :func:`random`, which
21generates a random float uniformly in the semi-open range [0.0, 1.0). Python
22uses the Mersenne Twister as the core generator. It produces 53-bit precision
23floats and has a period of 2\*\*19937-1. The underlying implementation in C is
24both fast and threadsafe. The Mersenne Twister is one of the most extensively
25tested random number generators in existence. However, being completely
26deterministic, it is not suitable for all purposes, and is completely unsuitable
27for cryptographic purposes.
28
29The functions supplied by this module are actually bound methods of a hidden
30instance of the :class:`random.Random` class. You can instantiate your own
Raymond Hettinger28de64f2008-01-13 23:40:30 +000031instances of :class:`Random` to get generators that don't share state.
Georg Brandl116aa622007-08-15 14:28:22 +000032
33Class :class:`Random` can also be subclassed if you want to use a different
34basic generator of your own devising: in that case, override the :meth:`random`,
Raymond Hettinger28de64f2008-01-13 23:40:30 +000035:meth:`seed`, :meth:`getstate`, and :meth:`setstate`.
Georg Brandl116aa622007-08-15 14:28:22 +000036Optionally, a new generator can supply a :meth:`getrandombits` method --- this
37allows :meth:`randrange` to produce selections over an arbitrarily large range.
38
Georg Brandl116aa622007-08-15 14:28:22 +000039
Georg Brandl116aa622007-08-15 14:28:22 +000040Bookkeeping functions:
41
42
43.. function:: seed([x])
44
45 Initialize the basic random number generator. Optional argument *x* can be any
Guido van Rossum2cc30da2007-11-02 23:46:40 +000046 :term:`hashable` object. If *x* is omitted or ``None``, current system time is used;
Georg Brandl116aa622007-08-15 14:28:22 +000047 current system time is also used to initialize the generator when the module is
48 first imported. If randomness sources are provided by the operating system,
49 they are used instead of the system time (see the :func:`os.urandom` function
50 for details on availability).
51
Georg Brandl5c106642007-11-29 17:41:05 +000052 If *x* is not ``None`` or an int, ``hash(x)`` is used instead. If *x* is an
53 int, *x* is used directly.
Georg Brandl116aa622007-08-15 14:28:22 +000054
55
56.. function:: getstate()
57
58 Return an object capturing the current internal state of the generator. This
59 object can be passed to :func:`setstate` to restore the state.
60
Christian Heimescbf3b5c2007-12-03 21:02:03 +000061 State values produced in Python 2.6 cannot be loaded into earlier versions.
62
Georg Brandl116aa622007-08-15 14:28:22 +000063
64.. function:: setstate(state)
65
66 *state* should have been obtained from a previous call to :func:`getstate`, and
67 :func:`setstate` restores the internal state of the generator to what it was at
68 the time :func:`setstate` was called.
69
Georg Brandl116aa622007-08-15 14:28:22 +000070
Christian Heimesc3f30c42008-02-22 16:37:40 +000071.. function:: jumpahead(n)
72
73 Change the internal state to one different from and likely far away from the
74 current state. *n* is a non-negative integer which is used to scramble the
75 current state vector. This is most useful in multi-threaded programs, in
76 conjunction with multiple instances of the :class:`Random` class:
77 :meth:`setstate` or :meth:`seed` can be used to force all instances into the
78 same internal state, and then :meth:`jumpahead` can be used to force the
79 instances' states far apart.
80
81
Georg Brandl116aa622007-08-15 14:28:22 +000082.. function:: getrandbits(k)
83
Georg Brandl5c106642007-11-29 17:41:05 +000084 Returns a python integer with *k* random bits. This method is supplied with
85 the MersenneTwister generator and some other generators may also provide it
Georg Brandl116aa622007-08-15 14:28:22 +000086 as an optional part of the API. When available, :meth:`getrandbits` enables
87 :meth:`randrange` to handle arbitrarily large ranges.
88
Georg Brandl116aa622007-08-15 14:28:22 +000089
90Functions for integers:
91
Georg Brandl116aa622007-08-15 14:28:22 +000092.. function:: randrange([start,] stop[, step])
93
94 Return a randomly selected element from ``range(start, stop, step)``. This is
95 equivalent to ``choice(range(start, stop, step))``, but doesn't actually build a
96 range object.
97
Georg Brandl116aa622007-08-15 14:28:22 +000098
99.. function:: randint(a, b)
100
101 Return a random integer *N* such that ``a <= N <= b``.
102
Georg Brandl116aa622007-08-15 14:28:22 +0000103
Georg Brandl55ac8f02007-09-01 13:51:09 +0000104Functions for sequences:
Georg Brandl116aa622007-08-15 14:28:22 +0000105
106.. function:: choice(seq)
107
108 Return a random element from the non-empty sequence *seq*. If *seq* is empty,
109 raises :exc:`IndexError`.
110
111
112.. function:: shuffle(x[, random])
113
114 Shuffle the sequence *x* in place. The optional argument *random* is a
115 0-argument function returning a random float in [0.0, 1.0); by default, this is
116 the function :func:`random`.
117
118 Note that for even rather small ``len(x)``, the total number of permutations of
119 *x* is larger than the period of most random number generators; this implies
120 that most permutations of a long sequence can never be generated.
121
122
123.. function:: sample(population, k)
124
Raymond Hettinger1acde192008-01-14 01:00:53 +0000125 Return a *k* length list of unique elements chosen from the population sequence
126 or set. Used for random sampling without replacement.
Georg Brandl116aa622007-08-15 14:28:22 +0000127
Georg Brandl116aa622007-08-15 14:28:22 +0000128 Returns a new list containing elements from the population while leaving the
129 original population unchanged. The resulting list is in selection order so that
130 all sub-slices will also be valid random samples. This allows raffle winners
131 (the sample) to be partitioned into grand prize and second place winners (the
132 subslices).
133
Guido van Rossum2cc30da2007-11-02 23:46:40 +0000134 Members of the population need not be :term:`hashable` or unique. If the population
Georg Brandl116aa622007-08-15 14:28:22 +0000135 contains repeats, then each occurrence is a possible selection in the sample.
136
137 To choose a sample from a range of integers, use an :func:`range` object as an
138 argument. This is especially fast and space efficient for sampling from a large
139 population: ``sample(range(10000000), 60)``.
140
141The following functions generate specific real-valued distributions. Function
142parameters are named after the corresponding variables in the distribution's
143equation, as used in common mathematical practice; most of these equations can
144be found in any statistics text.
145
146
147.. function:: random()
148
149 Return the next random floating point number in the range [0.0, 1.0).
150
151
152.. function:: uniform(a, b)
153
154 Return a random floating point number *N* such that ``a <= N < b``.
155
Christian Heimesfe337bf2008-03-23 21:54:12 +0000156.. function:: triangular(low, high, mode)
157
158 Return a random floating point number *N* such that ``low <= N < high``
159 and with the specified *mode* between those bounds.
160
161 If *mode* is not specified or is ``None``, it defaults to the midpoint
162 between the upper and lower bounds, producing a symmetric distribution.
163
164 The default values for *low* and *high* are zero and one.
Georg Brandl116aa622007-08-15 14:28:22 +0000165
166.. function:: betavariate(alpha, beta)
167
168 Beta distribution. Conditions on the parameters are ``alpha > 0`` and ``beta >
169 0``. Returned values range between 0 and 1.
170
171
172.. function:: expovariate(lambd)
173
174 Exponential distribution. *lambd* is 1.0 divided by the desired mean. (The
175 parameter would be called "lambda", but that is a reserved word in Python.)
176 Returned values range from 0 to positive infinity.
177
178
179.. function:: gammavariate(alpha, beta)
180
181 Gamma distribution. (*Not* the gamma function!) Conditions on the parameters
182 are ``alpha > 0`` and ``beta > 0``.
183
184
185.. function:: gauss(mu, sigma)
186
187 Gaussian distribution. *mu* is the mean, and *sigma* is the standard deviation.
188 This is slightly faster than the :func:`normalvariate` function defined below.
189
190
191.. function:: lognormvariate(mu, sigma)
192
193 Log normal distribution. If you take the natural logarithm of this
194 distribution, you'll get a normal distribution with mean *mu* and standard
195 deviation *sigma*. *mu* can have any value, and *sigma* must be greater than
196 zero.
197
198
199.. function:: normalvariate(mu, sigma)
200
201 Normal distribution. *mu* is the mean, and *sigma* is the standard deviation.
202
203
204.. function:: vonmisesvariate(mu, kappa)
205
206 *mu* is the mean angle, expressed in radians between 0 and 2\*\ *pi*, and *kappa*
207 is the concentration parameter, which must be greater than or equal to zero. If
208 *kappa* is equal to zero, this distribution reduces to a uniform random angle
209 over the range 0 to 2\*\ *pi*.
210
211
212.. function:: paretovariate(alpha)
213
214 Pareto distribution. *alpha* is the shape parameter.
215
216
217.. function:: weibullvariate(alpha, beta)
218
219 Weibull distribution. *alpha* is the scale parameter and *beta* is the shape
220 parameter.
221
222
223Alternative Generators:
224
Georg Brandl116aa622007-08-15 14:28:22 +0000225.. class:: SystemRandom([seed])
226
227 Class that uses the :func:`os.urandom` function for generating random numbers
228 from sources provided by the operating system. Not available on all systems.
229 Does not rely on software state and sequences are not reproducible. Accordingly,
230 the :meth:`seed` and :meth:`jumpahead` methods have no effect and are ignored.
231 The :meth:`getstate` and :meth:`setstate` methods raise
232 :exc:`NotImplementedError` if called.
233
Georg Brandl116aa622007-08-15 14:28:22 +0000234
235Examples of basic usage::
236
237 >>> random.random() # Random float x, 0.0 <= x < 1.0
238 0.37444887175646646
239 >>> random.uniform(1, 10) # Random float x, 1.0 <= x < 10.0
240 1.1800146073117523
241 >>> random.randint(1, 10) # Integer from 1 to 10, endpoints included
242 7
243 >>> random.randrange(0, 101, 2) # Even integer from 0 to 100
244 26
245 >>> random.choice('abcdefghij') # Choose a random element
246 'c'
247
248 >>> items = [1, 2, 3, 4, 5, 6, 7]
249 >>> random.shuffle(items)
250 >>> items
251 [7, 3, 2, 5, 6, 4, 1]
252
253 >>> random.sample([1, 2, 3, 4, 5], 3) # Choose 3 elements
254 [4, 1, 5]
255
256
257
258.. seealso::
259
260 M. Matsumoto and T. Nishimura, "Mersenne Twister: A 623-dimensionally
261 equidistributed uniform pseudorandom number generator", ACM Transactions on
262 Modeling and Computer Simulation Vol. 8, No. 1, January pp.3-30 1998.
263
Georg Brandl116aa622007-08-15 14:28:22 +0000264