o

�]Lba��@s�
dd
lm
Z

ddlZddlmZ
ddlmZmZ
ddlm	Z	m
Z
mZmZm
Z
mZ
ddlmZ
dZdZGd	d
�d
e�ZdPdd
�
Zdd�Zdd�ZdQdd�
ZdQdd�
Zdd�Zdd�Zdd�ZdZdZdZdZ dZ!dZ"d Z#d!Z$e�%d"�
e�%d#�
e�%d$�
e�%d%�
gZ&d&d'�Z'd(d)�Z(d*d+�Z)d,d-�Z*d.d/�Z+dRd0d1�
Z,Gd2d3�d3e-�Z.dSd4d5�
Z/d6d7�Z0d8d9�Z1d:d;�Z2d<d=�Z3d>d?�Z4d@dA�Z5dBdC�Z6edD�
edE�
edF�
edG�
edH�
dI�Z7dJdK�Z8dLdM�Z9dNdO�Z:dS)T�)
�absolute_importN�
)
�
_)�hex�short)�diffutil�encoding�error�phases�pycompat�util)
�dateutil�c@sXeZ
dZd
Zdd�Zdd�Zdd�Zdd	�Zd
d�Zdd
�Z	dd�Z
dd�Zdd�ZdS)�markerzWrap obsolete marker raw datacCs|
|_||_
d|_dS�
N)�_repo�_data�_decodedmeta)�self�repo�data�r�3/usr/lib/python3/dist-packages/mercurial/obsutil.py�__init__@s


zmarker.__init__c

Cs
t|j
�
Sr)�hashr�
rrrr�__hash__Fs

zmarker.__hash__cCs t|
�
t|�
kr
d
S|j
|
j
kS�NF)�typer�r�otherrrr�__eq__Is


z
marker.__eq__c

C�
|jd
S)z%Predecessor changeset node identifierr
�
rrrrr�prednodeN�
zmarker.prednodec

Cr")z-List of successor changesets node identifiersrr#rrrr�	succnodesRr%zmarker.succnodesc

Cr")z2Parents of the predecessors (None if not recorded)�r#rrrr�parentnodesVr%zmarker.parentnodesc

Cst|j
d
�
S)zDecoded metadata dictionary�)�dictrrrrr�metadataZ�zmarker.metadatac

Cr")z#Creation date as (unixtime, offset)�r#rrrr�date^r%zmarker.datec

Cr")zThe flags field of the markerrr#rrrr�flagsbr%zmarker.flagsN)
�__name__�
__module__�__qualname__�__doc__rrr!r$r&r(r+r.r/rrrrr=s
rFccsH�|
d
ur	|j}n|rt
||
�}n|j�|
�
}|D]}t||�V
qd
S)zreturns markers known in a repository

    If <nodes> is specified, only markers "relevant" to those nodes are are
    returnedN)�obsstore�exclusivemarkers�relevantmarkersr)r�nodes�	exclusive�
rawmarkers�
markerdatarrr�
getmarkersgs�



�r;c

Cst|d
d�d�S)Nc

Ss|dd
�|d
p
df
S)N���rr)
�
mrrr�<lambda>yszsortedmarkers.<locals>.<lambda>)
�key�
�sorted�
�markersrrr�
sortedmarkerswsrDc	cs|�|jj
}|
g
}t|�
}|r<|��}|�|d
�}|D]}|d}||vr%q|�|�

||vr2|V
q|�|�

q|sdSdS)z�yield the list of next predecessors pointing on visible changectx nodes

    This function respect the repoview filtering, filtered revision will be
    considered missing.
    rr
N)r4�predecessors�set�pop�get�add�append)	r�nodeid�
precursors�stack�seen�current�
currentpreccs�prec�
precnodeidrrr�closestpredecessors|s �








�rSc	csz�t|
�
}t|�
}|j
j}|r;|��}|V
||d
�D]}|d|@r$q|d}||v
r6|�|�

|�|�

q|sdSdS)z�Yield node for every precursors of <nodes>.

    Some precursors may be unknown locally.

    This is a linear yield unsuited to detecting folded changesets. It includes
    initial nodes too.rrr
N)rFrErHrGrI)	r4r7�ignoreflags�	remainingrNrQrO�mark�sucrrr�allpredecessors�s �












��rXccs|�t|
�
}t|�
}|r<|�
�}|V
|j�|d
�D]}|d|@r"q|dD]}||v
r6|�|�

|�|�

q&q|sdSdS)z�Yield node for every successor of <nodes>.

    Some successors may be unknown locally.

    This is a linear yield unsuited to detecting split changesets. It includes
    initial nodes too.rrrN)rFrG�
