NG4R3P

Linux 4gvps.4gvps.com 3.10.0-1127.18.2.vz7.163.46 #1 SMP Fri Nov 20 21:47:55 MSK 2020 x86_64
SOFT : Apache PHP : 7.4.33
/proc/self/root/opt/alt/python38/lib64/python3.8/

38.135.39.45

[ NAME ]	[ SIZE ]	[ PERM ]	[ DATE ]	[ ACT ]
+FILE +DIR
__pycache__	dir	drwxr-xr-x	2022-06-03 01:15	R D
asyncio	dir	drwxr-xr-x	2022-06-03 01:15	R D
collections	dir	drwxr-xr-x	2022-06-03 01:15	R D
concurrent	dir	drwxr-xr-x	2022-06-03 01:15	R D
config-3.8-x86_64-linux-gnu	dir	drwxr-xr-x	2022-06-03 01:15	R D
ctypes	dir	drwxr-xr-x	2022-06-03 01:15	R D
curses	dir	drwxr-xr-x	2022-06-03 01:15	R D
dbm	dir	drwxr-xr-x	2022-06-03 01:15	R D
distutils	dir	drwxr-xr-x	2022-06-03 01:15	R D
email	dir	drwxr-xr-x	2022-06-03 01:15	R D
encodings	dir	drwxr-xr-x	2022-06-03 01:15	R D
ensurepip	dir	drwxr-xr-x	2022-06-03 01:15	R D
html	dir	drwxr-xr-x	2022-06-03 01:15	R D
http	dir	drwxr-xr-x	2022-06-03 01:15	R D
importlib	dir	drwxr-xr-x	2022-06-03 01:15	R D
json	dir	drwxr-xr-x	2022-06-03 01:15	R D
lib-dynload	dir	drwxr-xr-x	2022-06-03 01:15	R D
lib2to3	dir	drwxr-xr-x	2022-08-08 06:03	R D
logging	dir	drwxr-xr-x	2022-06-03 01:15	R D
multiprocessing	dir	drwxr-xr-x	2022-06-03 01:15	R D
pydoc_data	dir	drwxr-xr-x	2022-06-03 01:15	R D
site-packages	dir	drwxr-xr-x	2022-08-08 06:03	R D
sqlite3	dir	drwxr-xr-x	2022-08-08 06:03	R D
unittest	dir	drwxr-xr-x	2022-06-03 01:15	R D
urllib	dir	drwxr-xr-x	2022-06-03 01:15	R D
venv	dir	drwxr-xr-x	2022-06-03 01:15	R D
wsgiref	dir	drwxr-xr-x	2022-06-03 01:15	R D
xml	dir	drwxr-xr-x	2022-06-03 01:15	R D
xmlrpc	dir	drwxr-xr-x	2025-06-26 06:15	R D
LICENSE.txt	13.599 KB	-rw-r--r--	2021-08-30 14:26	R E G D
__future__.py	5.026 KB	-rw-r--r--	2021-08-30 14:26	R E G D
__phello__.foo.py	0.063 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_bootlocale.py	1.759 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_collections_abc.py	25.488 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_compat_pickle.py	8.544 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_compression.py	5.215 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_dummy_thread.py	5.886 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_markupbase.py	14.256 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_osx_support.py	21.264 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_py_abc.py	6.044 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_pydecimal.py	223.307 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_pyio.py	90.993 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_sitebuiltins.py	3.042 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_strptime.py	24.676 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_sysconfigdata__linux_x86_64-linux-gnu.py	37.549 KB	-rw-r--r--	2022-04-22 10:23	R E G D
_sysconfigdata_d_linux_x86_64-linux-gnu.py	37.289 KB	-rw-r--r--	2022-04-22 10:13	R E G D
_threading_local.py	7.051 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_weakrefset.py	5.601 KB	-rw-r--r--	2021-08-30 14:26	R E G D
abc.py	4.384 KB	-rw-r--r--	2021-08-30 14:26	R E G D
aifc.py	32.045 KB	-rw-r--r--	2021-08-30 14:26	R E G D
antigravity.py	0.466 KB	-rw-r--r--	2021-08-30 14:26	R E G D
argparse.py	93.765 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ast.py	18.783 KB	-rw-r--r--	2021-08-30 14:26	R E G D
asynchat.py	11.063 KB	-rw-r--r--	2021-08-30 14:26	R E G D
asyncore.py	19.623 KB	-rw-r--r--	2021-08-30 14:26	R E G D
base64.py	19.917 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
bdb.py	31.305 KB	-rw-r--r--	2021-08-30 14:26	R E G D
binhex.py	13.627 KB	-rw-r--r--	2021-08-30 14:26	R E G D
bisect.py	2.162 KB	-rw-r--r--	2021-08-30 14:26	R E G D
bz2.py	12.264 KB	-rw-r--r--	2021-08-30 14:26	R E G D
cProfile.py	6.847 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
calendar.py	24.25 KB	-rw-r--r--	2021-08-30 14:26	R E G D
cgi.py	33.149 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
cgitb.py	11.813 KB	-rw-r--r--	2021-08-30 14:26	R E G D
chunk.py	5.308 KB	-rw-r--r--	2021-08-30 14:26	R E G D
cmd.py	14.512 KB	-rw-r--r--	2021-08-30 14:26	R E G D
code.py	10.373 KB	-rw-r--r--	2021-08-30 14:26	R E G D
codecs.py	35.808 KB	-rw-r--r--	2021-08-30 14:26	R E G D
codeop.py	6.182 KB	-rw-r--r--	2021-08-30 14:26	R E G D
colorsys.py	3.969 KB	-rw-r--r--	2021-08-30 14:26	R E G D
compileall.py	13.357 KB	-rw-r--r--	2021-08-30 14:26	R E G D
configparser.py	53.1 KB	-rw-r--r--	2021-08-30 14:26	R E G D
contextlib.py	24.409 KB	-rw-r--r--	2021-08-30 14:26	R E G D
contextvars.py	0.126 KB	-rw-r--r--	2021-08-30 14:26	R E G D
copy.py	8.458 KB	-rw-r--r--	2021-08-30 14:26	R E G D
copyreg.py	6.968 KB	-rw-r--r--	2021-08-30 14:26	R E G D
crypt.py	3.525 KB	-rw-r--r--	2021-08-30 14:26	R E G D
csv.py	15.766 KB	-rw-r--r--	2021-08-30 14:26	R E G D
dataclasses.py	48.802 KB	-rw-r--r--	2021-08-30 14:26	R E G D
datetime.py	86.218 KB	-rw-r--r--	2021-08-30 14:26	R E G D
decimal.py	0.313 KB	-rw-r--r--	2021-08-30 14:26	R E G D
difflib.py	82.088 KB	-rw-r--r--	2021-08-30 14:26	R E G D
dis.py	20.088 KB	-rw-r--r--	2021-08-30 14:26	R E G D
doctest.py	102.093 KB	-rw-r--r--	2021-08-30 14:26	R E G D
dummy_threading.py	2.749 KB	-rw-r--r--	2021-08-30 14:26	R E G D
enum.py	37.242 KB	-rw-r--r--	2021-08-30 14:26	R E G D
filecmp.py	9.6 KB	-rw-r--r--	2021-08-30 14:26	R E G D
fileinput.py	14.364 KB	-rw-r--r--	2021-08-30 14:26	R E G D
fnmatch.py	3.983 KB	-rw-r--r--	2021-08-30 14:26	R E G D
formatter.py	14.788 KB	-rw-r--r--	2021-08-30 14:26	R E G D
fractions.py	23.759 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ftplib.py	34.306 KB	-rw-r--r--	2021-08-30 14:26	R E G D
functools.py	36.529 KB	-rw-r--r--	2021-08-30 14:26	R E G D
genericpath.py	4.858 KB	-rw-r--r--	2021-08-30 14:26	R E G D
getopt.py	7.313 KB	-rw-r--r--	2021-08-30 14:26	R E G D
getpass.py	5.854 KB	-rw-r--r--	2021-08-30 14:26	R E G D
gettext.py	26.502 KB	-rw-r--r--	2021-08-30 14:26	R E G D
glob.py	5.563 KB	-rw-r--r--	2021-08-30 14:26	R E G D
gzip.py	20.911 KB	-rw-r--r--	2021-08-30 14:26	R E G D
hashlib.py	9.502 KB	-rw-r--r--	2021-08-30 14:26	R E G D
heapq.py	22.341 KB	-rw-r--r--	2021-08-30 14:26	R E G D
hmac.py	6.474 KB	-rw-r--r--	2021-08-30 14:26	R E G D
imaplib.py	52.35 KB	-rw-r--r--	2021-08-30 14:26	R E G D
imghdr.py	3.719 KB	-rw-r--r--	2021-08-30 14:26	R E G D
imp.py	10.289 KB	-rw-r--r--	2021-08-30 14:26	R E G D
inspect.py	115.771 KB	-rw-r--r--	2021-08-30 14:26	R E G D
io.py	3.458 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ipaddress.py	69.965 KB	-rw-r--r--	2021-08-30 14:26	R E G D
keyword.py	0.923 KB	-rw-r--r--	2021-08-30 14:26	R E G D
linecache.py	5.205 KB	-rw-r--r--	2021-08-30 14:26	R E G D
locale.py	76.358 KB	-rw-r--r--	2021-08-30 14:26	R E G D
lzma.py	12.679 KB	-rw-r--r--	2021-08-30 14:26	R E G D
mailbox.py	76.817 KB	-rw-r--r--	2021-08-30 14:26	R E G D
mailcap.py	7.914 KB	-rw-r--r--	2021-08-30 14:26	R E G D
mimetypes.py	21.156 KB	-rw-r--r--	2021-08-30 14:26	R E G D
modulefinder.py	23.857 KB	-rw-r--r--	2021-08-30 14:26	R E G D
netrc.py	5.436 KB	-rw-r--r--	2021-08-30 14:26	R E G D
nntplib.py	42.247 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ntpath.py	27.084 KB	-rw-r--r--	2021-08-30 14:26	R E G D
nturl2path.py	2.819 KB	-rw-r--r--	2021-08-30 14:26	R E G D
numbers.py	10.004 KB	-rw-r--r--	2021-08-30 14:26	R E G D
opcode.py	5.672 KB	-rw-r--r--	2021-08-30 14:26	R E G D
operator.py	10.46 KB	-rw-r--r--	2021-08-30 14:26	R E G D
optparse.py	58.954 KB	-rw-r--r--	2021-08-30 14:26	R E G D
os.py	38.081 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pathlib.py	51.377 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pdb.py	61.28 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
pickle.py	62.956 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pickletools.py	91.295 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pipes.py	8.707 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pkgutil.py	20.996 KB	-rw-r--r--	2021-08-30 14:26	R E G D
platform.py	39.49 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
plistlib.py	31.465 KB	-rw-r--r--	2021-08-30 14:26	R E G D
poplib.py	14.724 KB	-rw-r--r--	2021-08-30 14:26	R E G D
posixpath.py	15.261 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pprint.py	20.98 KB	-rw-r--r--	2021-08-30 14:26	R E G D
profile.py	22.995 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
pstats.py	26.704 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pty.py	4.694 KB	-rw-r--r--	2021-08-30 14:26	R E G D
py_compile.py	8.011 KB	-rw-r--r--	2022-04-22 10:10	R E G D
pyclbr.py	14.897 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pydoc.py	104.199 KB	-rw-r--r--	2022-04-22 10:25	R E G D
queue.py	11.09 KB	-rw-r--r--	2021-08-30 14:26	R E G D
quopri.py	7.095 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
random.py	28.127 KB	-rw-r--r--	2021-08-30 14:26	R E G D
re.py	15.489 KB	-rw-r--r--	2021-08-30 14:26	R E G D
reprlib.py	5.144 KB	-rw-r--r--	2021-08-30 14:26	R E G D
rlcompleter.py	6.931 KB	-rw-r--r--	2021-08-30 14:26	R E G D
runpy.py	11.77 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sched.py	6.291 KB	-rw-r--r--	2021-08-30 14:26	R E G D
secrets.py	1.99 KB	-rw-r--r--	2021-08-30 14:26	R E G D
selectors.py	18.126 KB	-rw-r--r--	2021-08-30 14:26	R E G D
shelve.py	8.327 KB	-rw-r--r--	2021-08-30 14:26	R E G D
shlex.py	13.013 KB	-rw-r--r--	2021-08-30 14:26	R E G D
shutil.py	50.268 KB	-rw-r--r--	2021-08-30 14:26	R E G D
signal.py	2.22 KB	-rw-r--r--	2021-08-30 14:26	R E G D
site.py	21.091 KB	-rw-r--r--	2022-04-22 10:10	R E G D
smtpd.py	33.908 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
smtplib.py	43.959 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
sndhdr.py	6.933 KB	-rw-r--r--	2021-08-30 14:26	R E G D
socket.py	34.417 KB	-rw-r--r--	2021-08-30 14:26	R E G D
socketserver.py	26.656 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sre_compile.py	26.069 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sre_constants.py	6.986 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sre_parse.py	39.287 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ssl.py	49.57 KB	-rw-r--r--	2021-08-30 14:26	R E G D
stat.py	5.356 KB	-rw-r--r--	2021-08-30 14:26	R E G D
statistics.py	38.76 KB	-rw-r--r--	2021-08-30 14:26	R E G D
string.py	10.288 KB	-rw-r--r--	2021-08-30 14:26	R E G D
stringprep.py	12.614 KB	-rw-r--r--	2021-08-30 14:26	R E G D
struct.py	0.251 KB	-rw-r--r--	2021-08-30 14:26	R E G D
subprocess.py	75.518 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sunau.py	17.944 KB	-rw-r--r--	2021-08-30 14:26	R E G D
symbol.py	2.06 KB	-rw-r--r--	2022-04-22 10:13	R E G D
symtable.py	7.833 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sysconfig.py	24.313 KB	-rw-r--r--	2022-04-22 10:24	R E G D
tabnanny.py	11.151 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
tarfile.py	91.739 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
telnetlib.py	22.709 KB	-rw-r--r--	2021-08-30 14:26	R E G D
tempfile.py	26.892 KB	-rw-r--r--	2021-08-30 14:26	R E G D
textwrap.py	18.952 KB	-rw-r--r--	2021-08-30 14:26	R E G D
this.py	0.979 KB	-rw-r--r--	2021-08-30 14:26	R E G D
threading.py	49.629 KB	-rw-r--r--	2021-08-30 14:26	R E G D
timeit.py	13.177 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
token.py	2.313 KB	-rw-r--r--	2021-08-30 14:26	R E G D
tokenize.py	25.235 KB	-rw-r--r--	2021-08-30 14:26	R E G D
trace.py	29.171 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
traceback.py	23.058 KB	-rw-r--r--	2021-08-30 14:26	R E G D
tracemalloc.py	16.676 KB	-rw-r--r--	2021-08-30 14:26	R E G D
tty.py	0.858 KB	-rw-r--r--	2021-08-30 14:26	R E G D
types.py	9.485 KB	-rw-r--r--	2021-08-30 14:26	R E G D
typing.py	67.346 KB	-rw-r--r--	2021-08-30 14:26	R E G D
uu.py	6.807 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
uuid.py	29.752 KB	-rw-r--r--	2021-08-30 14:26	R E G D
warnings.py	19.227 KB	-rw-r--r--	2021-08-30 14:26	R E G D
wave.py	17.803 KB	-rw-r--r--	2021-08-30 14:26	R E G D
weakref.py	20.886 KB	-rw-r--r--	2021-08-30 14:26	R E G D
webbrowser.py	23.531 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
xdrlib.py	5.774 KB	-rw-r--r--	2021-08-30 14:26	R E G D
zipapp.py	7.358 KB	-rw-r--r--	2021-08-30 14:26	R E G D
zipfile.py	85.672 KB	-rw-r--r--	2021-08-30 14:26	R E G D
zipimport.py	30.044 KB	-rw-r--r--	2021-08-30 14:26	R E G D
REQUEST EXIT

"""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. """ from warnings import warn as _warn from math import log as _log, exp as _exp, pi as _pi, e as _e, ceil as _ceil from math import sqrt as _sqrt, acos as _acos, cos as _cos, sin as _sin from os import urandom as _urandom from _collections_abc import Set as _Set, Sequence as _Sequence from itertools import accumulate as _accumulate, repeat as _repeat from bisect import bisect as _bisect import os as _os try: # hashlib is pretty heavy to load, try lean internal module first from _sha512 import sha512 as _sha512 except ImportError: # fallback to official implementation from hashlib import sha512 as _sha512 __all__ = ["Random","seed","random","uniform","randint","choice","sample", "randrange","shuffle","normalvariate","lognormvariate", "expovariate","vonmisesvariate","gammavariate","triangular", "gauss","betavariate","paretovariate","weibullvariate", "getstate","setstate", "getrandbits", "choices", "SystemRandom"] NV_MAGICCONST = 4 * _exp(-0.5)/_sqrt(2.0) TWOPI = 2.0*_pi LOG4 = _log(4.0) SG_MAGICCONST = 1.0 + _log(4.5) BPF = 53 # Number of bits in a float RECIP_BPF = 2**-BPF # Translated by Guido van Rossum from C source provided by # Adrian Baddeley. Adapted by Raymond Hettinger for use with # the Mersenne Twister and os.urandom() core generators. import _random class Random(_random.Random): """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. """ VERSION = 3 # used by getstate/setstate def __init__(self, x=None): """Initialize an instance. Optional argument x controls seeding, as for Random.seed(). """ self.seed(x) self.gauss_next = None def __init_subclass__(cls, /, **kwargs): """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. """ for c in cls.__mro__: if '_randbelow' in c.__dict__: # just inherit it break if 'getrandbits' in c.__dict__: cls._randbelow = cls._randbelow_with_getrandbits break if 'random' in c.__dict__: cls._randbelow = cls._randbelow_without_getrandbits break def seed(self, a=None, version=2): """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. """ if version == 1 and isinstance(a, (str, bytes)): a = a.decode('latin-1') if isinstance(a, bytes) else a x = ord(a[0]) << 7 if a else 0 for c in map(ord, a): x = ((1000003 * x) ^ c) & 0xFFFFFFFFFFFFFFFF x ^= len(a) a = -2 if x == -1 else x if version == 2 and isinstance(a, (str, bytes, bytearray)): if isinstance(a, str): a = a.encode() a += _sha512(a).digest() a = int.from_bytes(a, 'big') super().seed(a) self.gauss_next = None def getstate(self): """Return internal state; can be passed to setstate() later.""" return self.VERSION, super().getstate(), self.gauss_next def setstate(self, state): """Restore internal state from object returned by getstate().""" version = state[0] if version == 3: version, internalstate, self.gauss_next = state super().setstate(internalstate) elif version == 2: version, internalstate, self.gauss_next = state # In version 2, the state was saved as signed ints, which causes # inconsistencies between 32/64-bit systems. The state is # really unsigned 32-bit ints, so we convert negative ints from # version 2 to positive longs for version 3. try: internalstate = tuple(x % (2**32) for x in internalstate) except ValueError as e: raise TypeError from e super().setstate(internalstate) else: raise ValueError("state with version %s passed to " "Random.setstate() of version %s" % (version, self.VERSION)) ## ---- Methods below this point do not need to be overridden when ## ---- subclassing for the purpose of using a different core generator. ## -------------------- pickle support ------------------- # Issue 17489: Since __reduce__ was defined to fix #759889 this is no # longer called; we leave it here because it has been here since random was # rewritten back in 2001 and why risk breaking something. def __getstate__(self): # for pickle return self.getstate() def __setstate__(self, state): # for pickle self.setstate(state) def __reduce__(self): return self.__class__, (), self.getstate() ## -------------------- integer methods ------------------- def randrange(self, start, stop=None, step=1, _int=int): """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. """ # This code is a bit messy to make it fast for the # common case while still doing adequate error checking. istart = _int(start) if istart != start: raise ValueError("non-integer arg 1 for randrange()") if stop is None: if istart > 0: return self._randbelow(istart) raise ValueError("empty range for randrange()") # stop argument supplied. istop = _int(stop) if istop != stop: raise ValueError("non-integer stop for randrange()") width = istop - istart if step == 1 and width > 0: return istart + self._randbelow(width) if step == 1: raise ValueError("empty range for randrange() (%d, %d, %d)" % (istart, istop, width)) # Non-unit step argument supplied. istep = _int(step) if istep != step: raise ValueError("non-integer step for randrange()") if istep > 0: n = (width + istep - 1) // istep elif istep < 0: n = (width + istep + 1) // istep else: raise ValueError("zero step for randrange()") if n <= 0: raise ValueError("empty range for randrange()") return istart + istep*self._randbelow(n) def randint(self, a, b): """Return random integer in range [a, b], including both end points. """ return self.randrange(a, b+1) def _randbelow_with_getrandbits(self, n): "Return a random int in the range [0,n). Raises ValueError if n==0." getrandbits = self.getrandbits k = n.bit_length() # don't use (n-1) here because n can be 1 r = getrandbits(k) # 0 <= r < 2**k while r >= n: r = getrandbits(k) return r def _randbelow_without_getrandbits(self, n, int=int, maxsize=1<= maxsize: _warn("Underlying random() generator does not supply \n" "enough bits to choose from a population range this large.\n" "To remove the range limitation, add a getrandbits() method.") return int(random() * n) if n == 0: raise ValueError("Boundary cannot be zero") rem = maxsize % n limit = (maxsize - rem) / maxsize # int(limit * maxsize) % n == 0 r = random() while r >= limit: r = random() return int(r*maxsize) % n _randbelow = _randbelow_with_getrandbits ## -------------------- sequence methods ------------------- def choice(self, seq): """Choose a random element from a non-empty sequence.""" try: i = self._randbelow(len(seq)) except ValueError: raise IndexError('Cannot choose from an empty sequence') from None return seq[i] def shuffle(self, x, random=None): """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. """ if random is None: randbelow = self._randbelow for i in reversed(range(1, len(x))): # pick an element in x[:i+1] with which to exchange x[i] j = randbelow(i+1) x[i], x[j] = x[j], x[i] else: _int = int for i in reversed(range(1, len(x))): # pick an element in x[:i+1] with which to exchange x[i] j = _int(random() * (i+1)) x[i], x[j] = x[j], x[i] def sample(self, population, k): """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) """ # Sampling without replacement entails tracking either potential # selections (the pool) in a list or previous selections in a set. # When the number of selections is small compared to the # population, then tracking selections is efficient, requiring # only a small set and an occasional reselection. For # a larger number of selections, the pool tracking method is # preferred since the list takes less space than the # set and it doesn't suffer from frequent reselections. # The number of calls to _randbelow() is kept at or near k, the # theoretical minimum. This is important because running time # is dominated by _randbelow() and because it extracts the # least entropy from the underlying random number generators. # Memory requirements are kept to the smaller of a k-length # set or an n-length list. # There are other sampling algorithms that do not require # auxiliary memory, but they were rejected because they made # too many calls to _randbelow(), making them slower and # causing them to eat more entropy than necessary. if isinstance(population, _Set): population = tuple(population) if not isinstance(population, _Sequence): raise TypeError("Population must be a sequence or set. For dicts, use list(d).") randbelow = self._randbelow n = len(population) if not 0 <= k <= n: raise ValueError("Sample larger than population or is negative") result = [None] * k setsize = 21 # size of a small set minus size of an empty list if k > 5: setsize += 4 ** _ceil(_log(k * 3, 4)) # table size for big sets if n <= setsize: # An n-length list is smaller than a k-length set pool = list(population) for i in range(k): # invariant: non-selected at [0,n-i) j = randbelow(n-i) result[i] = pool[j] pool[j] = pool[n-i-1] # move non-selected item into vacancy else: selected = set() selected_add = selected.add for i in range(k): j = randbelow(n) while j in selected: j = randbelow(n) selected_add(j) result[i] = population[j] return result def choices(self, population, weights=None, *, cum_weights=None, k=1): """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. """ random = self.random n = len(population) if cum_weights is None: if weights is None: _int = int n += 0.0 # convert to float for a small speed improvement return [population[_int(random() * n)] for i in _repeat(None, k)] cum_weights = list(_accumulate(weights)) elif weights is not None: raise TypeError('Cannot specify both weights and cumulative weights') if len(cum_weights) != n: raise ValueError('The number of weights does not match the population') bisect = _bisect total = cum_weights[-1] + 0.0 # convert to float hi = n - 1 return [population[bisect(cum_weights, random() * total, 0, hi)] for i in _repeat(None, k)] ## -------------------- real-valued distributions ------------------- ## -------------------- uniform distribution ------------------- def uniform(self, a, b): "Get a random number in the range [a, b) or [a, b] depending on rounding." return a + (b-a) * self.random() ## -------------------- triangular -------------------- def triangular(self, low=0.0, high=1.0, mode=None): """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 """ u = self.random() try: c = 0.5 if mode is None else (mode - low) / (high - low) except ZeroDivisionError: return low if u > c: u = 1.0 - u c = 1.0 - c low, high = high, low return low + (high - low) * _sqrt(u * c) ## -------------------- normal distribution -------------------- def normalvariate(self, mu, sigma): """Normal distribution. mu is the mean, and sigma is the standard deviation. """ # mu = mean, sigma = standard deviation # Uses Kinderman and Monahan method. Reference: Kinderman, # A.J. and Monahan, J.F., "Computer generation of random # variables using the ratio of uniform deviates", ACM Trans # Math Software, 3, (1977), pp257-260. random = self.random while 1: u1 = random() u2 = 1.0 - random() z = NV_MAGICCONST*(u1-0.5)/u2 zz = z*z/4.0 if zz <= -_log(u2): break return mu + z*sigma ## -------------------- lognormal distribution -------------------- def lognormvariate(self, mu, sigma): """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. """ return _exp(self.normalvariate(mu, sigma)) ## -------------------- exponential distribution -------------------- def expovariate(self, lambd): """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. """ # lambd: rate lambd = 1/mean # ('lambda' is a Python reserved word) # we use 1-random() instead of random() to preclude the # possibility of taking the log of zero. return -_log(1.0 - self.random())/lambd ## -------------------- von Mises distribution -------------------- def vonmisesvariate(self, mu, kappa): """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. """ # mu: mean angle (in radians between 0 and 2*pi) # kappa: concentration parameter kappa (>= 0) # if kappa = 0 generate uniform random angle # Based upon an algorithm published in: Fisher, N.I., # "Statistical Analysis of Circular Data", Cambridge # University Press, 1993. # Thanks to Magnus Kessler for a correction to the # implementation of step 4. random = self.random if kappa <= 1e-6: return TWOPI * random() s = 0.5 / kappa r = s + _sqrt(1.0 + s * s) while 1: u1 = random() z = _cos(_pi * u1) d = z / (r + z) u2 = random() if u2 < 1.0 - d * d or u2 <= (1.0 - d) * _exp(d): break q = 1.0 / r f = (q + z) / (1.0 + q * z) u3 = random() if u3 > 0.5: theta = (mu + _acos(f)) % TWOPI else: theta = (mu - _acos(f)) % TWOPI return theta ## -------------------- gamma distribution -------------------- def gammavariate(self, alpha, beta): """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 """ # alpha > 0, beta > 0, mean is alpha*beta, variance is alpha*beta**2 # Warning: a few older sources define the gamma distribution in terms # of alpha > -1.0 if alpha <= 0.0 or beta <= 0.0: raise ValueError('gammavariate: alpha and beta must be > 0.0') random = self.random if alpha > 1.0: # Uses R.C.H. Cheng, "The generation of Gamma # variables with non-integral shape parameters", # Applied Statistics, (1977), 26, No. 1, p71-74 ainv = _sqrt(2.0 * alpha - 1.0) bbb = alpha - LOG4 ccc = alpha + ainv while 1: u1 = random() if not 1e-7 < u1 < .9999999: continue u2 = 1.0 - random() v = _log(u1/(1.0-u1))/ainv x = alpha*_exp(v) z = u1*u1*u2 r = bbb+ccc*v-x if r + SG_MAGICCONST - 4.5*z >= 0.0 or r >= _log(z): return x * beta elif alpha == 1.0: # expovariate(1/beta) return -_log(1.0 - random()) * beta else: # alpha is between 0 and 1 (exclusive) # Uses ALGORITHM GS of Statistical Computing - Kennedy & Gentle while 1: u = random() b = (_e + alpha)/_e p = b*u if p <= 1.0: x = p ** (1.0/alpha) else: x = -_log((b-p)/alpha) u1 = random() if p > 1.0: if u1 <= x ** (alpha - 1.0): break elif u1 <= _exp(-x): break return x * beta ## -------------------- Gauss (faster alternative) -------------------- def gauss(self, mu, sigma): """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. """ # When x and y are two variables from [0, 1), uniformly # distributed, then # # cos(2*pi*x)*sqrt(-2*log(1-y)) # sin(2*pi*x)*sqrt(-2*log(1-y)) # # are two *independent* variables with normal distribution # (mu = 0, sigma = 1). # (Lambert Meertens) # (corrected version; bug discovered by Mike Miller, fixed by LM) # Multithreading note: When two threads call this function # simultaneously, it is possible that they will receive the # same return value. The window is very small though. To # avoid this, you have to use a lock around all calls. (I # didn't want to slow this down in the serial case by using a # lock here.) random = self.random z = self.gauss_next self.gauss_next = None if z is None: x2pi = random() * TWOPI g2rad = _sqrt(-2.0 * _log(1.0 - random())) z = _cos(x2pi) * g2rad self.gauss_next = _sin(x2pi) * g2rad return mu + z*sigma ## -------------------- beta -------------------- ## See ## http://mail.python.org/pipermail/python-bugs-list/2001-January/003752.html ## for Ivan Frohne's insightful analysis of why the original implementation: ## ## def betavariate(self, alpha, beta): ## # Discrete Event Simulation in C, pp 87-88. ## ## y = self.expovariate(alpha) ## z = self.expovariate(1.0/beta) ## return z/(y+z) ## ## was dead wrong, and how it probably got that way. def betavariate(self, alpha, beta): """Beta distribution. Conditions on the parameters are alpha > 0 and beta > 0. Returned values range between 0 and 1. """ # This version due to Janne Sinkkonen, and matches all the std # texts (e.g., Knuth Vol 2 Ed 3 pg 134 "the beta distribution"). y = self.gammavariate(alpha, 1.0) if y == 0: return 0.0 else: return y / (y + self.gammavariate(beta, 1.0)) ## -------------------- Pareto -------------------- def paretovariate(self, alpha): """Pareto distribution. alpha is the shape parameter.""" # Jain, pg. 495 u = 1.0 - self.random() return 1.0 / u ** (1.0/alpha) ## -------------------- Weibull -------------------- def weibullvariate(self, alpha, beta): """Weibull distribution. alpha is the scale parameter and beta is the shape parameter. """ # Jain, pg. 499; bug fix courtesy Bill Arms u = 1.0 - self.random() return alpha * (-_log(u)) ** (1.0/beta) ## --------------- Operating System Random Source ------------------ class SystemRandom(Random): """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). """ def random(self): """Get the next random number in the range [0.0, 1.0).""" return (int.from_bytes(_urandom(7), 'big') >> 3) * RECIP_BPF def getrandbits(self, k): """getrandbits(k) -> x. Generates an int with k random bits.""" if k <= 0: raise ValueError('number of bits must be greater than zero') numbytes = (k + 7) // 8 # bits / 8 and rounded up x = int.from_bytes(_urandom(numbytes), 'big') return x >> (numbytes * 8 - k) # trim excess bits def seed(self, *args, **kwds): "Stub method. Not used for a system random number generator." return None def _notimplemented(self, *args, **kwds): "Method should not be called for a system random number generator." raise NotImplementedError('System entropy source does not have state.') getstate = setstate = _notimplemented ## -------------------- test program -------------------- def _test_generator(n, func, args): import time print(n, 'times', func.__name__) total = 0.0 sqsum = 0.0 smallest = 1e10 largest = -1e10 t0 = time.perf_counter() for i in range(n): x = func(*args) total += x sqsum = sqsum + x*x smallest = min(x, smallest) largest = max(x, largest) t1 = time.perf_counter() print(round(t1-t0, 3), 'sec,', end=' ') avg = total/n stddev = _sqrt(sqsum/n - avg*avg) print('avg %g, stddev %g, min %g, max %g\n' % \ (avg, stddev, smallest, largest)) def _test(N=2000): _test_generator(N, random, ()) _test_generator(N, normalvariate, (0.0, 1.0)) _test_generator(N, lognormvariate, (0.0, 1.0)) _test_generator(N, vonmisesvariate, (0.0, 1.0)) _test_generator(N, gammavariate, (0.01, 1.0)) _test_generator(N, gammavariate, (0.1, 1.0)) _test_generator(N, gammavariate, (0.1, 2.0)) _test_generator(N, gammavariate, (0.5, 1.0)) _test_generator(N, gammavariate, (0.9, 1.0)) _test_generator(N, gammavariate, (1.0, 1.0)) _test_generator(N, gammavariate, (2.0, 1.0)) _test_generator(N, gammavariate, (20.0, 1.0)) _test_generator(N, gammavariate, (200.0, 1.0)) _test_generator(N, gauss, (0.0, 1.0)) _test_generator(N, betavariate, (3.0, 3.0)) _test_generator(N, triangular, (0.0, 1.0, 1.0/3.0)) # Create one instance, seeded from current time, and export its methods # as module-level functions. The functions share state across all uses #(both in the user's code and in the Python libraries), but that's fine # for most programs and is easier for the casual user than making them # instantiate their own Random() instance. _inst = Random() seed = _inst.seed random = _inst.random uniform = _inst.uniform triangular = _inst.triangular randint = _inst.randint choice = _inst.choice randrange = _inst.randrange sample = _inst.sample shuffle = _inst.shuffle choices = _inst.choices normalvariate = _inst.normalvariate lognormvariate = _inst.lognormvariate expovariate = _inst.expovariate vonmisesvariate = _inst.vonmisesvariate gammavariate = _inst.gammavariate gauss = _inst.gauss betavariate = _inst.betavariate paretovariate = _inst.paretovariate weibullvariate = _inst.weibullvariate getstate = _inst.getstate setstate = _inst.setstate getrandbits = _inst.getrandbits if hasattr(_os, "fork"): _os.register_at_fork(after_in_child=_inst.seed) if __name__ == '__main__': _test()