diff options
| author | Benjamin Peterson <benjamin@python.org> | 2010-10-09 02:04:15 (GMT) |
|---|---|---|
| committer | Benjamin Peterson <benjamin@python.org> | 2010-10-09 02:04:15 (GMT) |
| commit | b1fb458807ac853650951c42562b8fad6d57a5a1 (patch) | |
| tree | e304a160bb3a637e96fdec8a6c9f6cd3df63bb1a /Doc/library/heapq.rst | |
| parent | 26236880b861822b8d71d6f88e4193de0ad22fb2 (diff) | |
| download | cpython-b1fb458807ac853650951c42562b8fad6d57a5a1.zip cpython-b1fb458807ac853650951c42562b8fad6d57a5a1.tar.gz cpython-b1fb458807ac853650951c42562b8fad6d57a5a1.tar.bz2 | |
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
........
Diffstat (limited to 'Doc/library/heapq.rst')
| -rw-r--r-- | Doc/library/heapq.rst | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index 416ec2c..6c0e467 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -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 |