6h,SSKJr SSKrSSKrSSKJr SSKJrJr SSK J r Sr Sr S r S rS rS r\R"S 5rSrSrSrg)) annotationsN)_)hexshort)errorc8^^TR5mTRmTRnUSVs1sHnTRU5iM nnUU4SjnSnU"USUS5upxU(dSnU"USUS5upxTR U5n U(d|[ US5S:Xa=[ US5S:Xa+USUS:wa[ R"[S55e[ R"[S 5U[U 54-5e0n [R"U/5n /n U (ayU R5n X/:XaXU RU 5 U"U 5H;nUS :wdM X;aXRU 5 M%U /X'U RU5 M= U (aMyU R5 [ U 5nU Vs/sHnUU;dM UU:wdMUPM nnUS:XdU(d%U Vs/sHnTR U5PM snS U4$US -nS nS n[5nU GH7n U U;a#UR!U R#U /55 M-X=(d U /nS X'[ U5nUU- n[%UU5nUU:aX;a UnU nUU:Xa OUU:a(X;a#UR!U R#U /55 M/nU R#U /5H=nUU(a['[UUU-55UU'M,URU5 M? U(dMUR)S 5nUH nUU/-UU'M URU5 UUU'GM: UceTR U5nU/X4$s snfs snfs snf)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. skipc>[UVs/sHnTRU5PM sn5n[R"S5nTR SXU5Hn/XE'M XCcUS4$X44$s snf)Ncg)Nr 3/usr/lib/python3/dist-packages/mercurial/hbisect.py0bisect..buildancestors..*sDrs(%ln::%d) - (::%ln))minrev collections defaultdictrevs)badgoodnbadrev ancestorsr changelogrepos rbuildancestorsbisect..buildancestors(sv41immA&45++L9 993T4HCINI   $4<   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` @rbisectrGs ?? DI$$I&+Gn 5nIMM! nD 5! D&uV}eGnEF *5>5=I .. C  f ! #E'N#q(f w/++a NOP Pkk : ;uSz" #  H   vh 'EJ mmo >R    c "!#2:' --c2*- T* ' %OO j/C&LJq1D=qF{JIL axy,67Jq"J7DAAQhGHH UF &= MM(,,sB/ 0  N #se  F !GAq  8 HH w;3? MM(,,sB/ 0  c2&A|#C ! q(8$9: !   # ' 9MM!$E A3w !  HHUO Ie KN   x(I K ##I 6bM7sN  NN'NNcXSR5n[U5S:adU(aUSnOUSn[UVs1sHofR5iM sn[U5-5nUS:XaUSR US5$gs snf)Nrrr r!)parentsr'r&r-ancestor)rr2nodesrrIsideinums r extendrangerOs8n$$&G 7|a =D>DW-W668W-D 9: !81:&&wqz2 2 .sB c4////S.nURRS5HqnUSSR5up4UR5R U5nX1;a"[ R "[S5U-5eXRU5 Ms U$)N)currentr!r r bisect.stater"sunknown bisect kind %s) vfs tryreadlinessplitr$lookuprr(rr+)rr2lkindr&s r load_staterYsb"r BE XX " "? 3sV\\^  ''-  ++a 9:TAB B 4 4 Lrc URSSSS9nUR5 [U5H-nXH"nURSU[ U54-5 M$ M/ UR 5 SSS5 g!,(df  g=f)NrRwT) atomictemps%s %s )rSwlocksortedwriterclose)rr2frXr&s r save_staterbsh $48A 5MD  dCI%667$"  s A A88 Bc|URRS5(aURRS5 gg)z+remove any bisect state from the repositoryrRN)rSexistsunlink)rs r resetstaterfs* xx'' ((rcUS(a US(agUS(d[R"[S55e[R"[S55e)z\check we have both 'good' and 'bad' to define a range Raise StateError exception otherwise.r!r Ts'cannot bisect (no known good revisions)s&cannot bisect (no known bad revisions))r StateErrorr)r2s r checkstaterisI W~%- >q!KLMMq!JKLLrc#d# Sv U/US'[X5 g!U/US'[X5 f=f7f)NrQ)rb)rr2r&s r restore_staterks8  !Fj4"Fj4s00-0c`[U5nUS;a0[UR5RRX!5$SnUR S5n[ U5S:XaSnSnOSnSnS nS XVU4-nS X84-n S n S n SXU4-n US:XaUR U5$US:XaUR U5$US:XaUR U 5$US:XaUR U 5$US:XaUR U5$US:XaUR U5$[R"[S55e)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 r rQs9( 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) rYmapr$rrrr'r ParseErrorr) rstatusr2range_tgoodsbadsskipspruneduntestedibaigaignoreds rr/r/sP t E 774??$..22EMBBM YY3 4 r7a<%E#D&E#D *e5-AA&7 0//3U2CC X 99U# # y 99V$ $ { "99X& & z !99W% % x 99U# # w 99T? """1%<#=> >rcURRU5nU[US5;a [S5$U[US5;a [S5$U[US5;a [S5$U[US5;dU[US5;a [S5$U[US5;a [S5$U[US5;a [S 5$U[US 5;a [S 5$g) Nr!r r sskippedrmrQrnrosgood (implicit)rpsbad (implicit))rrr/r)rr&rs rlabelrs ..  T "C c$  z c$y c$  } c$ $$s4/D(D~ c$ ##} c$!!#$$ c$  "## rcUR5n[U5S:XaU(aUR[S55 OUR[S55 UR XS5 [ XXE5nUbUR[S5U-5 OXU(aUR[S55 OUR[S55 UHnUR X5 M UR 5 g)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_rshowrOr`)uirr2 displayerrKr extendnoders r printresultr.s ?? D 5zQ  HHQ78 9 HHQ67 8t!H~& e:  ! HHB     HH8  HH7  A NN47 # OOr) __future__rr contextlibi18nrr&rrrrGrOrYrbrfricontextmanagerrkr/rrr rrrsi#r$j ) M   A?H>%r