mirrors/cpython
1
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2025-09-26 18:29:57 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 10

Minor markup changes.

Browse source
This commit is contained in:
Fred Drake 2002-08-02 19:46:42 +00:00
parent a0b3a00bc5
commit 1acab695a7
1 changed files with 4 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

7
Doc/lib/libheapq.tex
View file

@ -3,14 +3,15 @@
\declaremodule{standard}{heapq} \declaremodule{standard}{heapq}
\modulesynopsis{Heap queue algorithm (a.k.a. priority queue).} \modulesynopsis{Heap queue algorithm (a.k.a. priority queue).}
\moduleauthor{Kevin O'Connor}{}
\sectionauthor{Guido van Rossum}{guido@python.org} \sectionauthor{Guido van Rossum}{guido@python.org}
% Implementation contributed by Kevin O'Connor % Theoretical explanation:
% Theoretical explanation by François Pinard \sectionauthor{Fran\c cois Pinard}{}
\versionadded{2.3}
This module provides an implementation of the heap queue algorithm, This module provides an implementation of the heap queue algorithm,
also known as the priority queue algorithm. also known as the priority queue algorithm.
\versionadded{2.3}
Heaps are arrays for which Heaps are arrays for which
\code{\var{heap}[\var{k}] <= \var{heap}[2*\var{k}+1]} and \code{\var{heap}[\var{k}] <= \var{heap}[2*\var{k}+1]} and