File: //kunden/lib/python3/dist-packages/breezy/__pycache__/tree.cpython-39.pyc
a
�*�^�� � @ sV d Z ddlmZ zddlmZ W n ey> ddlmZ Y n0 ddlmZ ee� d� ddl m
Z
m Z m Z ddl
mZ dd lmZmZ G d
d � d e
j�ZG d d
� d
e
j�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�Z G d d � d e�Z e � e � d&d d �Z d'd!d"�Z d#d$� Z!d%S )(z7Tree classes, representing directory at point in time.
� )�absolute_import)�deque� )� lazy_importz�
from breezy import (
conflicts as _mod_conflicts,
debug,
delta,
filters,
revision as _mod_revision,
rules,
trace,
)
from breezy.i18n import gettext
)�errors�lock�osutils)� InterObject)� text_type�
viewvaluesc @ s e Zd ZdZdZdd� ZdS )�FileTimestampUnavailablez,The filestamp for %(path)s is not available.Tc C s
|| _ d S �N��path��selfr � r �-/usr/lib/python3/dist-packages/breezy/tree.py�__init__< s z!FileTimestampUnavailable.__init__N)�__name__�
__module__� __qualname__�_fmtZinternal_errorr r r r r r 6 s r c @ s e Zd ZdZdd� ZdS )�MissingNestedTreez1The nested tree for %(path)s can not be resolved.c C s
|| _ d S r
r r r r r r D s zMissingNestedTree.__init__N)r r r r r r r r r r @ s r c @ s0 e Zd ZdZg Zdd� ZdZdd� Zdd� ZdS ) � TreeEntryzEAn entry that implements the minimum interface used by commands.
c C s t |t�o|j| jkS r
)�
isinstancer � __class__�r �otherr r r �__eq__N s
�zTreeEntry.__eq__Nc C s dS )Nz???r �r r r r �kind_characterU s zTreeEntry.kind_characterc C s dS )z�Does this entry reference the same entry?
This is mostly the same as __eq__, but returns False
for entries without enough information (i.e. revision is None)
Fr r r r r �
is_unmodifiedX s zTreeEntry.is_unmodified) r r r �__doc__� __slots__r �kindr! r" r r r r r H s r c @ s e Zd ZdZg ZdZdd� ZdS )�
TreeDirectoryz5See TreeEntry. This is a directory in a working tree.� directoryc C s dS �N�/r r r r r r! h s z TreeDirectory.kind_characterN�r r r r# r$ r% r! r r r r r& a s r& c @ s e Zd ZdZg ZdZdd� ZdS )�TreeFilez8See TreeEntry. This is a regular file in a working tree.�filec C s dS �N� r r r r r r! s s zTreeFile.kind_characterNr* r r r r r+ l s r+ c @ s e Zd ZdZg ZdZdd� ZdS )�TreeLinkz3See TreeEntry. This is a symlink in a working tree.�symlinkc C s dS r- r r r r r r! ~ s zTreeLink.kind_characterNr* r r r r r/ w s r/ c @ s e Zd ZdZg ZdZdd� ZdS )�
TreeReferencezFSee TreeEntry. This is a reference to a nested tree in a working tree.�tree-referencec C s dS )N�+r r r r r r! � s z TreeReference.kind_characterNr* r r r r r1 � s r1 c @ sb e Zd ZdZg d�Zddd�Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
dS )�
TreeChangezCDescribes the changes between the same item in two different trees.� �file_idr �changed_content� versioned� parent_id�namer% �
executable�copiedFc
C s: || _ || _|| _|| _|| _|| _|| _|| _| | _d S r
r5 )
r r6 r r7 r8 r9 r: r% r; r< r r r r � s zTreeChange.__init__c C s d| j j| �� f S )Nz%s%r)r r � _as_tupler r r r �__repr__� s zTreeChange.__repr__c C s
t | j�S r
)�lenr$ r r r r �__len__� s zTreeChange.__len__c C s( | j | j| j| j| j| j| j| j| jf S r
r5 r r r r r= � s �zTreeChange._as_tuplec C s4 t |t�r| �� |�� kS t |t�r0| �� |kS dS �NF)r r4 r= �tupler r r r r � s
zTreeChange.__eq__c C s | � � |� � k S r
)r= r r r r �__lt__� s zTreeChange.__lt__c C s" | j dkr | jd | jd kS dS )N)TTr r F)r8 r; r r r r �
meta_modified� s
zTreeChange.meta_modifiedc C s | j d | j d kS )Nr r )r9 r r r r �
is_reparented� s zTreeChange.is_reparentedc C s\ | j | j| jd d f| j| jd d f| jd d f| jd d f| jd d f| jd d fdd� S )Nr F)r< ) r r6 r r7 r8 r9 r: r% r; r r r r � discard_new� s �zTreeChange.discard_newN)F)r r r r# r$ r r> r@ r= r rC rD rE rF r r r r r4 � s �
r4 c @ s� e Zd ZdZdd� Zdd� Zdd� Zdod
d �Zdpd
d�Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd � Zdqd d �Zdrd d!�Zd"d#� Zdsd$d%�Zd&d'� Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Zdtd2d3�Zd4d5� Zd6d7� Z d8d9� Z d:d;� Z d<d=� Z dud>d?�Z dvd@dA�Z!dBdC� Z"dDdE� Z#dFdG� Z$dHdI� Z%dJdK� Z&e'j(fdLdM�Z)dNdO� Z*dPdQ� Z+g d fdRdS�Z,dTdU� Z-dVdW� Z.dXdY� Z/dZd[� Z0d\d]� Z1dwd_d`�Z2dadb� Z3dxdcdd�Z4dedf� Z5dydgdh�Z6didj� Z7dzdkdl�Z8e9dmdn� �Z:d S ){�Treea+ Abstract file tree.
There are several subclasses:
* `WorkingTree` exists as files on disk editable by the user.
* `RevisionTree` is a tree as recorded at some point in the past.
Trees can be compared, etc, regardless of whether they are working
trees or versioned trees.
c C s dS )z�Whether this tree supports rename tracking.
This defaults to True, but some implementations may want to override
it.
Tr r r r r �supports_rename_tracking� s z Tree.supports_rename_trackingc C s dS )z�Whether this tree can contain explicitly versioned directories.
This defaults to True, but some implementations may want to override
it.
Tr r r r r �has_versioned_directories� s z Tree.has_versioned_directoriesc C s t �� S )z/Does this tree support symbolic links?
)r Z has_symlinksr r r r �supports_symlinks� s zTree.supports_symlinksFNc C s t �|| �j||||||d�S )a Return a TreeDelta of the changes from other to this tree.
:param other: A tree to compare with.
:param specific_files: An optional list of file paths to restrict the
comparison to. When mapping filenames to ids, all matches in all
trees (including optional extra_trees) are used, and all children of
matched directories are included.
:param want_unchanged: An optional boolean requesting the inclusion of
unchanged entries in the result.
:param extra_trees: An optional list of additional trees to use when
mapping the contents of specific_files (paths) to their identities.
:param require_versioned: An optional boolean (defaults to False). When
supplied and True all the 'specific_files' must be versioned, or
a PathsNotVersionedError will be thrown.
:param want_unversioned: Scan for unversioned paths.
The comparison will be performed by an InterTree object looked up on
self and other.
)�want_unchanged�specific_files� extra_trees�require_versioned� include_root�want_unversioned)� InterTree�get�compare)r r rK rL rM rN rO rP r r r � changes_from� s �zTree.changes_fromTc C s" t �|| �}|j||||||d�S )zSee InterTree.iter_changes)rP )rQ rR � iter_changes) r � from_tree�include_unchangedrL �pbrM rN rP Z intertreer r r rU s
�zTree.iter_changesc C s t �� S )zuGet a list of the conflicts in the tree.
Each conflict is an instance of breezy.conflicts.Conflict.
)Z_mod_conflictsZ ConflictListr r r r � conflicts s zTree.conflictsc C s g S )zAFor trees that can have unversioned files, return all such paths.r r r r r �extras s z Tree.extrasc C s t | j��dS )z�Get the parent ids for this tree.
:return: a list of parent ids. [] is returned to indicate
a tree with no parents.
:raises: BzrError if the parents are not known.
N)�NotImplementedError�get_parent_idsr r r r r\ s zTree.get_parent_idsc C s t | j��dS )z$True if the tree has given filename.N)r[ � has_filename�r �filenamer r r r] % s zTree.has_filenamec C s dS )z�Check whether the filename is ignored by this tree.
:param filename: The relative filename within the tree.
:return: True if the filename is ignored.
Fr r^ r r r �
is_ignored) s zTree.is_ignoredc C s t | j��dS )z>Iterate through all file ids, including ids for missing files.N)r[ � all_file_idsr r r r ra 1 s zTree.all_file_idsc C s t | j��dS )z=Iterate through all paths, including paths for missing files.N)r[ �all_versioned_pathsr r r r rb 5 s zTree.all_versioned_paths�downc C s t | j��dS )zBReturn the path for a file id.
:raises NoSuchId:
N)r[ �id2path)r r6 �recurser r r rd 9 s z Tree.id2pathc C s t | j��dS )aJ Walk the tree in 'by_dir' order.
This will yield each entry in the tree as a (path, entry) tuple.
The order that they are yielded is:
Directories are walked in a depth-first lexicographical order,
however, whenever a directory is reached, all of its direct child
nodes are yielded in lexicographical order before yielding the
grandchildren.
For example, in the tree::
a/
b/
c
d/
e
f/
g
The yield order (ignoring root) would be::
a, f, a/b, a/d, a/b/c, a/d/e, f/g
If recurse_nested is enabled then nested trees are included as if
they were a part of the tree. If is disabled then TreeReference
objects (without any children) are yielded.
N)r[ �iter_entries_by_dir)r rL �recurse_nestedr r r rf @ s zTree.iter_entries_by_dirc C s t | j��dS )z�Iterate over the children of a directory or tree reference.
:param path: Path of the directory
:raise NoSuchFile: When the path does not exist
:return: Iterator over entries in the directory
N)r[ �iter_child_entriesr r r r rh _ s zTree.iter_child_entriesc C s t | j��dS )a{ List all files in this tree.
:param include_root: Whether to include the entry for the tree root
:param from_dir: Directory under which to list files
:param recursive: Whether to list files recursively
:param recurse_nested: enter nested trees
:return: iterator over tuples of
(path, versioned, kind, inventory entry)
N)r[ �
list_files)r rO Zfrom_dir� recursiverg r r r ri h s zTree.list_filesc c s. | � � r*| �� D ]\}}|jdkr|V qd S )Nr2 )Zsupports_tree_referencerf r% )r r �entryr r r �iter_referencesu s
zTree.iter_referencesc C sF | � � D ]8}|d7 }|�|�r| �|�}||t|�d� f S qdS )z~Find the nested tree that contains a path.
:return: tuple with (nested tree and path inside the nested tree)
r) N�NN)rl �
startswith�get_nested_treer? )r r Z nested_pathZ nested_treer r r �get_containing_nested_tree{ s
z Tree.get_containing_nested_treec C s t | j��dS )z�Open the nested tree at the specified path.
:param path: Path from which to resolve tree reference.
:return: A Tree object for the nested tree
:raise MissingNestedTree: If the nested tree can not be resolved
N)r[ ro r r r r ro � s zTree.get_nested_treec C s t d| jj ��d S )Nz$Tree subclass %s must implement kind�r[ r r r r r r r% � s �z Tree.kindc C s
| � |�S )z�File kind stored for this path.
May not match kind on disk for working trees. Always available
for versioned files, even when the file itself is missing.
)r% r r r r � stored_kind� s zTree.stored_kindc C s t | j��dS )a� Get a summary of the information about path.
All the attributes returned are for the canonical form, not the
convenient form (if content filters are in use.)
:param path: A relative path within the tree.
:return: A tuple containing kind, size, exec, sha1-or-link.
Kind is always present (see tree.kind()).
size is present if kind is file and the size of the
canonical form can be cheaply determined, None otherwise.
exec is None unless kind is file and the platform supports the 'x'
bit.
sha1-or-link is the link target if kind is symlink, or the sha1 if
it can be obtained without reading the file.
N)r[ �path_content_summaryr r r r rs � s zTree.path_content_summaryc C s t d| jj ��d S )Nz6Tree subclass %s must implement get_reference_revisionrq )r r �branchr r r �get_reference_revision� s �zTree.get_reference_revisionc C s t | j��dS )a@ Return a tuple of kind, executable, stat_value for a file.
entry may be None if there is no inventory entry for the file, but
path must always be supplied.
kind is None if there is no file present (even if an inventory id is
present). executable is False for non-file entries.
N)r[ �_comparison_data)r rk r r r r rv � s zTree._comparison_datac C s t | j��dS )z<Return a file object for the file path in the tree.
N)r[ �get_filer r r r rw � s z
Tree.get_filec C s | � |�dfS )a� Get a file handle and stat object for path.
The default implementation returns (self.get_file, None) for backwards
compatibility.
:param path: The path of the file.
:return: A tuple (file_handle, stat_value_or_None). If the tree has
no stat facility, or need for a stat cache feedback during commit,
it may return None for the second element of the tuple.
N)rw r r r r �get_file_with_stat� s zTree.get_file_with_statc C s6 | � |��}|�� W d � S 1 s(0 Y dS )z�Return the byte content of a file.
:param path: The path of the file.
:returns: A single byte string for the whole file.
N)rw �read)r r Zmy_filer r r �
get_file_text� s zTree.get_file_textc C s t �| �|��S )z\Return the content of a file, as lines.
:param path: The path of the file.
)r Z split_linesrz r r r r �get_file_lines� s zTree.get_file_linesc C s d| j ||d�fS )aD Return a verifier for a file.
The default implementation returns a sha1.
:param path: The path that this file can be found at.
These must point to the same object.
:param stat_value: Optional stat value for the object
:return: Tuple with verifier name and verifier data
�SHA1)�
stat_value)�
get_file_sha1�r r r} r r r �get_file_verifier� s
zTree.get_file_verifierc C s t | j��dS )ag Return the SHA1 file for a file.
:note: callers should use get_file_verifier instead
where possible, as the underlying repository implementation may
have quicker access to a non-sha1 verifier.
:param path: The path that this file can be found at.
:param stat_value: Optional stat value for the object
N)r[ r~ r r r r r~ � s
zTree.get_file_sha1c C s t | j��dS )zpReturn the modification time for a file.
:param path: The path that this file can be found at.
N)r[ �get_file_mtimer r r r r� � s zTree.get_file_mtimec C s t | j��dS )z�Return the size of a file in bytes.
This applies only to regular files. If invoked on directories or
symlinks, it will return None.
N)r[ �
get_file_sizer r r r r� s zTree.get_file_sizec C s t | j��dS )zfCheck if a file is executable.
:param path: The path that this file can be found at.
N)r[ �
is_executabler r r r r� s zTree.is_executablec c s( |D ] \}}| � |�f}||fV qdS )a Iterate through file contents.
Files will not necessarily be returned in the order they occur in
desired_files. No specific order is guaranteed.
Yields pairs of identifier, bytes_iterator. identifier is an opaque
value supplied by the caller as part of desired_files. It should
uniquely identify the file version in the caller's context. (Examples:
an index number or a TreeTransform trans_id.)
bytes_iterator is an iterable of bytestrings for the file. The
kind of iterable and length of the bytestrings are unspecified, but for
this implementation, it is a tuple containing a single bytestring with
the complete text of the file.
:param desired_files: a list of (path, identifier) pairs
N)rz )r Z
desired_filesr Z
identifierZcur_filer r r �iter_files_bytes s zTree.iter_files_bytesc C s t | j��dS )z�Get the target for a given path.
It is assumed that the caller already knows that path is referencing
a symlink.
:param path: The path of the file.
:return: The path the symlink points to.
N)r[ �get_symlink_targetr r r r r� * s zTree.get_symlink_targetc C s t | j��dS )a� Return an iterator of revision_id, line tuples.
For working trees (and mutable trees in general), the special
revision_id 'current:' will be used for lines that are new in this
tree, e.g. uncommitted changes.
:param path: The file to produce an annotated version from
:param default_revision: For lines that don't match a basis, mark them
with this revision id. Not all implementations will make use of
this value.
N)r[ �
annotate_iter)r r Zdefault_revisionr r r r� 4 s zTree.annotate_iterc C s t | j��dS )z$Return the id for path in this tree.N)r[ �path2idr r r r r� B s z Tree.path2idc C s | � |�duS )zfCheck whether path is versioned.
:param path: Path to check
:return: boolean
N)r� r r r r � is_versionedF s zTree.is_versionedc C s t | j��dS )aH Find related paths in tree corresponding to specified filenames in any
of `lookup_trees`.
All matches in all trees will be used, and all children of matched
directories will be used.
:param paths: The filenames to find related paths for (if None, returns
None)
:param trees: The trees to find file_ids within
:param require_versioned: if true, all specified filenames must occur in
at least one tree.
:return: a set of paths for the specified filenames and their children
in `tree`
N)r[ � find_related_paths_across_trees)r �paths�treesrN r r r r� N s z$Tree.find_related_paths_across_treesc C s t �| j�S )zmLock this tree for multiple read only operations.
:return: A breezy.lock.LogicalLockResult.
)r ZLogicalLockResult�unlockr r r r � lock_read` s zTree.lock_readc C s t �| |��dS )aE Obtain a revision tree for the revision revision_id.
The intention of this method is to allow access to possibly cached
tree data. Implementors of this method should raise NoSuchRevision if
the tree is not locally available, even if they could obtain the
tree via a repository or some other means. Callers are responsible
for finding the ultimate source for a revision tree.
:param revision_id: The revision_id of the requested tree.
:return: A Tree.
:raises: NoSuchRevision if the tree cannot be obtained.
N)r ZNoSuchRevisionInTree)r Z revision_idr r r �
revision_treeg s
zTree.revision_treec C s t g �S )zoWhat files are present in this tree and unknown.
:return: an iterator over the unknown files.
)�iterr r r r �unknownsv s z
Tree.unknownsc C s d S r
r r r r r r� } s z Tree.unlockc s t � fdd�|D ��S )zMFilter out paths that are versioned.
:return: set of paths.
c 3 s | ]}� � |�s|V qd S r
)r� ��.0�pr r r � <genexpr>� � z0Tree.filter_unversioned_files.<locals>.<genexpr>)�set)r r� r r r �filter_unversioned_files� s z Tree.filter_unversioned_filesr. c C s t | j��dS )a� Walk the contents of this tree from path down.
This yields all the data about the contents of a directory at a time.
After each directory has been yielded, if the caller has mutated the
list to exclude some directories, they are then not descended into.
The data yielded is of the form:
((directory-relpath, directory-path-from-root, directory-fileid),
[(relpath, basename, kind, lstat, path_from_tree_root, file_id,
versioned_kind), ...]),
- directory-relpath is the containing dirs relpath from prefix
- directory-path-from-root is the containing dirs path from /
- directory-fileid is the id of the directory if it is versioned.
- relpath is the relative path within the subtree being walked.
- basename is the basename
- kind is the kind of the file now. If unknonwn then the file is not
present within the tree - but it may be recorded as versioned. See
versioned_kind.
- lstat is the stat data *if* the file was statted.
- path_from_tree_root is the path from the root of the tree.
- file_id is the file_id if the entry is versioned.
- versioned_kind is the kind of the file as last recorded in the
versioning system. If 'unknown' the file is not versioned.
One of 'kind' and 'versioned_kind' must not be 'unknown'.
:param prefix: Start walking from prefix within the tree rather than
at the root. This allows one to walk a subtree but get paths that are
relative to a tree rooted higher up.
:return: an iterator over the directory data.
N)r[ �walkdirs)r �prefixr r r r� � s z
Tree.walkdirsc C s dS rA r r r r r �supports_content_filtering� s z Tree.supports_content_filteringc C sZ t �� }t|�dkrg S t| �|g|��}t �|�}dtjv rVt� t
d�� |||�� |S )a� The stack of content filters for a path if filtering is supported.
Readers will be applied in first-to-last order.
Writers will be applied in last-to-first order.
Either the path or the file-id needs to be provided.
:param path: path relative to the root of the tree
or None if unknown
:return: the list of filters - [] if there are none
r �filtersz$*** {0} content-filter: {1} => {2!r}) r� Z_get_registered_namesr? �next�iter_search_rulesZ_get_filter_stack_for�debugZ debug_flagsZtraceZnote�gettext�format)r r Zfilter_pref_namesZprefsZstkr r r �_content_filter_stack� s
�zTree._content_filter_stackc C s | � � r| jS dS dS )z�A function that returns a stack of ContentFilters.
The function takes a path (relative to the top of the tree) and a
file-id as parameters.
:return: None if content filtering is not supported by this tree.
N)r� r� r r r r � _content_filter_stack_provider� s z#Tree._content_filter_stack_providerc c s\ |du rt j}| �|�}|durX|durB|D ]}|�||�V q,n|D ]}|�|�V qFdS )a� Find the preferences for filenames in a tree.
:param path_names: an iterable of paths to find attributes for.
Paths are given relative to the root of the tree.
:param pref_names: the list of preferences to lookup - None for all
:param _default_searcher: private parameter to assist testing - don't use
:return: an iterator of tuple sequences, one per path-name.
See _RulesSearcher.get_items for details on the tuple sequence.
N)ZrulesZ_per_user_searcher�_get_rules_searcherZget_selected_itemsZ get_items)r Z
path_namesZ
pref_namesZ_default_searcher�searcherr r r r r� � s
zTree.iter_search_rulesc C s |}|S )z:Get the RulesSearcher for this tree given the default one.r )r Zdefault_searcherr� r r r r� � s zTree._get_rules_searcherc C sL ddl m} | �� �$ ||| ||||d�W d � S 1 s>0 Y dS )a Create an archive of this tree.
:param format: Format name (e.g. 'tar')
:param name: target file name
:param root: Root directory name (or None)
:param subdir: Subdirectory to export (or None)
:return: Iterator over archive chunks
r )�create_archive)� force_mtimeN)�archiver� r� )r r� r: �rootZsubdirr� r� r r r r� � s
�z Tree.archivec C s |dv S )z;Check if this tree support versioning a specific file kind.)r, r' r0 r2 r )�clsr% r r r �versionable_kind� s zTree.versionable_kind)FNNFFF)FNNNTF)rc )NF)FNTF)N)N)N)r. )N)NN)r. NN);r r r r# rH rI rJ rT rU rY rZ r\ r] r` ra rb rd rf rh ri rl rp ro r% rr rs ru rv rw rx rz r{ r� r~ r� r� r� r� r� Z
_mod_revisionZCURRENT_REVISIONr� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� � classmethodr� r r r r rG � s� �
" �
�
�
�
!
�
�
rG c @ s� e Zd ZdZdZdZg Zedd� �Zdd� Z d dd �Z
dddg d
dfd d �Z e d
d� �Z
d dd�Zd dd�Zd dd�Zd dd�Zd!dd�Zd"dd�ZdS )#rQ a� This class represents operations taking place between two Trees.
Its instances have methods like 'compare' and contain references to the
source and target trees these operations are to be carried out on.
Clients of breezy should not need to use InterTree directly, rather they
should use the convenience methods on Tree such as 'Tree.compare()' which
will pass through to InterTree as appropriate.
Nc C s dS )NTr )Zkls�source�targetr r r �
is_compatible s zInterTree.is_compatiblec C s� |du r |du rdS |j }n|j }|durPd}|j}|j}| j�||�\} }
} nd}d}d}d} d}
|dur�d} |j}
|j}| j�||�\}}}nd} d}
d}d}d}|| f}| |f}d}| |kr�d}np| dkr�| �||| |�s�d}nR| dk�r| j�|�| j�|�k�r8d}n(| dk�r8| j�|�| j�|�k�r8d}||f}||
f}|
|f}|du�s�|d |d k�s�|d |d k�s�|d |d k�s�|d |d k�r�d}nd}t |||f||||||�|fS ) a� Generate a iter_changes tuple between source_entry and target_entry.
:param source_entry: An inventory entry from self.source, or None.
:param target_entry: An inventory entry from self.target, or None.
:param source_path: The path of source_entry.
:param target_path: The path of target_entry.
:return: A tuple, item 0 of which is an iter_changes result tuple, and
item 1 is True if there are any changes in the result tuple.
NTFr, r0 r2 r r )
r6 r: r9 r� rv r� �file_content_matchesr� ru r4 )r � source_entry� target_entry� source_path� target_pathr6 Zsource_versionedZ source_nameZ
source_parentZ source_kindZsource_executable� source_statZtarget_versionedZ target_nameZ
target_parent� target_kind�target_executable� target_statr8 r% r7 �parentr: r; �changesr r r �_changes_from_entries s� �
�
�
�
� ���
��z InterTree._changes_from_entriesFc C sf | j f}|dur |t|� }| �� �. tj| j | j||||||d�W d � S 1 sX0 Y dS )a� Return the changes from source to target.
:return: A TreeDelta.
:param specific_files: An optional list of file paths to restrict the
comparison to. When mapping filenames to ids, all matches in all
trees (including optional extra_trees) are used, and all children of
matched directories are included.
:param want_unchanged: An optional boolean requesting the inclusion of
unchanged entries in the result.
:param extra_trees: An optional list of additional trees to use when
mapping the contents of specific_files (paths) to file_ids.
:param require_versioned: An optional boolean (defaults to False). When
supplied and True all the 'specific_files' must be versioned, or
a PathsNotVersionedError will be thrown.
:param want_unversioned: Scan for unversioned paths.
N)rM rN rP )r� rB r� ZdeltaZ_compare_treesr� )r rK rL rM rN rO rP r� r r r rS a s
�zInterTree.compareTc 0 # s� |s
g }nt |�}t� }g }� g kr.g } g }
n4| jj� | jg| |d�} | jj� | jg| |d�}
� durvt� } t� } |r�t� fdd�| j�� D ��}
t|
�}
nt� }
i }t | jj|
d��}t |�}t | jj| d��}| �
dd� |D ��}t |�t |� }d}t � }|D �]�\}}|
�r�|
d d |�
d�k �r�|
�� }| j�||d �\}}}tdd|d fd
d d d|d d
fd|fd|f�V �q|| } | du�r�|�| �} nd} | j| || |d�\} } | jd || j< |d 7 }| jd �r�|d 7 }|du�r|�d||� | �s|�r<� du�r6|�| jd � |�| j� | V � du�r| jd dk�rb| �| j� | jd �rx| �� �r| �| jd � �q|
�r�|
�� }| j�||d �\} }!}"tdd|d fd
d d d|d d
fd| fd|!f�V �q�|D ]�\}#}$|$j}%|%|v �r
�q�| � |#�}&|d 7 }|du�r4|�d||� d}'|$jdf}(|$j df})| j�|$|#�\}*}+},|*df}-|+df}.|*du}/|�|%� t|%|#|&f|/|'|(|)|-|.�V �q�t|�}� du�r�| � ||�D ] } | V �q�dS )a� Generate an iterator of changes between trees.
A tuple is returned:
(file_id, (path_in_source, path_in_target),
changed_content, versioned, parent, name, kind,
executable)
Changed_content is True if the file's content has changed. This
includes changes to its kind, and to a symlink's target.
versioned, parent, name, kind, executable are tuples of (from, to).
If a file is missing in a tree, its kind is None.
Iteration is done in parent-to-child order, relative to the target
tree.
There is no guarantee that all paths are in sorted order: the
requirement to expand the search due to renames may result in children
that should be found early being found late in the search, after
lexically later results have been returned.
:param require_versioned: Raise errors.PathsNotVersionedError if a
path in the specific_files list is not versioned in one of
source, target or extra_trees.
:param specific_files: An optional list of file paths to restrict the
comparison to. When mapping filenames to ids, all matches in all
trees (including optional extra_trees) are used, and all children
of matched directories are included. The parents in the target tree
of the specific files up to and including the root of the tree are
always evaluated for changes too.
:param want_unversioned: Should unversioned files be returned in the
output. An unversioned file is defined as one with (False, False)
for the versioned pair.
)rN Nc s. g | ]&}� d u s t �� |�r|�d�|f�qS r( )r Z
is_inside_any�splitr� �rL r r �
<listcomp>� s �z*InterTree.iter_changes.<locals>.<listcomp>r� c S s g | ] \}}|�qS r r )r� r� �er r r r� � r� r r) r T)FFrm ���)r� r� zcomparing filesr' )TF) �listr� r� r� r� �sortedrZ r rf �dict�find_source_pathsr? r+ r� �popleftrv r4 rR r� r r6 r8 �update�addr9 �appendr% rE �find_target_pathr: �_handle_precise_ids)0r rW rL rX rM rN rP �precise_file_ids�changed_file_idsZtarget_specific_filesZsource_specific_filesZ seen_parentsZ seen_dirsZall_unversionedZto_pathsZfrom_entries_by_dirZ from_dataZto_entries_by_dirZ path_equivsZ num_entriesZ entry_countZ
fake_entryr� r� Zunversioned_pathr� r� r� r� r� �resultr� Zto_kindZ
to_executableZto_statr Z
from_entryr6 Zto_pathr8 r� r: Z from_kindZfrom_executabler} r% r; r7 r r� r rU } s� $ � � �
������
�
��
�
�
�zInterTree.iter_changesc C s6 z | j |gd�}t|�d W S ty0 Y dS 0 dS )aU Get an inventory entry from a tree, with missing entries as None.
If the tree raises NotImplementedError on accessing .inventory, then
this is worked around using iter_entries_by_dir on just the file id
desired.
:param tree: The tree to lookup the entry in.
:param path: The path to look up
r� r N)rf r� �
StopIteration)�treer �iteratorr r r �
_get_entry s
zInterTree._get_entryc c s� |�r�|� d� |�|� |s"�q�g }|D ]0}z|�| j�|�� W q* tjyX Y q*0 q*|D ]}| j�|�}|� |� q`|� d� |}t
� }|D �]D} |r�|� | �}
d} nd}
|
du �rLz| j�| �} W n tjy� d} d} Y n0 | � | j| �} z| j�| �}
W n tj�y& d}
d}Y n0 | � | j|
�}| �
| || |
�\}
}nd}|
jd }|� |� |r�|
jd dk�r�|
jd dk�r�| du �r�| � | j|
jd �} |�dd� | j�|
jd �D �� |� |
j� |
V q�q dS )a� Fill out a partial iter_changes to be consistent.
:param precise_file_ids: The file ids of parents that were seen during
the iter_changes.
:param changed_file_ids: The file ids of already emitted items.
:param discarded_changes: An optional dict of precalculated
iter_changes items which the partial iter_changes had not output
but had calculated.
:return: A generator of iter_changes items to output.
NTr r r' c s s | ] }|j V qd S r
)r6 )r� �childr r r r� � s �z0InterTree._handle_precise_ids.<locals>.<genexpr>)�discard�difference_updater� r� rd r �NoSuchIdr� r� r� r� rR r� r� r9 r% r r� rh r6 )r r� r� Zdiscarded_changesr� r9 r Zold_idZ current_idsr6 r� r� r� r� r� r� Z
new_parent_idr r r r� 1 st
�
��
�
�
� z InterTree._handle_precise_idsc C s� | � � �� | j�||�\}}| j�||�\}}||krL||kW d � S |dkrd| j�||�} n|} |dkr�| j�||�}
n|}
| |
kW d � S 1 s�0 Y dS )a$ Check if two files are the same in the source and target trees.
This only checks that the contents of the files are the same,
it does not touch anything else.
:param source_path: Path of the file in the source tree
:param target_path: Path of the file in the target tree
:param source_stat: Optional stat value of the file in the source tree
:param target_stat: Optional stat value of the file in the target tree
:return: Boolean indicating whether the files have the same contents
Nr| )r� r� r� r� r~ ) r r� r� r� r� Zsource_verifier_kindZsource_verifier_dataZtarget_verifier_kindZtarget_verifier_dataZ source_sha1Z target_sha1r r r r� � s(
�����z InterTree.file_content_matches�nonec C sL | j �|�}|du r t�|��z| jj||d�W S tjyF Y dS 0 dS )z�Find target tree path.
:param path: Path to search for (exists in source)
:return: path in target, or None if there is no equivalent path.
:raise NoSuchFile: If the path doesn't exist in source
N�re )r� r� r �
NoSuchFiler� rd r� �r r re r6 r r r r� � s
zInterTree.find_target_pathc C sL | j �|�}|du r t�|��z| jj||d�W S tjyF Y dS 0 dS )z�Find the source tree path.
:param path: Path to search for (exists in target)
:return: path in source, or None if there is no equivalent path.
:raise NoSuchFile: if the path doesn't exist in target
Nr� )r� r� r r� r� rd r� r� r r r �find_source_path� s
zInterTree.find_source_pathc C s$ i }|D ]}| j ||d�||< q|S )z�Find target tree paths.
:param paths: Iterable over paths in target to search for
:return: Dictionary mapping from source paths to paths in target , or
None if there is no equivalent path.
r� )r� �r r� re Zretr r r r �find_target_paths� s zInterTree.find_target_pathsc C s$ i }|D ]}| j ||d�||< q|S )z�Find source tree paths.
:param paths: Iterable over paths in target to search for
:return: Dictionary mapping from target paths to paths in source, or
None if there is no equivalent path.
r� )r� r� r r r r� � s zInterTree.find_source_paths)FNNFFF)N)NN)r� )r� )r� )r� )r r r r# Z_matching_from_tree_formatZ_matching_to_tree_formatZ _optimisersr� r� r� rS rU � staticmethodr� r� r� r� r� r� r� r r r r rQ s4
H �
�
#
�
Z �
#
rQ r� c C s t �|| �j||d�S )a Find previous tree paths.
:param from_tree: From tree
:param to_tree: To tree
:param paths: Iterable over paths in from_tree to search for
:return: Dictionary mapping from from_tree paths to paths in to_tree, or
None if there is no equivalent path.
r� )rQ rR r� )rV �to_treer� re r r r �find_previous_paths� s r� c C s t �|| �j||d�S )a Find previous tree path.
:param from_tree: From tree
:param to_tree: To tree
:param path: Path to search for (exists in from_tree)
:return: path in to_tree, or None if there is no equivalent path.
:raise NoSuchFile: If the path doesn't exist in from_tree
r� )rQ rR r� )rV r� r re r r r �find_previous_path� s �r� c
C s� d}t |�d��}|D ]�}||�}d}zn| �|�D ]^}z@|j|krXt�||j�}W q�n ||j�|krtt�||j�}W q2 tjy� Y q2Y q20 q2W n tjy� Y n0 |r�|}qtj||gt |��R � } q�q|S )z�Find the canonical path of an item, ignoring case.
:param tree: Tree to traverse
:param path: Case-insensitive path to look up
:param normalize: Function to normalize a filename for comparison
:return: The canonical path
r. r) N)
r� r� rh r: r Zpathjoinr r� Z
NotADirectoryr� ) r� r Z normalizeZcur_pathZbit_iter�eltZlelt�new_pathr� r r r �get_canonical_path� s,
r� N)r� )r� )"r# Z
__future__r �collections.abcr � ImportError� collectionsr �globalsr. r r r Zinterr Zsixishr
r ZBzrErrorr r �objectr r& r+ r/ r1 r4 rG rQ Zregister_optimiserr� r� r� r r r r �<module> s>
7 @ f