diff options
| author | Tim Peters <tim.peters@gmail.com> | 2005-08-26 15:20:46 (GMT) |
|---|---|---|
| committer | Tim Peters <tim.peters@gmail.com> | 2005-08-26 15:20:46 (GMT) |
| commit | 9e34c047325651853a95f95e538582a4f6d5b7f6 (patch) | |
| tree | 97ba789e8889e26e3fd5bd729d01d5e8e2c15d70 /Lib/random.py | |
| parent | e8889c5741b636aa798757eb5500d304b1704344 (diff) | |
| download | cpython-9e34c047325651853a95f95e538582a4f6d5b7f6.zip cpython-9e34c047325651853a95f95e538582a4f6d5b7f6.tar.gz cpython-9e34c047325651853a95f95e538582a4f6d5b7f6.tar.bz2 | |
Whitespace normalization (via reindent.py).
Diffstat (limited to 'Lib/random.py')
| -rw-r--r-- | Lib/random.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Lib/random.py b/Lib/random.py index 3e6941e..b4ad2b3 100644 --- a/Lib/random.py +++ b/Lib/random.py @@ -303,7 +303,7 @@ class Random(_random.Random): 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 + setsize += 4 ** _ceil(_log(k * 3, 4)) # table size for big sets if n <= setsize: # is an n-length list smaller than a k-length set pool = list(population) for i in xrange(k): # invariant: non-selected at [0,n-i) |