[Python-checkins] r85328 - python/branches/py3k/Doc/library/heapq.rst

[benjamin.peterson]

Author: benjamin.peterson
Date: Sat Oct  9 03:58:37 2010
New Revision: 85328

Log:
remove author names from prose

Modified:
   python/branches/py3k/Doc/library/heapq.rst

Modified: python/branches/py3k/Doc/library/heapq.rst
==============================================================================
--- python/branches/py3k/Doc/library/heapq.rst	(original)
+++ python/branches/py3k/Doc/library/heapq.rst	Sat Oct  9 03:58:37 2010
@@ -203,9 +203,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