diff options
| author | Raymond Hettinger <python@rcn.com> | 2009-06-11 22:08:10 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2009-06-11 22:08:10 (GMT) |
| commit | 2742e7e58418851d71c8d89c8b7f0b252d8ff1ff (patch) | |
| tree | b52dbf6b32d177e13729acdcc9d6e906ef5cc7f2 | |
| parent | 6118040b7aee905bcddcb949c6815dc19ca23070 (diff) | |
| download | cpython-2742e7e58418851d71c8d89c8b7f0b252d8ff1ff.zip cpython-2742e7e58418851d71c8d89c8b7f0b252d8ff1ff.tar.gz cpython-2742e7e58418851d71c8d89c8b7f0b252d8ff1ff.tar.bz2 | |
Move comment to correct line.
| -rw-r--r-- | Doc/library/bisect.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst index 9364ed8..eb32354 100644 --- a/Doc/library/bisect.rst +++ b/Doc/library/bisect.rst @@ -94,8 +94,8 @@ Instead, it is better to search a list of precomputed keys to find the index of the record in question:: >>> data = [('red', 5), ('blue', 1), ('yellow', 8), ('black', 0)] - >>> data.sort(key=lambda r: r[1]) # precomputed list of keys - >>> keys = [r[1] for r in data] + >>> data.sort(key=lambda r: r[1]) + >>> keys = [r[1] for r in data] # precomputed list of keys >>> data[bisect_left(keys, 0)] ('black', 0) >>> data[bisect_left(keys, 1)] |