Mirror
/
cpython
mirror of https://github.com/python/cpython
4
1
Fork 0
Code Issues Releases Wiki Activity

remove author names from prose

This commit is contained in:
Benjamin Peterson 2010-10-09 01:58:37 +00:00
parent 81564093a1
commit fc8408cbe8
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

@ -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