|
Server : Apache System : Linux iad1-shared-b8-43 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64 User : dh_edsupp ( 6597262) PHP Version : 8.2.26 Disable Function : NONE Directory : /lib/python3/dist-packages/mercurial/__pycache__/ |
Upload File : |
o
�]Lb � � @ s~ d dl mZ d dlZd dlZddlmZ ddlmZ ddlm Z
m Z m Z m
Z
mZ ddlmZ ddlmZmZ e �d �Zd
d � Zd d
� Zdd� ZdEdd�ZdEdd�Zdd� Z dd� Z dd� Z dd� Z d d � Z d d � Z!d Z"dZ#d Z$d!d"� Z%d#d$� Z&d%d&� Z'd'd(� Z(d)d*� Z)dFd+d,�Z*d-d.� Z+d/d0� Z,dEd1d2�Z-d3d4� Z.d5d6� Z/d7d8� Z0G d9d:� d:e1�Z2d;d<� Z3d=d>� Z4d?d@� Z5dAdB� Z6dCdD� Z7dS )G� )�absolute_importN� )�_)�nullrev)�match�pathutil�policy�pycompat�util)�
stringutil)�flagutil�sidedata� copy_tracingc C sH t |�� �D ]\}}||kr||= q|| vr||= q||vr!||= qdS )z)filters out invalid copies after chainingN)�list�items)�src�dst�t�k�v� r �2/usr/lib/python3/dist-packages/mercurial/copies.py�_filter$ s ��r c C s0 | � � }t�|�D ] \}}| �||�||< q |S )z.chain two sets of copies 'prefix' and 'suffix')�copyr � iteritems�get)�prefix�suffix�result�key�valuer r r �_chainE s r! c C sV | � � D ]$}|�� }|�|d�|�� kr| S |r(|�|d�|�� kr(| S qdS )a return file context that is the ancestor of fctx present in ancestor
manifest am
Note: we used to try and stop after a given limit, however checking if that
limit is reached turned out to be very expensive. we are better off
disabling that feature.N)� ancestors�pathr �filenode)�fctx�am�basemf�fr# r r r �
_tracefileM s ��r) c C sB | j }|�� �� }t|�D ]}|�|�jr|r ||�s ||= q
|S �N)�dirstate�copiesr r � get_entry�tracked)�repor �ds�cr r r r �_dirstatecopies] s �r2 c C s | � � }|� � }|j||d�S )z�Computes which files are in b but not a.
This is its own function so extensions can easily wrap this call to see what
files _forwardcopies is about to process.
�r )�manifest�
filesnotin)�a�br �ma�mbr r r �_computeforwardmissingf s r: c C s( | j dkrdS | j�dd�}d}||v S )z9Checks if we should use changeset-centric copy algorithms� changeset-sidedataT� experimentals copies.read-from)s changeset-onlys
compatibility)�filecopiesmode�ui�config)r/ �readfrom�changesetsourcer r r �usechangesetcentricalgop s
rB c C s� | j }t|�r
t| ||�S |jjo|j�dd�}|jj}|r&|d| |f � | �� }|du r0dn|�� }i } |}
|�� | krS|� � �
� t krSt �
|�� �} t �|| �}
|j�dd�rlt|�|��} |rk|dt| � � nt| ||
d�} |r}|dt| � � | j jj|�
� gd d
�}
t| �D ]7}|r�|d | � || }|
|_|r�t�� }t|||�}|r�|r�|d | � || |< |r�|d
t�� | � q�| S )z@Like _forwardcopies(), but b.rev() cannot be None (working copy)� devel� debug.copiess3 debug.copies: looking into rename from %s to %s
Ns copy-tracing.trace-all-filess+ debug.copies: searching all files: %d
r3 s/ debug.copies: missing files to search: %d
T�� inclusives& debug.copies: tracing file: %s
s% debug.copies: rename of: %s
s( debug.copies: time: %f seconds
)�_reporB �_changesetforwardcopiesr> � debugflag�
configbool�debugr4 �p1�p2�revr �matchmod�exact�files�intersectmatchersr �walk�lenr: � changelogr" �sorted�_ancestrycontextr
�timerr) )r6 r7 �baser r/ rK �dbgr& r' �cm�forwardmissingmatch� filesmatcher�missing�ancestrycontextr( r% �start�opathr r r �_committedforwardcopiesy s^ ���
���rb c sR | j }|j�|j�tj� |j�tdur � ���fdd�}|S � ���fdd�}|S )z�returns a function that returns the following data given a <rev>"
* p1: revision number of first parent
* p2: revision number of first parent
* changes: a ChangingFiles object
Nc s: �| �\}}�| �� @ r�| �j �tj�}nd }|||fS r* )� _sidedatar � sidedatamod�SD_FILES)rN rL rM �raw��
HASCOPIESINFO�changelogrevision�flags�parentsr r �revinfo� s
z _revinfo_getter.<locals>.revinfoc s2 �| �\}}�| �� @ r�| �j }nd }|||fS r* )�changes)rN rL rM rm rg r r rl � s
)rU �
parentrevsrj r �REVIDX_HASCOPIESINFOri �rustmod)r/ r �clrl r rg r �_revinfo_getter� s �rr c s i � � �fdd�}|S )z&return a cached version of is_ancestorc sH | |krdS | |kr dS | |f}� � |�}|d u r"�| |� }� |< |S )NFT)r )�anc�descr �ret��cache� is_ancestorr r � _is_ancestor� s
z(cached_is_ancestor.<locals>._is_ancestorr )rx ry r rv r �cached_is_ancestor� s rz c s� | � � t|� � fv r i S | �� �� }|j}|j}|j}ttf}|j| � � gdd�}|j| � � g|� � gd�} t � }
d} |j
� dd�} | D ]+}
||
�}||krQd} qD|\}}|tkrb||v rb|
� |� |tkro||v ro|
� |� qD|
sti S | r�t
|
�}
t|
�}|� � g}|j|||
dd�� t � �� � fdd �| D �} |jd
kr�td d � |
D ��}| D ] }
|�|
�D ]}|tkr�q�d
||
< ||v r�|| d7 < q�q�t||�}|j�� � t| ||� � |||| �W d � S 1 s�w Y d S tdd � |
D ��}| D ]"}
|�|
�D ]}|tk�r �qg ||
< ||v �r || �|
� �qq�| �� }||� � k�s,J �| �|
� | �� t|�}t| ||� � |||�S )NTrE )�common�headsFrC s copy-tracing.multi-thread)� includepathc s g | ]}|� v r|�qS r r ��.0�r��
roots_to_headr r �
<listcomp>+ � z+_changesetforwardcopies.<locals>.<listcomp>r; c s s � | ]}|d fV qdS )r Nr r~ r r r � <genexpr>7 � � z*_changesetforwardcopies.<locals>.<genexpr>r r c s s � | ]}|g fV qd S r* r r~ r r r r� M r� ) rN r r/ �
unfilteredrU �
isancestorrev�_uncheckedparentrevsr" �findmissingrevs�setr> rJ �addr �min�reachablerootsr= �dictrn rr �reading�_combine_changeset_copies�append�pop�extend�sort�_revinfo_getter_extra� _combine_changeset_copies_extra)r6 r7 r r/ rq �
isancestorrk � graph_rootsr" �revs�roots�has_graph_roots� multi_threadr� �psrL rM �m�h�children_count�prl �children�xr r� r rH � s�
�
��
�$�
��
�rH c C s8 |� � }tdurt�t| �||||�}n�t|�}i } | D ]�}
||
�\} } }
d}d| fd| ffD ]�\}}|tkr8q/|�|�}|du rBq/|d8 }|||< |rS| �|d�}n| �|d�}|du rbi }}n |ri|�� }n|}|
dur�i }|dkry|
j }n|dkr�|
j
}|r�|�� }t � |�D ] \}}|�|�}|dur�|d dur�|d }|
|f||< q�||us�J �|
j
r�|
j
D ]}||v r�||u r�|�� }|
df||< q�|du r�|}q/|dks�J �t||||
|
�}q/|| |
< q i }| | }|dus�J �|�� D ]\}\}}|du�r|||< q�|�st|�� �D ] }||��s||= �q|S )a� combine the copies information for each item of iterrevs
revs: sorted iterable of revision to visit
children_count: a {parent: <number-of-relevant-children>} mapping.
targetrev: the final copies destination revision (not in iterrevs)
revinfo(rev): a function that return (p1, p2, p1copies, p2copies, removed)
match: a matcher
It returns the aggregated copies information for `targetrev`.
Nr � )�alwaysrp �combine_changeset_copiesr rz r r r� r �copied_from_p1�copied_from_p2r r �removed�_merge_copies_dictr �keys) r� r� � targetrevrl r r� r� � alwaysmatch� final_copies�
all_copies� current_revrL rM rm �current_copies�parent�
parent_rev�remaining_childrenr, � newcopies� childcopies�dest�source�prevr( �targetrev_items�tt�filenamer r r r� ` s� �
� �
�
�r� r� c
C s� |� � D ]<\}}| �|�}|du r|| |< qt|||||�\}} | r8|tkr/||d f| |< q||d f| |< q|tkr@|| |< q| S )a� merge two copies-mapping together, minor and major
In case of conflict, value from "major" will be picked.
- `isancestors(low_rev, high_rev)`: callable return True if `low_rev` is an
ancestors of `high_rev`,
- `ismerged(path)`: callable return True if `path` have been merged in the
current revision,
return the resulting dict (in practice, the "minor" object, updated)
Nr )r r �_compare_values�
PICK_MAJOR)
�minor�majorr� rm �
current_merger� r �other�pick� overwriter r r r� � s
��r� c C s |\}}|\}}||kr||ksJ �t dfS | dur+|dur+|du r+|| jv r+tdfS | dur@|dur@|du r@|| jv r@tdfS |||�rV| durR|| jv rRtdfS tdfS |||�rl| durh|| jv rhtdfS tdfS |du rttdfS |du r|tdfS tdfS )z�compare two value within a _merge_copies_dict loop iteration
return (pick, overwrite).
- pick is one of PICK_MINOR, PICK_MAJOR or PICK_EITHER
- overwrite is True if pick is a return of an ambiguity that needs resolution.
FNT)� PICK_EITHER�salvaged�
PICK_MINORr� �merged) rm r� r� r� r� �major_tt� major_value�minor_tt� minor_valuer r r r� � s8
r� c s, �j }|j��fdd�� � ��fdd�}|S )aW return a function that return multiple data given a <rev>"i
* p1: revision number of first parent
* p2: revision number of first parent
* p1copies: mapping of copies from p1
* p2copies: mapping of copies from p2
* removed: a list of removed files
* ismerged: a callback to know if file was merged in that revision
c s �| � � �fdd�}|S )Nc sN | � � � vrdS � | }|j�|j�}d}|D ] }|�jkr"|d7 }q|dkS )NFr r r� )rQ �_filelogrk � _filenode�nullid)r# r% rk �
nb_parents�n)�ctxr/ r r �ismerged@ s
�z=_revinfo_getter_extra.<locals>.get_ismerged.<locals>.ismergedr )rN r� )r/ )r� r � get_ismerged= s z+_revinfo_getter_extra.<locals>.get_ismergedc s: �| �\}}�| }|j \}}|�� }|||||� | �fS r* )�_copies� filesremoved)rN rL rM r� �p1copies�p2copiesr� �r� rk r/ r r rl M s
z&_revinfo_getter_extra.<locals>.revinfo)rU rn )r/ rq rl r r� r r� 0 s
r� c s� i }� � � }| D ]�}|�|d�} | du ri } t|| �D ]�\}
} || �\} }
}}}}|| kr3d}|}n
||
ks9J �d}|}|sJ� fdd�|�� D �}| }|r{| �� }t�|�D ] \}}| �|�}|durn|d durn|d }| |f||< qW|| us{J �|D ]}||v r�|| u r�| �� }| df||< q}|�| �}|du r�||| < q |dkr�t||||� q t||||� ||| < q qi }|| �� D ]\}\}}|dur�|||< q�|S )zyversion of `_combine_changeset_copies` that works with the Google
specific "extra" based storage for copy informationNr r� c s i | ] \}}� |�r||�qS r r )r r r r3 r r �
<dictcomp>m s
��z3_combine_changeset_copies_extra.<locals>.<dictcomp>) r� r� � enumerater r r r r �_merge_copies_dict_extra) r� r� r� rl r r� r� r� r� r, �ir1 rL rM r� r� r� r� r� r� r� r� r� r� r( � othercopiesr� r� r r3 r r� W sf
�
�
��
�3�r� c C sv |� � D ]4\}}| �|�}|du r|| |< q|d }|d }|d |d kr'q||ks4|||�r4||�r8|| |< qdS )zrversion of `_merge_copies_dict` that works with the Google
specific "extra" based storage for copy informationNr r )r r ) r� r� r� r� r� r r� �new_tt�other_ttr r r r� � s
����r� c C s` |du r| }| � � �|�}|�� du r't| |�� ||�}t|t|j|��}|S t| |||�}|S )z<find {dst@b: src@a} copy mapping where a is an ancestor of bN)r/ � narrowmatchrN rb rL r! r2 rG )r6 r7 rY r r[ r, r r r �_forwardcopies� s �r� c C s. | j j�dd�dkr i S t|| �}t|| |�S )zfind renames from a to br< � copytraces off)rG r> r? r� �_reverse_renames)r6 r7 r r, r r r �_backwardrenames� s
r� c C s@ i }t t�| ��D ]\}}|r||�sq ||v rq |||< q |S )z>given copies to context 'dst', finds renames from that context)rV r r )r, r r r� r r r r r r� � s
r� c
C sr | j }|jjo
|j�dd�}|r|j�d| |f � | |ks"| r"|s$i S |�� du r=| |�� kr=|r8|j�d� t||�S |�| �}|| krV|rN|j�d� t | ||d�}n[||krj|rb|j�d� t
| ||d�}nG|rr|j�d � d}|�� t kr|| }t || �}t ||||d�} t |�t | �@ }
|
D ]} |�
| �| �
| �kr�|| = | | = q�t|| |�} t| | �}t| ||� |S )
z5find {dst@y: src@x} copy mapping for directed comparerC rD s- debug.copies: searching copies from %s to %s
Ns$ debug.copies: search mode: dirstate
s# debug.copies: search mode: forward
r3 s$ debug.copies: search mode: backward
s$ debug.copies: search mode: combined
)rG r> rI rJ rK rN rL r2 �ancestorr� r� r r� r r� r! r )
r� �yr r/ rK r6 r, rY �x_copies�y_copies� same_keysr �x_backward_renamesr r r �
pathcopies� sR
�
� � r� c C s� |r|r||krt � t � i fS |�� �� }|�� du r/|�� | j�� kr/t t| |��t � i fS | j�dd�}t �
|�du rDt � t � i fS t | �rOt | |||�S |dkrgt
| ||�r`t | |||�S t| |||�S t | |||�S )a�
Finds moves and copies between context c1 and c2 that are relevant for
merging. 'base' will be used as the merge base.
Copytracing is used in commands like rebase, merge, unshelve, etc to merge
files that were moved/ copied in one merge parent and modified in another.
For example:
o ---> 4 another commit
|
| o ---> 3 commit that modifies a.txt
| /
o / ---> 2 commit that moves a.txt to b.txt
|/
o ---> 1 merge base
If we try to rebase revision 3 on revision 4, since there is no a.txt in
revision 4, and if user have copytrace disabled, we prints the following
message:
```other changed <file> which local deleted```
Returns a tuple where:
"branch_copies" an instance of branch_copies.
"diverge" is a mapping of source name -> list of destination names
for divergent renames.
This function calls different copytracing algorithms based on config.
Nr< r� Fs
heuristics)�
branch_copiesr/ r� �noder+ rL r2 r> r? r � parseboolrB �_fullcopytracing�_isfullcopytraceable�_heuristicscopytracing)r/ �c1�c2rY r� � copytracingr r r � mergecopies
s$ ! � r� c C sX |� � du r
|�� }|�� r*|�� r*| j�dd�}t| �d|� � |� � ��}||k S dS )a� Checks that if base, source and destination are all no-public branches,
if yes let's use the full copytrace algorithm for increased capabilities
since it will be fast enough.
`experimental.copytrace.sourcecommitlimit` can be used to set a limit for
number of changesets from c1 to base such that if number of changesets are
more than the limit, full copytracing algorithm won't be used.
Nr< s copytrace.sourcecommitlimit� %d::%dF)rN rL �mutabler> � configintrT r� )r/ r� rY �sourcecommitlimit�commitsr r r r� S s �r� c
C s� | |vr| |vr||| < d S d S | |vrd S || || kr)t || || �s)d S || || ks;|�| �|�| �krD|D ]} | || < q=d S d S r* )�_relatedrj )
r �dsts1�m1�m2r9 r� rY r � renamedeleter r r r �_checksinglesidecopiesg s �"$
�r c @ s$ e Zd ZdZ ddd�Zdd� ZdS )r� a Information about copies made on one side of a merge/graft.
"copy" is a mapping from destination name -> source name,
where source is in c1 and destination is in c2 or vice-versa.
"movewithdir" is a mapping from source name -> destination name,
where the file at source present in one context but not the other
needs to be moved to destination by the merge process, because the
other context moved the directory it is in.
"renamedelete" is a mapping of source name -> list of destination
names for files deleted in c1 that were renamed in c2 or vice-versa.
"dirmove" is a mapping of detected source dir -> destination dir renames.
This is needed for handling changes to new files previously grafted into
renamed directories.
Nc C sR |d u ri n|| _ |d u ri n|| _|d u ri n|| _|d u r$i | _d S || _d S r* �r r �dirmove� movewithdir)�selfr r r r r r r �__init__� s zbranch_copies.__init__c C s d| j | j| j| jf S )NzJ<branch_copies
copy=%r
renamedelete=%r
dirmove=%r
movewithdir=%r
>r )r r r r �__repr__� s �zbranch_copies.__repr__)NNNN)�__name__�
__module__� __qualname__�__doc__r r r r r r r� | s
� r� c $ s� |� � �|� � �|� � �t||�}t||�}|s!|s!t� t� i fS i }i }|�� D ]
\}} |�| g ��|� q)|�� D ]
\}} |�| g ��|� q;i }
i } i } i }
i }t|�t|�B }|D ]z} |�| �}|�| �}|r�|r�| �vr�| �vr�t|�}t|�}||@ r�||@ D ]
}| |
|< | | |< q�q]t||B �| | < q]| �v r�| �v r�t|�}t|�}||@ D ]
}| |
|< | | |< q�q]|r�t | |���|||
|
� q]|r�t | |���||| |� q]g ������fdd�� � fdd�}� fdd�}�j
j �r�|� }|� }d}|�r�j
� d|d d �
|�f � |�r!�j
� d|d
d �
|�f � t� }t� }| �� D ]}|�|� �q+|
�� D ]}|�|� �q8|�� D ]}|�|� �qE�j
� d � d|fd |ffD ]I\}}|�se�q\�j
� d
| � t|�D ]2} d} | |
v �s| | v �r�| d7 } | |v �r�| d7 } | |v �r�| d7 } �j
� d|| | | f � �qq�q\~~�j
� d� t�||
||�\} } t�|| ||�\} }!t|
|
| |!�}"t| || | �}#|"|#| fS )a' The full copytracing algorithm which finds all the new files that were
added from merge base up to the top commit and for each file it checks if
this file was copied from another file.
This is pretty slow when a lot of changesets are involved but will track all
the copies.
c sR � s%�� ���� �}�� ���� �}t|| �}t|| �}� �||f� � | S r* )r5 r� rV r� )�idx� addedinm1� addedinm2�u1�u2)rw r� r r9 r/ r r �_get_addedfiles� s z)_fullcopytracing.<locals>._get_addedfilesc � � d�S )Nr r r �r r r �<lambda>� � z"_fullcopytracing.<locals>.<lambda>c r )Nr r r r r r r � r s unmatched files in %ss
%s:
%s
s locals
s othersK all copies found (* = to merge, ! = divergent, % = renamed and deleted):
s remotes on %s side:
� � *� !� %s src: '%s' -> dst: '%s' %s
s! checking for directory renames
)r4 r� r� r �
setdefaultr� r� r rV r r> rI rK �join�values�update� _dir_renames)$r/ r� r� rY �copies1�copies2�inversecopies1�inversecopies2r r �copy1�copy2�diverge�
renamedelete1�
renamedelete2�
allsourcesr� �dsts2�u1fn�u2fnr r �header�renamedeleteset�
divergeset�dsts�sider, r( �note�dirmove1� movewithdir2�dirmove2� movewithdir1�branch_copies1�branch_copies2r )r rw r� r r9 r/ r r� � s�
�
����
�� �
��
r� c C sb t � }i }t�|�D ]8\}}t�|�t�|�} }
| |v r q
|�| �r.|�|
�r.|�| � q
| |v r>|| |
kr>|�| � q
|
|| < q
|D ] } | |v rN|| = qE~|sVi i fS dd� t�|�D �}|D ]} | j�d| || f � qbt |dd�}
i }|� D ]0}||vr�|
D ]'} |�
| �r�|| |t | �d� }||vr�|||< | j�d||f � nq�q|||fS )a� Finds moved directories and files that should move with them.
ctx: the context for one of the sides
copy: files copied on the same side (as ctx)
fullcopy: files copied on the same side (as ctx), including those that
merge.manifestmerge() won't care about
addedfilesfn: function returning added files on the other side (compared to
ctx)
c S s i | ] \}}|d |d �qS )� /r )r r r r r r r� S s z _dir_renames.<locals>.<dictcomp>s) discovered dir src: '%s' -> dst: '%s'
T)�reverseNs' pending file src: '%s' -> dst: '%s'
) r� r r r �dirname�hasdirr� r> rK rV �
startswithrT )r/ r� r �fullcopy� addedfilesfn�invalidr r r �dsrc�ddstr� �d�dirmove_children_firstr r( �dfr r r r , sR
��
���� r c s* |� � du r
|�� }�� � du r��� �t� }|�� �| �d� � � �� � �s3| j�d� t| |�� �S �}|� kr]t|� � �dkrN| j�d� t| |�� �S |�
|� � � |�� }|� ks9i }t � ��}t
�|�D ] \}} | �v ru| ||< qi� ��fdd���fdd �|D �}
i } |
�r t�t�} t�t�}
��� �� �D ] }tj�|�}tj�|�}| | �|� |
| �|� q�|
D ]O}tj�|�}tj�|�}| | }|
| }|| }��|�}| j�d
d �}t|�|kr�| j�td �|t|�f � q�|D ]}|�|�}t ||��r
|| |< q�q�t | �t |�i fS )
a} Fast copytracing using filename heuristics
Assumes that moves or renames are of following two types:
1) Inside a directory only (same directory name but different filenames)
2) Move from one directory to another
(same filenames but different directory names)
Works only when there are no merge commits in the "source branch".
Source branch is commits from base up to c2 not including base.
If merge is involved it fallbacks to _fullcopytracing().
Can be used by setting the following config:
[experimental]
copytrace = heuristics
In some cases the copy/move candidates found by heuristics can be very large
in number and that will make the algorithm slow. The number of possible
candidates to check can be limited by using the config
`experimental.copytrace.movecandidateslimit` which defaults to 100.
Nr� s? switching to full copytracing as base is not an ancestor of c2
r� s0 switching to full copytracing because of merges
c s | �vo | � v o | �v S r* r )r( )rY r� r� r r r � r� z(_heuristicscopytracing.<locals>.<lambda>c s g | ]}� |�r|�qS r r )r r( )�filtr r r� � r� z*_heuristicscopytracing.<locals>.<listcomp>r< s copytrace.movecandidateslimitsB skipping copytracing for '%s', more candidates than the limit: %d
) rN rL r� r4 r� r> rK r� rT rk r rQ r� r r � collections� defaultdictr r5 �osr# �basenamer; r� �filectxr� �statusr r� r� )r/ r� r� rY � changedfilesr� r! �cpr r � missingfilesr �basenametofilename�dirnametofilenamer( rJ r; � samebasename� samedirname�movecandidates�f2�
maxcandidates� candidate�f1r )rY r� rF r� r r� s s| � �
�
� �
��
��r� c C s� | |krdS | � � |� � }}z;| �� |�� }}|du r!t|�} |du r)t|�} | �� |�� }}||kr<t|�} n||krEt|�}n| |kW S q* tyT Y dS w )aF return True if f1 and f2 filectx have a common ancestor
Walk back to common ancestor to see if the two files originate
from the same file. Since workingfilectx's rev() is None it messes
up the integer comparison logic, hence the pre-step check for
None (f1 and f2 can only be workingfilectx's initially).
TNF)r" �linkrev�next�
StopIteration)rX rU �g1�g2�f1r�f2rr r r r� � s(
� �r� c C sh t ||�}| �� }t|| |� t|�� �D ] \}}||v r ||= qt�|�D ] \}}| | �|� q&dS )a reproduce copies between base and ctx in the wctx
Unlike mergecopies(), this function will only consider copies between base
and ctx; it will ignore copies between base and wctx. Also unlike
mergecopies(), this function will apply copies to the working copy (instead
of just returning information about the copies). That makes it cheaper
(especially in the common case of base==ctx.p1()) and useful also when
experimental.copytrace=off.
merge.update() will have already marked most copies, but it will only
mark copies if it thinks the source files are related (see
merge._related()). It will also not mark copies if the file wasn't modified
on the local side. This function adds the copies that were "missed"
by merge.update().
N)r� rL r r r r r �
markcopied) �wctxr� rY �
new_copiesr� r� �__r r r r r � graftcopies s
��rd r* )NN)8�
__future__r rG rI �i18nr r� r � r rO r r r r
�utilsr � revlogutilsr r
rd �
importrustrp r r! r) r2 r: rB rb rr rz rH r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r �objectr� r� r r� r� rd r r r r �<module> sT
!
C&lr :'F
.F$
Gm !