diff options
| author | Benjamin Peterson <benjamin@python.org> | 2010-10-09 01:58:37 +0000 |
|---|---|---|
| committer | Benjamin Peterson <benjamin@python.org> | 2010-10-09 01:58:37 +0000 |
| commit | fc8408cbe85dfc549686036668ceed77f2d8e76f (patch) | |
| tree | 50b8a85ec9ba34d971c14b23740a9413bcf88fa0 /Doc/library/heapq.rst | |
| parent | 81564093a10d1bad6dc48d68e40e322731517b6e (diff) | |
| download | cpython-git-fc8408cbe85dfc549686036668ceed77f2d8e76f.tar.gz | |
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 49e3bf3577..78beee9978 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -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 |