Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6a4e3c5 commit b4a17a8Copy full SHA for b4a17a8
1 file changed
Lib/heapq.py
@@ -1,5 +1,3 @@
1
-# -*- coding: latin-1 -*-
2
-
3
"""Heap queue algorithm (a.k.a. priority queue).
4
5
Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
@@ -34,7 +32,7 @@
34
32
35
33
__about__ = """Heap queues
36
37
-[explanation by François Pinard]
+[explanation by François Pinard]
38
39
40
all k, counting elements from 0. For the sake of comparison,
0 commit comments