{|j ^ d Z ddlmZ ddlmZmZm Z
m Z m
Z ddlmZmZmZmZ ddlmZmZmZ ddlm Z m Z m!Z" ddl#m$Z% ddl&m'Z( dd l)m*Z+ dd
l,m-Z.m/Z0 dd l1m1Z2 dd l#Z3dd l4Z4 dd
l5m6Z7 g dZ:d ed z ed z Z; ed Zde> z Z?dZ@ G d de4j ZA G d deA ZB eA ZCeCj ZDeCj ZEeCj ZFeCj ZGeCj ZHeCj ZIeCj ZJeCj ZKeCj ZLeCj ZMeCj ZNeCj ZOeCj ZPeCj ZQeCj ZReCj ZSeCj ZTeCj ZUeCj ZVeCj ZWeCj ZXeCj ZYeCj ZZeCj Z[d Z\d!d Z] e^e3d r e3j eCj e`d k( r e] y y # e8$ r
dd
l9m6Z7 Y w xY w)"aE Random variable generators.
bytes
-----
uniform bytes (values between 0 and 255)
integers
--------
uniform within range
sequences
---------
pick random element
pick random sample
pick weighted random sample
generate random permutation
distributions on the real line:
------------------------------
uniform
triangular
normal (Gaussian)
lognormal
negative exponential
gamma
beta
pareto
Weibull
distributions on the circle (angles 0 to 2pi)
---------------------------------------------
circular uniform
von Mises
discrete distributions
----------------------
binomial
General notes on the underlying Mersenne Twister core generator:
* The period is 2**19937-1.
* It is one of the most extensively tested generators in existence.
* The random() method is implemented in C, executes in a single Python step,
and is, therefore, threadsafe.
)warn)logexppieceil)sqrtacoscossin)taufloorisfinite)lgammafabslog2)urandom)Sequence)index)
accumulaterepeat)bisectN)sha512)Random SystemRandom betavariatebinomialvariatechoicechoices expovariate gammavariategauss getrandbitsgetstatelognormvariate
normalvariate
paretovariate randbytesrandintrandom randrangesampleseedsetstateshuffle
triangularuniformvonmisesvariateweibullvariate g @ @ ? @5 c e Zd ZdZdZd$dZd% fd Z fdZ fdZd Z d Z
d
Z d Z d Z
d
ez fdZe
Zd ZdefdZd Zd Zd ZdddZd$dd
ddZd Zd&dZd'dZd'dZ d Z d(d Z d Z d Z d Z!d! Z"d" Z#d)d#Z$ xZ%S )*r a Random number generator base class used by bound module functions.
Used to instantiate instances of Random to get generators that don't
share state.
Class Random can also be subclassed if you want to use a different basic
generator of your own devising: in that case, override the following
methods: random(), seed(), getstate(), and setstate().
Optionally, implement a getrandbits() method so that randrange()
can cover arbitrarily large ranges.
Nc 4 | j | d| _ y)zeInitialize an instance.
Optional argument x controls seeding, as for Random.seed().
N)r-
gauss_next)selfxs /usr/lib64/python3.12/random.py__init__zRandom.__init__~ s
! c |dk( rt |t t f rpt |t r|j d n|}|rt |d dz nd}t t | D ]
}d|z |z dz } |t
| z }|dk( rdn|}n|d k( rkt |t t t f rPt |t r|j }t j |t | j z }n:t |t d
t t t t t f s t d t | E | d
| _ y
) a\ Initialize internal state from a seed.
The only supported seed types are None, int, float,
str, bytes, and bytearray.
None or no argument seeds from current time or from an operating
system specific randomness source if available.
If *a* is an int, all bits are used.
For version 2 (the default), all of the bits are used if *a* is a str,
bytes, or bytearray. For version 1 (provided for reproducing random
sequences from older versions of Python), the algorithm for str and
bytes generates a narrower range of seeds.
r; zlatin-1r iCB l r: NzOThe only supported seed types are: None,
int, float, str, bytes, and bytearray.)
isinstancestrbytesdecodeordmaplen bytearrayencodeint
from_bytes_sha512digesttypefloat TypeErrorsuperr- r? )r@ aversionrA c __class__s rB r- z Random.seed s $ az"Random.setstate.. s %K]a7m]s Nzstate with version z( passed to Random.setstate() of version )r? rY r. tuple
ValueErrorrX r_ )r@ stater[
internalstater r] s rB r. zRandom.setstate s ( a<6; 3G]DO G ] +
\6; 3G]DO
' %%K]%K K
G ] + %t|| 5 6
6
' Q&
's A5 5 B
>BB
c " | j S N)r$ r@ s rB __getstate__zRandom.__getstate__ s }} rD c & | j | y rj )r. )r@ rg s rB __setstate__zRandom.__setstate__ s
e rD c < | j d| j fS )Nrb )r] r$ rk s rB
__reduce__zRandom.__reduce__ s ~~r4==?22rD c | j D ]T }d|j v r yd|j v r| j | _ yd|j v sC| j | _ y y)a Control how subclasses generate random integers.
The algorithm a subclass can use depends on the random() and/or
getrandbits() implementation available to it and determines
whether it can generate random integers from arbitrarily large
ranges.
_randbelowr# r* N)__mro____dict___randbelow_with_getrandbitsrr _randbelow_without_getrandbits)clskwargsr\ s rB __init_subclass__zRandom.__init_subclass__ sY Aqzz)
*!$!@!@1::%!$!C!C rD c t | j }|j } || }||k\ r || }||k\ r|S )z;Return a random int in the range [0,n). Defined for n > 0.)r#
bit_length)r@ nr# krs rB ru z"Random._randbelow_with_getrandbits sA &&
LLN N1fAA 1frD r; c | j }||k\ r t d t | |z S ||z }||z
|z } | }||k\ r
| }||k\ r
t ||z |z S )zReturn a random int in the range [0,n). Defined for n > 0.
The implementation does not use getrandbits, but only random.
zUnderlying random() generator does not supply
enough bits to choose from a population range this large.
To remove the range limitation, add a getrandbits() method.)r* _warn_floor)r@ r| maxsizer* remlimitr~ s rB rv z%Random._randbelow_without_getrandbits s < N
O &(Q,' 'k3 ') H5jA 5ja'k"Q&&rD c J | j |dz j |d S )Generate n random bytes. little)r# to_bytesr@ r| s rB r( zRandom.randbytes s$ A&//8<t | }
t | D ]# } |
||z
}|
| | |< |
||z
d
z
|
|< % | S t }|j }t | D ]+ } |
| }||v r
|
| }||v r
|| || | |< - | S c c} w )af Chooses k unique random elements from a population sequence.
Returns a new list containing elements from the population while
leaving the original population unchanged. The resulting list is
in selection order so that all sub-slices will also be valid random
samples. This allows raffle winners (the sample) to be partitioned
into grand prize and second place winners (the subslices).
Members of the population need not be hashable or unique. If the
population contains repeats, then each occurrence is a possible
selection in the sample.
Repeated elements can be specified one at a time or with the optional
counts parameter. For example:
sample(['red', 'blue'], counts=[4, 2], k=5)
is equivalent to:
sample(['red', 'red', 'red', 'red', 'blue', 'blue'], k=5)
To choose a sample from a range of integers, use range() for the
population argument. This is especially fast and space efficient
for sampling from a large population:
sample(range(10000000), 60)
zAPopulation must be a sequence. For dicts or sets, use sorted(d).Nz2The number of counts does not match the populationr zCounts must be integerszCounts must be non-negative)r} z,Sample larger than population or is negative r4 r= r; )rI _SequencerX rO list _accumulaterf poprR r, r _bisectrr _ceil_logsetadd)r@
populationr} r r|
cum_countstotal
selectionsr sr resultsetsizepoolr r selected selected_adds rB r, z
Random.sampleg s j *i0 @ A
A
O k& 12J:!# !UVV(2JNN$E eS) 9::qy !>?? U5\Q7J F?IJz!Jvj! 45zJ JOO A{{ KL L KL L! q5 qE$q1ua. 11 1G <
#D1X a!e$ Gq q1uqy/Q
uH#<) cum_weightsr} c
\ | j }t | }|N|6t }|dz
}t d| D cg c] }| | | |z c}S t t | }n
| t
d t | |k7 r t d |d dz } | dk r t d t | s t d t }
|d z
} t d| D cg c] }| |
| | | z d
| c}S c c}w # t $ r# t |t s |}t
d| dw xY wc c}w ) zReturn a k sized list of population elements chosen with replacement.
If the relative weights or cumulative weights are not specified,
the selections are made with equal probability.
N z4The number of choices must be a keyword argument: k=z2Cannot specify both weights and cumulative weightsz3The number of weights does not match the populationrG z*Total of weights must be greater than zeroz Total of weights must be finiter; r ) r* rO r _repeatr r rX rI rR rf _isfiniter ) r@ r weightsr r} r* r| r r r r his rB r zRandom.choices sf
O SAHqAQRAQA
5A #67AQRR
";w#7 8
PQ Q { q RS SB#% C< IJ J >? ?
U q)+)A 6+vx%/?BGH)+ ++ S
!'3/ KM
$+s C5C: D):,D&c 4 |||z
| j z z S )zGet a random number in the range [a, b) or [a, b] depending on rounding.
The mean (expected value) and variance of the random variable are:
E[X] = (a + b) / 2
Var[X] = (b - a) ** 2 / 12
r* r s rB r1 zRandom.uniform s AET[[]***rD c | j } |dn
||z
||z
z }||kD rd|z
}d|z
}||}}|||z
t ||z z z S # t $ r |cY S w xY w)a Triangular distribution.
Continuous distribution bounded by given lower and upper limits,
and having a given mode value in-between.
http://en.wikipedia.org/wiki/Triangular_distribution
The mean (expected value) and variance of the random variable are:
E[X] = (low + high + mode) / 3
Var[X] = (low**2 + high**2 + mode**2 - low*high - low*mode - high*mode) / 18
?r7 )r* ZeroDivisionError_sqrt)r@ lowhighmodeur\ s rB r0 zRandom.triangular s
KKM |$*)DA
q5aAaA cCdSjE!a%L000
! J s A AAc | j } | }d | z
}t |dz
z |z }||z dz }|t | k rn9|||z z S )z\Normal distribution.
mu is the mean, and sigma is the standard deviation.
r7 r r6 )r*
NV_MAGICCONSTr )r@ musigmar* u1u2zzzs rB r& zRandom.normalvariate sg Bvx B c*R/AQBd2hY
AI~ rD c | j }| j }d| _ |N | t z }t dt d | z
z }t | |z }t
| |z | _ |||z z S )zGaussian distribution.
mu is the mean, and sigma is the standard deviation. This is
slightly faster than the normalvariate() function.
Not thread-safe without a lock around calls.
Ng r7 )r* r? TWOPIr r _cos_sin)r@ r r r* r x2pig2rads rB r" z Random.gauss' st 6 OO 98e#D$cFHn!556ET
U"A "4j5 0DOAI~ rD c 8 t | j || S )zLog normal distribution.
If you take the natural logarithm of this distribution, you'll get a
normal distribution with mean mu and standard deviation sigma.
mu can have any value, and sigma must be greater than zero.
)_expr& )r@ r r s rB r% zRandom.lognormvariateM s D&&r5122rD c B t d| j z
|z S )a Exponential distribution.
lambd is 1.0 divided by the desired mean. It should be
nonzero. (The parameter would be called "lambda", but that is
a reserved word in Python.) Returned values range from 0 to
positive infinity if lambd is positive, and from negative
infinity to 0 if lambd is negative.
The mean (expected value) and variance of the random variable are:
E[X] = 1 / lambd
Var[X] = 1 / lambd ** 2
r7 )r r* )r@ lambds rB r zRandom.expovariateW s" $ S4;;=())E11rD c | j }|dk rt | z S d|z }|t d||z z z } | }t t |z }|||z z } | } | d||z z
k s| d|z
t | z k rnId|z }
|
|z d|
|z z z } | } | dkD r|t
| z t z }
|
S |t
| z
t z }
|
S )aF Circular data distribution.
mu is the mean angle, expressed in radians between 0 and 2*pi, and
kappa is the concentration parameter, which must be greater than or
equal to zero. If kappa is equal to zero, this distribution reduces
to a uniform random angle over the range 0 to 2*pi.
gư>r r7 )r* r r r _pir _acos)r@ r kappar* r r~ r r dr qfu3thetas rB r2 zRandom.vonmisesvariatek s D=68# # %K
cAEk" "BS2XAQU ABC!a%K 2#'T!W)<#<
!G
UsQU{ #
X
8%(]e+E %(]e+E rD c |dk s|dk r t d | j }|dkD rt d|z dz
}|t z
}||z } | }d|cxk rdk sn d | z
}t |d|z
z |z } |t | z }
||z |z } ||| z z |
z
} | t z d| z z
dk\ s| t | k\ r|
|z S z|dk( rt d | z
|z S | }
t |z t z }||
z }|dk r |d|z z }
nt ||z
|z }
| }|dkD r||
|dz
z k r |
|z S |t |
k r |
|z S o)a Gamma distribution. Not the gamma function!
Conditions on the parameters are alpha > 0 and beta > 0.
The probability distribution function is:
x ** (alpha - 1) * math.exp(-x / beta)
pdf(x) = --------------------------------------
math.gamma(alpha) * beta ** alpha
The mean (expected value) and variance of the random variable are:
E[X] = alpha * beta
Var[X] = alpha * beta ** 2
r z*gammavariate: alpha and beta must be > 0.0r7 r5 gHz>gP?r8 )rf r* r LOG4r r
SG_MAGICCONST_e)r@ alphabetar* ainvbbbcccr r vrA r r~ r r ps rB r! zRandom.gammavariate s ( C<43; IJ J 3; us*+D$,C$,CXb,9, 68^sRx )D0DGOGbL#'MA%}$sQw.#5d1g t8O c\vx ((4/ /
H%Z2%E8cEk*A q1uo..AXs7Q53; // t8O 48^t8O rD c \ | j |d }|r||| j |d z z S y)aQ Beta distribution.
Conditions on the parameters are alpha > 0 and beta > 0.
Returned values range between 0 and 1.
The mean (expected value) and variance of the random variable are:
E[X] = alpha / (alpha + beta)
Var[X] = alpha * beta / ((alpha + beta)**2 * (alpha + beta + 1))
r7 r )r! )r@ r r ys rB r zRandom.betavariate s9 6
eS ) D - -dC 889 9rD c 8 d| j z
}|d|z z S )z3Pareto distribution. alpha is the shape parameter.r7 g r )r@ r r s rB r' zRandom.paretovariate s#
$++- TE\""rD c R d| j z
}|t | d|z z z S )zfWeibull distribution.
alpha is the scale parameter and beta is the shape parameter.
r7 )r* r )r@ r r r s rB r3 zRandom.weibullvariate s.
$++- acDj111rD c |dk r t d |dk s|dk\ r|dk( ry|dk( r|S t d | j }|dk( rt | |k S |dkD r|| j |d|z
z
S ||z dk rFdx}}t d|z
}|s|S |t t | |z dz z
}||kD r|S |dz
}/d
}t
||z d|z
z }d d |z z } d
d| z z d|z z }
||z dz }dd| z z
} | } | dz } dt | z
}
t d|
z |
z | z | z |z }|dk s||kD r@ | }|
dk\ r|| k r|S |sOdd| z z |z }t |d|z
z }t |dz |z }t |dz t ||z
dz z }d }||
|
|
z z | z z z }t | t |dz z
t ||z
dz z
|z
z z k r|S )a Binomial random variable.
Gives the number of successes for *n* independent trials
with the probability of success in each trial being *p*:
sum(random() < p for i in range(n))
Returns an integer in the range: 0 <= X <= n
The mean (expected value) and variance of the random variable are:
E[X] = n * p
Var[x] = n * p * (1 - p)
r zn must be non-negativer r7 z&p must be in the range 0.0 <= p <= 1.0r; r g $@TFgffffff?g=
ףp=@gEJYga+e?{Gz?gq=
ףp?g@r5 gQ ?gp=
ף@gffffff@)
rf r* r r _log2r r _fabsr _lgamma)r@ r| r r* rA r r\ setup_completespqr rZ vrr usr} r r lpqmhs rB r zRandom.binomialvariate s{ "
q5 56 6 8qCxCxCx EF F
6&(Q,' '
s7t++AsQw77 7 q54< IAcAgAVE&(Oa /0144q5 HQ AES1W%& 4#: fqj 4!8 +
ECK
C!G^A
HAuQx Ba" q(A-12A1uA ATza2g
" a 3.1a=)AEQ;'AENWQUQY%77!%
!rBw-!+, ,AAw!ga!en,wq1uqy/AAQUcMQQ5 rD rj )Nr: )r r7 Nr r7 )r7 )r; r )&__name__
__module__ __qualname____doc__r_ rC r- r$ r. rl rn rp ry ru BPFrv rr r( r r+ r) r r/ r, r r1 r0 r& r" r% r r2 r! r r' r3 r
__classcell__)r] s @rB r r n s G $ LA6B 3 ( 9:3 '& -J= %)t '3R&.$ /3 ]~#+tq #+P +12 *$ L32((TC J @# 2 VrD r c 6 e Zd ZdZd Zd Zd Zd Zd ZexZ Z
y)r zAlternate random number generator using sources provided
by the operating system (such as /dev/urandom on Unix or
CryptGenRandom on Windows).
Not available on all systems (see os.urandom() for details).
c R t j t d dz t z S )z7Get the next random number in the range 0.0 <= X < 1.0.rF r= )rR rS _urandom RECIP_BPFrk s rB r* zSystemRandom.randomu s x{+q0I==rD c |dk r t d |dz dz }t j t | }||dz |z
z S )z:getrandbits(k) -> x. Generates an int with k random bits.r z#number of bits must be non-negativerF r )rf rR rS r )r@ r} numbytesrA s rB r# zSystemRandom.getrandbitsy sI q5 BC CEa< NN8H- .X\A%&&rD c t | S )r )r r s rB r( zSystemRandom.randbytes s {rD c y)z' P *)HxrD r c 6 ddl m}m} ddlm} | }t d | D cg c] } || }} | } || }
|||
} t
| } t | }
t | |z
dd| d|j | t d|
| | |
fz y c c}w )Nr )stdevfmean) perf_counterz.3fz sec, z times z"avg %g, stddev %g, min %g, max %g
)
statisticsr r timer r minmaxprintr )r| funcr r meanr t0r datat1xbarr r r s rB _test_generatorr$ s /! B!(q!1 2!1AD$K!1D 2 B :D $ E
d)C t9D R"WSMs'$--
AB
/4T2J
JK 3s Bc h t | t d t | t d t | t d t | t d t | t
d t | t
d t | t d t | t d t | t d t | t d t | t d t | t d
t | t d t | t d t | t d
t | t d t | t d t | t d y )Nrb r ) g333333?)d g ?)r r7 )皙?r7 )r( r5 )r r7 )g?r7 )r7 r7 )r5 r7 )g 4@r7 )g i@r7 ) @r) )r r7 gUUUUUU?)
r$ r* r& r% r2 r r! r" r r0 )Ns rB _testr+ s Avr"A}j1A~z2A
3A
3A 4A|[1A|Z0A|Z0A|Z0A|Z0A|Z0A|Z0A|[1A|\2Auj)A{J/Az#89rD fork)after_in_child__main__)i' )ar warningsr r mathr r r r r r r r r r r r r
r r r r r r
r r r r r r r r r r r osr r _collections_abcr r operatorr r itertoolsr r r r r r _os_random_sha2r rT ImportErrorhashlib__all__r r r r r
r r r _instr- r* r1 r0 r) r r+ r, r/ r r& r% r r2 r! r" r r r' r3 r$ r. r# r( r$ r+ hasattrregister_at_forkr rb rD rB r> s .h # L L G G E E @ @ " 2 $ B $ *'
: DJs+
Cyd3i
#I w W^^ w |"*6 "*X zz
--
-- OO
--
--##
%% ''!!
''##
%% >> >> OO L":0 3C
3 z G } *))*s H H,+H,