Remove coding cookie from heapq.py.
This commit is contained in:
parent
6a4e3c5f12
commit
b4a17a8440
|
@ -1,5 +1,3 @@
|
||||||
# -*- coding: latin-1 -*-
|
|
||||||
|
|
||||||
"""Heap queue algorithm (a.k.a. priority queue).
|
"""Heap queue algorithm (a.k.a. priority queue).
|
||||||
|
|
||||||
Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
|
Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
|
||||||
|
@ -34,7 +32,7 @@ maintains the heap invariant!
|
||||||
|
|
||||||
__about__ = """Heap queues
|
__about__ = """Heap queues
|
||||||
|
|
||||||
[explanation by François Pinard]
|
[explanation by François Pinard]
|
||||||
|
|
||||||
Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
|
Heaps are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
|
||||||
all k, counting elements from 0. For the sake of comparison,
|
all k, counting elements from 0. For the sake of comparison,
|
||||||
|
|
Loading…
Reference in New Issue