ó \ K]c@`sêdZddlmZmZmZddlZddlmZejddddd d d d d ddddddddfƒZ dZ dZ dZ ejddddddfƒZ ejdd d!fƒZd"„Zd#„Zd$„ZdS(%sˆ Timsort implementation. Mostly adapted from CPython's listobject.c. For more information, see listsort.txt in CPython's source tree. i(tprint_functiontabsolute_importtdivisionN(ttypestTimsortImplementationtcompilet count_runt binarysortt gallop_leftt gallop_rightt merge_initt merge_appendt merge_poptmerge_compute_minruntmerge_lotmerge_hitmerge_attmerge_force_collapsetmerge_collapset run_timsorttrun_timsort_with_valuesiUiit MergeStatet min_galloptkeystvaluestpendingtntMergeRuntstarttsizec`sž|ˆƒ‰tj‰ˆdƒ‰|d„ƒ‰|‡‡‡fd†ƒ‰|‡‡‡fd†ƒ‰|d„ƒ‰ |d„ƒ‰|‡‡fd†ƒ‰|‡fd†ƒ‰ |d „ƒ‰|‡‡fd †ƒ‰|‡fd †ƒ‰|‡fd †ƒ‰|‡fd †ƒ‰|d„ƒ‰ |‡fd†ƒ‰|‡fd†ƒ‰d‰|‡‡‡‡‡‡ ‡‡fd†ƒ‰|‡‡‡‡‡‡ ‡‡‡f d†ƒ‰|‡‡‡‡‡fd†ƒ‰ |‡ fd†ƒ‰ |‡ fd†ƒ‰|‡fd†ƒ‰|‡‡‡ ‡ ‡ ‡‡‡fd†ƒ‰|‡‡fd†ƒ}|‡‡fd†ƒ}t|ˆˆˆˆˆˆ ˆˆ ˆˆˆ ˆˆ ||ƒS(NicS`s ||k S(N((RR((s2lib/python2.7/site-packages/numba/tests/timsort.pyt has_values@sc`sdtt|ƒddtƒ}ˆ||ƒ}|}tˆˆƒgt}tˆtƒ|||ˆƒS(s? Initialize a MergeState for a non-keyed sort. ii(tmintlentMERGESTATE_TEMP_SIZERtMAX_MERGE_PENDINGRt MIN_GALLOP(Rt temp_sizet temp_keyst temp_valuesR(tintptmake_temp_areatzero(s2lib/python2.7/site-packages/numba/tests/timsort.pyR Ds c`smtt|ƒddtƒ}ˆ||ƒ}ˆ||ƒ}tˆˆƒgt}tˆtƒ|||ˆƒS(s; Initialize a MergeState for a keyed sort. ii(RR R!RR"RR#(RRR$R%R&R(R'R(R)(s2lib/python2.7/site-packages/numba/tests/timsort.pytmerge_init_with_valuesOs cS`sN|j}|tkst‚||j|}q"Wˆ|j|ƒ}ˆ|j|jƒrxˆ|j|ƒ}n|}t|j|||j|jƒS(sJ Ensure enough temp memory for 'need' items is available. i(R RRRRRR(R,tneedtallocedR%R&(RR((s2lib/python2.7/site-packages/numba/tests/timsort.pyt merge_getmemks c`s(tˆ|ƒ|j|j|j|jƒS(s5 Modify the MergeState's min_gallop. (RRRRR(R,t new_gallop(R'(s2lib/python2.7/site-packages/numba/tests/timsort.pytmerge_adjust_gallopscS`s ||kS(s‡ Trivial comparison function between two keys. This is factored out to make it clear where comparisons occur. ((tatb((s2lib/python2.7/site-packages/numba/tests/timsort.pytLT‡sc `sM||kr||kst‚ˆ||ƒ}||krF|d7}nx||krH||}|}|}xH||krµ|||d?} ˆ||| ƒr¨| }qn| d}qnWx,t||dƒD]} || d|| lo[1] > lo[2] > ... A tuple (length, descending) is returned, where boolean *descending* is set to 0 in the former case, or to 1 in the latter. For its intended use in a stable mergesort, the strictness of the defn of "descending" is needed so that the caller can safely reverse a descending sequence without violating stability (strict > ensures there are no equal elements to get out of order). iiN(R+tFalseR6tTrue(RR7R8tk(R5(s2lib/python2.7/site-packages/numba/tests/timsort.pyRÁs c `sü||kst‚||kr*||ks0t‚||}d}d}ˆ|||ƒræ||}xT||kr¹ˆ||||ƒrµ|}|d>d}|dkr¶|}q¶qfPqfW||krÏ|}n||7}||7}n||d}xT||krJˆ||||ƒrPq÷|}|d>d}|dkr÷|}q÷q÷W||kr`|}n||||}}|d|kr||kr||ks£t‚|d7}xH||kr÷|||d?} ˆ|| |ƒrî| d}q°| }q°W|S(sà Locate the proper position of key in a sorted vector; if the vector contains an element equal to key, return the position immediately to the left of the leftmost equal element. [gallop_right() does the same except returns the position to the right of the rightmost equal element (if any).] "a" is a sorted vector with stop elements, starting at a[start]. stop must be > start. "hint" is an index at which to begin the search, start <= hint < stop. The closer hint is to the final result, the faster this runs. The return value is the int k in start..stop such that a[k-1] < key <= a[k] pretending that a[start-1] is minus infinity and a[stop] is plus infinity. IOW, key belongs at index k; or, IOW, the first k elements of a should precede key, and the last stop-start-k should follow key. See listsort.txt for info on the method. ii(R+( tkeyR3RtstopthintRtlastofstofstmaxofstm(R5(s2lib/python2.7/site-packages/numba/tests/timsort.pyRæsJ            .   c `sü||kst‚||kr*||ks0t‚||}d}d}ˆ|||ƒrë||d}xT||kr½ˆ||||ƒr¹|}|d>d}|dkrº|}qºqjPqjW||krÓ|}n||||}}nŠ||}xT||krKˆ||||ƒrPqø|}|d>d}|dkrø|}qøqøW||kra|}n||7}||7}|d|kr||kr||ks£t‚|d7}xH||kr÷|||d?} ˆ||| ƒrê| }q°| d}q°W|S(sû Exactly like gallop_left(), except that if key already exists in a[start:stop], finds the position immediately to the right of the rightmost equal value. The return value is the int k in start..stop such that a[k-1] <= key < a[k] The code duplication is massive, but this is enough different given that we're sticking to "<" comparisons that it's much harder to follow if written as one routine with yet another "left or right?" flag. ii(R+( RBR3RRCRDRRERFRGRH(R5(s2lib/python2.7/site-packages/numba/tests/timsort.pyR <sJ            .  cS`sKd}|dkst‚x(|dkrB||d@O}|dL}qW||S(s½ Compute a good value for the minimum run length; natural runs shorter than this are boosted artificially via binary insertion. If n < 64, return n (it's too small to bother with fancy stuff). Else if n is an exact power of 2, return 32. Else return an int k, 32 <= k <= 64, such that n/k is close to, but strictly less than, an exact power of 2. See listsort.txt for more info. ii@i(R+(RR<((s2lib/python2.7/site-packages/numba/tests/timsort.pyR ˆs c`s”|dkst‚|dks$t‚x*t|ƒD]}|||||| 0, and should have na <= nb. See listsort.txt for more info. An updated MergeState is returned (with possibly a different min_gallop or larger temp arrays). NOTE: compared to CPython's timsort, the requirement that "Must also have that keys[ssa + na - 1] belongs at the end of the merge" is removed. This makes the code a bit simpler and easier to reason about. ii(R+RRRR@R#(R,RRtssatnatssbtnbta_keysta_valuestb_keystb_valuestdestR9RtacounttbcountRA(t DO_GALLOPR5RR RR2R0RQ(s2lib/python2.7/site-packages/numba/tests/timsort.pyR¿s¾*                                                c`s¥|dkr$|dkr$||ks*t‚|||ks@t‚ˆ||ƒ}ˆ|j|jd||||ƒ|}|}|j} |j} ||d} |d}||d}ˆ| | ƒ} |j} xi|dkr8|dkr8d}d}x trˆ| |||ƒrŠ|||| <| r9|||| 0, and should have na >= nb. See listsort.txt for more info. An updated MergeState is returned (with possibly a different min_gallop or larger temp arrays). NOTE: compared to CPython's timsort, the requirement that "Must also have that keys[ssa + na - 1] belongs at the end of the merge" is removed. This makes the code a bit simpler and easier to reason about. ii(R+RRRR@R#(R,RRRSRTRURVRWRXRYRZR[R9RR\R]RA( R^R5RR RR2R0RQRR(s2lib/python2.7/site-packages/numba/tests/timsort.pyRZsÀ*                   (           (             c `sÌ|j}|dkst‚|dks-t‚||dksS||dksSt‚|j|\}}|j|d\}}|dkr•|dks›t‚|||ks±t‚t|||ƒ|j|<||dkrú|j|d|j|d len[-2] + len[-1] 2. len[-2] > len[-1] An updated MergeState is returned. See listsort.txt for more info. iii(RRR(R,RRRR(R(s2lib/python2.7/site-packages/numba/tests/timsort.pyR(s   99" c`sƒx||jdkr~|j}|jd}|dkrf||dj||djkrf|d8}qfnˆ||||ƒ}qW|S(s¾ Regardless of invariants, merge all runs on the stack until only one remains. This is used at the end of the mergesort. An updated MergeState is returned. iii(RRR(R,RRRR(R(s2lib/python2.7/site-packages/numba/tests/timsort.pyRDs   "c`s¾|}|d}xA||krS||||||<||<|d7}|d8}qWˆ||ƒrº|}|d}xD||kr¶||||||<||<|d7}|d8}qvWndS(s, Reverse a slice, in-place. iN((RRRRCRPtj(R(s2lib/python2.7/site-packages/numba/tests/timsort.pyt reverse_sliceWs    c `sMt|ƒ}|dkrdSˆ|ƒ}ˆ}xÌ|dkrüˆ||||ƒ\}}|ryˆ|||||ƒn||kr»t||ƒ}ˆ|||||||ƒ|}nˆ|t||ƒƒ}ˆ|||ƒ}||7}||8}q1Wˆ|||ƒ}|jdks$t‚|jddt|ƒfksIt‚dS(s2 Run timsort with the mergestate. iNii(R RRRR+R( R,RRt nremainingtminrunR7Rtdesctforce(RRR RR RR`R)(s2lib/python2.7/site-packages/numba/tests/timsort.pytrun_timsort_with_mergestateks(      c`s |}ˆˆ|ƒ||ƒdS(s2 Run timsort over the given keys. N((RR(R Re(s2lib/python2.7/site-packages/numba/tests/timsort.pyRsc`sˆˆ||ƒ||ƒdS(s= Run timsort over the given keys and values. N((RR(R*Re(s2lib/python2.7/site-packages/numba/tests/timsort.pyR™s(RR'R(twrapR(RR((R^R5RRRR RR'R(R2R RRR RR0RR R*RR R`ReRQRRR)s2lib/python2.7/site-packages/numba/tests/timsort.pytmake_timsort_impl:sF      2%VL*›-ž!0*%    cG`std„|ŒS(NcS`s|S(N((tf((s2lib/python2.7/site-packages/numba/tests/timsort.pyt«t(Rg(targs((s2lib/python2.7/site-packages/numba/tests/timsort.pytmake_py_timsortªsc`s&ddlm‰t‡fd†|ŒS(Ni(tjitc`sˆdtƒ|ƒS(Ntnopython(R@(Rh(Rm(s2lib/python2.7/site-packages/numba/tests/timsort.pyRi¯Rj(tnumbaRmRg(Rk((Rms2lib/python2.7/site-packages/numba/tests/timsort.pytmake_jit_timsort­s(t__doc__t __future__RRRt collectionsRoRt namedtupleRR"R#R!RRRgRlRp(((s2lib/python2.7/site-packages/numba/tests/timsort.pyts.       ÿÿÿs