successorsrHrI)r4r7rTrUrNrOrVrWrrr�
allsuccessors�s �











���rZc

C�d
d�|D�
S)z"return a set with no prune markersc
Ssh|]}
|
dr|
�qS)
rr��.0r=rrr�	<setcomp>��z _filterprunes.<locals>.<setcomp>rrBrrr�
_filterprunes�r,r`csL
|��}|j
jj}|jj}|jj�|jj}t�}t|
�
}
�f
d
d�|
D�
}|�	�
t|�
}|r�|�
�}	t|�|	d��
}
��|	d�D]}|dsL|
�
|�

qA|�|	d�D]}|ds^|
�
|�

qS|
D]@}||vrhqa|dsr|d|	krw|�|�

|d}||vr�qa||�
}
|
r�||
v
r�qat��|�
�
}|�|�
r�|�|�

|�
|�

qa|s/|S)aset 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 <nodes> until we reach a
    locally-known precursors outside of <nodes>. Element of <nodes> with
    locally-known successors outside of <nodes> 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.
    c
s g|]}
t��
|
d��
s|
�qS)
r)r`rH�r]�
n�
�successormarkersrr�
<listcomp>
s z$exclusivemarkers.<locals>.<listcomp>rrr
)�
unfiltered�	changelog�index�has_noder4rErY�childrenrF�sortrG�listrHrJrIr`�issubset)rr7�unfiri�precursorsmarkers�childrenmarkers�exclmarkersrM�	seennodesrOrCrVrQ�known�precmarkersrrcrr5�sN6









�


�










��.r5cs�|��}t
|�
d
|
��
}|jrN|jjj�d}t|�
|krNt|�
}dd�|D�
}dd�|D�
}|�t|j|��

�f
dd�|D�
}t
|�
d
|��
}t|�
|ksd	d�|D�
S)
aR
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::r<c
S�h|]}
|
���qSr�
�node�r]�
crrrr^Y
�zforeground.<locals>.<setcomp>c
Ssg|]
}
|
��r|
�
��qSr)�mutablerwrxrrrreZ
szforeground.<locals>.<listcomp>c
3s�|]	}
�|
�
r|
V
qdSrrra�
rirr�	<genexpr>\
s�zforeground.<locals>.<genexpr>c
Srurrvrxrrrr^^
rz)	rfrFr4rgrhri�len�updaterZ)rr7�
foreground�plen�succsr{rsrr|rr�F
s	









�r�sef1�r-�� �@s^branch$s^.*-source$s^.*_source$s^source$c

s |d
�t�f
dd�t
D�
�
S)zvCheck that the key of a meta item (extrakey, extravalue) does not
    match at least one of the blacklist pattern
    r
c
3s�|]}
|
���
V
qdSr)
�match)r]�pattern�
�metakeyrrr}�
s�z%metanotblacklisted.<locals>.<genexpr>)�any�
METABLACKLIST)
�metaitemrr�r�metanotblacklisted�
sr�c
CsBg}
|��D]}|�
d
�
s|�
d�
s|�
d�
rd}|
�|�

q|
S)z/Drop all information but the username and patchs# User�
#s@@s@@
)�
splitlines�
startswithrJ)�hunk�	cleanhunk�linerrr�
_prepare_hunk�
s






�
r�c
Cst|d
�}
|
d
ur|
St
|
�
S)zreturn a cleaned up linesN)�nextr�)�iterdiff�linesrrr�
_getdifflines�
s

r�c	Cs�t�
|��jd
di
�}|j��|��}|j|d�
}|
j��|
��}|j|d�
}d\}}d||fv
rGt|�
}t|�
}||krAdSd||fv
s3dS)z|return True if both ctx introduce the "same diff"

    This is a first and basic implementation, with many shortcoming.
    sgitT)
�opts)r
r
NF)	r�diffalloptsr�uirrf�rev�diffr�)	�leftctx�rightctx�diffopts�leftunfi�leftdiff�	rightunfi�	rightdiff�left�rightrrr�_cmpdiff�
s






�r�cCs�d
}|
D]i}|��|��kr|t
O}|��|��kr|tO}|��|��kr*|tO}|��|��kr6|tO}|��|��krB|t	O}|�
���}tt
t|��
}|�
���}tt
t|��
}||krd|tO}t||�sm|tO}q|S)zeFrom an obs-marker relation, compute what changed between the
    predecessor and the successor.
    r
)�description�DESCCHANGED�user�USERCHANGEDr.�DATECHANGED�branch�
BRANCHCHANGED�parents�
PARENTCHANGED�extra�itemsrl�filterr��METACHANGEDr��DIFFCHANGED)�sourcerY�effects�	changectx�changeextra�ctxmeta�sourceextra�srcmetarrr�
geteffectflag�
s,









�r�cCs�|
d
u|d
ukrd}t�
|�
�
|��jjj}|jj}|jj	j
}tj}|d
ur)|
j
}|d}|d}	t�}
t�}|D]4}|d}
||
�
}|d
usO||
vsO||	krPq9|
�|�

|||�|kr]q9t||
�
pcg�
�|�
rm|�|�

q9|S)z�return 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
obsmarkerssorigrepolenr
)r	�ProgrammingErrorrfrgrh�get_rev�_phasecache�phaser4rYrHr
�public�changesrFrIrm)r�trr��
e�torevr��succsmarkersr��addedmarkers�origrepolen�seenrevs�	obsoletedrVrwr�rrr�getobsoleted�
s2

























�
r�cs>eZ
dZd
Z�f
dd�Zdd�Zejdd��
Zdd	�Z	�Z
S)
�_succszAsmall class to represent a successors with some metadata about itc
s"tt
|�j|
i|�
�

t�|_dSr)�superr�rrFrC)r�args�kwargs�
�	__class__rrrs

z_succs.__init__c
Cst|�
}
|j
��|
_
|
Sr)r�rC�copy)r�newrrrr�s


z_succs.copyc

Cst|�
Sr)
rFrrrr�_setsz_succs._setcCs|j�
|
j�
Sr)r�rmrrrr�canmerges
z_succs.canmerge)r0r1r2r3rr�r�
propertycacher�r��
__classcell__rrr�rr�s


r�cCs|jj
}|
g
}t|�
}|d
uri}|r�|d}||v
p$|o$||
ko$||v}||vr1|�|���

n�|rE||vr@t|f
�
g
||<n�g||<n�t||�
D]$}	|	dD]}
|
|v
rl|
|vr`g||
<qQ|�|
�

