diff options
| author | Raymond Hettinger <python@rcn.com> | 2010-11-06 07:10:31 (GMT) |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2010-11-06 07:10:31 (GMT) |
| commit | e0e082281ef9ec89d2d2cfdd18eddf4685068c59 (patch) | |
| tree | 37cef4be4e3f2873026b2b674d15bd056cafa61a /Doc/library/heapq.rst | |
| parent | d5cd1ff7da20543794496dc4a8867fafff0c87a2 (diff) | |
| download | cpython-e0e082281ef9ec89d2d2cfdd18eddf4685068c59.zip cpython-e0e082281ef9ec89d2d2cfdd18eddf4685068c59.tar.gz cpython-e0e082281ef9ec89d2d2cfdd18eddf4685068c59.tar.bz2 | |
Add more links to Python sources where the code is short, readable and an informative adjunct to the docs.
Diffstat (limited to 'Doc/library/heapq.rst')
| -rw-r--r-- | Doc/library/heapq.rst | 5 |
1 files changed, 5 insertions, 0 deletions
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index 6c0e467..b46bd82 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -13,6 +13,11 @@ This module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm. +.. seealso:: + + Latest version of the `heapq Python source code + <http://svn.python.org/view/python/branches/release27-maint/Lib/heapq.py?view=markup>`_ + Heaps are arrays for which ``heap[k] <= heap[2*k+1]`` and ``heap[k] <= heap[2*k+2]`` for all *k*, counting elements from zero. For the sake of comparison, non-existing elements are considered to be infinite. The |