Merged revisions 85328 via svnmerge from

svn+ssh://pythondev@svn.python.org/python/branches/py3k

........
  r85328 | benjamin.peterson | 2010-10-08 20:58:37 -0500 (Fri, 08 Oct 2010) | 1 line

  remove author names from prose
........

diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst
index 49e3bf35771eed73b2e1de7ed010b49d3ea35e39..78beee9978815c1b3b390102299385b259520c55 100644 (file)
--- a/Doc/library/heapq.rst
+++ b/Doc/library/heapq.rst
@@ -203,9 +203,6 @@ entry as invalid and optionally add a new entry with the revised priority::
 Theory
 ------
 
-(This explanation is due to François Pinard.  The Python code for this module
-was contributed by Kevin O'Connor.)
-
 Heaps are arrays for which ``a[k] <= a[2*k+1]`` and ``a[k] <= a[2*k+2]`` for all
 *k*, counting elements from 0.  For the sake of comparison, non-existing
 elements are considered to be infinite.  The interesting property of a heap is