diff options
| author | Georg Brandl <georg@python.org> | 2016-02-26 18:37:12 (GMT) |
|---|---|---|
| committer | Georg Brandl <georg@python.org> | 2016-02-26 18:37:12 (GMT) |
| commit | 6e0b44ef9eedf94cfbafea8a298fe9b6f39b18ff (patch) | |
| tree | 29d9ee893681ff303ca2e24f0363dd782ca7c138 /Doc/library/heapq.rst | |
| parent | bb650631f239823a951cc141b14325ab32d64711 (diff) | |
| download | cpython-6e0b44ef9eedf94cfbafea8a298fe9b6f39b18ff.zip cpython-6e0b44ef9eedf94cfbafea8a298fe9b6f39b18ff.tar.gz cpython-6e0b44ef9eedf94cfbafea8a298fe9b6f39b18ff.tar.bz2 | |
Closes #25910: fix dead and permanently redirected links in the docs. Thanks to SilentGhost for the patch.
Diffstat (limited to 'Doc/library/heapq.rst')
| -rw-r--r-- | Doc/library/heapq.rst | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/heapq.rst b/Doc/library/heapq.rst index a7d1f45..16b2fd5 100644 --- a/Doc/library/heapq.rst +++ b/Doc/library/heapq.rst @@ -133,7 +133,7 @@ the iterable into an actual heap. Basic Examples -------------- -A `heapsort <http://en.wikipedia.org/wiki/Heapsort>`_ can be implemented by +A `heapsort <https://en.wikipedia.org/wiki/Heapsort>`_ can be implemented by pushing all values onto a heap and then popping off the smallest values one at a time:: @@ -164,7 +164,7 @@ Heap elements can be tuples. This is useful for assigning comparison values Priority Queue Implementation Notes ----------------------------------- -A `priority queue <http://en.wikipedia.org/wiki/Priority_queue>`_ is common use +A `priority queue <https://en.wikipedia.org/wiki/Priority_queue>`_ is common use for a heap, and it presents several implementation challenges: * Sort stability: how do you get two tasks with equal priorities to be returned |