summaryrefslogtreecommitdiff
path: root/Lib/random.py
diff options
context:
space:
mode:
authorJeremy Hylton <jeremy@alum.mit.edu>2004-02-23 17:27:57 +0000
committerJeremy Hylton <jeremy@alum.mit.edu>2004-02-23 17:27:57 +0000
commit23fac8262477406bb25614f9a02e542ee99d933a (patch)
tree7bb4e220ff881cf84b1288e9ccf16e46ef6a1004 /Lib/random.py
parent84e337cf1b195723787982c42fea6346b7a074f6 (diff)
downloadcpython-23fac8262477406bb25614f9a02e542ee99d933a.tar.gz
Reflow long line.
Diffstat (limited to 'Lib/random.py')
-rw-r--r--Lib/random.py12
1 files changed, 6 insertions, 6 deletions
diff --git a/Lib/random.py b/Lib/random.py
index a2415ae6bd..58865fc59b 100644
--- a/Lib/random.py
+++ b/Lib/random.py
@@ -280,12 +280,12 @@ class Random(_random.Random):
# selections (the pool) in a list or previous selections in a
# dictionary.
- # When the number of selections is small compared to the population,
- # then tracking selections is efficient, requiring only a small
- # dictionary and an occasional reselection. For a larger number of
- # selections, the pool tracking method is preferred since the list takes
- # less space than the dictionary and it doesn't suffer from frequent
- # reselections.
+ # When the number of selections is small compared to the
+ # population, then tracking selections is efficient, requiring
+ # only a small dictionary and an occasional reselection. For
+ # a larger number of selections, the pool tracking method is
+ # preferred since the list takes less space than the
+ # dictionary and it doesn't suffer from frequent reselections.
n = len(population)
if not 0 <= k <= n: