# Adrian Baddeley. Adapted by Raymond Hettinger for use with
# the Mersenne Twister and os.urandom() core generators.
-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 math import tau as TWOPI, floor as _floor, isfinite as _isfinite
import os as _os
import _random
-try:
- # hashlib is pretty heavy to load, try lean internal module first
- from _sha2 import sha512 as _sha512
-except ImportError:
- # fallback to official implementation
- from hashlib import sha512 as _sha512
-
__all__ = [
"Random",
"SystemRandom",
BPF = 53 # Number of bits in a float
RECIP_BPF = 2 ** -BPF
_ONE = 1
+_sha512 = None
class Random(_random.Random):
a = -2 if x == -1 else x
elif version == 2 and isinstance(a, (str, bytes, bytearray)):
+ global _sha512
+ if _sha512 is None:
+ try:
+ # hashlib is pretty heavy to load, try lean internal
+ # module first
+ from _sha2 import sha512 as _sha512
+ except ImportError:
+ # fallback to official implementation
+ from hashlib import sha512 as _sha512
+
if isinstance(a, str):
a = a.encode()
a = int.from_bytes(a + _sha512(a).digest())
random = self.random
if n >= 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.")
+ from warnings import warn
+ 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 _floor(random() * n)
rem = maxsize % n
limit = (maxsize - rem) / maxsize # int(limit * maxsize) % n == 0