6h4SSKJr SSKrSSKJr SSKJrJr SSKJ r J r J r J r J r SSKJr SrSr"S S 5rS6S jrS rS rS7SjrS7SjrSrSrSrSrSrSrSrSrSr Sr!Sr"\RF"S5\RF"S5\RF"S5\RF"S5/r$Sr%Sr&Sr'S r(S!r)S8S"jr*"S#S$\+5r,S9S%jr-S&r.S'r/S(r0S)r1S*r2S+r3S,r4\"S-5\"S.5\"S/5\"S05\"S15S2.r5S:S3jr6S4r7S5r8g);) annotationsN)_)hexshort)diffutilencodingerrorphasesutil)dateutilcN\rSrSrSrSrSrSrSrSr Sr S r S r S r S rg )marker<zWrap obsolete marker raw datac*XlX lSUlgN)_repo_data _decodedmeta)selfrepodatas 3/usr/lib/python3/dist-packages/mercurial/obsutil.py__init__marker.__init__?s   c,[UR5$r)hashrrs r__hash__marker.__hash__EsDJJrcf[U5[U5:wagURUR:H$NF)typerrothers r__eq__ marker.__eq__Hs( ;$t* $zzU[[((rc URS$)z%Predecessor changeset node identifierrrr s rprednodemarker.prednodeMzz!}rc URS$)z-List of successor changesets node identifiersrr+r s r succnodesmarker.succnodesQr.rc URS$)z2Parents of the predecessors (None if not recorded)r+r s r parentnodesmarker.parentnodesUr.rc2[URS5$)zDecoded metadata dictionary)dictrr s rmetadatamarker.metadataYsDJJqM""rc URS$)z#Creation date as (unixtime, offset)r+r s rdate marker.date]r.rc URS$)zThe flags field of the markerrr+r s rflags marker.flagsar.r)rrrN)__name__ __module__ __qualname____firstlineno____doc__rr!r(r,r0r4r9r=r@__static_attributes__rrrr<s2'!  ) #rrc## Uc URnO,U(a [X5nOURRUS9nUHn[X5v M g7f)zwreturns markers known in a repository If is specified, only markers "relevant" to those nodes are are returnedN)nodes)obsstoreexclusivemarkersrelevantmarkersr)rrJ exclusive rawmarkers markerdatas r getmarkersrQfsN  }]] %d2 ]]222?  T&&!sAAc[USS9$)Nc,USSUS=(d S4-$)NrHrH)ms rsortedmarkers..xs3B1R5;B.)@r)key)sortedmarkerss r sortedmarkersr\vs '@ AArc#># URRnU/n[U5nU(anUR5nUR US5nUH<nUSnX;aMUR U5 X;aUv M+UR U5 M> U(aMmgg7f)zyield the list of next predecessors pointing on visible changectx nodes This function respect the repoview filtering, filtered revision will be considered missing. rHrN)rK predecessorssetpopgetaddappend) rnodeid precursorsstackseencurrent currentpreccsprec precnodeids rclosestpredecessorsrl{s++J HE u:D ))+"w3 !DaJ! HHZ !   Z(" %s BBBc#H# [U5n[U5nURRnU(akUR5nUv U"US5H@nUSU-(aMUSnX;dMUR U5 UR U5 MB U(aMjgg7f)zYield node for every precursors of . Some precursors may be unknown locally. This is a linear yield unsuited to detecting folded changesets. It includes initial nodes too.rHrrN)r_r^rar`rb) rKrJ ignoreflags remainingrgrjrhmarksucs rallpredecessorsrrsE I y>D  $ $D --/ "%DAw$q'C  c"& )sA+B"1-B" B"c#P# [U5n[U5nU(aUR5nUv URRUS5HGnUSU-(aMUSH,nXt;dM UR U5 UR U5 M. MI U(aMgg7f)zYield node for every successor of . Some successors may be unknown locally. This is a linear yield unsuited to detecting split changesets. It includes initial nodes too.rHrrN)r_r` successorsrarb)rKrJrnrorgrhrprqs r allsuccessorsrusE I y>D --/ ''++GR8DAw$Aw?HHSMMM#& 9 )sA+B&11B&$B&cHUVs1sHoS(dMUiM sn$s snf)z"return a set with no prune markersrrHr[rUs r _filterprunesrxs 'w!A$Aw '' 's c bUR5nURRRnURR nURR nURRn[5n[U5nUVs/sH'n[URUS55(aM%UPM) n nU R5 [U 5n U (GaKU R5n [URU S55n URU S5H n U S(aMU RU 5 M" URU S5H n U S(aMU RU 5 M" U Hn X;aM U S(d U SU :XaURU 5 U SnX;aM:U"U5nU(aX;aMP[URU55nUR!U5(dMU RU5 U RU5 M U (aGMKU$s snf)atset of markers relevant to "nodes" but no other locally-known nodes This function compute the set of markers "exclusive" to a locally-known node. This means we walk the markers starting from until we reach a locally-known precursors outside of . Element of with locally-known successors outside of are ignored (since their precursors markers are also relevant to these successors). For example: # (A0 rewritten as A1) # # A0 <-1- A1 # Marker "1" is exclusive to A1 or # (A0 rewritten as AX; AX rewritten as A1; AX is unknown locally) # # <-1- A0 <-2- AX <-3- A1 # Marker "2,3" are exclusive to A1 or # (A0 has unknown precursors, A0 rewritten as A1 and A2 (divergence)) # # <-2- A1 # Marker "2" is exclusive to A0,A1 # / # <-1- A0 # # <-3- A2 # Marker "3" is exclusive to A0,A2 # # in addition: # # Markers "2,3" are exclusive to A1,A2 # Markers "1,2,3" are exclusive to A0,A1,A2 See test/test-obsolete-bundle-strip.t for more examples. An example usage is strip. When stripping a changeset, we also want to strip the markers exclusive to this changeset. Otherwise we would have "dangling"" obsolescence markers from its precursors: Obsolescence markers marking a node as obsolete without any successors available locally. As for relevant markers, the prune markers for children will be followed. Of course, they will only be followed if the pruned children is locally-known. Since the prune markers are relevant to the pruned node. However, while prune markers are considered relevant to the parent of the pruned changesets, prune markers for locally-known changeset (with no successors) are considered exclusive to the pruned nodes. This allows to strip the prune markers (with the rest of the exclusive chain) alongside the pruned changesets. rHrr) unfiltered changelogindexhas_noderKr^rtchildrenr_rxrasortr`listrcrbissubset)rrJunfir}precursorsmarkerssuccessormarkerschildrenmarkers exclmarkersnrf seennodesrhr[rprjknown precmarkerss rrLrLsl ?? D~~##,,H 22}}//mm,,O%K JE P1]3C3G3G23N%OQE P JJLE I ))+(,,Wb9:$(("5D77t$6$''4D77t$5D" Aw$q'W,%7D TNE* ((8(<(return all nodes in the "foreground" of other node The foreground of a revision is anything reachable using parent -> children or precursor -> successor relation. It is very similar to "descendant" but augmented with obsolescence information. Beware that possible obsolescence cycle may result if complex situation. s%ln::rTc3F># UHnT"U5(dMUv M g7frrH).0rr}s r foreground..[s51!QQs! !) rzr_rKr{r|r}lennodemutableupdateru) rrJ foregroundplencsuccsrrr}s @rrrEs ?? DTXXh./J }}>>''00*o%z?D'12z!VVXzE2)3CAyy{xqvvxGC LLt}}g> ?55ETXXh67J *o%) )jFFHj )) 3C *s>E E9E0Esef1r< @s^branch$s ^.*-source$s ^.*_source$s^source$cJ^USm[U4Sj[55(+$)znCheck that the key of a meta item (extrakey, extravalue) does not match at least one of the blacklist pattern rc3D># UHoRT5v M g7fr)match)rpatternmetakeys rr%metanotblacklisted..sGg==))s )any METABLACKLIST)metaitemrs @rmetanotblacklistedrs"qkGGGG GGrc/nUR5HZnURS5(dURS5(aM1URS5(aSnURU5 M\ U$)z/Drop all information but the username and patchs# User#s@@s@@ ) splitlines startswithrc)hunk cleanhunklines r _prepare_hunkrs_I! ??9 % %T__T-B-Bu%%   T " " rc:[US5nUcU$[U5$)zreturn a cleaned up linesN)nextr)iterdiffliness r _getdifflinesrs# 4 E }  rc[R"UR5RSSS.5nURR 5UR 5nURUS9nURR 5UR 5nURUS9nSupxSXx4;a%[U5n[U5nXx:wagSXx4;aM%g)ztreturn True if both ctx introduce the "same diff" This is a first and basic implementation, with many shortcoming. Tr)sgitsunified)opts)rrNF) r diffalloptsruirrzrevdiffr) leftctxrightctxdiffoptsleftunfileftdiff rightunfi rightdiffleftrights r_cmpdiffrs ## 1%H}}'')'++-8H}}(}+H))+HLLN;IH-IKD tm #X&i( = tm # rcSnUGHsnUR5UR5:wa U[-nUR5UR5:wa U[-nUR 5UR 5:wa U[ -nUR 5UR 5:wa U[-nUR5UR5:wa U[-nUR5R5n[[[U55nUR5R5n[[[U55nXW:wa U[-n[!X5(aGMjU["-nGMv U$)z]From an obs-marker relation, compute what changed between the predecessor and the successor. r) description DESCCHANGEDuser USERCHANGEDr= DATECHANGEDbranch BRANCHCHANGEDparents PARENTCHANGEDextraitemsrYfilterr METACHANGEDr DIFFCHANGED)sourcerteffects changectx changeextractxmeta sourceextrasrcmetas r geteffectflagrs?G  "f&8&8&: : { "G >> v{{} , { "G >> v{{} , { "G     0 } $G    &.."2 2 } $G oo'--/  2K@Alln**,  2K@A   { "G** { "GC F NrcUSLUSL:XaSn[R"U5eUR5RRR nUR RnURRRn[RnUc URnUSnUSn [5n [5n UHn U Sn U"U 5nUb X;dX:aMU RU5 U"X5U:XaM>[U"U 5=(d /5R!U5(dMnU RU5 M U $)zreturn the set of pre-existing revisions obsoleted by a transaction Either the transaction or changes item of the transaction (for hooks) must be provided, but not both. Ns.exactly one of tr and changes must be provideds obsmarkerss origrepolenr)r ProgrammingErrorrzr{r|get_rev _phasecachephaserKrtrar publicchangesr_rbr)rtrretorevr succsmarkersr addedmarkers origrepolenseenrevs obsoletedrprrs r getobsoletedrs$ d 4( =$$Q'' OO  ' ' - - 5 5E    " "E==++//L ]]F**=)L.)KuHIAwDk ;#/S-?  S  v %  |D!'R ( 1 1, ? ? MM#  rc\^\rSrSrSrU4SjrSr\RS5r Sr Sr U=r $)_succsi zAsmall class to represent a successors with some metadata about itcD>[TU]"U0UD6 [5Ulgr)superrr_r[)rargskwargs __class__s rr_succs.__init__ s $)&)u rcZ[U5nURR5UlU$r)rr[copy)rnews rr _succs.copys$Tlll'')  rc[U5$r)r_r s r_set _succs._sets4yrcLURRUR5$r)rrr&s rcanmerge_succs.canmergesyy!!%**--rrZ) rBrCrDrErFrrr propertycacherrrG __classcell__)rs@rrr s4K  ..rrcURRnU/n[U5nUc0nU(GaVUSnXt;=(d U=(a Xq:g=(a Xp;nXs;a!URUR 55 GOU(aXp;a[ U45/X7'GO/X7'GO[ XG5HFn U SH7n X;dM X;a/X:'MURU 5 URU 5 O ME GO /n [ XG5Hn [ 5n U RRU 5 U /n U SHn /nU HvnX:HknUR5nURRUR5 UHnUU;dM URU5 M URU5 Mm Mx U(dMUn M U RU 5 M /n/n[SU 5[SS9nUHlnUHAnURU5(dMURRUR5 MH URU5 URU5 Mn UR!5 UX7'U(aGMVX1$)a Return set of all latest successors of initial nodes The successors set of a changeset A are the group of revisions that succeed A. It succeeds A as a consistent whole, each revision being only a partial replacement. By default, the successors set contains non-obsolete changesets only, walking the obsolescence graph until reaching a leaf. If 'closest' is set to True, closest successors-sets are return (the obsolescence walk stops on known changesets). This function returns the full list of successor sets which is why it returns a list of tuples and not just a single tuple. Each tuple is a valid successors set. Note that (A,) may be a valid successors set for changeset A (see below). In most cases, a changeset A will have a single element (e.g. the changeset A is replaced by A') in its successors set. Though, it is also common for a changeset A to have no elements in its successor set (e.g. the changeset has been pruned). Therefore, the returned list of successors sets will be [(A',)] or [], respectively. When a changeset A is split into A' and B', however, it will result in a successors set containing more than a single element, i.e. [(A',B')]. Divergent changesets will result in multiple successors sets, i.e. [(A',), (A'')]. If a changeset A is not obsolete, then it will conceptually have no successors set. To distinguish this from a pruned changeset, the successor set will contain itself only, i.e. [(A,)]. Finally, final successors unknown locally are considered to be pruned (pruned: obsoleted without any successors). (Final: successors not affected by markers). The 'closest' mode respect the repoview filtering. For example, without filter it will stop at the first locally known changeset, with 'visible' filter it will stop on visible changesets). The optional `cache` parameter is a dictionary that may contains precomputed successors sets. It is meant to reuse the computation of a previous call to `successorssets` when multiple calls are made at the same time. The cache dictionary is updated in place. The caller is responsible for its life span. Code that makes multiple calls to `successorssets` *should* use this cache mechanism or risk a performance hit. Since results are different depending of the 'closest' most, the same cache cannot be reused for both mode. rTrc36# UHo(dM Uv M g7frrH)rss rr!successorssets..s/ 1QQQ s  T)rXreverse)rKrtr_remover`rr\rcrbr[rrextendrYrrr)r initialnodeclosestcache succmarkers toproceed stackedsetrhcase2conditionrprq succssetsbasemarkss productresultprefixsuffixnewsspartrgfinal candidatescand seensuccss rsuccessorssetsrstb--**K IYJ }8 $B-"4  B. B7?      immo . "('"4!5"$B&k&:;7C',)+EJ &,,S1&NN3/!#!?D!8DLL$$T*"VF#Aw(* &,F*/*(.  % 4 4V^^ D,2D(,5'8(- T(: -3 !. 4 4U ;+5'-)=%2F '$$V,)@,#/ /S$ 'D%) ==33%--44T\\B!&*  T* D)' !&_ )`  rchUR5(dg[XR5SS9nU/:Xa [5/nURR n/nUHnU(aUR U5 MSnURUR5S5HGnUS(aMSn[5nURRU5 UR U5 MI U(aMUR [55 M /nUH nUR XURS.5 M" U$)zfcompute the raw data needed for computing obsfate Returns a list of dict, one dict per successors set NT)rFrHr)s successorssmarkers) obsoleterrrrKrtrcrar[rb) rctxssetssuccsmapfullsuccessorsetsssetfoundanyrpvaluess rsuccessorsandmarkersr"s <<>> 4T :E { }}''H   $ $T *H SXXZ4Aww#H!8DLL$$T*%,,T2 5 8!((2-0F! d EF" Mrcn[U5S:Xag[U5S:agUSn[U5S:Xagg)aYCompute a changeset obsolescence fate based on its successorssets. Successors can be the tipmost ones or the immediate ones. This function return values are not meant to be shown directly to users, it is meant to be used by internal functions only. Returns one fate from the following values: - pruned - diverged - superseded - superseded_split rprunedrdiverged supersededsuperseded_splitr)rrts r _getobsfater)7sB >a ^ q $A& z?a  &rcFU(dSnU$[U5S:XaSnU$SnU$)z`Return the verb summarizing the successorset and potentially using information from the markers r$rs rewrittenssplitr() successorsetr[verbs r obsfateverbr-Rs:  K \ a  K Krc6UVs/sHoSPM sn$s snf)z/returns the list of dates for a list of markersr<rHrws r markersdatesr/_s! "'QaD' "" "scUVs/sHn[US5PM nnUVs1sH4nURS5(dM[R"US5iM6 nn[ U5$s snfs snf)z9Returns a sorted list of markers users without duplicatesr7suser)r8rar tolocalrY)r[rU markersmetametauserss r markersusersr5dss'./w!4!:wK/  D 88G  (g'   %=0 sA+A0A0cUVs/sHn[US5PM nnUVs1sH+o3RS5(dMURS5iM- nn[U5$s snfs snf)z>Returns a sorted list of markers operations without duplicatesr7s operation)r8rarY)r[rUr2r3 operationss rmarkersoperationsr8psf'./w!4!:wK/+6+64((<:P; *  0sA"A'A'cURnURnU(+=(a U(+n/nUR[X#55 [ U5n U (a#URSSR U 5-5 U(a<UV s/sH o"X5PM n n URSSR U 5-5 [ U5n U(d%URSS9n [U 5S:XaX;aSn U(dU(a*U (a#URSSR U 5-5 [U5nU(aU(a[U5n[U5nUU:Xa,[R"US 5nURS U-5 OD[R"US 5n[R"US 5nURS UU4-5 S R U5$s sn f) zgBuild a obsfate string for a single successorset using all obsfate related function defined in obsutil s using %s, s as %sT) acceptemptyrNs by %ss%Y-%m-%d %H:%M %1%2s (at %s)s (between %s and %s)r)quietverbosercr-r8joinr5usernamerr/minmaxr datestr)rrrtr[ formatctxr<r=normalrr7succ fmtsuccessorsr4 currentuserdatesmin_datemax_date fmtmin_date fmtmax_dates robsfateprinterrMzs HHEjjG[ &YF D KK J01#7+J L5::j#99:;EF:44:.: F I = 99:  !E kkdk3 u:?{3E6u I 5 112  !E u:u: x "**85KLK KK k1 2"**85KLK"**85KLK KK/; 2LL M 88D>=Gs G'shidden revision '%s' is pruneds!hidden revision '%s' has divergeds)hidden revision '%s' was rewritten as: %ss%hidden revision '%s' was split as: %ss1hidden revision '%s' was split as: %s and %d more)r$r%r&r'superseded_split_severalc&[XR55n[U5nUS:Xa [SU-$US:Xa [SU-$US:Xa[ USS5n[SX4-$US:Xa/nUSHnUR [ U55 M [ U5S::aSRU5n[SX4-$SRUSS5n [ U5S- n XU 4n [S U -$[R"S U-5e) zDreturn a human-friendly string on why a obsolete changeset is hiddenr$r%r&rr'rr:NrNzunhandled fate: %r) rrr)filteredmsgtablerrcrr>r r) rchangeidrrtfatesingle_successorrnode_idfmtsuccsfirstsuccessorsremainingnumberrs r_getfilteredreasonrXs+hhj1J z "D y *X55   ,x77   Aq!12 .(1MMM $ $!!}G LLw (% u:?zz%(H#$78H;OO O#jjr3O!%j1nO?D#$?@4G G$$%9D%@AArcx0n0n[URUR5/5HanXAR5:XaM[XU5nUH7nUR5U;aM[ U5U;aM*XC[ U5'M9 Mc UR 5VVs/sH upxXxS.PM snn$s snnf)z2Compute sets of commits divergent with a given one)divergentnodescommonpredecessor)rrrKrrtupler) rrrr r nsuccsetsnsuccsetdivsetbs r divergentsetsras E D T]]SXXZL 9  ? "4E2 !HxxzX%X$&$%x !" : %IF#<%  s"B6c ,/nUR5(asUR5H_nSnUR5(aSnOUR5(aSnUcM9URSSU-UR 5S.5 Ma UR 5(a[ URUR5/[S9nUVs/sH'ofU;dM XR5(aM#XPM) nnUH&nURSSUR 5S.5 M( UR5(aM[X5n U H<n U SV s/sHoU PM n n URS U S [ U S 5S .5 M> U$s snfs sn f) Nsorphansobsoletes %s parent) instabilityreasonnode)rnsphase-divergentsimmutable predecessorrZscontent-divergents predecessorr[)rcrZrdre) orphanrrrcrphasedivergentrrrKr bumpedfixrcontentdivergentra) rrresultparentkindr^p immutable predecessordsetsdsetrdivnodess r whyunstablerss F zz||kkmFD}} """ (1#/$#6!'$ & MMCHHJr~sm# @   ''T ' B ):#0',( wt*T       JJ{JJ~JJ~JJ{  H >)X@.T.*eP-`'6 # 2l2378ABCD!"<" B>.,r