ELF>@p@8 @"!8 8 %%000\"\" ^ n n(00^0n0n888$$PtdMMMQtdRtd ^ n nGNU2H|_fQY: lF t%c,  < U p __gmon_start___ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalizePyInit__heapqPyModuleDef_InitPyUnicode_FromStringPyModule_AddObject_Py_Dealloc_PyArg_BadArgument_Py_NoneStructPyObject_RichCompareBoolPyExc_RuntimeErrorPyErr_SetStringPyExc_IndexErrorPyList_Append_PyArg_CheckPositionalPyList_SetSlice n!(n `p`ppp;0pp@5ph0pp`4q30qq3 qO0(q8q 2@q0HqXq1`qt0hqxq1q[0q0q@1q0qq0r0r5 rp(rpoooo o o opppp p(p 0p 8p@pHpHH_HtH5_%_@%_h%_h%_h%_h%_h%_h%_h%_hp%_h`%_h P%^fHx HHtHH^H5H8(>HLD$D$rD$LD$H^H5H8A H+HE H;HG 6 IEs HIEe LX PHHOH5MH=b1ZHHuH߉D$D$HL$Ht$H;q HD$HPIJI}HI]H8L9M 1 1HLZI/ 7 HIuLD$%D$x-HIHD$HPH;Xt`H]H5H8J LD$D$ H\H5EH8]LD$D$ J<JH4:LLLLL9d$~6Me A 1LLrI E H$ HH H HֹH=/ LHUH5H=h PHH2H50H=E1ZH[H5#H8;L H-pHHHH5' H-KHֹHtH;HG fDH=i]@UHH=&SQH5gHHH11Z[]ff.HFHt H5 'PHH&H5$H=&91ZDAWAVAUATIUHSHHWHHHD$H HD$HHWHHtpHtUHt:HtH8HHAԅ:HHHAԅ%HHHAԅHHHAԅHHHAԅHHHAԅHHHAԅLkHLAԅHHHAԅI]HHAԅu{I]HHAԅujI]HHAԅuYI]HHAԅuHI]HHAԅu7I]IbHYH[]A\A]A^A_HAԅu H1H1HHuHHHXLpH9]LzHHAԅut>IHILAԅuAt%IILHAԅuAt IfDHI9uLl$IM9>LHAԅVAt[LHHHAԅ9t?LHHHAԅt"LHHHAԅtHI|f.AWAVAUATUSHLoL9MHWHIIIHL9K6HXHH H9L9H ‹t1HHL$H<$MH<$HL$Hx HHHx HHHUHHL;mH JH1H8H9H0I9~IGDJH0H1H8I9HHLH[]A\A]A^A_mD;8Hω$}$iD$H $hD$H $;HdVH5MH8H[]A\A]A^A_AWAVAUATUSH(LGHt$L9HGIHHH9LeIN,N4AELD$AE1LHIULD$xHIUHx HHx{M;Gu_t)IGIHI6HIH2L9d$} LZ1H([]A\A]A^A_AE_LD$[H'UH5H8LLD$D$LD$D$I@HFHt H5 PHH#H5!H=>61ZfATUSHHufH.HEt2HsHguBHE1HHP1u,HnT[]A\L%HHH5L1L%HֹLtUSHHHuCH>HGtWHHStpHOHtH1ulHH[]H-VHֹHRua1H-2HHH1H5HSH51H8HxHHuH12uAUATUSHHoHt_HGHILlAEtAE1HuHHHt=HC1HH(L(Aԅu,HH[]A\A]HRH5 H88E1LHExHHEuHv@HFHlH5AWAVAUATUSH(H_H|$H9]HHWHIHHD$H9}vKD-L`HJ<L:M0H9}fLHGHHSHOHtH1 u HH[]HxHHuHJ1fDH=QHQH9tH^OHt H=QH5QH)HH?HHHtH OHtfD=mQu+UH=NHt H=nOdEQ]wHH__about__listargumentheapifyindex out of rangeheappopheappushargument 1heapreplace_heapify_maxheappushpop_heappop_max_heapreplace_max_heapqlist 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! :-) ;0d G8`yhH0`Hp\`Tp @zRx $FJ w?;*3$"D\ $p 5AKA eAAD"  ;Z`H4BBB B(D0D8DP 8A0A(B BBBA `BBB B(A0A8DP 8J0A(B BBBG W8D0A(B BBBxPHLBBB B(A0A8D` 8A0A(B BBBH 5:`>]`,BAA G ABA L (h4AAG C DAA  8BBA A(D0^ (D ABBA '0( "A`H0gBBB B(A0A8D` 8A0A(B BBBA |R`0 BAA G0u  DABA u0 "A`(zAAG O DAA D{ !  ! n(no`P L oH  o 0n6FVfv`p;0@5h0`4303O0 201t01[00@10005ppGCC: (Debian 12.2.0-14) 12.2.0p 5;pL>0 Pg z);p a|aU q;; H; ;KC D! Drp D DRUs H U :MUvT 0Qso;O;<;&B;#6BBBNBZB fBE E5D 5SD-+FD?=`DOM= =ga=#UTT &B16BBB1NBZB fBU 0T 0Q  0RT====gY= DAd DA(DDA# E*( >QfC8>;7+>TPQE>miO>Y>c> p>&$ ~>@>64>GCUvTsUvT}+UvT}dUvT}UvTs+UvTsUvTs]UvTswUvTsUvTsUvTsUvTsUvTsUvTsUvT}.-UvTsCGUvTsTaUvTse{UvTsvUvTsUvTsTs:@m +@n\7@C@D2O@[@g@s@@@80@b\ DMD(DD # E@ @ @3+D:] $D]YDDDG^ lDDDDc` D Dc D8RDa $ DHD D  D`^#R Df Dom(D|DE c UTQ0[7 T 0 UUTT7 T  0:@7 @@ @V F @ @ A   A* " AX T %Aw q  Dp D (D Dp # E D*- A D  *D; 5 Dj d D?. D ?D D DT0 D D D  RU}Dp1 k D& D V DJ H .RUs D4 DY W (Dj f DE ~  UsT}Q0 7  T 0R7 T  0:+C>;C GC SC_C kCE? E 5D? SD  FD. , `D> < s? Du?V P ?t r UTT +C:;CGC SC _C kCU 30T 0Q  0RT?? ??VP?{w? D D(DD# E%#D D42DEADeaCXCCCDD D D D*RUvD' FD D 1DRU} oUsTvQvR0UsT07 T  0rC[CC\RCCCC CoE! 6E1-5D! ~SDNJFDqm`D?&'?@@ )[Uv? UvT0 o5U|T D0Q  0Rv`U|TQQ2R2:;BBB8"BC CC $CEh E!5Dh 7SD>:FDa]`D|>n%?? ?2?3 Z?N?#B?<8Qf?WQ D 5Dvt(DD EnDoDDo.DoDDCC C!C;7DSODT aDkg DTT SDnR xT0R7 T  0 `UvTQQ2R28UvT D0Q  0:1ABAOA\A iA0* vA E00 xENL 5D00 SD][FDom`D} ;D ;;P#UTT P1ABAOA\AiA vAU [0T 0Q  0RTh<Py<<7#<<<D8<{<< <7+<|t Dg.D.(DDg.# E<><=.( Dc DfbcDD Dx UDxDDI? D D D DRU D D D D{RU~ DD(DDE  UT~Q0> UT~Q0=0 ;=%.=mc!=H=U=2$b=umn={==-% D00 DVT(DoeD0 0E nD\=DD\.DDD-' Ds DYSDyD D( D DB D RU~ DW ^D- ' D IDO M RUs DD^ \ (Dq m DE  U~TsQ0 V U~TsQ0 7 2T 07 T  0mBl#}B B BH!x#>v"l">"">"">*#&#>I#C#>o#g#D  D##D##D##DJ!D##D 5!D##RUsnD.  !D## D. .D##D$$D$$nD "D5$3$DD5$3$DD$B$DV$R$Cc\"Cn$l$C}${$C$$D$$!nD"D$$DD$$D$$D%%D`( #D;%9%D` #DJ%H%RUs  >#UsTvQ0 p[#U|T07 T  0 `#U h0TQQ2R2U h0T D0Q  0R|A%A]%W%A%%B%%B%% BE h$E&&5D $SD&&$&FD8&6&`DH&F&<< %Z<`&Z&M<~&|&UTT PAAA&&B&&B BU t0T 0Q  0RTA5)A&&A '&AF'6'AA''A'' A4 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*CS*O*Cm*i*D**D> >  (D** D> >  (D**V RUs 0 (T07 T  0 *)UvT D0Q  0K`UvTQQ2R2 9 0 9 @1 9 1 9 1 l9  2 J9 3 9 `4 )9 @5 f: p : p &: 5 s: q I: :+# Nn- *$int& Y= R4 6 / &)1 *e%* 8R, l(z / w~ ~hbrcdM( eM0 f8Cg @ hH ihPj eXk ` !JTK 1L   6W 7M 8^ 91 ;MYY( bZ Mget set  doc M   n ( )Z *M + 1 , - 1doc .M  & 's w  M   (y 0 8 @J H5  P 1 X=  `f  h  p = xO ; 1    % 9   *2 MY h( e ]    m  w  i 9  e '  U   F ( 0o 8_ @T eH 'Pc'X '` h 'px ec ^P 'buf  obj 'len    1 g  1$M  ( 10 18 1@ H'0 ! #NS 1l'l16d $}'l( l }* w  X 0 ''1"' ';'' 2GL 'e'''3qv 1'e4 '5 ''u 7 1''9 1'''N;*/ 1C''_<OT 1h'u =ty 1'CO @A'B '' C"D  1% ''eES FAGI N ] '1 Hi n ' ''1Iv JKG L,MoN  ' ''IO  ' (R # 'A 'A ',)v J*1 hu +%lS ,  ; `  @ A B C D X E;(L F0 G8 H@ I eHm JPv KX L` Mh Np Ox P9 Q  R? T UO V W X;B Ya Z [ \h ]9 _ ` a8b df.g$ h P j  k  l m nj o  p( q 0 r8: t@ uH vl  x3  y  z\ { | ] ~K P u i ''i ' y   7 ?  n  b B q   `  3  b c'i'(Rw i E  !" "(,w-49> ' -'?j ''\   1''RY+*Y  +YL*a<-LYn*]JnY*ta+Y*>Y*LJ * Y(* "(YK*o: AKm* G  ] "1'' %1''.@ 1''1  'M 4 'MMM')(1CM/ bV'I31v'M'S'M('0' 1m' Y' '  $' 6' 'C (' :' (' 'o $' 6' 1 pos+     " w, ' 'arri cmp 1!a'b' 1   -posB m ' ( 'arr#i  cmp 1 ' ' 1' \' \' \&i^n^ 1 ;' ;"' ;,i=j=m= I = = ni 1 '#'5' E' 'cmp 1top' '9#'5' E' |'z ' 0': ' &''1' ''&' 'n '" '2' B' F1FposF' H H H"wH,I'I'arrIi cmpJ 1!a['b\' 18 )pos>m '( 'arr#i  cmp 1 ' 'arg1' ' '1 '#'#  I&I: ; 9 I!I/ : ;9 I4:!; 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 'I1 : ;9 2.: ; 9 '3.: ; 9 'IjI '1B!Te 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 XKW~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 KL : Y K%fi(D ~%fi(D ~. %$| <M J ~%$| <~. xJ = = =fv}" K YX =J%~~fi(D |%X1(6 ~. %$| <M J }%$| <XX {  < yX fKjX(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.hlistobject.hstdint-intn.hpybuffer.hpyerrors.hmoduleobject.h./Modules/_heapqmodule.cstdint-uintn.h/usr/include/x86_64-linux-gnu/sys/usr/include/x86_64-linux-gnu/bitsstddef.hmethodobject.hmodsupport.hdescrobject.hpyport.h.unicodeobject.hpytypedefs.h/usr/lib/gcc/x86_64-linux-gnu/12/includetypes.h* U 4V45U55V"VPSS"S"SSU;UTUT+T+2U26R6;T70TU TT @E$ t t#TU T UTRT0wUwVUUVUVwTw\TT\T\0 p SsS]SS_QQQuUwUwVUUVUVU*T*\*U*VkSk]S)])2s1&2J]k]S}1&S}2&Sq1&*u1& Q b^P0R:U:VUUVUUUU:T:BSB^S^SQ^TTT(T(\TT\TTTT]]]]"SS __T-U U*TJQQQQcPPU:U:VUUVUUUU U6s3$q"s3$q":(R(FR: s3$q"s3$q": uGpu:u# PPG RRGrrGr# Pr#PRRR V#VV Vp7U7_U_U__0U0:Up7T7-T-:p7Q7V\VVV4Q4:QSSSS]T]]]PP\\\\%X<XPPpUp7U7_U_U__0U0:U pUSaSspas s# PP]] }}}#P}#P]]]SSSS_0_e{__U>UTUT.T.5U59R9>TT U TT @E$ t t#T U T UTRT0;U;dSdrUrUUS'S5T5d\drTrTT\'\B]n]'] V6RV:V:LvdzVV'VU;U;dSdrUrUUS'SU ] }p}# P]0S S6RSVV']]UOUOVUVsUsUUWUTKSKOTOSWSQOQOVQVsQsQTQWQC0O0W0-V sVZV@E$Z@E$vZvv#Zv#&U s&VURURiUiUpUT3S3RTRrSrvTvSTSTSpSQRQRfQfmTmvQv}Q}QpQ$U{UQrQUsU@E$s@E$usuu#su#QrQUrU UrU r QrQUrUSSU UUrU UQQPqppP QQ 00 UU U UTSUTS0U U"U0TU T TTUR"T0 00DT U T0T 0@E$ 0t 0t#DT U TD UTRT0P:U:P:T:]]\]f4]]\]\g#T#VTVVTVTV gSSSf4SgSSk\~\\f4\\\Pys1&f4^XCHX8YYCHYzUQQQ#oQQP P YiP gUg#U# gUO__f4___ |3$q"|3$q"%|3$q"_%_p%#P%P|3$q"|3$q"% |3$q" ~~% ~~#PP%~# P__Yi__>_frPr-\\[\[l_l\\_-VVVVV-KgSllSSSSs?^DD^Q^QlUl^^UG7QfkQ3QQXZ_______>PtyyPVPbmPmw- - -\^>^\^>^\~sp>~\~#P>Ps S:?S> Sss:?s> sss# P:?P>s# P^V^bw^^V^SSSSKRUUX-U-AUAuUTBSBTSTSXS-T-uSQQX-Q-:Q:ETEuQ|0||V0Xu0R\^\\\X-\HVTVVVX-V\@E$||#HUTUUUX-UHVTVVVX-VH\T\\\X-\[S`%SPP\7SFYSwSS S ss# PSSS. V. v.v# P[V[v[pPcVc0c\c\`%\ V''VXV v''vXvv# P''PXP`%S`SU U"UTU T TTUR"T 00T U TT @E$ t t#T U T UTRT0UzU@U@WUW{U'T'?S?zTzzS{S'Q'zQQ"Q"@Q@TQT[T[{Q (USSUU QJJQQURU@E$R@E$uRuu#Ru# QJJQQ UJJUU $U.FUJJUU $ P.F PJJ P P QJJQQ UJJUU S7S  U UJJUU  U Q Q Pqp pP & QQ & 00 & UU & U U> S> Su5"" &: G  cc p:p WZZpss ){ ){ ){  T' 0 "D P^ if4%% Yi>f0\>s > VbwVXu O^X0U X " z{RR  -7O"  -7O"  -7O"   & p 5;p>0 P zqh 5 :p# "3 ;B I Z pLc o :} >   W  p ' 0  Pg" "; K ^ Xuv   " z { 0M @1? 1?- 1ZC 2] 3bs `4 @5Zp0p  5 `   Hr (n2 !> n]XR))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))k0ntHr`p) M !o /D[l p z   _heapqmoduleheapq_exec__about__heapq_exec.cold_heapq_heapifysiftupheapify_internalsiftdownsiftup.coldsiftdown.cold_heapq_heappopheappop_internal_heapq_heappush_heapq_heappush.cold_heapq_heapreplace_heapq_heapreplace.coldheappop_internal.cold_heapq__heapify_maxsiftup_max_heapq__heapify_max.coldsiftup_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_slotsheapq_methodsmodule_doccrtstuff.cderegister_tm_clones__do_global_dtors_auxcompleted.0__do_global_dtors_aux_fini_array_entryframe_dummy__frame_dummy_init_array_entry__FRAME_END___DYNAMIC__TMC_END____dso_handle_initg_heapqmodule.c.8c8889db__GNU_EH_FRAME_HDR_fini_GLOBAL_OFFSET_TABLE_PyExc_RuntimeError_Py_NoneStruct_PyArg_BadArgument__cxa_finalizePyErr_SetStringPyUnicode_FromString_PyArg_CheckPositionalPyModuleDef_InitPyInit__heapq_ITM_registerTMCloneTablePyModule_AddObjectPyList_AppendPyExc_IndexError_ITM_deregisterTMCloneTable_Py_DeallocPyObject_RichCompareBoolPyList_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_rnglists88$.o``$8 @PPLHRBH H \W  bk9q!! w00 MMNN\ n ^(n(^0n0^fo_8o_h`p`` HrHb0Hbgb c(En$ 00%L*5y ~ &&E