ELF>@@8@H H ++@@@""m}}m}}Ptd]]]QtdRtdm}}@@    HlR Ao8 3 #  ;a @; __gmon_start___init_fini_ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalizePyInit__heapqPyModuleDef_InitPyUnicode_FromStringPyModule_AddObject_Py_Dealloc_PyArg_BadArgumentPyObject_RichCompareBool_Py_NoneStructPyExc_RuntimeErrorPyErr_SetStringPyExc_IndexErrorPyList_SetSlicePyList_Append_PyArg_CheckPositional$ORIGIN/../..XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX}8;};(P;@;@H-X@E`h@h@6x`D3@)CO@0 B@Ȁ؀At@7A[@4@A @(78@@E@ x     H*H5Ro%To@%jofHEHPHUH?+D$ HoD$ )+LL$ LD$poD$LL$ 1HKoH5/H;o1H H-oH5v/H8n1* $Lo$!D$D$H=kD$D$H'kD$PLL$H$ k$LL$I|$L4J47HMD$H|$HjH|$D$L+IMMuHkMIELHEH(LD$M~^MILL$D$L\jD$rD$HFjD$L &jH5o*I9iL jH5S*I;i[HH *H5*H=c*i1ZÉD$HiD$ID$LiD$)HiH5)H8SiL $iH5E*I94iD$H|$LbiH|$D$gD$H|$LBiH|$D$>LiH5f)I:hYL5hH5)I>h:HMt,E1HֹH=\)h:HE1hvLH(E1H5)H= ):hPHH(E1H5(H=)hI $tE1LE1MhD$HLD$6hLD$D$s"HֹH=(gt2L+IURLH(H5I(H=(gHD$!D$LLD$gLD$D$!D$gI $D$uD$LgD$"M;uL-gH5%(I}g!L5?gH5'I>f!D$H-gI $D$uD$LgD$!M]HM9uH=fH5'H?f]!$ 3 D$fD$w D$HfD$j MuHkMt4M]MHEI+LD$MBH hfH5&H9 f H-LfH5&H}fHD$MILL$~sHFHt H5 $HH$&PH5!&H=#&e1ZÐAWAVAUIATUSHHHGHt$HHH\$0H= GH\$0HH H9L$H5g H9t$M}I9@LHHT$H9KMMIO6IhIIM;e t)M]LI HELLEHI9zHfHbHHH[]A\A]A^A_DMuI9LHHt$H9~IUIO ?IiIL$M9~MJL9|$~MpfDImL9)HL9MGL1IN$JI1HD$LI$LL$S\I $L $AIEI;mE=IMLT$JII:L:M:H:L9I1LINLL$ N4ILIL$[H4$LT$ HI/I;m!I}Ld$J7ILM<$L8M$L9MJM1IN$J ILHL$I$LL $9[I $L$tI<I;mt,I}HT$J4HLL>L:LL9zuHL$LfHHHHD$HLЅt1H1ZHH-ZH5;H})Z1n$aZHM$o$HHZ$[$7ZI$:Hl$HLՅi1$ZI $$$LY$D$IHI8MDMM1HILL$O4HN,ILSIHL$mH AI;l$MT$O*IIHIHMuHl$HH]H5[H=xRHD$H=RH5H?RHt$LLL$ILHRHD$CL-RH5I}jRHD$D$HRD$yL%RH5@I<$.RwD$LdRHMD$D$HIRD$D$L3RID$`D$LRD$HL$xfDAWAVAUATUSHHH L&ID$HvLQM|$IOI9AI|$L4J47HyHYH.1HL,LHEHL$IELgQIMHMM9|$ML$L$K1OIH*I+HHH1HHM,HEL4IELPIMSHM M9|$LMT$H4$K 2LH9H.H)H>Ht|IH[1HHL$M4HEL,ILkPIL $HM.M9|$tMT$MKM]H(ImLHuHOHH[]A\A]A^A_LHH5PH=@O1HֹH="Oum1LL$L$OLL$$ED$LOD$0D$LxOD$L%OH5!I<$O1Df.AWAVAUATUSHH(HL.IElMuHVM6IEH0HHHt$MLHH|$ E1O?IZILM9}MM#J,1I$HLHENI $^HMoHIEM9uHNHI?H;\$} Is@MuL9MEHkHM$ML 1LL$I$LLILT$NL\$I I $xtM;uSuHD$H([]A\A]A^A_IEHT$LH9LMfL9 LI $KM]HM9u\H4O 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! :-) ;  tN#`08и@ڹCPX0`08@LzRx $FJ w?;*3$"D\ $p?BKD0jAB.0?gWLD BBB E(A0A8D 8A0A(B BBBF RH8BBB B(A0A8D`H 8A0A(B BBBA i`H(BBB B(D0A8D` 8A0A(B BBBA `HBBB B(A0A8GP 8A0A(B BBBA \PH|0 BBB B(A0A8G`m 8A0A(B BBBH H`"A\"aHXBBB B(A0A8D`: 8A0A(B BBBA d`8BBA D(A0Z (D ABBA 6i0,@BAD e ABA  SE H(BBB B(A0A8G`j 8A0A(B BBBA t0!`8;;X  ;}}o  ` oo }P;;@-@Eh@@6`D3@)CO@0 B@At@7A[@4@A@7@@E@ GCC: (GNU) 4.4.7 20120313 (Red Hat 4.4.7-23)GCC: (conda-forge gcc 10.4.0-19) 10.4.00.@; P;?? ^'3i)-@0 4""4X@6i7SE7!<1 u +L@; `M;@<U `M M $M|U00 U UL<Uv g;Y<U J };e<U|T @QvS?S SPBSS S RU pUeccU}U N O O/-UTT ' S`SS[U`SS S q<U @T @Q  @RT(O 9OFOSOy^OztOxf OOuOZO5  OY U O O O|p@Ot r pP QFQ QQaWQQ[OQQb^QQR<6R0gRRU Y UU Z U.,U+ \ U 'L<UsU4 ] (UUQ ('L<U~ + }<KUsT~Q0 &<T @+R @p SRGR;R[W@_RkRbJwRf^RRRvdU ) #U=7U * KUU p, U%L< &L<U~"&L<U - Uvh L<U~ L<Uv L<Uv }<6U~TQ0 Z!}<[UvTQ0 !}<~UvT~Q0 A&<T @ <T  @ <T  @Q"@Q Q Q@QQj`QQqgQQ< 8 Qv r R R RR! U" Y UU"PZ UN!L!U"\ U%L<U"] I Uu!q! %L<Uv "}<n UTvQ0 o%<T @+RH#p SR!!GR"";R6#2#_R|#l#kRC$%$wR|%t%R%%Rl'`'R('U#@) F U((U#* n U))U# , Ul)`) B'L< U|`'L< 'L<U|U#- ; U)) pL< U~ L<& U 1L<U #}<^ U~T|Q0 $}< UTQ0 $}< UT|Q0 '< T @ <T  @ <T  @UH% XI UUH%H% FU=%h U}Ts%vU}TsQd0 p zQ**Q]+K+0 Q',,Q,,Q- -Q--Q ..QZ.V.Q..R..R 6RR!//U Y d UU@ Z Ul/j/Up \ U%L<U ] U// %L<U| }<UT|Q0 &<T @ +R  p SR//GR00;RZ1V1 _R11kR22wR33RC414R 55R55UI@ ) Ug6a6UT * U66Ul , lU 77T&L<&L< &L<UUy` - U77 L<UvL< L<U l}<UTQ0 }<UvTQ0 v}<<UTQ0 &<[T @ ,<T  @U rUU FUM p ME858M88 M99M':!:N|:p:N;:"Nl;h;/N;;m>N>>`N4? ?N@@NAAN{AkAN/B%BNBBU AUCCU  jUCCU U2D$D L<U9L<L<U 'UDDL< (L<Uv NL<U }<LUTQ0 {}<qUTvQ0 }<UTQ0 U<T  @ w<T @ <T  @ivU}TsQQgEWEQ)FFQGFQGGQfH^HQHHQ\IZIQIIQIIR#JJRRpJnJRJJU(Y UJJU(@Z U*K(KU1(p\ >U+)L<U?(] zUQKMK )L<U| 1(}<UT|Q0 )<T @+R(p vSRKKGRLL;RLL_R MMkR^MVMwRMMRNMRNNRONU(0) wUMOKOU(`* UrOpOU(, UOO g)L<UU(- UOO L<U| (}<:U|TQ0 K)<YT @ J<T  @ j<T  @TbTP PTPPTRQTRwR T,RU) 9 *pUSScUSS }USSP)P>PTTP'UU Q)` (QUUQkVSV`4QpWhW@QWWLQXXU*U$Y"YQ5* Q[YGYQ=Z+ZQ[ZQ[[Q\\Q\\Q4]0]Qn]j]Q]]R^^RR[^Y^R^^Up*Y U^^Uz*Z U_^U\ (U |-L<U}U] ZU'_#_ -L<Uv *}<}U}TvQ0 ,<T @+R*@p SRw_]_GR``;R(aa@_RaakRbbwRccR.ddR edReeU+) UU{fufU+* }UffU++p, UggI-L<-L< -L<U~U9+- ?Ugg L<Us L<*Us ,L<U~ ++}<dU~TQ0 +}<UsTQ0 D,}<UsT~Q0 j-<T @ <T  @ <T  @ U,," OU_h]h -L<UU` Uhh >L<Uv *<U|TsQsR0 .-<T  @T,,,4TThhTi iT T, ,q<U 3@T @Q  @R|T#U=i3i UiiUjj%U1U*k"k=Ukk IU#0RU- pUkkcUll}UWlSlWQ.!#gQllQ"mmsQummm+R..@ "SRmmGRnn;RAo7o@_RookR?p+pwRq qRqqR5r+rRrrUa.) !U}swsUm.* 2!UssU.`, !Utt 80L<q!U~ R0L<!U} h0L<U}U.- "Utt L<!Uv L<!Uv L<Uv .}<-"UvT}Q0 .}<P"UvT}Q0 }/}<s"UvT~Q0 0<"T @ <T  @U/ "UU/ FU .<#U| b<U| 0q<\#U ;@T D@Q  @R| 0<U ;@TQQ2R2GT*WTttcTutuoTYvMv{TTvvTvwrw T3RU00b 4$pUwwcUww0}U,x(xmP0`h)PpxlxPxx}PBy4y P0@ PyyPzzPzz@P{u{U0$U=|9|Q0P )Q|s|Q{}m}PQ~~Q~~Q'QQf^QȀĀQR}wR&RʁȁRU-1Y %UDBU71Z &UomU0\ 2&U 3L<U|U`] d&U 3L<Uv A1}<&U|TvQ0 4<T @+R1p (SR̂GRڃ;Rzn_R kR΅wR݆R]ARR)U1) _'UU1`* 'U?9U1, 'U Y3L<'U3L<4L<U1@- M(U* L< (Us L<8(U| L<Us 1}<r(U|TQ0 }2}<(UsTQ0 2}<(UsTQ0 {3<(T @ <T  @ <T  @ U{3{3  ])Uԋҋ 3L<UP44%PPPP -4<T  @ Y4q<)U O@T D@Q  @R} 4<U O@TQQ2R2R+RR^NR RNH RRU4 *pUcUč}U2M4 +PMCMfd4UTT 4RRRRގR R q<U [@T @Q  @RTM` 7/MMڏMM0(NN"Nsq/NT6 RUX6X6 /pU97cUa_}UPr6"1#P;PA7/P"GP2*SP_Pa[U60UU0#0UӞϞ 7L<UvU6 0U U6 1U0.U6 31UUSUp# f1U|x (L<Uv 6}<1UvT|Q0 6 1U}T0 6<T  @ <1U h@TQQ2R2 Nq<U h@T D@Q  @R}TS#4dSpSn^|SS# S]7RU7# 2pUcU#}UM(7$N4M M Q(7`$ (Q Qyo$4Q@QfbLQUC7%y3UU70% 3U>< 7L<UsUyp% 3UgaL< P7<4UvTsQsR0 t7+04UvT0 7<T  @TSSS&dSpS|SS St tq<U t@T @Q  @RvR%};S/%SS_S'S3S?S KS|:RU7% 5pUܨcU %}U\X^M7&;M|MoMP7& POCP PdV&P U8'B6U֭ҭM8' r:M M'M߯ӯMogNװ˰NgY"N /Ntp     ( ,10  8 P @  H o >P >X >` >h  >p  x @  >  o}i ] k ol ms  t un v)/>>>>U[>o>>{>>>>S>9>>>> S->> 9?SX>>>"djS~>> S>a-S>~ae a} >i>/>oUQGMSf>o>19 )>>>>S) )8 {x 99>1>> =C>W ]S{ dP10buf2 aobj3>len4 5 7 S X 8 S$ 9 o( :00 ;08 <0@ = aH>w@NTSm>mS6z A>mC>>>D h mI nI oI pI :qI ro( s0 ct8 u@ v H AwP #xIX  yI` zIh {Ip U|Ix f } * ~ a N  I I I [I o I pI mI PI I O I W I FI I x  I I P F   L I y   a (   a0 X8 I@ OH     I % -q R    >> >  #       . B sa   F  .  # H $ u%C  &S (X   %(  K get set  doc   a  (  7      6     U *X O  ( ,  - # .   /  0 > >  1a 5 =  > S ~ ? ah Ke > L M( e N0 O8  P[ @ g QeH m RP  S X  T ` q>>a k S>>a V> \>|)Y |)a '|'), D'|H)8 nH  |u)>eV u|)L  uO ) |) #|)o B &)    E  !> >" Sw#m> >"4>$K $>$^6>"_>$K (>$^:>$(>">$K $>$^6>" S$^#pos+ *   " K, > >%arr %cmp S&%a>%b>7 "'SA$^$* -#posB 6 >  >%arr#  %cmp S"K>m$K >$^1>"|\>$^\>$]\&%i^%n^S";>0$^;">$];,%i=%j=%m= _ = D= "jX#n%i S'U>(K #>(^5>(E> >)cmp S%top>'>(K #>(^5>(E>' >((^ >(0>(]: >'k >Q(K >(^1>' >(^>(]&] > >)n'~>(K ~ >(^~2>(~B>'BSp(^B*posB'* D D D"KD,E>E>)arrE )cmpF S&)aW>)bX>' S(^(* )*pos>6 > >)arr#   )cmp S' >8(K >*arg 1>w > ^ >+F ' >(K #>( <( Mw >^ > >,F ' >(K >*arg 1>w >^ >,F ' >+(K >*arg ,>w >^ >,F ' ~>(K ~>( ~7( ~Hw >^ > >,F ' Y>(K Y>( Y7( YHw [>^ \> ]>,F j'- 4>6(K 4>*arg 4,>w 6>^ 7>,F @' >(K >( 4( Ew >^ > >,F #" S$r!$5) )"R D>#objD.>-  #op>.#op)>% U.1@BB1B.1U@B1B41B1RBUX YW  1 1 1 1RBX Y W  1RBUX Y W 1 U41 1U1RBUX Y W 11RBX YW BB1X Y W 1UX Y W 1RBX Y W 41 1X YW 1X YW 1UX YW 1RBUX YW 41 .?<n: ; 9 !.?<n: ;9 % : ; 9 I$ > $ >   I&I : ; 9  : ; 9 I8 7I  : ; 9  : ; 9 I8 : ;9 I8 : ; 9 'II'4: ;9 I?<> I: ;9 ( ( : ;9 I : ; 9 I8  : ; 9 <'I4: ; 9 I?<I!I/ 4: ; 9 I!I/ 4: ;9 I!.?: ;9 'I".: ;9 'I#: ;9 I$: ;9 I%4: ;9 I& '.: ; 9 'I(: ; 9 I)4: ; 9 I*: ; 9 I+ : ;9 , : ; 9 -.: ;9 '..: ;9 '7  /usr/local/src/conda/python-3.10.8/Modules/usr/local/src/conda/python-3.10.8/Include/usr/local/src/conda/python-3.10.8/Modules/clinic_heapqmodule.cobject.h_heapqmodule.c.hmoduleobject.hunicodeobject.hmodsupport.hpyerrors.hlistobject.h @;   P;YsY g= X.  0~ ~<   {J@ tX~  %ttg yKxbX& X< u}$ K   xJ KK IY < K }.< } }* = K |< | |9X< |  J | |        KYI< = = = = j NT = K J | |< |  J | |        KWK; = = = = j N8\*@GI = < | |< |   | |      L  K=I K = K = j&Ji ~< K   VxJ KL H Y K t X< s t JJ t g J b c (=I = IK; = = = f r K K  N8 = K3 A+?X< C2 D* = K |< | |9X< |t g J | |        KYIJ = = = = j @T = K J | |< |  J | |        KWK; = = = = j !<NT = K J | |< |  | |      L  K=I K = K = jft *+XX   L }  K   xJ KK IY < K }.< } } =J|<+[<|J9 K  |  |f| =f | |        KYI< = = = = j @T =  |< | |<< |  J | |        KWK; = K = K j x* =J|<9X|J9 K  |  | g | |      L  KYI< = = = = j &S'X 7 X7XvJt ~~Xtt <f | D<f|X~t <f | DJ< |ht< | |    t}ttt <J |ht J | R fJtf |tt Xff| XX  ct<|tt<g }tgt <J |gt Xf..tat <f Z D [ (=I =v }tgt JtfȺJf <<fJ    gtMt <<f  gtJ J<<|t 'z K  ;  < J KK IY < K }.< } }IK;>= g* = K |J | |9JJ |  | |        YKIJ = = = = j @T = K J | |J |  | |        YIK; = = = = j Y<NT =K K J | |< |  | |      L  Y=I K = K = jX| ww  .. 7t f Jp .. XffJJ |tt @ < zX + XJ Ytt J J .|X Y  0  < {J  JKVJ<}<:Y }~  <<7JKK IY=M.J}fJ}f|(<=KIK;>= g.J ~ ~J..~.J}y MUXJ)X G<tu ; . }< <  S} IK;>= gfX R  JfJ } U +JK}]J<}J:Y }  YfX} u f /home/conda/feedstock_root/build_artifacts/python-split_1669104742391/_build_env/lib/gcc/x86_64-conda-linux-gnu/10.4.0/include/home/conda/feedstock_root/build_artifacts/python-split_1669104742391/_build_env/x86_64-conda-linux-gnu/sysroot/usr/include/bits/home/conda/feedstock_root/build_artifacts/python-split_1669104742391/_build_env/x86_64-conda-linux-gnu/sysroot/usr/include/sys/home/conda/feedstock_root/build_artifacts/python-split_1669104742391/_build_env/x86_64-conda-linux-gnu/sysroot/usr/include/usr/local/src/conda/python-3.10.8/Include/cpython/usr/local/src/conda/python-3.10.8/Include/usr/local/src/conda/python-3.10.8/Modules/clinic/usr/local/src/conda/python-3.10.8/Modulesstddef.htypes.hstdio.hpyport.htime.hobject.hobject.hmethodobject.hdescrobject.hlistobject.hmoduleobject.hpyerrors.h_heapqmodule.c.h_heapqmodule.c_PyArg_BadArgumentPyErr_SetStringPyList_AppendGNU GIMPLE 10.4.0 -march=nocona -mtune=haswell -g -g -O3 -O3 -O3 -O3 -O3 -fno-openmp -fno-openacc -fcf-protection=none -fno-semantic-interposition -flto-partition=none -ftree-vectorize -fPIC -fstack-protector-strong -fno-plt -ffunction-sections -fuse-linker-plugin -ffat-lto-objects -flto-partition=none -flinker-output=dynPyUnicode_FromStringPyObject_RichCompareBool_Py_Dealloc/usr/local/src/conda/python-3.10.8/build-static_PyArg_CheckPositionalPyModuleDef_InitPyModule_AddObjectPyList_SetSliceGNU C99 10.4.0 -march=nocona -mtune=haswell -g -O3 -O3 -O3 -std=c99 -fwrapv -fstack-protector-strong -flto-partition=none -ftree-vectorize -fPIC -fstack-protector-strong -fno-plt -ffunction-sections -flto-partition=none -fno-semantic-interposition -flto -fuse-linker-plugin -ffat-lto-objects -flto-partition=none -fvisibility=hidden -fprofile-use -fprofile-correctionm_indexm_copytz_dsttimetmp1tmp2tp_hashbinaryfuncheapq_methodsstridesnb_inplace_powerPy_hash_tm_methodsformatslotPyGetSetDefsetattrofuncm_basetp_deallocnb_inplace_xor_heapq__heapreplace_max_impltp_as_mappingm_clearnb_matrix_multiplyPyAsyncMethodscache_friendly_heapifytp_namePYGEN_RETURNbf_releasebufferPySendResulttz_minuteswesttp_as_buffertp_initobjobjproctp_traverselenfuncnb_invertlimitsetattrfuncsiftup_funcgetattrfuncml_methdestructorsiftuptp_weaklistoffset_heapq_heappush_implm_freesq_itemtp_getattrvectorcallfuncam_sendnb_inplace_add_heapq_heappushpop_heapq_heapify__doc__ob_basesiftdown_max_heapq__heapify_max_impltp_iternb_ornb_inplace_remaindernb_inplace_rshiftPyExc_RuntimeErrorreadonlylong long unsigned inttp_cachenb_multiplytp_getattroinitproctp_as_asynchashfunc_heapq__heapify_max__doc__tp_basetp_iternextam_awaittp_allocPyModuleDef_Slotnb_inplace_floor_divideheapnb_positivetp_vectorcall_object_heapq__heapify_max__about__shapetp_richcomparePYGEN_NEXTPyListObjectnb_inplace_matrix_multiplygettertp_mrowas_sq_slicetp_methodstp_subclassesPyTypeObject_heapq_heapreplace__doc__exit_heapq_heapify_implPy_ssize_tkeep_top_bitreturn_valuebufferinfotp_getsetfeaturetp_dictoffsetPy_buffersq_inplace_concatnb_negativenb_power_Py_INCREF_typeobjectnb_absoluteam_aiter_heapq_heapreplace_heapq__heapreplace_max__doc__PyInit__heapqsq_concat_heapq__heappop_max__doc__PyMappingMethodsm_sizelong long intparentpos_Py_DECREFaboutvisitproctp_members_heapq_heappushheapreplace_internalmodule_docnb_remainderPyObjectsiftdownnb_rshiftPYGEN_ERRORtp_setattrodescrgetfunc_heapqmodule_Py_NewReflasteltm_doc_heapq_heappop_impl_heapq_heapifyallocfuncnb_inplace_or_Py_NoneStructmp_lengthtp_docPyModuleDef_Basem_namePyCFunctionnb_andtp_itemsizeobjobjargprocsetterwas_sq_ass_slicem_initstartpostp_basicsizetp_version_tagnb_floor_dividemhalffreefuncPyVarObjectreleasebufferprociternextfunctp_descr_getreturnitemmp_subscriptheappop_internaltp_weaklistam_anexttp_flagsob_sizesq_lengthnb_inplace_subtractnargsparentshort intnb_reservedallocatedtp_callml_nametp_freendimob_refcntm_slotstp_basesdescrsetfunc_heapq__heappop_maxml_docclosuresiftup_maxPyMethodDeftp_reprsq_containssq_ass_item_heapq_heappop__doc__PyExc_IndexError__ssize_theapq_slotsreprfuncmp_ass_subscriptnewitemssizeobjargprocnb_floatnb_true_dividenb_intm_traversenb_indexendposnb_xorPySequenceMethodsheapq_exectimezonePyType_HasFeaturechildposPyMemberDefPyNumberMethodsunsigned charnb_inplace_lshifttp_is_gcsendfunctp_as_sequencetraverseprocnb_divmodleftmosttp_dict_heapq_heappushpop_implnb_inplace_andheapify_internalternaryfunctp_strml_flags_heapq_heappush__doc__ob_itemsuboffsetsgetattrofunctp_clearrichcmpfunctp_as_numbertp_descr_setbf_getbuffertp_newnb_lshift_heapq_heappopshort unsigned intsq_inplace_repeatPyBufferProcsob_typegetbufferprocnb_addtp_vectorcall_offsettp_del_heapq_heappushpop__doc__nb_inplace_true_dividenb_inplace_multiplytp_finalizenewfuncdoublePyModuleDefnb_bool_heapq__heapreplace_max/usr/local/src/conda/python-3.10.8/Modules/_heapqmodule.ctp_setattrsq_repeatnb_subtract_heapq_heapreplace_implssizeargfuncunaryfuncinquirygetiterfunc_heapq__heappop_max_implP;\;U\;;\;;U;;\0^\t;|;P|;;V;;V0^V0^VUUTUTTURT0TUT@E$tt#TUTUTRT0?U?]Ux]xUy&]y&&U&t']t''U'']^f]f~U~3]?T?xx|T|'^319s9SsqS%&SH&&S''S>ES\SSS?PxPux%&H&&'''^>xU%]&H&]&t']t''U'']'']^>]]]QF"K"V"XV"c"c"%%(%(%H%H%W%ZW%%%%&H&&1'1''''^>S x"%S#%H%SW%%S%%S&1'1''S''S^SS>SSxp1&u1&PpV"#%(%#%%#&H&#&1'####Y%&H&&'''^>|T|~0~RSe \w !V%%V&&\'1'\VVS5"]%%]&A&]&&]'1']]]]S &1'S _&&_'1'___ !V%%V&&V'1'VVVZ &&'1'p QQp XX* [O [&&[[+ = P' 'P '' * v3${" Y ^&&^'1'^  v3${" % ^4 = ^'1'^ !V&!2!_2!:!!!_!+"S+"1"_%%V&&SVSV !S!5"%%S&&&*&SSSS ]] y !^ !5"V%%^&*&V^VV Z !>!T>!Y!XY!g!!!U!!"^!"1"T%%&&^&&^ [ !Y!P!!Y"1"Y 2!_2!:!:!!_!!S!5"_%%_&A&___ !\!5"%%\&&&*&\\\\ PZ!g!P!!P%%P%%& &P &&&!&P!&*& y>!B!V!!V ZB!M!X!!^ Z!g!!!^%%U&&^&!&R ^g!q!V!!V%%^^VV""S"##^3##_W%o%^v%%^''_''_^_S"%]W%o%]v%%]1't']t''U'']'']^]]>]"%SW%%S1''S''S^SS>S"o#\W%o%\v%%\~\\"#_W%o%_v%%_''_''_^_""_"#W%o%v%%~-##U~U~-##T~T ##QW%n%Q""Pv%~%P~%%"#VW%^%Vv%%V""V""V%%VH##_##Y##yr$$Z$$^$%Z1'O'^''_''_^_ ^H#%S1''S''S''S^S>SH#U#]~]X##r##^#%_1'm'_''^''^^~^>_##T##\##U$$X$1$g${$[$$T$$\$%X1'O'\O'Z'''\''\^~\ \U#h#Q#$RX$$U$%Uk##X####1&#$Y$1$$$Y$$$%~1&1'<'<'O'~1&O'S'''''1&''1&^~1& ~1&L#%V1''V''V''V^V>V##P$1$P$$P1'A'PA'O'O'_'P_'m'''P''##r$$_$$_##T$$X$$T##\$1$$$\1'O'\O'_'T''\##^1$:$_$$_''^''^^~^>_dS^ V%&^H&r&V&&^V,Vd]%&]H&y&]y&&U&&]&&]~]],]hS%&SH&&S~SSSh@_%&_&&_,_V%&VH&r&V&&VV,V|Q\%&&&,kP+PkR+RY&&YP%%P%%\%&\&&\\\%&\ V^~:_^_^H&r&V&&V,V SH&&S&&S~SSS -],]0kzk_4V4uXuXH&r&_&&V&&~V_IkXkU{P1CQ__PH&K&&&&&__-@YY"u[[E^~_^_uZu^H&&^&&^~^^$\H&&\&&\~\\,\lPPvPH&S&PS&`&&&P&&&&P&&ITzV_bXT_XPbm_lyv_H&S&Q&&R&&_y_VXT&`&_~VX_S_CV''V>UV\_A_VV\]'']>U]\]f]fwU]\S''S>ES\S~SS^>U^\^$CV''V>UV\VA_VVT>U\[>T[P>TP:QtQ>TQQKmP\dPdn5JUJ~\_5:v3$q"5=UKX\dUCVIV^V^~^N\^''V>UVA_VV\S''S>ESwSS]>U]C_CVXG\X''_AVA___U@zUzTD_D\U''_03Q0zYP9\PV^V^~^^Q\^''^w^^\\''\>U\w\\P{PP''P P 08P8APUbmU__muVXU{_''U_08UU_VXX0VAN_''U')])!)U!))]3R]RdUdrUr]''T'p(S|((^((S!)4)Sz))S))S3RSR`T`rT''T')V)!)T!))V))T))V3RVR`T`rTrV'(_!)4)_z))_))_3r_((^!)4)^z))^))^''S'(!)4)z))))3Rs((Tv((U'0(P[((Pz))P))P3IP1(?(P!)*)P*)4)(0(~3$p"(e(\!)4)\z))\))\((~3$p"(&(\?(I(\))\()S))S4)z)S))S3RSrS()V4)z)V))V3RVrV()]4)z)]))]3R]r]()\4)z)\r\()_))T4)z)_r_((P()P((R((()s1&4)P)s1&P)a)a)z)s1&rs1&((X))X3IX((PP)f)Pf)z)((\((_((_P)z)_((\r\))U),U,,U,-U-(-U(--U@U))T)Y+\Y+m+Tm+,\,,T,,\,-T-$-T$-Y-\Y-o-To--\\T@\)Y+0m+,0,,V,-0@0))T)Y+\m+,\,,\,-T-$-T$-Y-\Y-o-To--\\T@\))@E$))t))t#))T)Y+\m+,\,,\,-T-$-T$-Y-\Y-o-To--\\T@\))U)Y+Um+,U,-U-(-U(--U@U)Y+ 'm+, ',- '@ '))T)Y+\m+,\,,\,-T-$-T$-Y-\Y-o-To--\\T@\*R*VV V5@V5*R*TR*Y+m+,,-<--T5)*S*R*s-<-SS s5@S**V5*R*0R**_*Y+Sm++S,,_o--_--SS05S5*Y+\m+,\,,\<-Y-\Y-j-To--\\\ 5\5*Y+0m+,0,-0<--00505**^,,^o--^^^Z*Y+Sm++S,,So--SS5S>*D*~1&D*R*UR*"+,,o--**+PP*+QQ>**Y**+Y,,YY**Po-{-P{--j**s3$y"n**V,,Vo--Vn*t*s3$y"t*~*V**V|--V*Y+Sm++S++_++ ,,_,C,YC,[,,,_--S--S5S*Y+0m+,0<-j-0--00 50*Y+\m+,\<-Y-\Y-j-T--\\ 5\*Y+^m++^+,S<-R-S--^--SS S5^+%+U%+*+T*+B+++Z++P++,,U-,,^,,Q<-@-----^^**+Yr++Y+C,Z{,,Z+Y+_m++_+++,_,$,Y$,,_<-j-_--__ 5_*Y+Vm+,V<-j-V--VV| 5V++B+P++PD,R,P<-H-PH-R---P----P--++^++S-,0,S++U++P0,;,^++9+++D,R,^<-H-Q--X--^9+B+^++SR,[,S--^--SS S5^,-V5@V,,T,,R,,\,,0-.U.0U00U00U@U-.T.U.SU./T/#0S#00T00S@STS-.Q.0Q00Q00T00Q@Q./\'0x0\U\\..t..TUas--@E$CC@E$--|CC|--|#CC|#..U./U'00UUUU..t..TUas./\'0x0\U\\...R..S..sI/U/SU/|/X|////S'020sRR../0'000s000../\'0x0\s\\\H.Q.tX./V'00VVta..]..P.@/]@/N/Ue//^//['0E0^E0q0]]^<.p.U..Y2/|/Z//ZU]..S..s.U/SU/]/X]//S'00SS../_'00_s___..P./P}//P'070P70E0E0Q0PQ0[0[0g0Pg0q0a.m.V..Ve/i/Vm.x.]..]i/t/^..]./]}//^'0E0^E0q0]..V//V//VV00U0g4Ug4{4U{44UU00T01S14T44S44T$T$wSwTS00Q0g4Qg4t4Qt44T44QQ02])23]3;4]44]$]8]0 1Q@wV00@E$''@E$00}''}00}#''}#0 1Q@wV02])23]3;4]44]$]@]00U02U)23U3;4U44U$U@U02 ')23 '3;4 '44 '$ '@ '0 1Q@wV02])23]3;4]44]$]@]0 1T 12)233444$\wXw00Q\\V0101}1_12S)2G2S33_33S34_\w0wSS002])2{3]34]44]$]\]]020)230340440$0\001^33^34^\w^^12S)2G2S34SwSS01~1&1 1U 113334ag~1&gwY11U11U11RR0@1Pg11P34PawPPA1U1P33P33'1@1s3$p"+1q1V33V34V+111s3$p"11;1VK1U1V33V12S)2G2SM2U2VU2]2v203V>3L3UL3d3V33S44V$VwSS120)2{30330440$0w012])2{3]33]44]$]w]12\)2G2\G2d3S33\44S$Sw\S11Z11D2a2Ta2|2R|2222Z233_33L3TL3d3_334444_$_11X42|2P22Q(3L3Q12V)2U2VU2]2v]22V22P23303v1&L3d333V44V44  $v1&wV12^)2{3^33^44^$^w^11P}22P2 3PL3X3PX3d333P3344P4411\a2d2S22S11Zd2o2R22_11}222 3_L3d3_33[44X11\22S 33S33\44S$Sw\S{3344U44UU44T44U44T44TTURT440044T44U44T44@E$44t44t#44T44U44T44UTRT045U5$6^$636U3686^.^.?U?MUM^U45T55S55]55S8686S.S.<T<MS45T586..<T<45_8686_M__&55]8686].]]55S558686.55X55U 5L5Po5}5~}55PPPM5W5P$P$.75}5\8686\.\\75L5}3$p"75@5\@5G5}3$p"M5W5\.\56S 6$6SMS5$6M5$6^M^5$6_M_56]6"6TM]55P 6"6P55R5556s1&Ms1&s1&5$6\M\55PP55]55_55]]55_l_@6T6UT6 7UU U SU@6T6TT6~6V~66T66V67T7 7V 7 7TTTV-T-SV@6T6QT6 7QQQTSQi66]67] 7 7]]-]r66\66\66r66\67\X6X6@E$X6X6}X6X6}#r66U67U 7 7UU-Ur66\66\66r66\67\r66]67] 7 7]]-]66V 7 7VV-V66P66S66S66S67P77S 7 7SS-S~66V66V67V~66V66V67V66\66\66\V-V7>7U>77U77U77U77USnUnU7;7T;7}7V}77T77T77V77TSgTgV(7;7T;7x7V77T77VyV77@E$77t77t#(7;7T;7x7V77T77VyV(7>7U>7x7U77U77UyU(7x7 477 4y 4(7;7T;7x7V77T77VyVC7o7\o7s7ry\\Ui7x7S77S,7X7SX7[7s77SySSC7J7\77Sy\\USgTgsRstVtt078U8:UUUU78T8/8S/8:TTS<T<S7,8Q,8:QQQTQ729]F9c:]::]]t]<]<]7,8RDaVV77@E$@E$77}}77}#}#7,8RDaVV729]F9c:]::]]t]<]D]78U829UF9:U::UU<UDU729 4F9: 4:: 4 4< 4D 47,8RDaVV729]F9c:]::]]t]<]D]8,8U,829F9:::<\aXa}X88R\\V8/80/88_829SF9\9S6mSS_S\x00829]F9c:]::]]t]]]<]\x]]8290F9:00<0\}0088^^\x^^7829SF9\9S6mSSSS8!8~1&!8,8T,88~1&Y88U89U89PP8]8[89[[[[^8}8PPH88VVH8]8s3${"H8Q8VQ8X8s3${"^8h8VV829SF9\9Sb9j9Vj9r9v99V9:\:":Y:c:V"6mSSS8290F9c:0::0000<0829]F9c:]::]]t]]<]829\F9\9\\9c:S::SS6S6m\\<S89U929Y9v9[v99U9999R9P:_P:c:Z::__6_6:88Q89}J99Y99QE:c:Q829VF9j9Vj9r9vr99V99\9c:V::VVV<V829^F9c:^::^^^^}<^929P99P:":P'P'66?P?JP&88Uv99U9:_88\99S::S9999:":_6_6?UU99\99S":+:S::SS@[\&<Sc::P;;0^08;^'^3%qxxH%H%R%R%%&K&&'^>|8"%%&A&&&'6'  Y &&'6'      " % + 4 ''4 = '6' 8"%%&A& >!B!!! B!B!J!M!!!!! Z!g!!!%%&*& g!q!!!%%"%W%o%y%%6''''^>"""#W%o%y%%""""""""""y%%""%%H#%6''''^>w#z###$$ $$$$$$####$$$$$$$$####$1$$$6'm'''##1$:$$$''^~>H%H%H%R%d%&K&&&&&&,%&&&%%%& K&&&&,IIQT_bTT\_bbjmlyvK&T&&&yT&`&\>U_w(,1~_55:===AEKX_eXbe}\>Uwbbjmmmqu{3E3EN')3 (((e(%)4)z))33(((((("(&(1(?(%)4)?(I())33()4)z)3R{((((((((((Y)z)(({)-@)))))))**Y+m+,,,,-@****%***5***Y+m+,,,@--5^*b*g**,,s--**s-|-**|--*Y+m+,@-s--- 5++++++-,0,++++++++0,0,8,;,++9+++D,R,@-R-----9+B+++R,[,-- 55@-0@-.CH./,00U../,00sa.a.i.m...e/i/m.m.t.x.....i/i/q/t/.../}//,0q0..////0400'+00000 11112023333;444$8<@@@000 11112023333;444$8<@0000PT\\0 1111202{33444$\11$1q13334A1K133K1U1331202{33344${1111a2d222221111d2d2l2o2222211}222 3P3d333441122 333344${4444444444486*5.535}53686.7575<5@5@5@5C5G5M5W5.W5a55$6M555555555555u@6 7Si6n6r6667-666667"(77S7777(7x777SSy(7x777SSy(7x777SSyC7C7F7J77777SSy7:7777777,8/88829F9:::<<@DDD777,8/88829F9:::<<@D8 888PT\\8,8/88829F9c:<\};8?8D88^8h8h8r8829F9c:<8888v9v9~9999::88889999:: ::9999:":@*9999":+:@[*<0^@;M;P;;'^3')3)-@-0@0444486@6 7S77S7: :`h% P;?0 Jp: 0.J ?Y '`  q 4X| ^ 3i )  - @ 0   4"% "> N @6a iy 7 SE 7 ! @M @A? A?0 AZF B` Cbv `D @EZ @  E : : ;ȁ}5 8;A}` b<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<n}wȁ ]`< &;Rci @; w   ;  crti.ocall_gmon_start_heapqmoduleheapq_exec__about__heapq_exec.cold_heapq_heapifysiftupheapify_internalsiftup_maxheapify_internal.coldsiftup.cold_heapq_heappop_heapq_heappop.cold_heapq_heappush_heapq_heappush.cold_heapq_heapreplace_heapq_heapreplace.cold_heapq__heapify_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__GNU_EH_FRAME_HDR_GLOBAL_OFFSET_TABLE_g_heapqmodule.c.d45ca554PyExc_RuntimeError_Py_NoneStruct_PyArg_BadArgument__cxa_finalizePyErr_SetStringPyUnicode_FromString_PyArg_CheckPositionalPyModuleDef_Init_initPyInit__heapq_ITM_registerTMCloneTablePyModule_AddObjectPyList_AppendPyExc_IndexError_ITM_deregisterTMCloneTable_Py_Dealloc_finiPyObject_RichCompareBoolPyList_SetSlice__gmon_start__.symtab.strtab.shstrtab.gnu.hash.dynsym.dynstr.rela.dyn.init.plt.plt.got.text.fini.rodata.eh_frame_hdr.eh_frame.init_array.fini_array.dynamic.data.bss.comment.debug_aranges.debug_info.debug_abbrev.debug_line.debug_str.debug_loc.debug_rangeso4% -5?EJ  S00_+Y;; _@@ g]]u]]}m}m}mN``op ȁq0qUrsU`;0y d, P)y