traverseda
/
cpython
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

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
........
This commit is contained in:
Benjamin Peterson 2010-10-09 02:04:15 +00:00
parent 26236880b8
commit b1fb458807
1 changed files with 0 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Doc/library/heapq.rst
View File

@ -217,9 +217,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