ELF>p@`b@8 @ 000=MM=MM $$Std Ptd000||QtdRtd=MMGNUGNUyv z4њ[ I Tf `{o'8U, F" "R__gmon_start___ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalizePyObject_HasAttrPyObject_RichCompareBoolPyString_FromStringPyExc_RuntimeErrorPyErr_SetStringPyExc_IndexError_Py_NoneStructPyExc_TypeErrorPyArg_UnpackTuplePyList_Append__stack_chk_failPyList_SetSlicePyArg_ParseTuplePyObject_GetIterPyList_NewPyIter_NextPyErr_OccurredPyList_SortPyList_Reverseinit_heapqPy_InitModule4_64PyModule_AddObjectlibpython2.7.so.1.0libc.so.6GLIBC_2.2.5GLIBC_2.4/opt/alt/python27/lib64:/opt/alt/openssl11/lib64ui ii M MMMk70k@kTlL0l l S l0(l8lR@l@0HlXlQ`l0hlxlPl[0ll`Plg0llPOOO O OOOO0O8O@OHOPOXO`O hO pO xOOOOOOOOOHH?HtH5>%>hhhhhhhhqhah Qh Ah 1h !h hhhh%=D%=D%=D%=D%=D%=D%=D%=D%=D%=D%=D%}=D%u=D%m=D%e=D%]=D%U=D%M=DH=iZHbZH9tH6=Ht H=9ZH52ZH)HH?HHHtH%=HtfD=Yu+UH==Ht H=:YdY]wATIUHHH5YHtOHu+HLKƒtG)H]A\DHLH1]A\@H=a,H=YHHufDAWAVAUATUSHLgI9HGIHIH value. 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) Pop the smallest item off the heap, maintaining the heap invariant.heappushpop(heap, item) -> value. 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(heap, item) -> None. Push item onto heap, maintaining the heap invariant.Heap queues [explanation by Franois 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! :-) 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! 70@TL0  S0R@0Q0P[0`Pg0P_heapq.so-2.7.18-9.el9.x86_64.debug77zXZִF!t/]?Eh=ڊ2N$:& t<3ݡA#bӨB lE W.0c? kGY"JRMBC&ߎ^^p(H{} ӫD'x{ʜi~T,O mӮzBl ջ,z̥/7o5`Ivmqt[28E/ ]ȍz~gn$t!Gh*[dzSXjt(ș/rD̨؝B2r1{Gjf *:CCؕ#|J/ _ڠA ޴bG`gr!o/El>1"))1*3SpعnTd*4:CoU]"+趺уr,?K/DT 2Pаf5G!6+"_Rm4n-.!:snöub1Ӌ?@eDK֡Sx錖3Ou^ ..kGK͚ -JfNZn e?h&".l"Ft_]`Q'@r(*JBLg! y^Wrn s(Epz9q=;x 7 f:yuga5"̭ҬWpP#ΰApu%>v?9D9^7NDH ȶ;=Cm|xa~yx&)|{$Zs5֢lZF"}> 9 IjZF֖rNž[ )+Y~srh>Hx$~ne~K}#. >U~8YW,6ٟN ! G:xy \X6|Zt+>hk Aʓg<ݬ"dceMP۳!xgYZ.shstrtab.note.gnu.property.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.plt.sec.text.fini.rodata.eh_frame_hdr.eh_frame.init_array.fini_array.data.rel.ro.dynamic.got.data.bss.gnu_debuglink.gnu_debugdata  $1o$; CKo6Xo0g((qB( ( {v  0PP ppt"t" 20000|8181M=M=M=M=O?P@ l\\(]@Ha