diff options
| author | Fred Drake <fdrake@acm.org> | 2002-08-02 19:46:42 (GMT) |
|---|---|---|
| committer | Fred Drake <fdrake@acm.org> | 2002-08-02 19:46:42 (GMT) |
| commit | 1acab695a710ce658f381fb70aae13224aba6dc9 (patch) | |
| tree | 7c6394d4152e6384551807a9b12ddf24dbc23858 /Doc | |
| parent | a0b3a00bc5f55cfbdc3d9b7925ee8a28fa2bdc55 (diff) | |
| download | cpython-1acab695a710ce658f381fb70aae13224aba6dc9.zip cpython-1acab695a710ce658f381fb70aae13224aba6dc9.tar.gz cpython-1acab695a710ce658f381fb70aae13224aba6dc9.tar.bz2 | |
Minor markup changes.
Diffstat (limited to 'Doc')
| -rw-r--r-- | Doc/lib/libheapq.tex | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/Doc/lib/libheapq.tex b/Doc/lib/libheapq.tex index fe8c411..d196fda 100644 --- a/Doc/lib/libheapq.tex +++ b/Doc/lib/libheapq.tex @@ -3,14 +3,15 @@ \declaremodule{standard}{heapq} \modulesynopsis{Heap queue algorithm (a.k.a. priority queue).} +\moduleauthor{Kevin O'Connor}{} \sectionauthor{Guido van Rossum}{guido@python.org} -% Implementation contributed by Kevin O'Connor -% Theoretical explanation by François Pinard +% Theoretical explanation: +\sectionauthor{Fran\c cois Pinard}{} +\versionadded{2.3} This module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm. -\versionadded{2.3} Heaps are arrays for which \code{\var{heap}[\var{k}] <= \var{heap}[2*\var{k}+1]} and |