Skip to content

C
cpython
Commit 41f2650d authored by Fred Drake's avatar Fred Drake
Browse files
Options

Minor markup changes.

parent 2c9f8a6a
Show whitespace changes
Inline Side-by-side
Showing with 4 additions and 3 deletions
Doc/lib/libheapq.tex
View file @ 41f2650d
...@@ -3,14 +3,15 @@ ...@@ -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
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment
GitLab Nexedi Edition | About GitLab | About Nexedi | 沪ICP备2021021310号-2 | 沪ICP备2021021310号-7