6hXSrSSKJr SSKrSSKJr SSKJr SrSr S r S r S r S r g) a Stable-tail sort computation. The "stable-tail sort", or STS, is a reverse topological ordering of the ancestors of a node, which tends to share large suffixes with the stable-tail sort of ancestors and other nodes, giving it its name. Its properties should make it suitable for making chunks of ancestors with high reuse and incrementality for example. This module and implementation are experimental. Most functions are not yet optimised to operate on large production graphs. ) annotationsN)nullrev)ancestorcURU5URU5pCX4:aX4$X4:aX!4$URU5URU5:aX4$X!4$)a Chooses and returns the pair (px, pt) from (p1, p2). Where "px" denotes the parent starting the "exclusive" part, and "pt" denotes the parent starting the "Tail" part. "px" is chosen as the parent with the lowest rank with the goal of minimising the size of the exclusive part and maximise the size of the tail part, hopefully reducing the overall complexity of the stable-tail sort. In case of equal ranks, the stable node ID is used as a tie-breaker. ) fast_ranknode)clp1p2r1r2s J/usr/lib/python3/dist-packages/mercurial/stabletailgraph/stabletailsort.py_sorted_parentsrs[\\" r||B/ wx x rwwr{ "xxcURU5up#U[:Xd'URU5URU5S- :XaU[4$U[:Xd'URU5URU5S- :XaU[4$X#4$)u Returns the non-œdipal parent pair of the given revision. An œdipal merge is a merge with parents p1, p2 with either p1 in ancestors(p2) or p2 in ancestors(p1). In the first case, p1 is the œdipal parent. In the second case, p2 is the œdipal parent. Œdipal edges start empty exclusive parts. They do not bring new ancestors. As such, they can be skipped when computing any topological sort or any iteration over the ancestors of a node. The œdipal edges are eliminated here using the rank information. ) parentrevsrrr revr r s r_nonoedipal_parent_revsr7sy]]3 FB W} R(BLL,=,AA7{ w",,r*bll3.?!.CC7{v rcN[X5up#U[:XaX#4$[XU5$N)rrrrs r_parentsrOs) $R -FB W}v 22 &&rc#x^# UnU[:waUv [X5up4U[:XaUnO|[R"URU4SS9mU4Sj[ X55nUR U5UR U5- S- n[R"XV5ShvN UnU[:waMggN7f)a Naive topological iterator of the ancestors given by the stable-tail sort. The stable-tail sort of a node "h" is defined as the sequence: sts(h) := [h] + excl(h) + sts(pt(h)) where excl(h) := u for u in sts(px(h)) if u not in ancestors(pt(h)) This implementation uses a call-stack whose size is O(number of open merges). As such, this implementation exists mainly as a defining reference. T) inclusivec38># UHnUT;dM Uv M g7fr).0atail_ancestorss r *_stable_tail_sort_naive..os"#8AN*8s  rN) rrr lazyancestorsr_stable_tail_sort_naiver itertoolsislice)r head_rev cursor_revpxptexclusive_ancestorsexcl_part_sizer!s @rr%r%WsJ  ") =J%33 uN#08#  \\*5 R8HH1LN ''(;L L LJ+  ( MsB B:#B8$B:6B:c#|# [X5n[U5nUHnU[X5S:waX44v UnM g7f)a  Yields the leaps in the stable-tail sort of the given revision. A leap is a pair of revisions (source, target) consecutive in the stable-tail sort of a head, for which target != px(source). Leaps are yielded in the same order as encountered in the stable-tail sort, from head to root. rN)r%nextr)r r(stsprevcurrents r_find_all_leaps_naiver3}sC "" /C 9D hr(+ +/ ! s:<c## [X5up#U[:Xd U[:Xag[[X55n[ X5n[ U5nUH*nXs:Xa gU[X5S:wa Xg4nX;aUv UnM, g7f)a Returns the specific leaps in the stable-tail sort of the given revision. Specific leaps are leaps appear in the stable-tail sort of a given revision, but not in the stable-tail sort of any of its ancestors. The final leaps (leading to the pt of the considered merge) are omitted. Only merge nodes can have associated specific leaps. This implementations uses the whole leap sets of the given revision and of its parents. Nr)rrsetr3r%r/) r r(r*r+ parents_leapsr0r1r2leaps r_find_specific_leaps_naiver8sb #FB W}g -b56M !" /C 9D =  hr(+ +?D( sA>B)__doc__ __future__rr&r rrrrrr%r3r8rrrr<s7 #40'#L&r