diff options
| author | Mark Dickinson <dickinsm@gmail.com> | 2010-07-04 19:23:49 +0000 |
|---|---|---|
| committer | Mark Dickinson <dickinsm@gmail.com> | 2010-07-04 19:23:49 +0000 |
| commit | b4a17a8440cbee52df5a1cae508a8f722007e516 (patch) | |
| tree | 6a0a3d1d35768cb9dec0d6dd5696a66d1ac83d7d /Lib/heapq.py | |
| parent | 6a4e3c5f12bc4f835b396944c87b80fed56e4967 (diff) | |
| download | cpython-git-b4a17a8440cbee52df5a1cae508a8f722007e516.tar.gz | |
Remove coding cookie from heapq.py.
Diffstat (limited to 'Lib/heapq.py')
| -rw-r--r-- | Lib/heapq.py | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/Lib/heapq.py b/Lib/heapq.py index b74818e2ba..464663a78a 100644 --- a/Lib/heapq.py +++ b/Lib/heapq.py @@ -1,5 +1,3 @@ -# -*- coding: latin-1 -*- - """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 @@ -34,7 +32,7 @@ maintains the heap invariant! __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 all k, counting elements from 0. For the sake of comparison, |