Current File : //proc/thread-self/root/opt/alt/python37/lib64/python3.7/__pycache__/random.cpython-37.pyc
B
� f�k � @ s� d Z ddlmZ ddlmZmZ ddl m
Z m Z
mZmZmZ ddl mZmZmZmZ ddl m Z ddl m Z!m"Z# ddl$m%Z& dd l'Z(dd l)Z*dd l Z+d
d d d
ddddddddddddddd d d d d d!gZ,d"e
d#� ed$� Z-d$e Z.e d%�Z/d&e d'� Z0d(Z1d)e1 Z2dd l3Z3G d*d
� d
e3j4�Z4G d+d!� d!e4�Z5d,d-� Z6d4d/d0�Z7e4� Z8e8j9Z9e8j:Z:e8j;Z;e8j<Z<e8j=Z=e8j>Z>e8j?Z?e8j@Z@e8jAZAe8jBZBe8jCZCe8jDZDe8jEZEe8jFZFe8jGZGe8jHZHe8jIZIe8jJZJe8jKZKe8jLZLe8jMZMe8jNZNeOe+d1��r�e+jPe8j9d2� eQd3k�r�e7� d S )5a� Random variable generators.
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
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)�
MethodType�BuiltinMethodType)�log�exp�pi�e�ceil)�sqrt�acos�cos�sin)�urandom)�Set�Sequence)�sha512N�Random�seed�random�uniform�randint�choice�sample� randrange�shuffle�
normalvariate�lognormvariate� expovariate�vonmisesvariate� gammavariate�
triangular�gauss� betavariate�
paretovariate�weibullvariate�getstate�setstate� getrandbits�choices� SystemRandom� g �g @g @g �?g @�5 � c s e Zd ZdZdZd;dd�Zd<� fdd� Z� fd d
�Z� fd d �Zd
d� Z dd� Z
dd� Z dde fdd�Z
dd� Ze de> eeefdd�Zdd� Zd=d d �Zd d � Zd>ddd �d!d"�Zd#d$� Zd?d'd(�Zd)d*� Zd+d,� Zd-d.� Z d/d0� Z d1d2� Z d3d4� Z d5d6� Z d7d8� Z!d9d:� Z"� Z#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 C s | � |� d| _dS )zeInitialize an instance.
Optional argument x controls seeding, as for Random.seed().
N)r �
gauss_next)�self�x� r1 �+/opt/alt/python37/lib64/python3.7/random.py�__init__X s
zRandom.__init__r, c s� |dkr�t |ttf�r�t |t�r*|�d�n|}|rBt|d �d> nd}x"tt|�D ]}d| |A d@ }qRW |t|�N }|dkr�dn|}|d kr�t |tttf�r�t |t�r�|�� }|t |��
� 7 }t � |d
�}t
� �|� d | _d S ) a Initialize internal state from hashable object.
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.
� zlatin-1r � iCB l ���� ������r, �bigN)�
isinstance�str�bytes�decode�ord�map�len� bytearray�encode�_sha512Zdigest�int�
from_bytes�superr r. )r/ �a�versionr0 �c)� __class__r1 r2 r a s
z Random.seedc s | j t� �� | jfS )z9Return internal state; can be passed to setstate() later.)�VERSIONrE r% r. )r/ )rI r1 r2 r% � s zRandom.getstatec
s� |d }|dkr*|\}}| _ t� �|� nt|dkr�|\}}| _ ytdd� |D ��}W n( tk
r| } z
t|�W dd}~X Y nX t� �|� ntd|| jf ��dS )z:Restore internal state from object returned by getstate().r r- r, c s s | ]}|d V qdS )l Nr1 )�.0r0 r1 r1 r2 � <genexpr>� s z"Random.setstate.<locals>.<genexpr>Nz?state with version %s passed to Random.setstate() of version %s)r. rE r& �tuple�
ValueError� TypeErrorrJ )r/ �staterG Z
internalstater )rI r1 r2 r& � s zRandom.setstatec C s | � � S )N)r% )r/ r1 r1 r2 � __getstate__� s zRandom.__getstate__c C s | � |� d S )N)r& )r/ rP r1 r1 r2 � __setstate__� s zRandom.__setstate__c C s | j d| �� fS )Nr1 )rI r% )r/ r1 r1 r2 �
__reduce__� s zRandom.__reduce__r4 c
C s ||�}||krt d��|dkr:|dkr2| �|�S t d��||�}||krRt d��|| }|dkrx|dkrx|| �|� S |dkr�t d|||f ��||�}||kr�t d��|dkr�|| d | } n"|dk r�|| d | } nt d ��| dkr�t d��||| �| � S )
z�Choose a random item from range(start, stop[, step]).
This fixes the problem with randint() which includes the
endpoint; in Python this is usually not what you want.
z!non-integer arg 1 for randrange()Nr zempty range for randrange()z non-integer stop for randrange()r4 z'empty range for randrange() (%d,%d, %d)z non-integer step for randrange()zzero step for randrange())rN �
_randbelow)
r/ �start�stop�step�_intZistartZistop�widthZistep�nr1 r1 r2 r � s4
zRandom.randrangec C s | � ||d �S )zJReturn random integer in range [a, b], including both end points.
r4 )r )r/ rF �br1 r1 r2 r � s zRandom.randintc
C s� | j }| j}||�|ks$||�|krN|�� } || �}
x|
|krH|| �}
q6W |
S ||krltd� ||� | �S |dkr|td��|| } || | } |� }
x|
| kr�|� }
q�W ||
| �| S )zCReturn a random int in the range [0,n). Raises ValueError if n==0.z�Underlying 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 zBoundary cannot be zero)r r' �
bit_length�_warnrN )
r/ rZ rC �maxsize�typeZMethodZ
BuiltinMethodr r' �k�rZrem�limitr1 r1 r2 rT � s&
zRandom._randbelowc C s: y| � t|��}W n tk
r0 td�d�Y nX || S )z2Choose a random element from a non-empty sequence.z$Cannot choose from an empty sequenceN)rT r? rN �
IndexError)r/ �seq�ir1 r1 r2 r s
z
Random.choicec C s� |dkrR| j }x�ttdt|���D ]*}||d �}|| || ||< ||< q"W nLt}xFttdt|���D ]0}||� |d �}|| || ||< ||< qjW dS )z�Shuffle list x in place, and return None.
Optional argument random is a 0-argument function returning a
random float in [0.0, 1.0); if it is the default None, the
standard random.random will be used.
Nr4 )rT �reversed�ranger? rC )r/ r0 r � randbelowre �jrX r1 r1 r2 r s zRandom.shufflec C s& t |t�rt|�}t |t�s$td��| j}t|�}d| krF|ksPn td��dg| }d}|dkr�|dtt |d d�� 7 }||kr�t
|�}x�t |�D ]0}||| �} || ||< ||| d || < q�W nRt � }
|
j
} xDt |�D ]8}||�} x| |
k�r||�} q�W | | � || ||< q�W |S )
a= Chooses k unique random elements from a population sequence or set.
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.
To choose a sample in a range of integers, use range as an argument.
This is especially fast and space efficient for sampling from a
large population: sample(range(10000000), 60)
z>Population must be a sequence or set. For dicts, use list(d).r z,Sample larger than population or is negativeN� � r* r- r4 )r9 �_SetrM � _SequencerO rT r? rN �_ceil�_log�listrg �set�add) r/ �
populationr` rh rZ �resultZsetsizeZpoolre ri ZselectedZ selected_addr1 r1 r2 r s6
z
Random.sample)� cum_weightsr` c s� | j ��dkrN|dkr>t� t���� ���fdd�t|�D �S tt�|���n|dk r^td��t��t��krvtd��t j
��d �t��d �������fdd�t|�D �S ) z�Return 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.
Nc s g | ]}�� �� � � �qS r1 r1 )rK re )rX rs r �totalr1 r2 �
<listcomp>d s z"Random.choices.<locals>.<listcomp>z2Cannot specify both weights and cumulative weightsz3The number of weights does not match the populationr6 r4 c s$ g | ] }�� ��� � d �� �qS )r r1 )rK re )�bisectru �hirs r rv r1 r2 rw m s ) r rC r? rg rp �
_itertools�
accumulaterO rN �_bisectrx )r/ rs Zweightsru r` r1 )rX rx ru ry rs r rv r2 r( X s zRandom.choicesc C s ||| | � � S )zHGet a random number in the range [a, b) or [a, b] depending on rounding.)r )r/ rF r[ r1 r1 r2 r t s zRandom.uniform� � �?c C sx | � � }y |dkrdn|| || }W n tk
r< |S X ||kr`d| }d| }|| }}||| t|| � S )z�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
Ng �?g �?)r �ZeroDivisionError�_sqrt)r/ ZlowZhigh�mode�urH r1 r1 r2 r z s
zRandom.triangularc C sT | j }x@|� }d|� }t|d | }|| d }|t|� krP qW ||| S )z\Normal distribution.
mu is the mean, and sigma is the standard deviation.
g �?g �?g @)r �
NV_MAGICCONSTro )r/ �mu�sigmar �u1�u2�zZzzr1 r1 r2 r � s
zRandom.normalvariatec C s t | �||��S )z�Log 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� r1 r1 r2 r � s zRandom.lognormvariatec C s t d| �� � | 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.
g �?)ro r )r/ Zlambdr1 r1 r2 r � s zRandom.expovariatec C s� | j }|dkrt|� S d| }|td|| � }xN|� }tt| �}||| }|� } | d|| k s~| d| t|� kr6P q6W d| }
|
| d|
| } |� } | dkr�|t| � t }
n|t| � t }
|
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���ư>g �?g �?)r �TWOPIr� �_cos�_pir� �_acos)r/ r� Zkappar �sra r� r� �dr� �q�fZu3Zthetar1 r1 r2 r � s&
$zRandom.vonmisesvariatec C s� |dks|dkrt d��| j}|dkr�td| d �}|t }|| }x�|� }d| k rbdk sfqH qHd|� }t|d| �| } |t| � }
|| | } ||| |
} | t d| dks�| t| �krH|
| S qHW n�|dk�r |� }
x|
dkr�|� }
q�W t|
� | S x�|� }
t| t }||
}|dk�r@|d| }
nt|| | � }
|� }|dk�rx||
|d k�r�P n|t|
�k�rP �qW |
| S dS ) aZ 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
g z*gammavariate: alpha and beta must be > 0.0g �?g @gH�����z>g�P���?g @N)rN r r� �LOG4ro r� �
SG_MAGICCONST�_e)r/ �alpha�betar ZainvZbbbZcccr� r� �vr0 r� ra r� r[ �pr1 r1 r2 r � sJ
zRandom.gammavariatec C s` | j }| j}d| _|dkrT|� t }tdtd|� � �}t|�| }t|�| | _||| S )z�Gaussian 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 �g �?)r r. r� r� ro r� �_sin)r/ r� r� r r� Zx2piZg2radr1 r1 r2 r! @ s
z Random.gaussc C s0 | � |d�}|dkrdS ||| � |d� S dS )z�Beta distribution.
Conditions on the parameters are alpha > 0 and beta > 0.
Returned values range between 0 and 1.
g �?r g N)r )r/ r� r� �yr1 r1 r2 r" u s
zRandom.betavariatec C s d| � � }d|d| S )z3Pareto distribution. alpha is the shape parameter.g �?)r )r/ r� r� r1 r1 r2 r# � s zRandom.paretovariatec C s" d| � � }|t|� d| S )zfWeibull distribution.
alpha is the scale parameter and beta is the shape parameter.
g �?)r ro )r/ r� r� r� r1 r1 r2 r$ � s zRandom.weibullvariate)N)Nr, )N)N)r} r~ N)$�__name__�
__module__� __qualname__�__doc__rJ r3 r r% r& rQ rR rS rC r r �BPFr_ � _MethodType�_BuiltinMethodTyperT r r r r( r r r r r r r r! r" r# r$ �
__classcell__r1 r1 )rI r2 r H s8
,
:
0H5 c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Ze ZZ d
S ) r) z�Alternate 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 C s t �td�d�d? t S )z3Get the next random number in the range [0.0, 1.0).r5 r8 r- )rC rD �_urandom� RECIP_BPF)r/ r1 r1 r2 r � s zSystemRandom.randomc C sP |dkrt d��|t|�kr$td��|d d }t�t|�d�}||d | ? S )z:getrandbits(k) -> x. Generates an int with k random bits.r z(number of bits must be greater than zeroz#number of bits should be an integerr5 � r8 )rN rC rO rD r� )r/ r` Znumbytesr0 r1 r1 r2 r' � s zSystemRandom.getrandbitsc O s dS )z<Stub method. Not used for a system random number generator.Nr1 )r/ �args�kwdsr1 r1 r2 r � s zSystemRandom.seedc O s t d��dS )zAMethod should not be called for a system random number generator.z*System entropy source does not have state.N)�NotImplementedError)r/ r� r� r1 r1 r2 �_notimplemented� s z SystemRandom._notimplementedN)
r� r� r� r� r r' r r� r% r& r1 r1 r1 r2 r) � s
c C s� dd l }t| d|j� d}d}d}d}|�� }x@t| �D ]4} ||� }
||
7 }||
|
}t|
|�}t|
|�}q8W |�� } tt| | d�ddd � || } t|| | | �}
td
| |
||f � d S ) Nr �timesg g _�Bg _��r- zsec,� )�endz"avg %g, stddev %g, min %g, max %g
) �time�printr� Z perf_counterrg �min�max�roundr� )rZ �funcr� r� rv ZsqsumZsmallestZlargestZt0re r0 Zt1ZavgZstddevr1 r1 r2 �_test_generator� s&
r� �� c C s� t | td� t | td� t | td� t | td� t | td� t | td� t | td� t | td� t | td� t | td� t | td � t | td
� t | td � t | td� t | td � t | td
� d S )Nr1 )g g �?)g{�G�z�?g �?)g�������?g �?)g�������?g @)g �?g �?)g�������?g �?)g �?g �?)g @g �?)g 4@g �?)g i@g �?)g @g @)g g �?gUUUUUU�?) r� r r r r r r! r" r )�Nr1 r1 r2 �_test� s r� �fork)Zafter_in_child�__main__)r� )Rr� �warningsr r] �typesr r� r r� Zmathr ro r r� r r� r r� r rn r
r� r r� r r� r
r� �osr r� �_collections_abcr rl r rm Zhashlibr rB � itertoolsrz rx r| �_os�__all__r� r� r� r� r� r� Z_randomr r) r� r� Z_instr r r r r r r r r r( r r r r r r! r" r# r$ r% r& r' �hasattr�register_at_forkr� r1 r1 r1 r2 �<module>& st
Y!
Mini Shell