ddlZddlZddlmZddlmZmZddlmZdZ dZ dZ d Z d Z d Zejd Zd ZdZdZy)N)_)hexshort)errorcjjj}|dDchc]}j|}}fd}d}||d|d\}}|sd}||d|d\}}j |} |swt |ddk(r:t |ddk(r)|d|dk7rt jtdt jtd |t| fzi} tj|g} g} | ro| j} || gk(rT| j| || D]8}|d k7s || vr| |j| "| g| |<| j|:| ro| jt | }| Dcgc]}||vs||k7s|}}|dk(s|s"| Dcgc]}j |c}d |fS|d z}d }d }t}| D]} | |vr"|j!| j#| g*|| xs| g}d || <t |}||z }t%||}||kDr| |vr |}| }||k(rn||kr&| |vr"|j!| j#| gg}| j#| gD]6}||rt't|||z||<&|j|8|s|j)d }|D] }||gz||< |j||||<|Jj |}|g||fScc}wcc}wcc}w)afind the next node (if any) for testing during a bisect search. returns a (nodes, number, good) tuple. 'nodes' is the final result of the bisect if 'number' is 0. Otherwise 'number' indicates the remaining possible candidates for the search and 'nodes' contains the next bisect target. 'good' is True if bisect is searching for a first good changeset, False if searching for a first bad one. skipct|Dcgc]}j|c}}tjd}j d|||D]}g||< |||dfS||fScc}w)Ncy)Nr 5usr/lib/python3.12/site-packages/mercurial/hbisect.pyz0bisect..buildancestors..)sDr s(%ln::%d) - (::%ln))minrev collections defaultdictrevs)badgoodnbadrev ancestorsr changelogrepos rbuildancestorszbisect..buildancestors's~41immA&45++L9 993T64HCIcNI V  $4< y  5sA+FbadgoodTrs+starting revisions are not directly relateds)inconsistent state, %d:%s is good and badrN) unfilteredr parentrevsrnodelenrAbortrrrdequepopleftappendsortsetupdategetrlistpop)rstate clparentsrskiprrrrrchildrenvisit candidatesrprevtotc unskippedperfectbest_revbest_lenpoisonaxyvalue unvisitedfirst best_noders` @rbisectrDs ?? DI$$I&+Gn 5nIMM! nD 5! D&uV}eGnEFI *5>5=I .. C  f ! #E'N#q(f w/++a NOP Pkk : ;uSz" #  H   vh 'EJ mmo S>R    c "!#2:x' --c2*- T* ' OO j/C&LJq1D=qF{JIL axy,67Jq"J7DAAQhGHH UF &= MM(,,sB/ 0  cN #se # F !GAq  8 4HH w;3d? MM(,,sB/ 0  c2&A|#C ! q(8$9: !   # ' MM!$E A3w !  HHUO Ie KN   x(I Kd ##I 6bM7sL=0 M:MMMc||dj}t|dkDr\|r|d}n|d}t|Dchc]}|jc}t|z}|dk(r|dj |dSycc}w)Nrrrr)parentsr$r#r*ancestor)rr/nodesrrFsideinums r extendrangerLs58n$$&G 7|a =D>DW-W1668W-D 9: !81:&&wqz2 2 .sBc0ggggd}|jjdD]p}|ddj\}}|jj |}||vr!t j td|z||j|r|S)N)currentrrr bisect.statersunknown bisect kind %s) vfs tryreadlinessplitr!lookuprr%rr()rr/lkindr#s r load_staterVsb"r BE XX " "? 3sV\\^ d ''- u ++a 9:TAB B d 4 4 Lr c |jddd}|j5t|D]+}||D]!}|jd|t |fz#-|j dddy#1swYyxYw)NrOwT) atomictemps%s %s )rPwlocksortedwriterclose)rr/frUr#s r save_stater_sj $48A 5MDd  dCI%667$"  s A A88Bcr|jjdr|jjdyy)z+remove any bisect state from the repositoryrON)rPexistsunlink)rs r resetstatercs' xx' ((r c|dr|dry|dstjtdtjtd)z`check we have both 'good' and 'bad' to define a range Raise StateError exception otherwise.rrTs'cannot bisect (no known good revisions)s&cannot bisect (no known bad revisions))r StateErrorr)r/s r checkstaterfsI W~%- >q!KLMMq!JKLLr c#hK d|g|d<t||y#|g|d<t||wxYww)NrN)r_)rr/r#s r restore_staterhs=  !Fj4"Fj4s22/2cTt|}|dvr1t|jjj||Sd}|j d}t |dk(rd}d}nd}d}d }d |||fz}d ||fz} d } d } d| | |fz} |dk(r|j |S|dk(r|j |S|dk(r|j | S|dk(r|j | S|dk(r|j |S|dk(r|j |Stjtd)a Return a list of revision(s) that match the given status: - ``good``, ``bad``, ``skip``: csets explicitly marked as good/bad/skip - ``goods``, ``bads`` : csets topologically good/bad - ``range`` : csets taking part in the bisection - ``pruned`` : csets that are goods, bads or skipped - ``untested`` : csets whose fate is yet unknown - ``ignored`` : csets ignored due to DAG topology - ``current`` : the cset currently being bisected )rrr rNs9( bisect(bad)::bisect(good) | bisect(good)::bisect(bad) )sbisect(good)::bisect(bad)rsbisect(good)::s ::bisect(bad)s::bisect(good)s bisect(bad)::s bisect(skip)s( (%s) | (%s) | (%s) )s( (%s) - (%s) )s::bisect(bad) - ::bisect(good)s::bisect(good) - ::bisect(bad)s( ( (%s) | (%s) ) - (%s) )srangespruneduntestedignoredgoodsbadssinvalid bisect state) rVmapr!rrrr$r ParseErrorr) rstatusr/range_tgoodsbadsskipspruneduntestedibaigaignoreds rr,r,sX t E 774??$..22E&MBBM YY3 4 r7a<%E#D&E#D *eT5-AA&7 0//3U2CC X 99U# # y 99V$ $ { "99X& & z !99W% % x 99U# # w 99T? """1%<#=> >r c|jj|}|t|dvr tdS|t|dvr tdS|t|dvr tdS|t|dvs|t|dvr tdS|t|dvr tdS|t|dvr td S|t|d vr td Sy) Nrrr sskippedrjrNrkrlsgood (implicit)rmsbad (implicit))rrr,r)rr#rs rlabelr|s ..  T "C c$  z c$y c$  } c$ $$s4/D(D~ c$ ##} c$!!#$$ c$  "## r c|j}t|dk(r||r|jtdn|jtd|j ||dt ||||}|p|jtd|znR|r|jtdn|jtd|D]}|j |||j y)NrsThe first good revision is: sThe first bad revision is: rsNot all ancestors of this changeset have been checked. Use bisect --extend to continue the bisection from the common ancestor, %s. sCDue to skipped revisions, the first good revision could be any of: sBDue to skipped revisions, the first bad revision could be any of: )r!r$r\rshowrLr])uirr/ displayerrHr extendnoders r printresultr-s ?? D 5zQ  HHQ78 9 HHQ67 8tE!H~& ueT:  ! HHB     HH8  HH7  A NN47 # OOr )r contextlibi18nrr#rrrrDrLrVr_rcrfcontextmanagerrhr,r|rr r rrsfr$j ) M   A?H>%r