From 1acab695a710ce658f381fb70aae13224aba6dc9 Mon Sep 17 00:00:00 2001
From: Fred Drake <fdrake@acm.org>
Date: Fri, 2 Aug 2002 19:46:42 +0000
Subject: Minor markup changes.

---
 Doc/lib/libheapq.tex | 7 ++++---
 1 file 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
-- 
cgit v0.12