ELF > @ p @ 8 @ " ! 8
8
% % 0 0 0 \" \" ^ n n ( 0 0^ 0n 0n 8 8 8 $ $ Ptd M M M Qtd Rtd ^ n n GNU 2H|_fQY: l F t % c , < U
p __gmon_start__ _ITM_deregisterTMCloneTable _ITM_registerTMCloneTable __cxa_finalize PyInit__heapq PyModuleDef_Init PyUnicode_FromString PyModule_AddObject _Py_Dealloc _PyArg_BadArgument _Py_NoneStruct PyObject_RichCompareBool PyExc_RuntimeError PyErr_SetString PyExc_IndexError PyList_Append _PyArg_CheckPositional PyList_SetSlice n ! (n `p `p p p ;0 p p @5 p h0 p p `4 q 30 q q 3 q O0 (q 8q 2 @q 0 Hq Xq 1 `q t0 hq xq 1 q [0 q 0 q @1 q 0 q q 0 r 0 r 5 r p (r p o o o o o o
o p p p p p (p
0p 8p @p Hp HH_ HtH 5_ %_ @ %_ h %_ h %_ h %_ h %_ h %_ h %_ h %_ h p%_ h `%_ h P%^ f Hx HHt HH^ H5 H8(> HLD$D$rD$LD$ H^ H5 H8A H+HE H;HG
6
IE s HIE e LX PHHO H5M H= b1ZHHuH߉D$ D$ HL$Ht$H;q HD$HPIJI} HI] H8L9 M 1 1HLZI/ 7 HIuLD$ %D$ x-HIHD$HPH;Xt`H] H5 H8J LD$ D$ H\ H5E H8]LD$ D$
J< JH4:LLLL L9d$~6Me
A
1LLrI
E H$ HH H
Hֹ H= / LHU H5 H= h PHH2 H50 H= E1ZH[ H5# H8;L H-p HH HH5 ' H-K Hֹ HtH;HG f D H=i] @ UHH=& SQH5g HHH11Z[]ff. HFH t H5 'PHH& H5$ H=& 91Z D AWAVAUATIUHSHHWHHHD$H HD$HHW H HtpHtUHt:Ht H8 HHAԅ: HHHAԅ% HHHAԅ HHHAԅ HHHAԅ HHHAԅ H HHAԅ LkHLAԅ HHHAԅ I]HHAԅu{I]HHAԅujI]HHAԅuYI]HHAԅuHI]HHAԅu7I]IbHY H[]A\A]A^A_HAԅu H1H1HHuHHHXLpH9]LzHHAԅut>IHILAԅuAt%IILHAԅuAt If D HI9uLl$IM9>LHAԅVAt[LHHHAԅ9t?LHHHAԅ t"LHHHAԅtHI|f. AWAVAUATUSHLoL9MHWHIIIHL9 K6HXHH H9L9 H t1HHL$H<$MH<$HL$Hx
HH Hx
HH HUHHL;m H JH1H8H9H0I9~ IG D JH0H1H8I9HHLH[]A\A]A^A_m D ;8Hω$}$iD$H $hD$H $;HdV H5M H8H[]A\A]A^A_ AWAVAUATUSH(LGHt$L9HGIHH H9 LeIN,N4 AE LD$AE 1LHIU LD$xHIU Hx
HHx{M;Gu_t)IGIHI6HI H2L9d$} LZ 1H([]A\A]A^A_ AE _ LD$[H'U H5 H8LLD$D$LD$D$I @ HFH t H5 PHH# H5! H=> 61ZfATUSHHufH.HE t2HsHguBHE1HHP1u,HnT []A\L% HH H5 L1L% Hֹ Lt USHHHuCH>HG tWH HStpHOHtH1ulHH[]H-V Hֹ HRua1H-2 HH H1H5 HS H5 1H8HxHHuH12u AUATUSHHoHt_HGHILlAE tAE 1HuHH Ht=HC1HH(L(Aԅu,HH[]A\A]HR H5 H88E1LHE xHHE uHv @ HFH lH5 AWAVAUATUSH(H_H|$H9]HHWHIHHD$H9}vKD- L`HJ< L:M0H9}fLHG H HSHOHtH1 u
HH[]HxHHuHJ1f D H=Q HQ H9tH^O Ht H=Q H5Q H)HH?HHHtH
O Htf D =mQ u+UH=N Ht H=nO dEQ ] w HH __about__ list argument heapify index out of range heappop heappush argument 1 heapreplace _heapify_max heappushpop _heappop_max _heapreplace_max _heapq list changed size during iteration _heapreplace_max($module, heap, item, /)
--
Maxheap variant of heapreplace. _heapify_max($module, heap, /)
--
Maxheap variant of heapify. _heappop_max($module, heap, /)
--
Maxheap variant of heappop. heapify($module, heap, /)
--
Transform list into a heap, in-place, in O(len(heap)) time. heapreplace($module, heap, item, /)
--
Pop and return the current smallest value, and add the new item.
This is more efficient than heappop() followed by heappush(), and can be
more appropriate when using a fixed-size heap. Note that the value
returned may be larger than item! That constrains reasonable uses of
this routine unless written as part of a conditional replacement:
if item > heap[0]:
item = heapreplace(heap, item) heappop($module, heap, /)
--
Pop the smallest item off the heap, maintaining the heap invariant. heappushpop($module, heap, item, /)
--
Push item on the heap, then pop and return the smallest item from the heap.
The combined action runs more efficiently than heappush() followed by
a separate call to heappop(). heappush($module, heap, item, /)
--
Push item onto heap, maintaining the heap invariant. 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
all k, counting elements from 0. For the sake of comparison,
non-existing elements are considered to be infinite. The interesting
property of a heap is that a[0] is always its smallest element.
Usage:
heap = [] # creates an empty heap
heappush(heap, item) # pushes a new item on the heap
item = heappop(heap) # pops the smallest item from the heap
item = heap[0] # smallest item on the heap without popping it
heapify(x) # transforms list into a heap, in-place, in linear time
item = heapreplace(heap, item) # pops and returns smallest item, and adds
# new item; the heap size is unchanged
Our API differs from textbook heap algorithms as follows:
- We use 0-based indexing. This makes the relationship between the
index for a node and the indexes for its children slightly less
obvious, but is more suitable since Python uses 0-based indexing.
- Our heappop() method returns the smallest item, not the largest.
These two make it possible to view the heap as a regular Python list
without surprises: heap[0] is the smallest item, and heap.sort()
maintains the heap invariant!
Heap queues
[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,
non-existing elements are considered to be infinite. The interesting
property of a heap is that a[0] is always its smallest element.
The strange invariant above is meant to be an efficient memory
representation for a tournament. The numbers below are `k', not a[k]:
0
1 2
3 4 5 6
7 8 9 10 11 12 13 14
15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
In the tree above, each cell `k' is topping `2*k+1' and `2*k+2'. In
a usual binary tournament we see in sports, each cell is the winner
over the two cells it tops, and we can trace the winner down the tree
to see all opponents s/he had. However, in many computer applications
of such tournaments, we do not need to trace the history of a winner.
To be more memory efficient, when a winner is promoted, we try to
replace it by something else at a lower level, and the rule becomes
that a cell and the two cells it tops contain three different items,
but the top cell "wins" over the two topped cells.
If this heap invariant is protected at all time, index 0 is clearly
the overall winner. The simplest algorithmic way to remove it and
find the "next" winner is to move some loser (let's say cell 30 in the
diagram above) into the 0 position, and then percolate this new 0 down
the tree, exchanging values, until the invariant is re-established.
This is clearly logarithmic on the total number of items in the tree.
By iterating over all items, you get an O(n ln n) sort.
A nice feature of this sort is that you can efficiently insert new
items while the sort is going on, provided that the inserted items are
not "better" than the last 0'th element you extracted. This is
especially useful in simulation contexts, where the tree holds all
incoming events, and the "win" condition means the smallest scheduled
time. When an event schedule other events for execution, they are
scheduled into the future, so they can easily go into the heap. So, a
heap is a good structure for implementing schedulers (this is what I
used for my MIDI sequencer :-).
Various structures for implementing schedulers have been extensively
studied, and heaps are good for this, as they are reasonably speedy,
the speed is almost constant, and the worst case is not much different
than the average case. However, there are other representations which
are more efficient overall, yet the worst cases might be terrible.
Heaps are also very useful in big disk sorts. You most probably all
know that a big sort implies producing "runs" (which are pre-sorted
sequences, which size is usually related to the amount of CPU memory),
followed by a merging passes for these runs, which merging is often
very cleverly organised[1]. It is very important that the initial
sort produces the longest runs possible. Tournaments are a good way
to that. If, using all the memory available to hold a tournament, you
replace and percolate items that happen to fit the current run, you'll
produce runs which are twice the size of the memory for random input,
and much better for input fuzzily ordered.
Moreover, if you output the 0'th item on disk and get an input which
may not fit in the current tournament (because the value "wins" over
the last output value), it cannot fit in the heap, so the size of the
heap decreases. The freed memory could be cleverly reused immediately
for progressively building a second heap, which grows at exactly the
same rate the first heap is melting. When the first heap completely
vanishes, you switch heaps and start a new run. Clever and quite
effective!
In a word, heaps are useful memory structures to know. I use them in
a few applications, and I think it is good to keep a `heap' module
around. :-)
--------------------
[1] The disk balancing algorithms which are current, nowadays, are
more annoying than clever, and this is a consequence of the seeking
capabilities of the disks. On devices which cannot seek, like big
tape drives, the story was quite different, and one had to be very
clever to ensure (far in advance) that each tape movement will be the
most effective possible (that is, will best participate at
"progressing" the merge). Some tapes were even able to read
backwards, and this was also used to avoid the rewinding time.
Believe me, real good tape sorts were quite spectacular to watch!
From all times, sorting has always been a Great Art! :-)
; 0 d
G8 ` y h H 0 `H p\ ` T p @ zR x $ FJ w ?;*3$" D \ $ p 5 AKA eAA D" ; Z` H 4 BBB B(D0D8DP
8A0A(B BBBA ` BBB B(A0A8DP
8J0A(B BBBG W8D0A(B BBB x P H L BBB B(A0A8D`
8A0A(B BBBH 5: ` > ]` , BAA G
ABA L ( h 4 AAG C
DAA 8 BBA A(D0^
(D ABBA ' 0 ( " A` H 0 g BBB B(A0A8D`
8A0A(B BBBA | R ` 0 BAA G0u
DABA u 0 " A` ( z AAG O
DAA D { !
! n (n o ` P
L o H o 0n 6 F V f v `p ;0 @5 h0 `4 30 3 O0 2 0 1 t0 1 [0 0 @1 0 0 0 5 p p GCC: (Debian 12.2.0-14) 12.2.0 p 5 ; p L > 0 P g z ) ; p a | a U q ; ; H ; ; K C
D ! D r p D D R Us H U : M Uv T 0 Qs o; O; <; &B ; # 6B BB NB ZB
fB E
E 5D
5 SD - + FD ? = `D O M = = g a = # UTT &B 1 6B BB 1 NB ZB
fB U 0 T 0 Q
0 RT = = = = g Y =
D A d D A (D D A # E * (
> Q fC 8> ; 7 +> T P Q E> m i O> Y> c>
p> & $ ~> @ > 6 4 > G C Uv Ts Uv T} + Uv T} d Uv T} Uv Ts + Uv Ts Uv Ts ] Uv Ts w Uv Ts Uv Ts Uv Ts Uv Ts Uv Ts Uv Ts Uv T} . - Uv Ts C G Uv Ts T a Uv Ts e { Uv Ts v Uv Ts Uv Ts Ts : @ m
+@ n \ 7@ C@ D 2 O@ [@ g@ s@ @ @ 8 0 @ b \
D M D (D D # E @ @ @ 3 + D : ]
$ D ] Y D D D G ^
l D D D D c `
D
D c D 8 R D a
$ D H D D D ` ^ # R
D f D o m (D | D E c
UTQ0 [ 7
T 0
UUTT 7
T 0 : @ 7
@ @ @ V F @ @ A
A *
"
A X
T
%A w
q
D p
D
(D
D p # E D * - A D * D ; 5 D j d D ? . D ? D D D T 0 D D D R U} D p 1 k D & D V D J H . R Us
D 4 D Y W (D j f D E ~
Us T} Q0 7
T 0 R 7
T 0 : +C > ;C GC SC _C
kC E ?
E
5D ?
SD
FD .
,
`D >
<
s? Du ? V
P
? t
r
UTT +C :;C GC
SC
_C
kC U 30 T 0 Q
0 RT ? ?
? ? V P ? { w ?
D D (D D # E % # D
D 4 2 D E A D e a C X C C C D D D D D * R Uv D ' F D D 1 D R U} o Us TvQv R0 Us T0 7
T 0 rC [ C C \ R C C C C
C o E !
6 E 1 - 5D !
~ SD N J FD q m `D ? & ' ? @ @ ) [ Uv ?
Uv T0 o 5 U| T D0 Q
0 Rv ` U| TQQ2R2 : ; B B B 8 " B C C C
$C E h
E ! 5D h
7 SD > : FD a ] `D | > n %? ?
? 2? 3 Z? N? # B? < 8 Q f? W Q
D 5 D v t (D D E nD o D D o .D o D D C C C ! C ; 7 D S O D T a D k g D T T S D n R x T0 R 7
T 0 ` Uv TQQ2R2 8 Uv T D0 Q
0 : 1A BA OA \A iA 0 *
vA E 0 0
x E N L 5D 0 0
SD ] [ FD o m `D }
; D
; ; P # UTT P 1A BA OA \A iA
vA U [0 T 0 Q
0 RT h< P y< < 7 # < < < D 8 < { < < < 7 + < | t
D g . D . (D D g . # E < > < = . (
D c
D f b c D D
D x
U D x D D I ?
D
D
D D R U
D
D D D { R U~
D D (D D E
U T~ Q0 >
U T~ Q0 = 0 ;= % .= m c != H= U= 2 $ b= u m n= {= = - %
D 0 0 D V T (D o e D 0
0 E
nD \ = D D \ .D D D - '
D s D Y S D y D
D ( D
D B D
R U~
D W ^ D - ' D I D O M R Us
D D ^ \ (D q m D E
U~ Ts Q0 V
U~ Ts Q0 7
2 T 0 7
T 0 mB l # }B B B H! x# > v" l" > " " > " " > *# &# > I# C# > o# g# D D # # D # # D # # D J! D # # D 5! D # # R Us nD . ! D # # D . .D # # D $ $ D $ $ nD
" D 5$ 3$ D D 5$ 3$ D D$ B$ D V$ R$ C c \" C n$ l$ C }$ {$ C $ $ D $ $ !nD " D $ $ D D $ $ D $ $ D % % D ` ( # D ;% 9% D ` # D J% H% R Us
># Us Tv Q0 p [# U| T0 7
T 0 ` # U h0 TQQ2R2 U h0 T D0 Q
0 R| A % A ]% W% A % % B % % B % %
B E
h$ E & & 5D
$ SD && $& FD 8& 6& `D H& F& <<
% Z< `& Z& M< ~& |& UTT P A A A & & B & & B
B U t0 T 0 Q
0 RT A 5) A & & A ' & A F' 6' A A ' ' A ' '
A 4 E +
"& E ' ' 5D @
j& SD ' ' FD ( ( @ `D <( 8( < U ( .< e( _( !< ( ( < ( ( 2? r Z? ( ( N? ;) 5) B? a) [) f? ) )
D i' D ) ) (D ) ) D E ) ) nD ' D ) ) D .D ) ) D * ) D !* * C & +( C ;* 7* C S* O* C m* i* D * * D > > ( D * * D > > ( D * * V R Us 0 ( T0 7
T 0 * ) Uv T D0 Q
0 K ` Uv TQQ2R2 9 0 9 @1 9 1 9 1 l9 2 J9 3 9 `4 )9 @5 f: p : p &: 5 s: q I: : + #
N n - * $int & Y = R 4 6 /
& )1 *e %* 8 R , l ( z / w ~ ~ hb r c dM (
eM 0
f 8C g
@
h H ih P j e X k `
! J T K 1 L
6 W
7M 8^ 91
;M Y Y (
b Z
M get
set
doc
M
n (
) Z
*M
+ 1
,
- 1 doc
.M & 's w M
(y 0 8 @J
H5
P
1 X=
`f
h
p = xO
; 1 % 9
* 2 M Y h (
e ] m w
i 9 e ' U
F ( 0o
8_
@T
e H
' Pc ' X ' ` h ' p x e c
^ P
' buf
obj
' len
1 g
1 $M
(
1 0
1 8
1 @
H ' 0
!
#N S 1 l ' l 1 6 d
$} ' l ( l
} * w X 0 ' ' 1" ' ' ; ' ' 2G L ' e ' ' ' 3q v 1 ' e 4 ' 5 ' ' u 7 1 ' ' 9 1 ' ' ' N ;* / 1 C ' ' _ <O T 1 h ' u =t y 1 ' C O @ A ' B ' '
C" D 1 % ' ' e E S F A GI N ] ' 1
Hi n ' ' ' 1 I v J KG
L , M o N ' ' ' I O '
( R
#
' A
' A
' , )v J *1 hu
+ % lS
, ; ` @ A B C D X E; (L F 0 G 8 H @ I
e Hm J Pv
K X L ` M h N p O x P 9
Q R ? T
U O V W X; B Y a Z [ \ h ] 9 _ ` a 8 b d f . g $ h
P j
k
l m n j o
p ( q 0
r 8: t @ u H vl x3
y
z \ { |
] ~K
P
u
i
' ' i
'
y 7 ?
n
b
B q
` 3
b c' i' (R w
i
E
! " " (, w - 4 9 >
' -' ?j ' ' \
1 ' ' R Y + * Y + Y L * a < -L Y n * ] Jn Y * t a + Y * > Y * L J
*
Y ( *
"( Y K * o :
AK m *
G ]
"1 ' ' %1 ' ' .@ 1 ' ' 1
' M 4 ' M M M ' ) (1 C M / bV ' I 31 v ' M ' S ' M (' 0 '
1 m '
Y '
'
$' 6'
' C (' :'
('
' o $' 6'
1 pos +
"
w ,
'
' arr i
cmp 1 !a ' b '
1 - pos B
m '
(
' arr #i
cmp 1
' ' 1'
\' \ ' \& i ^ n ^ 1
;' ;"' ;, i = j = m =
I =
=
n i 1 ' #' 5'
E' ' cmp 1 top ' ' 9 #' 5'
E' | ' z '
0' : ' & ' ' 1' ' ' & ' ' n ' " ' 2'
B' F1 F pos F' H H H" w H, I' I' arr I i
cmp J 1 !a [' b \' 1 8 ) pos > m ' (
' arr #i
cmp 1
' ' arg 1'
'
' 1 ' #' #
I & I : ; 9 I ! I/ : ;9 I 4 :!; 9 I : ; 9
: ; 9 I8 : ; 9!
:!; 9! .?: ; 9 'I< ' ! I/
:! ; 9 I ( 4 :!; 9!I?< .?: ; 9!'< ! ".:! ;9!%' #% $$ > % &
I8 ' : ; 9 ( : ; 9 )4 : ;9 I?< *> I: ;9 +(
, : ; 9 - 'I ..?: ;9 'I< /.?: ;9 '< 0. ?: ;9 'I 1
: ;9 2.: ; 9 ' 3.: ; 9 'I j I
' 1 B ! T e p bKs/ Y= X. { 0 yJ@ t.~
%tY} "fXJJX{Z X p ~"J~y_
K J = K%.{<i(6 {%tf[(R { { %$| J J z%$| <M J z Lm ~ k L
K=I = = = =j
t.X {%t
{Z XX z xJ@ tX
%tYQf
JAi
< xJ M J u J wt
tJ < < X
i
< yJ
XK W~Y3J|.=%~<1(6yy< tJ
s < < XFJ |x 6 . .<Y4%$| <M J Y{< .XX{" J
]
Y%t1(R| ffXh LV=< <O k<Y< T%$| JM J g 0 | S zJ@ tX P "~JY| ;t ; ZX K L :
Y
K%fi(D
~%fi(D
~.
%$| <M J
~%$| <~. xJ = = =fv}"
K YX =J%~~fi(D |%X1(6 ~. %$| <M J }%$| <XX {
< yX
fK jX(1. | n< NJX|L.f(1<|< X}<<<(1<{< zX~Jft >X | yJ@ tX }
q< zJS
-XK}~YkJ|.=%~<1(6yy< tJ+ V%$| <M J Y|J %$| <M JXf {<Y.z<YW
< xJ
< yJ 5 %$| J J ~}
%tYJ J Yt} } A
=I K = K =k
|%X f ~. %$| < J Yt
~
L(X
=
|f
OZ> tX}Y. tX~IK; = = =f
t
~%f f
~.
%$| <X(JX ./Modules ./Include ./Modules/clinic ./Include/cpython _heapqmodule.c.h listobject.h stdint-intn.h pybuffer.h pyerrors.h moduleobject.h ./Modules/_heapqmodule.c stdint-uintn.h /usr/include/x86_64-linux-gnu/sys /usr/include/x86_64-linux-gnu/bits stddef.h methodobject.h modsupport.h descrobject.h pyport.h . unicodeobject.h pytypedefs.h /usr/lib/gcc/x86_64-linux-gnu/12/include types.h * U 4V45U55V "V PSS "S "S S U;U TUT+T+2U26R6;T 70 TU T T @E$ t
t# TU T U T R T 0 wUwVUUVUV wTw\TT\T\ 0 p SsS]SS _QQQu U wUwVUUVUV U *T*\ *U*V kSk] S)])2s 1&2J]k]S} 1&S} 2&S q 1&*u1& Q b ^ P 0R :U:VUUVUU UU :T:BSB^S^SQ^T TT (T(\TT\TT TT ]]] ] " SS __ T-U U *T JQQQQ c PP U :U:VUUVUU UU U 6 s 3$q "s 3$q " : (R(FR :
s 3$q " s 3$q " :
u G p u : u #
PP G RR G r r G r # Pr #P RR R V #VV V p 7U7_U_U_ _ 0U0:U p 7T7 -T-: p 7Q7V\VV V 4Q4:Q SSS S ]T]] ] PP \\\ \ %X< X PP p U p 7U7_U_U_ _ 0U0:U p U Sa S s pa s
s #
PP ]]
} } } #P} #P ]] ] SS S S _ 0_e{_ _ U>U TU T .T.5U59R9>T T U T T @E$ t
t# T U T U T R T 0 ;U;dSdrUrUUS 'S 5T5d\drTrTT\ '\ B]n] ']
V6RV :V:LvdzVV 'V U ;U;dSdrUrUUS 'S U
]
} p } #
P ] 0 S
S6RS V V '] ] U OUOVUVsUsUUW U T KSKOTOSW S Q OQOVQVsQsQTQW Q C0O0W 0 -V s VZ V @E$Z @E$ vZ v v#Z v# &U s &V URURiUiUp U T 3S3RTRrSrvTvSTSTSp S Q RQRfQfmTmvQv}Q}Qp Q $U{U QrQ Us U @E$s @E$ us u u#s u# QrQ UrU UrU
r
QrQ UrU SSU
U UrU
U Q Q Pq p pP
Q Q
0 0
U U
U U T SU T S 0 U U "U 0 T U T T TU R "T 0 0 0 D T U T 0 T 0 @E$ 0 t
0 t# D T U T D U T R T 0 P :U: P :T:]]\]f 4]]\]\ g #T#VTV VTVTV g SSSf 4SgSS k\~\\f 4\\\ Pys 1&f 4 ^ XCHX 8Y YCHY z UQQQ #oQQ P P YiP g U g #U# g U O__f 4___ | 3$q "| 3$q "% | 3$q " _% _ p% #P% P | 3$q "| 3$q "% | 3$q " ~ ~ % ~ ~ #PP% ~ # P _ _Yi_ _> _ frPr - \\ [\[l_l\\_ - VV VVV - K gSllS SSS s ?^DD^ Q^QlUl^^U G 7QfkQ 3QQ X Z____ ___ > Ptyy PV PbmPmw - -
- \ ^> ^ \ ^> ^ \ ~ s p> ~ \ ~ #P> P s S:?S> S s s :?s > s s s # P:?P> s # P ^V ^bw^ ^V ^ SS S S KR UUX -U-AUAuU TBSBTSTSX S-T-uS QQX -Q-:Q:ETEuQ |0||V0X u0 R\^\\\X -\ HVTVVVX -V \ @E$ | |# HUTUUUX -U HVTVVVX -V H\T\\\X -\ [ S` %S PP\ 7SFYSwSS S s s # P SS S . V . v . v # P [ V [ v [ pP c V c 0 c \ c \` %\
V''VX V
v ''v X v v #
P''PX P ` %S ` S U U "U T U T T TU R "T 0 0 T U T T @E$ t
t# T U T U T R T 0 UzU @U@WUW{U 'T'?S?zTzzS {S 'Q'zQ Q"Q"@Q@TQT[T[{Q (USSU U QJJQ Q UR U @E$R @E$ uR u u#R u# QJJQ Q UJJU U $U.FUJJU U $
P .F
P JJ
P
P QJJQ Q UJJU U S 7S
U UJJU U
U Q Q Pq p pP
& Q Q
& 0 0
& U U
& U U > S > S u 5 " " & :
G c c p : p
W Z Z p s s ){ ){ ){ T '
0 " D P ^ if 4 % % Yi > f 0 \ > s > V bw V X u
O^X 0 U
X " z { R R -7O " -7O " -7O " & p 5 ; p > 0 P z q h
5 : p #
" 3
; B
I
Z
p L c
o
: }
>
W
p
'
0
P g "
" ;
K
^
X u v
"
z
{ 0 M @1 ? 1 ? - 1 Z C 2 ] 3 b s `4 @5 Z p 0 p 5
`
Hr (n 2
! > n ] XR ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) k 0n t Hr `p )
M ! o / D [ l
p z _heapqmodule heapq_exec __about__ heapq_exec.cold _heapq_heapify siftup heapify_internal siftdown siftup.cold siftdown.cold _heapq_heappop heappop_internal _heapq_heappush _heapq_heappush.cold _heapq_heapreplace _heapq_heapreplace.cold heappop_internal.cold _heapq__heapify_max siftup_max _heapq__heapify_max.cold siftup_max.cold _heapq_heappushpop _heapq_heappushpop.cold _heapq__heappop_max _heapq__heappop_max.cold _heapq__heapreplace_max _heapq__heapreplace_max.cold _heapq__heapreplace_max__doc__ _heapq__heapify_max__doc__ _heapq__heappop_max__doc__ _heapq_heapify__doc__ _heapq_heapreplace__doc__ _heapq_heappop__doc__ _heapq_heappushpop__doc__ _heapq_heappush__doc__ heapq_slots heapq_methods module_doc crtstuff.c deregister_tm_clones __do_global_dtors_aux completed.0 __do_global_dtors_aux_fini_array_entry frame_dummy __frame_dummy_init_array_entry __FRAME_END__ _DYNAMIC __TMC_END__ __dso_handle _init g_heapqmodule.c.8c8889db __GNU_EH_FRAME_HDR _fini _GLOBAL_OFFSET_TABLE_ PyExc_RuntimeError _Py_NoneStruct _PyArg_BadArgument __cxa_finalize PyErr_SetString PyUnicode_FromString _PyArg_CheckPositional PyModuleDef_Init PyInit__heapq _ITM_registerTMCloneTable PyModule_AddObject PyList_Append PyExc_IndexError _ITM_deregisterTMCloneTable _Py_Dealloc PyObject_RichCompareBool PyList_SetSlice __gmon_start__ .symtab .strtab .shstrtab .note.gnu.build-id .gnu.hash .dynsym .dynstr .rela.dyn .rela.plt .init .plt.got .text .fini .rodata .eh_frame_hdr .eh_frame .init_array .fini_array .dynamic .got.plt .data .bss .comment .debug_aranges .debug_info .debug_abbrev .debug_line .debug_str .debug_line_str .debug_loclists .debug_rnglists 8 8 $ . o ` ` $ 8 @ P P L H R B H H \ W b k 9 q ! ! w 0 0 M M N N \ n ^ (n (^ 0n 0^ f o _ 8 o _ h `p `` Hr Hb 0 Hb gb c (E n $
0 0 % L * 5 y
~ & & E