|�|
�


nqQqK
n�g}t||�
D]J}	t�}|j	�|	�

|g
}
|	dD]2}
g}|
D]'}||
D] }|�
�}|j	�|j	�

|D]}||v
r�|�|�

q�|�|�

q�q�|r�|}
q�|�|
�

qxg}g}t
dd�|D�
tdd�}|D]}|D]}|�|�
r�|j	�|j	�


nq�|�|�

|�|�

q�|��
|||<|s||
S)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.
    Nr<rc
ss�|]}
|
r|
V
qdSrr)r]�
srrrr}�s�z!successorssets.<locals>.<genexpr>T)r?�reverse)r4rYrF�removerGr�rDrJrIrCr�r�extendrAr~r�r�)r�initialnode�closest�cache�succmarkers�	toproceed�
stackedsetrO�case2conditionrVrW�	succssets�base�markss�
productresult�prefix�suffix�newss�partrN�final�
candidates�cand�	seensuccsrrr�successorssetss�1


�

!







�












�
�	
�



�




�


�

��r�c	Cs�|
��sd
St
||
��dd�}|gkrt�g
}|jj}g}|D]3}|r)|�|�

qd}|�|
��d�D]}|dsId}t�}|j�	|�

|�|�

q3|sR|�t��

qg}|D]}|�||jd��

qW|S)zncompute the raw data needed for computing obsfate
    Returns a list of dict, one dict per successors set
    NT)
r�Frr)s
successorssmarkers)
�obsoleter�rwr�r4rYrJrHrCrI)	r�ctx�ssets�succsmap�fullsuccessorsets�sset�foundanyrV�valuesrrr�successorsandmarkerss2












�

�

r�c
Cs<t|�
d
krdSt|�
dkrdS|d
}
t|
�
dkrdSdS)a}
Compute 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
    r
�prunedr�diverged�
superseded�superseded_split�
r~)r�rYrrr�_getobsfate5s


r
cCs(|sd
}|St|�
dkrd}|Sd}|S)zhReturn the verb summarizing the successorset and potentially using
    information from the markers
    r�rs	rewrittenssplitr�)�successorsetrC�verbrrr�obsfateverbPs
�
�
r
c

Cr[)z/returns the list of dates for a list of markersc
Ssg|]}
|
d�qS)
r-rr\rrrre_rzz markersdates.<locals>.<listcomp>rrBrrr�markersdates]r,r
c
C�$d
d�|D�
}
dd�|
D�
}t|�
S)z9Returns a sorted list of markers users without duplicatesc
S�g|]}
t|
d�
�qS�
r)�
r*r\rrrredr_z markersusers.<locals>.<listcomp>c
Ss$h|]}
|
�d�
rt
�|
d�
�qS)
suser)rHr�tolocal�r]�metarrrr^es
�
�zmarkersusers.<locals>.<setcomp>r@)rC�markersmeta�usersrrr�markersusersbs

