diff options
| author | Senthil Kumaran <senthil@uthcode.com> | 2011-08-10 21:54:56 +0800 |
|---|---|---|
| committer | Senthil Kumaran <senthil@uthcode.com> | 2011-08-10 21:54:56 +0800 |
| commit | ea75f4cf3b604526ff5839d5afe573155b20197c (patch) | |
| tree | 20b2b427266307893718d4dd1151c08e539a4078 | |
| parent | 3ea5224c43663ee4a18e8a08ca927fe8a4790f24 (diff) | |
| download | cpython-git-ea75f4cf3b604526ff5839d5afe573155b20197c.tar.gz | |
Fix closes Issue12722 - link heapq source in the text format in the documentation.
| -rw-r--r-- | Doc/library/heapq.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index a6b9ba2710..fcaf28d668 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -16,7 +16,7 @@ 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>`_ + <http://svn.python.org/view/*checkout*/python/branches/release27-maint/Lib/heapq.py?content-type=text%2Fplain>`_ Heaps are binary trees for which every parent node has a value less than or equal to any of its children. This implementation uses arrays for which |