diff options
| author | Éric Araujo <merwok@netwok.org> | 2010-11-16 19:13:50 (GMT) |
|---|---|---|
| committer | Éric Araujo <merwok@netwok.org> | 2010-11-16 19:13:50 (GMT) |
| commit | 6e6cb8e0e491477614bae33c29f6e00d0d48c20b (patch) | |
| tree | 0cb13cc6d94af48c5a4b78b360c75fcf6f93d406 /Doc/library/heapq.rst | |
| parent | dbe7519da9d0a99d68aaa773cde2793900dad44f (diff) | |
| download | cpython-6e6cb8e0e491477614bae33c29f6e00d0d48c20b.zip cpython-6e6cb8e0e491477614bae33c29f6e00d0d48c20b.tar.gz cpython-6e6cb8e0e491477614bae33c29f6e00d0d48c20b.tar.bz2 | |
Provide links to Python source where the code is short, readable and
informative adjunct to the docs. Forward-port of Raymond's r86225 and
r86245 using the new source reST role added in #10334.
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 78beee9..67bda56 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -11,6 +11,11 @@ This module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm. +.. seealso:: + + Latest version of the :source:`heapq Python source code + <Lib/heapq.py>` + 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 |