SXA|EddlZddlmZddlmZmZej dZdZdZ Gdd Z d Z Gd d Z y) N)nullrev)dagoppolicyparsersct|ts t|}t|vr tSt|dkr|Sdt|zdz }dgt |dzz}t |D] \}}d|z||<ddzz}t}t|}t|dz } | dk\r|r| } | dz} || s|| } | |kr'|dz}| |k(r|j | | |z} | |vr| hS| |kr@|| D]4} || } | tk(r| dk(r | || <|dz }"| | k7s(|| xx| zcc<6n-|| D]"} | tk(r || } | r | |kr|dz}| || <$| dk\r|r|S)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 6usr/lib/python3.12/site-packages/mercurial/ancestor.pycommonancestorsheadsrs eS !E %u  5zQ CJ!#G 3#e*q. !D% 1q&Q! 1q5\F %Ce*K TQB 'k  aAw  !W ; 1 KW} f :3J ;1X!W<7 DG1$K2XGrMG1X<!W"v+1$KQ 3 'k@ JcVfd}tg|}t|dkr|S||S)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. cdi}t|dz}dg|z}dg|z}g}tt|D],\}}d||<d|z}|||<d||<|j||f.|dz } | dk\rt |dkDr| } | dz} || } | dk(r&|| } | D]} | t k(r || }|| }|| kr=| dz|| <|| k7s*|| xxdz cc<| || <|s?||xxdzcc<||dk(sU||=Y| |dz k(sb|| z}||k(rm||| <|j |d||xxdz cc<||xxdzcc<||dk(s||=|| xxdzcc<|| dk(r|| =| dk\rt |dkDrt |dk7rgSd}|D]}||z} |Dchc] \}}||zs |c}}Scc}}w)Nrr)r r sortedappendr r setdefault)rrcountdepthrmappingrrbrrdvrrdprnspkrs rdeepestzancestors..deepestUs3 E Qe sU{u .FQE!HQADGKN NNAq6 " / QYAg#k*Q.A !GBqBQwaB1X<1X!W8!AvE!HRx#B1,"$Q'Oq0O*2!3$/O26\r'Cby !DG**32$)$Oq(O"2!+'O/0 Oq O2!#OCAg#k*Q.F { q I A FA '1fq!1q5111s  F,$F,r)rr )r orignodesr-rs` r ancestorsr/Ms462p u 1y 1C 3x1} 3<rc4eZdZdZdZdZdZdZdZdZ y) 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.ct||_|js|jjt||_yN)r basesrrr)selfrr4s r__init__z$incrementalmissingancestors.__init__s+Z zz JJNN7 # rcF|jxr|jthk7S)z0whether the common set has any non-trivial bases)r4rr5s rhasbasesz$incrementalmissingancestors.hasbasesszz5djjWI55rc:|jj|y)z)grow the ancestor set by adding new basesN)r4update)r5newbasess raddbasesz$incrementalmissingancestors.addbasess (#rcVtj|j|jSr3)rheadrevsr4rr8s r basesheadsz&incrementalmissingancestors.basesheadss~~djj$**55rc|j}|j}|j||jt|syt |t fd|D}t||k(rytt|dz dD]?}||vr|j||j||t||k(s?yy)z:remove all ancestors of bases from the set revs (in place)Nc3.K|] }|kDs dyw)rN).0rstarts r zBincrementalmissingancestors.removeancestorsfrom..s54a1u94s r) r4rdifference_updatediscardrr sumr rangeminr;)r5revsr4r keepcountcurrrFs @rremoveancestorsfromz/incrementalmissingancestors.removeancestorsfroms   u% W E 5455 t9 ! %TQ3D5  LL  LLt %4yI%4rc t|}|j}|j}|j|}|j ||sgSt t |t |}g}t |tdD]}|sn||vrR|j|||D]5} |j| |j| |j| 7]||vr'|j||j||} |} n ||vr|} |} n||D]Y} | tk(r | | vs| |vr4|j| |j| |j| I| j| [|j|S)areturn 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.rH) r r4r intersectionrIr rLrremoverJrr#reverse) r5rN revsvisit basesvisitr bothvisitrFmissingrPr thisvisit othervisits rmissingancestorsz,incrementalmissingancestors.missingancestorsszI ZZ  **:6 ##I.IC NC O4 %"-Dy   &tA%%a(NN1%MM!$%y t$  &% ' #& & 4[<*_Y%%a(NN1%MM!$MM!$!5.N rN) __name__ __module__ __qualname____doc__r6r9r=r@rQr\rCrrr1r1s&?  6$64Hrr1c#Kth}tj}tj}tj}|j }|r7|D cgc]} | } } |j |tj| nVg} tj| |D]:} || \} } | |vr|| | || | |vs)|| | || <| rc| d } | |kry| || \} } | |vr"| | z dk(r| | d<n || | || n|| | |vr|| | || | rbyycc} ww)Nrr)rheapqheappushheappop heapreplacerr;heapify) parentrevsinitrevsstoprev inclusiverrcrdreseerEvisitp1p2currents r_lazyancestorsiterrpsL 9D~~HmmG##K ((C%&X!X& H e eA]FB~$B~$B 8) W   G$B T>|q 3aEB3' G EN T> URC G% 's A E D;A*EA7E9Ec*eZdZddZdZeZdZdZy) lazyancestorsc||_|Dcgc] }||k\s | c}|_||_||_t |_t |j|j|j|j|_ycc}w)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 _containsseenrp _containsiter)r5rrNrirjrEs rr6zlazyancestors.__init__?sm!%):TQ'\!T: # U/   dnndmmT__  ;s A<A<cL tt|y#t$rYywxYw)z*False if the set is empty, True otherwise.TF)nextiter StopIterationr8s r __nonzero__zlazyancestors.__nonzero__Us(  d   s  ##cnt|j|j|j|jS)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.)rprtrurvrwr8s r__iter__zlazyancestors.__iter___s,"   dnndmmT__  rc|j}||vry|j}|y|y|j} t|}||||k(ry||kry #t$r d|_YywxYw)z5Test whether target is an ancestor of self._initrevs.TNF)rxryrr{r})r5targetrr|rkrevs r __contains__zlazyancestors.__contains__ns!! T>!! < >hh 4jC&=<  "&D   sA AAA%$A%N)rF)r]r^r_r6r~__bool__rrrCrrrrrr>s ,H  rrr) rbnoderrr importmodrrr/r1rprrrCrrrsR  &  9 %6rDNzz|)XKKr