| commit | 4f707fd3165dad9cdf0307b610593a32bfcd456e | [log] [tgz] |
|---|---|---|
| author | Raymond Hettinger <python@rcn.com> | Mon Jan 10 19:54:11 2011 +0000 |
| committer | Raymond Hettinger <python@rcn.com> | Mon Jan 10 19:54:11 2011 +0000 |
| tree | 684fff97ff4e77a9b04a51c8ded1b4d0f4cb36ed | |
| parent | 04da1e013a6ad54b417d52b6c5e1312b18a67ae9 [diff] [blame] |
Separate source link from main text.
diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst index 98955e6..13b0147 100644 --- a/Doc/library/bisect.rst +++ b/Doc/library/bisect.rst
@@ -9,6 +9,8 @@ **Source code:** :source:`Lib/bisect.py` +-------------- + This module provides support for maintaining a list in sorted order without having to sort the list after each insertion. For long lists of items with expensive comparison operations, this can be an improvement over the more common