diff options
| author | Georg Brandl <georg@python.org> | 2007-12-29 10:57:00 (GMT) |
|---|---|---|
| committer | Georg Brandl <georg@python.org> | 2007-12-29 10:57:00 (GMT) |
| commit | b19be571e09263239ef29c92eee06dbb30186685 (patch) | |
| tree | 9c8a5439b14ce34cfaa0e4e164483b0f8690aa42 /Doc/library/bisect.rst | |
| parent | 28c7bcf38e1e69a9091cbba90b982331428ddbe6 (diff) | |
| download | cpython-b19be571e09263239ef29c92eee06dbb30186685.zip cpython-b19be571e09263239ef29c92eee06dbb30186685.tar.gz cpython-b19be571e09263239ef29c92eee06dbb30186685.tar.bz2 | |
Some cleanup in the docs.
Diffstat (limited to 'Doc/library/bisect.rst')
| -rw-r--r-- | Doc/library/bisect.rst | 6 |
1 files changed, 1 insertions, 5 deletions
diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst index b8eb348..6d91644 100644 --- a/Doc/library/bisect.rst +++ b/Doc/library/bisect.rst @@ -5,11 +5,7 @@ .. module:: bisect :synopsis: Array bisection algorithms for binary searching. .. sectionauthor:: Fred L. Drake, Jr. <fdrake@acm.org> - - -.. % LaTeX produced by Fred L. Drake, Jr. <fdrake@acm.org>, with an -.. % example based on the PyModules FAQ entry by Aaron Watters -.. % <arw@pythonpros.com>. +.. example based on the PyModules FAQ entry by Aaron Watters <arw@pythonpros.com> 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 |