�r
c
Cr
)z>Returns a sorted list of markers operations without duplicatesc
Sr
r
r
r\rrrrepr_z%markersoperations.<locals>.<listcomp>c
Ss h|]}
|
�d�
r|
�d�
�qS)
s	operation)
rHr

rrrr^qs


�
�z$markersoperations.<locals>.<setcomp>r@)rCr
�
operationsrrr�markersoperationsns


�r
cs@
|j}|j
}|o|}g}|�t||��

t|�
}	|	r&|�d
d�|	�
�

|r<��
fdd�|D�
}
|�dd�|
�
�

t|�
}|sT|jdd�
}t|�
dkrT||vrTd	}|sX|rd|rd|�d
d�|�
�

t	|�
}
|
r�|r�t
|
�
}t|
�
}||kr�t�
|d�}|�d|�

nt�
|d�}t�
|d�}|�d
||f�

d�|�
S)zoBuild a obsfate string for a single successorset using all obsfate
    related function defined in obsutil
    s	 using %s�, c
sg|]}
��
|
�
�qSrr)r]�succ��	formatctxrrrre�r_z"obsfateprinter.<locals>.<listcomp>s as %sT)
�acceptemptyrNs by %ss%Y-%m-%d %H:%M %1%2s (at %s)s (between %s and %s)�)�quiet�verboserJr
r
�joinr
�usernamer~r
�min�maxr
�datestr)r�rrYrCr
r
r
�normalr�r
�
fmtsuccessorsr

�currentuser�dates�min_date�max_date�fmtmin_date�fmtmax_daterr
r�obsfateprinterxs:
















r&
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Cs�t||�
��}t|�
}|d
krtd
|
S|dkrtd|
S|dkr3t|dd�
}td|
|fS|dkrtg}|dD]	}|�t|�
�

q=t|�
dk
rZd�|�
}td|
|fSd�|dd��
}	t|�
d}
|
|	|
f}td	|SdS)
zDreturn a human-friendly string on why a obsolete changeset is hiddenr�r�r�r
r�rr
Nr'
)r�rwr
�filteredmsgtablerrJr~r
)r�changeidr�rY�fate�single_successorr��node_id�fmtsuccs�firstsuccessors�remainingnumberr�rrr�_getfilteredreason�s*















�r0
cCs�i}i}t|j
|
��g
�D](}||
��krq
t|||�}|D]}|
��|vr'qt|�
|vr.q||t|�
<qq
d
d�t�|�
D�
S)z2Compute sets of commits divergent with a given onec
Ssg|]	\}
}|
|d��qS)
)�divergentnodes�commonpredecessorr)r]�divset�
brrrre�s��z!divergentsets.<locals>.<listcomp>)rXr4rwr��tupler�	iteritems)rr�r�r�rb�	nsuccsets�nsuccsetrrr�
divergentsets�s 







��r9
c	s�g}|
��r-|
�
�D]"}d}|��rd
}n|��rd}|du
r,|�d
d||��d��

q
|
��rUt�j|
��g
t	d�}�f
dd�|D�
}|D]
}|�dd	|��d��

qG|
�
�r|t�|
�}|D]}	�f
d
d�|	dD�
}
|�d|
d
t|	d�
d��

q`|S)Nsorphansobsoletes	%s parent)�instability�reason�node)
rTc
s(g|]}
|
�vr�|
��s�|
�qSr)
r{)r]�
p�
rrrres"
zwhyunstable.<locals>.<listcomp>sphase-divergentsimmutable predecessorc
sg|]}
�|
�qSrrrar>
rrrerzr1
scontent-divergentspredecessorr2
)r:
r1
r;
r<
)�orphanr�r�rJr�phasedivergentrXr4rw�	bumpedfix�contentdivergentr9
)rr��result�parent�kindrE�	immutable�predecessor�dsets�dset�divnodesrr>
r�whyunstable�sT











���

�

�


��








��rK
r)
r
)NN)FN);�
__future__r�re�i18nrrwrr�rrr	r
rr�utilsr
rA
�usingsha256�objectrr;rDrSrXrZr`r5r��EFFECTFLAGFIELDr�r�r�r�r�r�r��compiler�r�r�r�r�r�r�rlr�r�r�r
r
r
r
r
r&
r(
r0
r9
rK
rrrr�<module>
sr
  

*

z*








�	

, 
i0

6




��