diff options
| author | Raymond Hettinger <python@rcn.com> | 2011-01-10 03:26:08 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2011-01-10 03:26:08 (GMT) |
| commit | 10480940373492652bc285fca3fa74751c271645 (patch) | |
| tree | bb1bfed3416120cc371eb884960cf73aad9a957e /Doc/library/bisect.rst | |
| parent | a4815caa7ccf21aa994d0e0eec66873072f0e352 (diff) | |
| download | cpython-10480940373492652bc285fca3fa74751c271645.zip cpython-10480940373492652bc285fca3fa74751c271645.tar.gz cpython-10480940373492652bc285fca3fa74751c271645.tar.bz2 | |
Move source links to consistent location and remove wordy, big yellow boxes.
Diffstat (limited to 'Doc/library/bisect.rst')
| -rw-r--r-- | Doc/library/bisect.rst | 7 |
1 files changed, 2 insertions, 5 deletions
diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst index ca853e0..98955e6 100644 --- a/Doc/library/bisect.rst +++ b/Doc/library/bisect.rst @@ -7,6 +7,8 @@ .. sectionauthor:: Raymond Hettinger <python at rcn.com> .. example based on the PyModules FAQ entry by Aaron Watters <arw@pythonpros.com> +**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 @@ -14,11 +16,6 @@ approach. The module is called :mod:`bisect` because it uses a basic bisection algorithm to do its work. The source code may be most useful as a working example of the algorithm (the boundary conditions are already right!). -.. seealso:: - - Latest version of the :source:`bisect module Python source code - <Lib/bisect.py>` - The following functions are provided: |