Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
cpython
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
cpython
Commits
55e1fba5
Commit
55e1fba5
authored
Sep 08, 2010
by
Raymond Hettinger
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
In the case where only a user supplied random() method is available,
adopt a strategy that makes the fewest calls to random().
parent
41966336
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
12 additions
and
12 deletions
+12
-12
Lib/random.py
Lib/random.py
+12
-12
No files found.
Lib/random.py
View file @
55e1fba5
...
...
@@ -212,33 +212,33 @@ class Random(_random.Random):
return
self
.
randrange
(
a
,
b
+
1
)
def
_randbelow
(
self
,
n
,
int
=
int
,
bpf
=
BPF
,
type
=
type
,
def
_randbelow
(
self
,
n
,
int
=
int
,
maxsize
=
1
<<
BPF
,
type
=
type
,
Method
=
_MethodType
,
BuiltinMethod
=
_BuiltinMethodType
):
"""Return a random int in the range [0,n). Raises ValueError if n==0.
"""
"Return a random int in the range [0,n). Raises ValueError if n==0."
k
=
n
.
bit_length
()
# don't use (n-1) here because n can be 1
getrandbits
=
self
.
getrandbits
# Only call self.getrandbits if the original random() builtin method
# has not been overridden or if a new getrandbits() was supplied.
if
type
(
self
.
random
)
is
BuiltinMethod
or
type
(
getrandbits
)
is
Method
:
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
# There's an overriden random() method but no new getrandbits() method,
# so we can only use random() from here.
if
k
>
bpf
:
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."
)
return
int
(
self
.
random
()
*
n
)
r
andom
=
self
.
random
N
=
1
<<
k
r
=
int
(
N
*
random
())
# 0 <= r < 2**k
while
r
>=
n
:
r
=
int
(
N
*
random
()
)
return
r
return
int
(
random
()
*
n
)
r
em
=
maxsize
%
n
limit
=
(
maxsize
-
rem
)
/
maxsize
# int(limit * maxsize) % n == 0
r
=
random
()
while
r
>=
limit
:
r
=
random
(
)
return
int
(
r
*
maxsize
)
%
n
## -------------------- sequence methods -------------------
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment