6h1SSKJr SSKrSSKJr SSKJrJr \R"S5r Sr Sr "S S 5r S r "S S 5rg)) annotationsN)nullrev)dagoppolicyparsersc[U[5(d [U5n[U;a [5$[U5S::aU$S[U5-S- nS/[ U5S--n[ U5H upESU-X5'M SWS--n[5n[U5n[U5S- n U S:aU(aU n U S-n X:(dMX:n X:a'US-nX:XaUR U 5 X-n X;aU 1$X:aDU"U 5H7n X<n U [:XaMU S:Xa XU 'US- nM$X:wdM+X<==U -ss'M9 O4U"U 5H(n U [:XaMX<n U (a X:aUS-nXU 'M* U S:a U(aMU$)zReturns a set with the heads of all common ancestors of all nodes, heads(::nodes[0] and ::nodes[1] and ...) . pfunc must return a list of parent vertices for a given vertex. rr) isinstancesetrlenmax enumerateadd)pfuncnodesallseenseeninpoisongca interestingnvvsvpsps 4/usr/lib/python3/dist-packages/mercurial/ancestor.pycommonancestorsheadsrs eS ! !E %u  5zQ CJ!#G 3#e*q. !D% q&! 1q5\F %Ce*K TQB 'k  aw  W ; 1 K}  :3J ;1XW<7 G1$KXGrMG1X<W"+1$KQ 3 'kk@ JcZ^U4Sjn[T/UQ76n[U5S::aU$U"U5$)z Returns the common ancestors of a and b that are furthest from a root (as measured by longest path). pfunc must return a list of parent vertices for a given vertex. c>0n[U5S-nS/U-nS/U-n/n[[U55H(upgSX7'SU-nXU'SX'URX45 M* US- n U S:Ga [ U5S:aU n U S-n X:n U S:XaM)XJn T"U 5Hn U [ :XaMX=nXMnX::aAU S-X='X:wa3X==S- ss'XU 'U(aX==S-ss'XS:XaX MWMYM[M]XS- :XdMgX-nUU:XaMsUXM'UR US5 UU==S- ss'X==S-ss'XS:XdMX M X==S-ss'XS:XaX U S:a[ U5S:aM[ U5S:wa/$SnUHnUU-nM UVVs1sHupgUU-(dMUiM snn$s snnf)Nrr)r rsortedappendr r setdefault)rrcountdepthrmappingrrbrrdvrrdprnspkrs rdeepestancestors..deepestVs E Qe sU{fUm,DAEHQAGKN NNA6 " - QYAg#k*Q.A !GBBQwB1X<XW8!AvEHx#1,"$Q'Oq0O*!3$/O 4 6\'Cby !DG**32$)$Oq(O"!+'O/0 Oq O!#OCAg#k*Q.F { q I A FA '1fq1q5111s F=3F=r)rr )r orignodesr.rs` r ancestorsr1Ns462p u 1y 1C 3x1} 3<r c<\rSrSrSrSrSrSrSrSr Sr S r g ) incrementalmissingancestorsapersistent state used to calculate missing ancestors incrementally Although similar in spirit to lazyancestors below, this is a separate class because trying to support contains and missingancestors operations with the same internal data structures adds needless complexity.c[U5UlUR(dURR[5 XlgN)r basesrrr)selfrr7s r__init__$incrementalmissingancestors.__init__s)Z zz JJNN7 # r cPUR=(a UR[1:g$)z0whether the common set has any non-trivial bases)r7rr8s rhasbases$incrementalmissingancestors.hasbasesszz5djjWI55r c:URRU5 g)z)grow the ancestor set by adding new basesN)r7update)r8newbasess raddbases$incrementalmissingancestors.addbasess (#r cX[R"URUR5$r6)rheadrevsr7rr<s r basesheads&incrementalmissingancestors.basesheadss~~djj$**55r c^URnURnURU5 UR[5 U(dg[ U5m[ U4SjU55n[U5U:Xag[T[U5S- S5HCnXR;aM URU5 URU"U55 [U5U:XdMC g g)z:remove all ancestors of bases from the set revs (in place)Nc36># UHoT:dM Sv M g7f)rN).0rstarts r Bincrementalmissingancestors.removeancestorsfrom..s54au94s  r) r7rdifference_updatediscardrr sumr rangeminr@)r8revsr7r keepcountcurrrMs @rremoveancestorsfrom/incrementalmissingancestors.removeancestorsfroms   u% W E 5455 t9 ! %TQ3D  LL  LLt %4yI%4r cD[U5nURnURnURU5nUR U5 U(d/$[ [ U5[ U55n/n[ U[S5GH nU(d GOX;aUURU5 U"U5H6n URU 5 URU 5 URU 5 M8 MhX;a'URU5 URU5 Un Un O X;aUn Un OMU"U5H_n U [:XaMX;dX;a5URU 5 URU 5 URU 5 MNU RU 5 Ma GM UR5 U$)zreturn all the ancestors of revs that are not ancestors of self.bases This may include elements from revs. Equivalent to the revset (::revs - ::self.bases). Revs are returned in revision number order, which is a topological order.rP) r r7r intersectionrQr rTrremoverRrr$reverse) r8rV revsvisit basesvisitr bothvisitrMmissingrXr thisvisit othervisits rmissingancestors,incrementalmissingancestors.missingancestorsspI ZZ  **:6 ##I.IC NC O4 %"-D   &tA%%a(NN1%MM!$% t$  &% ' #& & 4[<_%%a(NN1%MM!$MM!$!5.N r )r7rN) __name__ __module__ __qualname____firstlineno____doc__r9r=rBrFrYre__static_attributes__rJr rr3r3s&?  6$64Hr r3c## [1n[Rn[Rn[RnUR nU(a:UV s/sHo*PM n n UR U5 [R"U 5 OY/n [R"U 5 UH;n U"U 5upX;aU"X*5 U"U 5 X;dM*U"X*5 U"U 5 M= U (ahU S*n X:agU v U"U 5upX;a!X- S:XaU *U S'O U"X*5 U"U 5 OU"U 5 X;aU"X*5 U"U 5 U (aMgggs sn f7f)Nrr)rheapqheappushheappop heapreplacerr@heapify) parentrevsinitrevsstoprev inclusiverrorprqseerLvisitp1p2currents r_lazyancestorsiterr|s3 9D~~HmmG##K ((C%&XX& H e eA]FB~$B~$B 8)    G$ >|q 3aE3' G EN > UC G% %'s AE EA*E BEEc4\rSrSrSSjrSr\rSrSrSr g) lazyancestorsi?cXlUVs/sH oUU:dM UPM snUlX0lX@l[ 5Ul[ URURURUR5Ulgs snf)aCreate a new object generating ancestors for the given revs. Does not generate revs lower than stoprev. This is computed lazily starting from revs. The object supports iteration and membership. cl should be a changelog and revs should be an iterable. inclusive is a boolean that indicates whether revs should be included. Revs lower than stoprev will not be generated. Result does not include the null revision.N) _parentrevs _initrevs_stoprev _inclusiver _containsseenr| _containsiter)r8rrVrurvrLs rr9lazyancestors.__init__@se!%):T'\!T: # U/   dnndmmT__  ;s A=A=cN[[U55 g![a gf=f)z*False if the set is empty, True otherwise.TF)nextiter StopIterationr<s r __nonzero__lazyancestors.__nonzero__Vs(  d   s  $$cn[URURURUR5$)aGenerate the ancestors of _initrevs in reverse topological order. If inclusive is False, yield a sequence of revision numbers starting with the parents of each revision in revs, i.e., each revision is *not* considered an ancestor of itself. Results are emitted in reverse revision number order. That order is also topological: a child is always emitted before its parent. If inclusive is True, the source revisions are also yielded. The reverse revision number order is still enforced.)r|rrrrr<s r__iter__lazyancestors.__iter__`s,"   dnndmmT__  r cURnX;agURnUcgUcgURn[U5nU"U5 XQ:XagXQ:agM!![a SUlgf=f)z5Test whether target is an ancestor of self._initrevs.TNF)rrrrr)r8targetrrrwrevs r __contains__lazyancestors.__contains__os!! >!! < >hh 4jC=<  "&D   sAAAA*)A*)rrrrrrN)rF) rgrhrirjr9r__bool__rrrlrJr rr~r~?s ,H  r r~) __future__rrnnoderrr importmodrrr1r3r|r~rJr rrsS#    9 %6rDNzz|)XKKr