6h,SrSSKJr SSKrSSKrSSKrSSKrSSKJr SSK J r SSK J r J r JrJrJrJrJrJrJrJr SS KJr \R0(aSSKrSS KJrJrJr SS KJr Sr"S S 5rS/Sjr S/Sjr!S0Sjr"S/Sjr#Sr$Sr%\RL"SSS9"SS55r'Sr(Sr)Sr*Sr+Sr,Sr-Sr.Sr/"S S!\R`5r1"S"S#\15r2"S$S%\15r3"S&S'\15r4"S(S)\45r5"S*S+5r6"S,S-5r7S.r8g)1z4Helper class to compute deltas stored inside revlogs) annotationsN)nullrev)_) COMP_MODE_DEFAULTCOMP_MODE_INLINECOMP_MODE_PLAINDELTA_BASE_REUSE_FORCEDELTA_BASE_REUSE_NOKIND_CHANGELOG KIND_FILELOGKIND_MANIFESTLOGREVIDX_ISCENSOREDREVIDX_RAWTEXT_CHANGING_FLAGS)attr)errormdiffutil)flagutilc@\rSrSrSrS SjrSrSrSrSr Sr S r g ) _testrevlog5z)minimalist fake revlog to use in doctestscSSKJn XlUR5UlX RlX0RlUR5UlUR5Ul [U5Ul SUl g)z.data is an list of revision payload boundariesr)revlogN)r_data DataConfig data_configsr_density_thresholdsr_min_gap_size DeltaConfig delta_config FeatureConfigfeature_configset _snapshotindex)selfdatadensitymingapsnapshotrs >/usr/lib/python3/dist-packages/mercurial/revlogutils/deltas.py__init___testrevlog.__init__8sg !,,.07-+1("..0$224X cJU[:XagUS:XagURUS- $)Nrrrrr)revs r.start_testrevlog.startEs) '> !8zz#'""r1c6U[:XagURU$Nrr3r4s r.end_testrevlog.endLs '>zz#r1cHURU5URU5- $Nr:r6r4s r.length_testrevlog.lengthQsxx}tzz#..r1c,[UR5$r=)lenrr)s r.__len___testrevlog.__len__Ts4::r1c4U[:XagXR;$)NT)rr'r4s r. issnapshot_testrevlog.issnapshotWs '>nn$$r1)rr'rr#r%r(N)?r) __name__ __module__ __qualname____firstlineno____doc__r/r6r:r?rDrG__static_attributes__rJr1r.rr5s#3 # /%r1rc#2^# Ub [UTRR5n[TRSS5nUcU4SjnU"UTRR TRR5Hn[ TXB5ShvN M gN 7f)aslice revs to reduce the amount of unrelated data to be read from disk. ``revs`` is sliced into groups that should be read in one time. Assume that revs are sorted. The initial chunk is sliced until the overall density (payload/chunks-span ratio) is above `revlog.data_config.sr_density_threshold`. No gap smaller than `revlog.data_config.sr_min_gap_size` is skipped. If `targetsize` is set, no chunk larger than `targetsize` will be yield. For consistency with other slicing choice, this limit won't go lower than `revlog.data_config.sr_min_gap_size`. If individual revisions chunk are larger than this limit, they will still be raised individually. >>> data = [ ... 5, #00 (5) ... 10, #01 (5) ... 12, #02 (2) ... 12, #03 (empty) ... 27, #04 (15) ... 31, #05 (4) ... 31, #06 (empty) ... 42, #07 (11) ... 47, #08 (5) ... 47, #09 (empty) ... 48, #10 (1) ... 51, #11 (3) ... 74, #12 (23) ... 85, #13 (11) ... 86, #14 (1) ... 91, #15 (5) ... ] >>> revlog = _testrevlog(data, snapshot=range(16)) >>> list(slicechunk(revlog, list(range(16)))) [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]] >>> list(slicechunk(revlog, [0, 15])) [[0], [15]] >>> list(slicechunk(revlog, [0, 11, 15])) [[0], [11], [15]] >>> list(slicechunk(revlog, [0, 11, 13, 15])) [[0], [11, 13, 15]] >>> list(slicechunk(revlog, [1, 2, 3, 5, 8, 10, 11, 14])) [[1, 2], [5, 8, 10, 11], [14]] Slicing with a maximum chunk size >>> list(slicechunk(revlog, [0, 11, 13, 15], targetsize=15)) [[0], [11], [13], [15]] >>> list(slicechunk(revlog, [0, 11, 13, 15], targetsize=20)) [[0], [11], [13, 15]] Slicing involving nullrev >>> list(slicechunk(revlog, [-1, 0, 11, 13, 15], targetsize=20)) [[-1, 0], [11], [13, 15]] >>> list(slicechunk(revlog, [-1, 13, 15], targetsize=5)) [[-1], [13], [15]] Nslicechunktodensityc>[TXU5$r=)_slicechunktodensity)xyzrs r.slicechunk..s)=faA)Nr1)maxrr!getattrr(r _slicechunktosize)rrevs targetsizedensityslicingchunks` r. slicechunkra]sxV%7%7%G%GH V\\+@$GNN //** %VU???  @sBB B Bc#:# UbSU::deURUS5nURUS5nXC- nUbXR::aUv gSnSn[U5n[U5 UHtupURU 5U- n UR U 5n X::a U (aU S-nO/[ XXg5n U (aU v U nURU 5nU S-nU (aMt O [ U5nXC- U:aUnX- S::aOURXS- 5nX- n X:a4Xv- S::aO+XwU- S--nURXS- 5nX- n X:aM4[ XXg5n U (aU v UnURX5nXC- U:aM[ XU5n U (aU v gg7f)a slice revs to match the target size This is intended to be used on chunk that density slicing selected by that are still too large compared to the read garantee of revlog. This might happens when "minimal gap size" interrupted the slicing or when chain are built in a way that create large blocks next to each other. >>> data = [ ... 3, #0 (3) ... 5, #1 (2) ... 6, #2 (1) ... 8, #3 (2) ... 8, #4 (empty) ... 11, #5 (3) ... 12, #6 (1) ... 13, #7 (1) ... 14, #8 (1) ... ] == All snapshots cases == >>> revlog = _testrevlog(data, snapshot=range(9)) Cases where chunk is already small enough >>> list(_slicechunktosize(revlog, [0], 3)) [[0]] >>> list(_slicechunktosize(revlog, [6, 7], 3)) [[6, 7]] >>> list(_slicechunktosize(revlog, [0], None)) [[0]] >>> list(_slicechunktosize(revlog, [6, 7], None)) [[6, 7]] cases where we need actual slicing >>> list(_slicechunktosize(revlog, [0, 1], 3)) [[0], [1]] >>> list(_slicechunktosize(revlog, [1, 3], 3)) [[1], [3]] >>> list(_slicechunktosize(revlog, [1, 2, 3], 3)) [[1, 2], [3]] >>> list(_slicechunktosize(revlog, [3, 5], 3)) [[3], [5]] >>> list(_slicechunktosize(revlog, [3, 4, 5], 3)) [[3], [5]] >>> list(_slicechunktosize(revlog, [5, 6, 7, 8], 3)) [[5], [6, 7, 8]] >>> list(_slicechunktosize(revlog, [0, 1, 2, 3, 4, 5, 6, 7, 8], 3)) [[0], [1, 2], [3], [5], [6, 7, 8]] Case with too large individual chunk (must return valid chunk) >>> list(_slicechunktosize(revlog, [0, 1], 2)) [[0], [1]] >>> list(_slicechunktosize(revlog, [1, 3], 1)) [[1], [3]] >>> list(_slicechunktosize(revlog, [3, 4, 5], 2)) [[3], [5]] == No Snapshot cases == >>> revlog = _testrevlog(data) Cases where chunk is already small enough >>> list(_slicechunktosize(revlog, [0], 3)) [[0]] >>> list(_slicechunktosize(revlog, [6, 7], 3)) [[6, 7]] >>> list(_slicechunktosize(revlog, [0], None)) [[0]] >>> list(_slicechunktosize(revlog, [6, 7], None)) [[6, 7]] cases where we need actual slicing >>> list(_slicechunktosize(revlog, [0, 1], 3)) [[0], [1]] >>> list(_slicechunktosize(revlog, [1, 3], 3)) [[1], [3]] >>> list(_slicechunktosize(revlog, [1, 2, 3], 3)) [[1], [2, 3]] >>> list(_slicechunktosize(revlog, [3, 5], 3)) [[3], [5]] >>> list(_slicechunktosize(revlog, [3, 4, 5], 3)) [[3], [4, 5]] >>> list(_slicechunktosize(revlog, [5, 6, 7, 8], 3)) [[5], [6, 7, 8]] >>> list(_slicechunktosize(revlog, [0, 1, 2, 3, 4, 5, 6, 7, 8], 3)) [[0], [1, 2], [3], [5], [6, 7, 8]] Case with too large individual chunk (must return valid chunk) >>> list(_slicechunktosize(revlog, [0, 1], 2)) [[0], [1]] >>> list(_slicechunktosize(revlog, [1, 3], 1)) [[1], [3]] >>> list(_slicechunktosize(revlog, [3, 4, 5], 2)) [[3], [5]] == mixed case == >>> revlog = _testrevlog(data, snapshot=[0, 1, 2]) >>> list(_slicechunktosize(revlog, list(range(9)), 5)) [[0, 1], [2], [3, 4, 5], [6, 7, 8]] Nrrr)r6r: enumeratenextrG _trimchunkrB)rr]r^ startdataenddatafullspan startrevidx endrevidxiterrevsidxrspanr-r`nbitem localenddatas r.r\r\sF  j0 0 T!W%Ijjb"G"HX3 KIHNzz!}y($$Q'  (aIv[DE K QIaIx &YF  * ,  1 $ zz$1}"56 '&!+ k1a7 7I!::dq=&9:L+D  6@ K LL!23 !  * ,$ v[ 1E   sCFA3F 4FFc#^# URnURm[U5S::aUv g[X5nXS:aUv gUn[ U4SjU55nU(aU[ U5- nOSnX:aUv g/n Sn [ U5H?upU"U 5n T"U 5nUS:XaMU bX- nX:aU RX45 X-n MA U R5 /nU (aRX:aMU R5unnURU5 Xo-nUS:aU[ U5- nOSnU (aX:aMMUR5 SnUHn[XUU5nU(aUv UnM [XU5nU(aUv gg7f)aslice revs to reduce the amount of unrelated data to be read from disk. ``revs`` is sliced into groups that should be read in one time. Assume that revs are sorted. The initial chunk is sliced until the overall density (payload/chunks-span ratio) is above `targetdensity`. No gap smaller than `mingapsize` is skipped. >>> revlog = _testrevlog([ ... 5, #00 (5) ... 10, #01 (5) ... 12, #02 (2) ... 12, #03 (empty) ... 27, #04 (15) ... 31, #05 (4) ... 31, #06 (empty) ... 42, #07 (11) ... 47, #08 (5) ... 47, #09 (empty) ... 48, #10 (1) ... 51, #11 (3) ... 74, #12 (23) ... 85, #13 (11) ... 86, #14 (1) ... 91, #15 (5) ... ]) >>> list(_slicechunktodensity(revlog, list(range(16)))) [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]] >>> list(_slicechunktodensity(revlog, [0, 15])) [[0], [15]] >>> list(_slicechunktodensity(revlog, [0, 11, 15])) [[0], [11], [15]] >>> list(_slicechunktodensity(revlog, [0, 11, 13, 15])) [[0], [11, 13, 15]] >>> list(_slicechunktodensity(revlog, [1, 2, 3, 5, 8, 10, 11, 14])) [[1, 2], [5, 8, 10, 11], [14]] >>> list(_slicechunktodensity(revlog, [1, 2, 3, 5, 8, 10, 11, 14], ... mingapsize=20)) [[1, 2, 3, 5, 8, 10, 11], [14]] >>> list(_slicechunktodensity(revlog, [1, 2, 3, 5, 8, 10, 11, 14], ... targetdensity=0.95)) [[1, 2], [5], [8, 10, 11], [14]] >>> list(_slicechunktodensity(revlog, [1, 2, 3, 5, 8, 10, 11, 14], ... targetdensity=0.95, mingapsize=12)) [[1, 2], [5, 8, 10, 11], [14]] rNc34># UH nT"U5v M g7fr=rJ).0rnr?s r. '_slicechunktodensity..s/$Qvayy$sg?r) r6r?rB segmentspansumfloatrdappendsortpoprf)rr] targetdensity mingapsizer6deltachainspanreaddata chainpayloadr+gapsprevendir5revstartrevlengapsizeselectedgapidxprevidxrmr`r?s @r.rTrTCsb LLE ]]F 4yA~  .N" H/$//L~!66  DGD/: Q;   (G# WL)#"  IIKH 7*((*  a<"U8_4GG 7* MMOG6#6 K  vW -E   s D6F ;AF cURnUc [U5nXS- [U5:a?US:a9X2:a4U"XS- 5S:Xa#US-nUS:aX2:aU"XS- 5S:XaM#XU$)a.returns revs[startidx:endidx] without empty trailing revs Doctest Setup >>> revlog = _testrevlog([ ... 5, #0 ... 10, #1 ... 12, #2 ... 12, #3 (empty) ... 17, #4 ... 21, #5 ... 21, #6 (empty) ... ]) Contiguous cases: >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 0) [0, 1, 2, 3, 4, 5] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 0, 5) [0, 1, 2, 3, 4] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 0, 4) [0, 1, 2] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 2, 4) [2] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 3) [3, 4, 5] >>> _trimchunk(revlog, [0, 1, 2, 3, 4, 5, 6], 3, 5) [3, 4] Discontiguous cases: >>> _trimchunk(revlog, [1, 3, 5, 6], 0) [1, 3, 5] >>> _trimchunk(revlog, [1, 3, 5, 6], 0, 2) [1] >>> _trimchunk(revlog, [1, 3, 5, 6], 1, 3) [3, 5] >>> _trimchunk(revlog, [1, 3, 5, 6], 1) [3, 5] rr)r?rB)rr]startidxendidxr?s r.rfrfsL]]F ~T QJ#f+% QJ6,aZ8H1IQ1N aKF QJ6,aZ8H1IQ1N   r1cfU(dgURUS5nX RUS5- $)ayGet the byte span of a segment of revisions revs is a sorted array of revision numbers >>> revlog = _testrevlog([ ... 5, #0 ... 10, #1 ... 12, #2 ... 12, #3 (empty) ... 17, #4 ... ]) >>> segmentspan(revlog, [0, 1, 2, 3, 4]) 17 >>> segmentspan(revlog, [0, 4]) 17 >>> segmentspan(revlog, [3, 4]) 5 >>> segmentspan(revlog, [1, 2, 3,]) 7 >>> segmentspan(revlog, [1, 3]) 7 rrcr>)rr]r:s r.rwrws20  **T"X C d1g& &&r1c[R"S5nUSU[R"UR U5[ U5U- 5:XaX'SnO'UR U5n [R"X5n[R"XU5n U (aURXX4S9 U[-(a"[R"[S5U-5eU$![Ra U[-(deU$f=f)zlllN)p1p2snode %s is not censored)structcalcsizerreplacediffheaderrawsizerBrevisionpatchrprocessflagsraw checkhashrr StorageErrorrCensoredNodeError) rbaserevdeltarrflags expectednodehlenfulltextbasetext validatehashs r._textfromdeltars ??7 #D Ud|u..wUd!2<??7+;;x/ //%H    X  B $ $$$,- <  % O  " "(( ) O s=AC#DDT)slotsfrozenc$\rSrSr\R "5r\R "5r\R "5r\R "5r \R "5r \R "5r \R "5r \R "5r Srg) _deltainfoi3rJN)rKrLrMrNribdistancedeltalenr*base chainbasechainlencompresseddeltalen snapshotdepthrPrJr1r.rr3s[wwyHwwyH 779D 779D IwwyHGGIMr1rc $URSS:XdURS5e[URURS- SURS4URUR UR URUR5$)zturn into a "u" (no-compression) into no-compression without header This is useful for revlog format that has better compression method. rurr1) r*rrrrrrrr)rs r.drop_u_compressionr?s~ ::a=D /%**Q-/    ejjm         r1i unspecifiedcachedparentsr-prevfullc\rSrSrSrS SjrSrSrSr\ S5r \ RS S j5r \ RS 5rS rg)_BaseDeltaSearchiezperform the search of a good delta for a single revlog revision note: some of the deltacomputer.finddeltainfo logic should probably move here. Nc Ub*US[:wdURR(aeXlX lUR UlX0lX@lXPlX`l Uc[UR5Ul Xpl Uc [5nXl [1Ul[ UlSUlUR'5 g)Nr)r r# general_deltarrevinfotextlenrr cachedeltaexcluded_basesrB target_rev SnapshotCachesnapshot_cachertested_STAGE_UNSPECIFIED current_stage current_group _init_group) r)rrrrrrrrs r.r/_BaseDeltaSearch.__init__ls  !} 66&&44  5   $,  !$++.DO$  !*_N,i /! r1c`URU5(dgURU5(dggzReturns True if the given delta is good. Good means that it is within the disk span, disk size, and chain length bounds that we know to be performant. FT)_is_good_delta_info_universal!_is_good_delta_info_chain_qualityr) deltainfos r.is_good_delta_info#_BaseDeltaSearch.is_good_delta_infos/ 11)<<55i@@r1cUcgURRbHURRS[:wd'URRR (aeURR UR:agg)zReturns True if the given delta is good. This performs generic checks needed by all format variants. This is used by is_good_delta_info. FrT)rrr rr#rrrrs r.r._BaseDeltaSearch._is_good_delta_info_universalst   LL # # +||&&q)-CC;;++99  : <<  )"4"4 4r1cURRS-nURRRnU(d UR n[ X25nURRR(dX1R :agURR[-nXAR:agURRR(a/URRRUR:agg)zReturns True if the chain associated with the delta is good. This performs checks for format that use delta chains. This is used by is_good_delta_info. FT) rrrr#max_deltachain_spanrrZ sparse_revlogLIMIT_DELTA2TEXTr max_chain_lenr)r)r defaultmaxmaxdistmax_chain_datas r.r2_BaseDeltaSearch._is_good_delta_info_chain_qualitys\\))A- ++**>>((Gg* ((66,,,--0@@ 88 8 KK $ $ 2 2 ((669K9KKr1cURSL$)z1True when all possible candidate have been testedN)rrCs r.done_BaseDeltaSearch.dones!!T))r1cg)aOmove to the next group to test The group of revision to test will be available in `self.current_group`. If the previous group had any good delta, the best one can be passed as the `good_delta` parameter to help selecting the next group. If not revision remains to be, `self.done` will be True and `self.current_group` will be None. NrJr) good_deltas r. next_group_BaseDeltaSearch.next_groups r1cgr=rJrCs r.r_BaseDeltaSearch._init_groups r1) rrrrrrrrrrrr)NNNr=)rKrLrMrNrOr/rrrpropertyrabcabstractmethodrrrPrJr1r.rresp&P :1f**        r1rc(\rSrSrSrSrSSjrSrg)_NoDeltaSearchizaSearch for no delta. This search variant is to be used in case where we should not store delta. c[Ulgr=) _STAGE_FULLrrCs r.r_NoDeltaSearch._init_groups (r1Ncgr=rJrs r.r_NoDeltaSearch.next_groups r1rr=rKrLrMrNrOrrrPrJr1r.rrs ) r1rc(\rSrSrSrSrSSjrSrg)_PrevDeltaSearchizSearch for delta against the previous revision only This search variant is to be used when the format does not allow for delta against arbitrary bases. c[UlURS- /UlURR UR5 gNr) _STAGE_PREVrrrrupdaterCs r.r_PrevDeltaSearch._init_groups6("oo12 4--.r1Nc([UlSUlgr=)rrrrs r.r_PrevDeltaSearch.next_group!s(!r1)rrr=rrJr1r.rrs / "r1rcX\rSrSrSrSrSrSSjrSrSr S r S r S r S r S rSrg)_GeneralDeltaSearchi&z1Delta search variant for general-delta repositorycURRR(deUR5UlSUlUR bUR S[:aURUR S5(a^[Ul UR S4Ul SUl URUl URRUR5 gUR!5 g)Nrr)rr#r _iter_groups_candidates_iterator _last_goodrr _pre_filter_rev _STAGE_CACHEDr_internal_group _internal_idxrrr_next_internal_grouprCs r.r_GeneralDeltaSearch._init_group)s{{''5555$($5$5$7! OO '"%88$$T__Q%788"/D $(OOA$6#8D !"D !%!5!5D  KK  t11 2  % % 'r1cjSUlURRUR5nUbUR U5nXlUR cSUlg[UR 5S:XaUR5 gURRRnUS:a*UR SUUlU=RU- slO9UR UlU=R[UR 5- slURRUR 5 gr9)rrsendr_pre_filter_candidate_revsrrrBrrr#candidate_group_chunk_sizerr)r)group chunk_sizes r.r(_GeneralDeltaSearch._next_internal_groupBs))..t?  33E:E$    '!%D  %% &! + OO 11LLJA~%)%9%9+:%F"""j0"%)%9%9"""c$*<*<&==" KK  t11 2r1NcURnUbXlUR[:Xa UbSUlSUlSUlSUlgUR [UR5:a~X!:wayURRRnUR U-nURUR UUlURRUR 5 X@lgUR5 gr=)rrrrrrrrBrr#r rrr)r)rold_goodrnext_idxs r.r_GeneralDeltaSearch.next_groupXs??  !(O    .:3I(,D %#'D !%D !%D     T%9%9!: :  "11LLJ))J6H!%!5!5""X"D  KK  t11 2!)   % % 'r1cURRnURRnURn/nUHnU[:XdIXd;dDU"U5(d7UR U5 U"U5nU[:XdXd;dU"U5(dM7UR U5(aURU5 MURR U5 M U$)a(filter possible candidate before computing a delta This function use various criteria to pre-filter candidate delta base before we compute a delta and evaluate its quality. Such pre-filter limit the number of computed delta, an expensive operation. return the updated list of revision to test )rr? deltaparentrraddrrz)r) temptative deltalengthrrr r5s r.r ._GeneralDeltaSearch._pre_filter_candidate_revs~skk(( kk-- Cg~+c:J:J 3!#&g~+c:J:J##C(( S! $ r1cU[:XagXR;agURbXR;agURbXR:agURR U5[ -(agg)zpre filtering that is need in all cases. return True if it seems okay to test a rev, False otherwise. used by _pre_filter_rev. FT)rrrrrrrr4s r._pre_filter_rev_universal-_GeneralDeltaSearch._pre_filter_rev_universalsm '> ++     *s6I6I/I ?? &3//+A ;;  S !$A Ar1cTURR[-nX RR U5:agURR U5up4URR R(a$X0RR R:agX$:agg)pre filtering that is needed in sparse revlog cases return True if it seems okay to test a rev, False otherwise. used by _pre_filter_rev. FT)rrrrr? _chaininfor#r)r)r5 deltas_limitr chainsizes r._pre_filter_rev_delta_chain/_GeneralDeltaSearch._pre_filter_rev_delta_chains||++.>> ++,,S1 1 #kk44S9 KK $ $ 2 2KK44BBB  #r1c`URU5(dgURU5(dggz;return True if it seems okay to test a rev, False otherwiseFT)rr"r4s r.r#_GeneralDeltaSearch._pre_filter_revs---c22//44r1c#d# URUR4Vs/sHo[:wdMUPM nn[UlUR R R(d0[U5S:Xa!UR5 US4v US4v g[U5S:aUv ggs snf7f)Nrrr) rrr_STAGE_PARENTSrrr#delta_both_parentsrBr{)r)prs r. _iter_parents!_GeneralDeltaSearch._iter_parentss#ww0A0L10A+ ((;;G ! LLN1:- 1:-  \A MBsB0 B+B+A&% r1rcB\rSrSrSrSrSrSrSrSr Sr S r S r g ) _SparseDeltaSearchiz'Delta search variants for sparse-revlogcURU5(dgURU5(dgURU5(dggr)rr(_is_good_delta_info_snapshot_constraintsrs r.r%_SparseDeltaSearch.is_good_delta_infosC 11)<<55i@@< ++--c2"%dllW&TRRU5S$r9)r _deltachain)r5r)s r.rX9_SparseDeltaSearch._iter_snapshots_base..cs!8!8!=a!@r1rT)reverse)rr#rr_STAGE_SNAPSHOTrrrr collections defaultdictr&rdrGrminrrr]rZkeyssorteditems snapshotstuple)r)r deltachainr*r parents_snapscandidate_chainschainrms snapfloorall_revsotherrn max_depthdepthfloorsnapssiblingsrs` r._iter_snapshots_base'_SparseDeltaSearch._iter_snapshots_base_s{{''5555!!_444"@ #ww0A0L10A  $//4 3:;7aJqM7;%E#E*{{--a00"&&q)+&  a()A-  ""4;; :5%E OOE "&!!$2A 3  M..01Iu%E%e,=${{--a00$((+- !4!4!6EJCuH 3 3 = =a @A (0=x!519Ax=x() )u & &JE-F@**44W= =!aA=  F4L!!kB sQA-L*0 LL(L*/LCL*C#L*: L L AL** L%7L%=-L*c## URRR(de[UlSnUR 5nUH nUvnUcM O UGbUR bUR[:XdeSnXA:wa>UnURRUR5nU[:XaO U4vnXA:waM>URR(d3URRURURS-5 SnX:waIUn[[SURRUR555nUvnX:waMISv g7f)Nrc3$# UHov M g7fr=rJ)rtcs r.ru5_SparseDeltaSearch._iter_snapshots..sO&N1&Ns)rr#rrMrrcrrrrrrTrrUrR)r)r1groups candidatespreviousrchildrens r._iter_snapshots"_SparseDeltaSearch._iter_snapshotssF{{''5555,**, J##D!   2 2 >%%8 88H"{{..tyy97?"W} "&&00##**4;; A FH" Od&9&9&C&CDII&NOO&~ "  sAE(A.E(BE(#E(c#,# SnUR5H nUvnUcM Ol UbeURRR(deUR 5nUR S5nUbUvnUR U5nUbMSv g7fr=)r+rr#rrmr )r)r1r  iter_snaps r.r_SparseDeltaSearch._iter_groupss'')E;D* < <;;++99 99,,.INN4(E#"{!t,# sBA,BBrN) rKrLrMrNrOrr6rr;rcrmrrPrJr1r.r4r4s,1 8'R["z@r1r4c.\rSrSrSrSrSSjrSrSrg) ri)rT _start_rev_end_revc^[R"[5UlSUlSUlgr=)rNrOr&rTrsrtrCs r.r/SnapshotCache.__init__s"$005 r1c[U5nUS- nX$:agURc"URbeURXU5 O|URU::aX@R::d]X R:aURXURS- 5 URU:aURXRS-U5 URcURbeX@lX lO6[ URU5Ul[ URU5UlURUR::dURUR45eg)z$find snapshots from start_rev to tiprN)rBrsrt_updaterPrZ)r)r start_revnb_revsend_revs r.rSnapshotCache.updatesf+A+    ?? "==( (( LLG 4//Y.7mm3K??* V!0CD}}w& V]]Q%6@ ?? "==( ((#M'O!$//9=DO w7DM$--/ OO MM2  /r1c`URb<X R:d-X R:dURURX#45eURb<X0R:d-X0R:dURURX#45eURn[URS5(aURR XBU5 gUR nURnURX#5H+nU"U5(dMXE"U5RU5 M- g)z/internal method that actually do update contentN findsnapshots) rsrtrThasattrr(r~rrGr]r)r)rryr{cacherrGr5s r.rxSnapshotCache._updates&  '9}}+D @ OOT]]I ? @ & oo %==)@ @ OOT]]I ? @  6<< 1 1 LL & &u A ,,K**J{{96c??+c*+//47r1)rtrsrTN)r) rKrLrMrN __slots__r/rrxrPrJr1r.rrs7I  85r1rcl\rSrSrSrSSjr\S5rSrSr SSjr S r SS jr S r S rS rg) deltacomputeri&zobject capable of computing delta and finding delta for multiple revision This object is meant to compute and find multiple delta applied to the same revlog. NchXlX lUcSUlOX0lX@l[ 5UlgNF)r _write_debug _debug_search _debug_infor_snapshot_cache)r)r write_debug debug_search debug_infos r.r/deltacomputer.__init__-s3 '  !&D !- %,r1cHURSL=(d URSL$r=)rrrCs r. _gather_debugdeltacomputer._gather_debug=s#  ,L0@0@0LLr1c URnUSbUS$URnURnUSnUSn[UUUURUR UR UR5=orS'U$)zfBuilds a fulltext version of a revision revinfo: revisioninfo instance that contains all needed info rr)btextrrrrrrnode)r)rrrrrrrs r. buildtextdeltacomputer.buildtextAs   8 8O'' Q-1 ,    JJ JJ MM LL  8r1c$URnURU5nURU5(a5[R"UR U5[ U55nXT-nU$URU5n[R"Xt5nU$r=) rr iscensoredrrrrBrawdatatextdiff)r)rrrtheaderrptexts r._builddeltadiffdeltacomputer._builddeltadiffZs| NN7 #   T " ",,V^^D-A3q6JFJE  NN4(ENN5,E r1c URnURU5nURR(aUnO+Ub&X#S- :waSnXU4-n[R "U5eUnSn URR (a U[:XaSn OURR (aU(aURU5(deURUR5URUR5pXzU 4;a3URU5(a[URU5S5n Sn UR(aURSn U nU[:waoX:wajURRU5S:XaKURR!U5nU[:wa&X:wa!URRU5S:XaMKURRR"(aX:XaURSn U cUR%X!5n UR&(a!SnU[U 5-nUR)U5 URR*bU (a[U 5URR*-nUR,U - nUR&(aSnX-nUR)U5 UU:a%UR&(aSnUR)U5 gURU5U:a%UR&(aSnUR)U5 gUR.R1U 5unn[U5[U5-nUR3[U5S- 5nUU-UR5U5- nUR7U5unnUS- nUU- n[9UUUU4UUUUU 5$)NrsEgeneral delta cannot use delta for something else than `prev`: %d<-%drs2DBG-DELTAS-SEARCH: uncompressed-delta-size=%d s/DBG-DELTAS-SEARCH: projected-lower-size=%d s2DBG-DELTAS-SEARCH: DISCARDED (snapshot limit) s-DBG-DELTAS-SEARCH: DISCARDED (prev size) )rrr#rrProgrammingErrorrrrGr5rrrBrJrr?r lazy_deltarrrr?r_innercompressr:r6rr)r)rrr as_snapshotrr deltabasemsgrrrr cachebase currentbaserDrErr*roffsetdistrrs r._builddeltainfodeltacomputer._builddeltainfohsc$$T*    , ,I%$q.*@+j)),,S11!I    , ,g1EM  . .;$$Y// //ZZ +VZZ -CR(V->->y-I-I #F$6$6y$A!$D E    **1-I#Kw&'KK&&{3q8"kk55kB w&'KK&&{3q8{{''22{7J**1- =((7E   HC 3u: C   c "    / / ; E f11BBB $$OO}$$A h&   TN       r1c URU5nURRRU5n[ US5[ US5-=n=pgU=pSn Sn [ UUUUU U UU 5$)Nrr)rrrrrBr) r)rcurrrawtextr*rrrrrrrs r._fullsnapshotinfodeltacomputer._fullsnapshotinfos..){{!!**73/247|c$q'l/JJJX $$            r1c ^*Uc[UR5nURnURnURnS=pxUc [ 5nU(a[ R "5n UR5n X:S'URUR5nURUR5nU[:waURU5Sn OSn U[:waURU5Sn OSn XS'XS'UR(aUR[-(apUR!X5n U(aV[ R "5nUW - W S'U R"U S'SU S 'S U S 'SU S 'S U S'SU S'UR%U 5 U $Sn UR&R((GaURGbURS[*:XGaURSnU[:XaS nUR!X5n U(aSnGOX;aURSnUR-U5unn[U5[U5-nU(aUR/[U5S- 5nUR1U5nUU-UR3U5- nURU5unnUS- nUU- nX:XdX:XaSnSnO:UR5U5(dSnO!SnUR7U5S-nO SnSnSnSnSn[9UUUU4UUUUUS9n U bhU(a_[ R "5nUW - W S'U R"U S'SU S 'SU S 'SU S 'S U S'WcSU S'OUU S'UR%U 5 U $SnSnSnUc6URUR5nURUR5nUR:(aSnUU-nUR=U5 [UR5(aURR>(d[@nO^URR&RB(a[DnO2URR&R((a[FnO[HnU"URUUUUUUURJS9nURL(GdURNn U ceU n!US- nUR:(aSm*U b U R"m*Ub[U!5S:Xa USU!;aSn"OQUU!;dUU!;aSn"OBT*b[QU*4SjU!55(aSn"O"T*b[QU*4SjU!55(aSn"OSn"S nUU[U!5U"4-nUR=U5 /n#U bPUR:(a.S!nUU R"U RR4-nUR=U5 U#RUU 5 U!GHMn$UR:(aS"nUU$-nUR=U5 Sn%U$U:XaS#n%OIU$U:XaS$n%O@URR5U$5(a S%n%U%URR7U$5-n%U%bS&nUU%-nUR=U5 S'nUURRWU$5-nUR=U5 S(nUURRYU$5-nUR=U5 US- nUR:(a[ R "5n&UR[UU$UUR\[^:HS)9n'UR:(a0[ R "5n(S*nUU(W&- -nUR=U5 U'bURaU'5(aGUR:(a"S+nUU'RR-nUR=U5 U#RUU'5 GMUR:(a%S,nUU'RR-nUR=U5 GM#GM&UR:(dGM:S-nUR=U5 GMP U#(a [cU#S.S/9n UReU 5 URL(dGMU cS nUR!X5n OU R6(aSnOSnU(a[ R "5nUS :Xa0USL=(a$ US:H=(a US:H=(a US[:Hn)O5USL=(a* US:H=(a US:H=(a U R"US:Hn)UW - W S'U R"U S'UU S 'U)U S 'UU S 'UU S'U R6bU R6U S'OSU S'UR%U 5 U $)0aFind an acceptable delta against a candidate revision revinfo: information about the revision (instance of _revisioninfo) Returns the first acceptable candidate revision, as ordered by _candidategroups If no suitable deltabase is found, we return delta info for a full snapshot. `excluded_bases` is an optional set of revision that cannot be used as a delta base. Use this to recompute delta suitable in censor or strip context. Nrrrc p1-chain-len p2-chain-lenduration delta-basesearch_round_countFusing-cached-basedelta_try_countsfulltypesnapshot-depthrrsdeltassnapshot)rrr*rrrrrTsunknowns!DBG-DELTAS-SEARCH: SEARCH rev=%d )rs cached-deltasparentsc3,># UH oT:v M g7fr=rJrtrgrs r.ru.deltacomputer.finddeltainfo..-N 1$h s refine-downc3,># UH oT:v M g7fr=rJrs r.rurrrs refine-ups search-downs2DBG-DELTAS-SEARCH: ROUND #%d - %d candidates - %s s3DBG-DELTAS-SEARCH: CONTENDER: rev=%d - length=%d s'DBG-DELTAS-SEARCH: CANDIDATE: rev=%d sp1sp2s snapshot-%dsDBG-DELTAS-SEARCH: type=%s sDBG-DELTAS-SEARCH: size=%d sDBG-DELTAS-SEARCH: base=%d )rrs,DBG-DELTAS-SEARCH: delta-search-time=%f s/DBG-DELTAS-SEARCH: DELTA: length=%d (GOOD) s.DBG-DELTAS-SEARCH: DELTA: length=%d (BAD) s DBG-DELTAS-SEARCH: NO-DELTA cUR$r=)r)rUs r.rX-deltacomputer.finddeltainfo..sqzzr1)key)3rBrrrr&rtimer _one_dbg_datar5rrrrrrrrr_dbg_process_datar#rr rr:rr6rGrrrr_storedeltachainsrrr4rrrrrallrrzr?rrrrMrrPr)+r)rrr gather_debugrrp1rp2rr6dbg p1_chain_len p2_chain_lenrr:rdbg_typerrrr*rrrrrr dbg_try_countdbg_try_roundsr search_clssearchr candidaterevs round_typenominateddeltas candidaterevcandidate_type delta_startcandidatedelta delta_end used_cachedrs+ @r. finddeltainfodeltacomputer.finddeltainfos   T[[)J)) ''   ! UN JJLE$$&C( O**WZZ(C**WZZ(Cg~%005a8 ! g~%005a8 ! ". ". '--2O"O..wCIjjl"%+JNN -.()+0'()*%&%F ()$%&&s+      - - -"".""1%)??%%a(Dw" 227G $%M+**1-%u5 v;T2#ZZF a8F & 0 0 6I'&06<< 3JJH393D3DT3J0H0MH&(2&{dk#+(, #..t44(, #.(.(<(>D*M*a/"1 6!0JM)SM-A!+J%#-N -N*N*N!/J%#-N -N*N*N!-J!/JLM(:JGG!!#& O$%%OINNI,>,>??C%%c* &&y1 - %%EC<'C%%c*%)N#s*).%,).// ==)7&$++*C*C(+&1A~-))#.=C4;;--l;;C%%c*=C4;;22<@@C%%c*" %%"&**,K!%!5!5 ) & 4 4 G "6" %% $ IJC9{22C%%c*!-00@@--"UC>#:#::C --c2'..~>++P~666))#.,'''>C%%c*o!.p5IJ   i (E+++H  H..wCI  $ $"HH **,C7"d*1&!+1%*1#1 0 d*8&!+8%*8"*Q-7  "EkC O  )7C$ %'2C# $%2C! ""CK'' ++$)+$%  " "3 'r1c SSSSSSSSSSSS. nSnURRSnURRSnU[:XaSnO7U[:XaSnU(aUSU-- nOU[:XaSnU(aUSU-- nX!S 'U$) N) rrrrrrrrrr target-revlogsUNKNOWNrrs CHANGELOG:s MANIFESTLOG:s%s:sFILELOG:r)rtargetr rr)r)r target_revlog target_type target_keys r.rdeltacomputer._one_dbg_data s"&!%#  "!  # kk((+ [[''* . ()M , ,+M*!44 L ('M*!44 ,O r1c URbURRU5 URbESnUUSUSUSUSUSUSUSUS US US US 4 -nURU5 gg) NsDBG-DELTAS: %-12s rev=%d: delta-base=%d is-cached=%d - search-rounds=%d try-count=%d - delta-type=%-6s snap-depth=%d - p1-chain-length=%d p2-chain-length=%d - duration=%f rrrrrrrrrrr)rrzr)r)rrs r.rdeltacomputer._dbg_process_data's    '    # #C (    (   O$JL!'(()%&F $%N#N#J  C   c "; )r1)rrrrr)NFNr)NN)rKrLrMrNrOr/rrrrrrrrrrPrJr1r.rr&sZ / MM2 ;@S j &wr >DA' Q*  && aF :.   && ,0   && d *&y1  &&r1r=)rIr)9rO __future__rrrNrtypingrri18nr constantsrr r r r r rrrr thirdpartyr TYPE_CHECKINGrrrrrrrrar\rTrfrwrrZrrr>rrr(rMrrABCrrrrr4rrrrJr1r.rsF;"       %%%%PH@VXvzz3!l'<>d4 !*#   ` sww` F  %  "'""V*Vrm,m`4545nb#b#J'r1