diff options
author | Jeremy Hylton <jeremy@alum.mit.edu> | 2004-02-23 17:27:57 (GMT) |
---|---|---|
committer | Jeremy Hylton <jeremy@alum.mit.edu> | 2004-02-23 17:27:57 (GMT) |
commit | 2b55d35850e3e8e0b28aba7878d3f9122a7907ac (patch) | |
tree | b62fc1c8aead6e6140b896f921a26cc84cec2f73 /Lib/random.py | |
parent | 361d66de5de1f7c295d9866cdf4237899d819db5 (diff) | |
download | cpython-2b55d35850e3e8e0b28aba7878d3f9122a7907ac.zip cpython-2b55d35850e3e8e0b28aba7878d3f9122a7907ac.tar.gz cpython-2b55d35850e3e8e0b28aba7878d3f9122a7907ac.tar.bz2 |
Reflow long line.
Diffstat (limited to 'Lib/random.py')
-rw-r--r-- | Lib/random.py | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/Lib/random.py b/Lib/random.py index a2415ae..58865fc 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: |