a &0_+@sddlmZddlZddlZddlmZddlmZmZddl m Z ddZ d d Z d d Z d dZddZddZejddZddZddZddZdS))absolute_importN)_)hexshort)errorcsjj}fdd|dDfdd}d}||d|d\}|spd }||d|d\}}|st|dd krt|dd kr|d|dkrttd ttd t|fi}t g}g} |rX| } || gkr| | || D]>} | d kr| |vr>||  | n| g|| <| | qq| t| } fdd| D} | d ks| sfdd| Dd|fS| d}d}d }t}| D]} | |vr||| gq|| p| g}d|| <t|}| |}t||}||kr@| vr@|}| }||kr@q||krj| vrj||| gq|| gD]8}||rtt|||||<n||g||<qvq|dusJ|}|g| |fS)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. csh|]}|qSrev.0n changelogr3/usr/lib/python3/dist-packages/mercurial/hbisect.py &zbisect..skipcs\tfdd|D}tdd}d||D] }g||<q2||durT|dfS||fS)Ncsg|]}|qSrr r rrr )rz2bisect..buildancestors..cSsdS)Nrrrrr*rz0bisect..buildancestors..s!descendants(%ln) - ancestors(%ln))min collections defaultdictrevs)badgoodbadrev ancestorsr )rreporrbuildancestors(s  zbisect..buildancestorsFbadgoodTrs+starting revisions are not directly relateds)inconsistent state, %d:%s is good and badcs g|]}|vr|kr|qSrrr c)rskiprrrWrzbisect..csg|]}|qSrnoder#rrrrYrrN) unfilteredrZ parentrevsr'lenrAbortrrrdequepopleftappendsortsetupdategetrlist)rstateZ clparentsrrrrZchildrenZvisitZ candidatesr prevZtotZ unskippedZperfectZbest_revZbest_lenZpoisonaxyvaluer$Z best_noder)rrrr%rbisects                r:cCsj||d}t|dkrf|r*|d}n|d}tdd|Dt|@}|dkrf|d|dSdS)Nrrr r!cSsh|] }|qSrr&)r irrrrrzextendrange..)parentsr*r0Zancestor)rr4nodesrr<ZsideZnumrrr extendranges  r>cCsnggggd}|jdD]N}|dd\}}||}||vrZttd||||q|S)N)currentr!r r bisect.stater"sunknown bisect kind %s) vfsZ tryreadlinessplitr)lookuprr+rr.)rr4lkindr'rrr load_statesrFc Csv|jdddd}|Jt|D](}||D]}|d|t|fq.q"|Wdn1sh0YdS)Nr@wT)Z atomictemps%s %s )rAZwlocksortedwriterclose)rr4frEr'rrr save_states    rLcCs|jdr|jddS)z+remove any bisect state from the repositoryr@N)rAexistsunlink)rrrr resetstates rOcCs>|dr|drdS|ds,ttdnttddS)z[check we have both 'good' and 'bad' to define a range Raise Abort exception otherwise.r!r Ts'cannot bisect (no known good revisions)s&cannot bisect (no known bad revisions)N)rr+r)r4rrr checkstates rPc cs:zdVW|g|d<t||n|g|d<t||0dS)Nr?)rL)rr4r'rrr restore_states   rQc Cst|}|dvr&t|jj||Sd}|d}t|dkrJd}d}nd}d}d }d |||f}d ||f} d } d } d| | |f} |dkr||S|dkr||S|dkr|| S|dkr|| S|dkr||S|dkr||Stt ddS)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 )r!r rr?s9( 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 stateN) rFmapr)rr rr*rZ ParseErrorr) rZstatusr4rangeZ_tZgoodsZbadsZskipsZprunedZuntestedZibaZigaZignoredrrrr2s:            r2cCs|j|}|t|dvr"tdS|t|dvr8tdS|t|dvrNtdS|t|dvsj|t|dvrrtdS|t|dvrtdS|t|dvrtd S|t|d vrtd SdS) Nr!r rsskippedrRr?rSrTsgood (implicit)rUsbad (implicit))rr r2r)rr'r rrrlabels  rXcCs|}t|dkrr|r(|tdn|td|||dt||||}|dur|td|n:|r|tdn|td|D]}|||q|dS)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*rIrZshowr>rJ)Zuirr4Z displayerr=rZ extendnoder rrr printresult$s:  rY)Z __future__rr contextlibZi18nrr'rrrr:r>rFrLrOrPcontextmanagerrQr2rXrYrrrr s   k    D