[Python-checkins] r85330 - in python/branches/release27-maint: Doc/library/heapq.rst

[benjamin.peterson]

Author: benjamin.peterson
Date: Sat Oct  9 04:04:15 2010
New Revision: 85330

Log:
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
........


Modified:
   python/branches/release27-maint/   (props changed)
   python/branches/release27-maint/Doc/library/heapq.rst

Modified: python/branches/release27-maint/Doc/library/heapq.rst
==============================================================================
--- python/branches/release27-maint/Doc/library/heapq.rst	(original)
+++ python/branches/release27-maint/Doc/library/heapq.rst	Sat Oct  9 04:04:15 2010
@@ -217,9 +217,6 @@
 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