diff options
| author | Fred Drake <fdrake@acm.org> | 1999-02-20 00:14:17 (GMT) |
|---|---|---|
| committer | Fred Drake <fdrake@acm.org> | 1999-02-20 00:14:17 (GMT) |
| commit | bbac43223c3ead4745d41414df13d113d79334ad (patch) | |
| tree | 08001df173f742c7ee291ae1e9ad196704fa7d59 /Doc/lib/libbisect.tex | |
| parent | da5736533705f22a2673fbdc53ea9c537751c43c (diff) | |
| download | cpython-bbac43223c3ead4745d41414df13d113d79334ad.zip cpython-bbac43223c3ead4745d41414df13d113d79334ad.tar.gz cpython-bbac43223c3ead4745d41414df13d113d79334ad.tar.bz2 | |
Shorten a few section titles.
Diffstat (limited to 'Doc/lib/libbisect.tex')
| -rw-r--r-- | Doc/lib/libbisect.tex | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/Doc/lib/libbisect.tex b/Doc/lib/libbisect.tex index e36cf0e..2b3f117 100644 --- a/Doc/lib/libbisect.tex +++ b/Doc/lib/libbisect.tex @@ -3,13 +3,12 @@ % <arw@pythonpros.com>. \section{\module{bisect} --- - Array bisection algorithms for binary searching.} -\declaremodule{standard}{bisect} + Array bisection algorithm} +\declaremodule{standard}{bisect} \modulesynopsis{Array bisection algorithms for binary searching.} - 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 |