File: //kunden/lib/python3/dist-packages/breezy/__pycache__/memorytree.cpython-39.pyc
a
�*�^�/ � @ sx d Z ddlmZ ddlZddlZddlmZmZmZ ddl
m Z ddl m
Z
ddlmZ dd lmZ G d
d � d e
�ZdS ) z5MemoryTree object.
See MemoryTree for more details.
� )�absolute_importN� )�errors�lock�revision)� Inventory)�MutableInventoryTree)�sha_file)�MemoryTransportc @ s e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
e dd� �Z dd� Z
dd� ZdBdd�Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� ZdCd'd(�Zd)d*� Zd+d,� Zd-d.� Zd/d0� Zd1d2� Z d3d4� Z d5d6� Z d7d8� Z dDd:d;�Z d<d=� Z!d>d?� Z"dEd@dA�Z#dS )F�
MemoryTreez�A MemoryTree is a specialisation of MutableTree.
It maintains nearly no state outside of read_lock and write_lock
transactions. (it keeps a reference to the branch, and its last-revision
only).
c C s$ || _ |j| _|| _d| _d| _dS )z4Construct a MemoryTree for branch using revision_id.r N)�branchZ
controldir�_branch_revision_id�_locks�
_lock_mode)�selfr � revision_id� r �3/usr/lib/python3/dist-packages/breezy/memorytree.py�__init__. s
zMemoryTree.__init__c C s dS )NTr �r r r r �supports_symlinks6 s z MemoryTree.supports_symlinksc C s dS �NFr r r r r �supports_tree_reference9 s z"MemoryTree.supports_tree_referencec C s
| j �� S �N)r �get_config_stackr r r r r < s zMemoryTree.get_config_stackc C s dS r r �r �filenamer r r �is_control_filename? s z MemoryTree.is_control_filenamec C s� | � � �� t|||�D ]�\}}}|du rn| j�|�j}t�|�rFd}n(t�|�rVd}nt�|�rfd}ntd��|du r�| j j
||d� q| j j
|||d� qW d � n1 s�0 Y dS )zSee MutableTree._add.N�file�symlink� directoryzUnknown file kind)�kind)r! �file_id) �lock_tree_write�zip�_file_transport�stat�st_mode�S_ISREG�S_ISLNK�S_ISDIR�AssertionError�
_inventoryZadd_path)r �filesZids�kinds�fr" r! r' r r r �_addC s
zMemoryTree._addc C s | j S )zSee Tree.basis_tree().)� _basis_treer r r r �
basis_treeV s zMemoryTree.basis_treec C s t �| �� �}t| |�S )zBCreate a MemoryTree for branch, using the last-revision of branch.)�
_mod_revisionZ ensure_null�
last_revisionr )r r r r r �create_on_branchZ s zMemoryTree.create_on_branchc C s dS )z�See MutableTree._gather_kinds.
This implementation does not care about the file kind of
missing files, so is a no-op.
Nr )r r- r. r r r �
_gather_kinds` s zMemoryTree._gather_kindsc C s | j �|�S )zSee Tree.get_file.)r% �get�r �pathr r r �get_fileg s zMemoryTree.get_fileNc C s | j �|�}t|�S )zSee Tree.get_file_sha1().)r% r7 r )r r9 Z
stat_value�streamr r r �
get_file_sha1k s zMemoryTree.get_file_sha1c C s |du r dS |j |jdfS )zSee Tree._comparison_data.N)NFN)r! �
executable)r �entryr9 r r r �_comparison_datap s zMemoryTree._comparison_datac C sn | � � �R | �|�}tj�|�\}}| �|�}| j�||� | j�|||� W d � n1 s`0 Y d S r ) r# �path2id�osr9 �splitr% Zmover, �rename)r Zfrom_relZto_relr" Zto_dirZto_tailZ to_parent_idr r r �
rename_onev s
zMemoryTree.rename_onec C s� | � |�}|du rdS | �||�}|dkrZ| j�|�}t|�}| j| j}d}||||fS |dkrn|dddfS |dkr�|dd| j| jfS td��dS )z See Tree.path_content_summary.N)ZmissingNNNr r r z unknown kind) r@ r! r% Z get_bytes�lenr, r= �symlink_target�NotImplementedError)r r9 �idr! �bytes�sizer= Zsha1r r r �path_content_summary~ s
z MemoryTree.path_content_summaryc C s6 | � � � t| j�W d � S 1 s(0 Y dS )z�See Tree.get_parent_ids.
This implementation returns the current cached value from
self._parent_ids.
N)� lock_read�list� _parent_idsr r r r �get_parent_ids� s
zMemoryTree.get_parent_idsc C s | j �|�S )zSee Tree.has_filename().)r% Zhasr r r r � has_filename� s zMemoryTree.has_filenamec C s | j �|�jS r )r, �get_entry_by_pathr= r8 r r r �
is_executable� s zMemoryTree.is_executablec C s | j �|�jS r )r, rQ r! r8 r r r r! � s zMemoryTree.kindc C s0 | � ||d� |du r | �|�}| j�|� |S )zSee MutableTree.mkdir().r N)�addr@ r% �mkdir)r r9 r" r r r rT � s
zMemoryTree.mkdirc C s2 | � � � | jW d � S 1 s$0 Y dS )z See MutableTree.last_revision.N)rL r
r r r r r4 � s
zMemoryTree.last_revisionc C sf | j d7 _ z0| j dkr2| j�� d| _| �� t�| j�W S ty` | j d8 _ � Y n0 dS )zvLock the memory tree for reading.
This triggers population of data from the branch for its revision.
r �rN) r r rL r �_populate_from_branchr �LogicalLockResult�unlock�
BaseExceptionr r r r rL � s
zMemoryTree.lock_readc C sz | j d7 _ z<| j dkr4| j�� d| _| �� n| jdkrHt�| ��W n" tyl | j d8 _ � Y n0 t� | j
�S )z"See MutableTree.lock_tree_write().r �wrU ) r r rL r rV r �
ReadOnlyErrorrY r rW rX r r r r r# � s
zMemoryTree.lock_tree_writec C s| | j d7 _ zF| j dkr4| j�� d| _| �� n| jdkrHt�| ��t�| j �W S t
yv | j d8 _ � Y n0 dS )z See MutableTree.lock_write().r rZ rU N) r r �
lock_writer rV r r[ r rW rX rY r r r r r\ � s
zMemoryTree.lock_writec C s� | � � | jtjkr g | _n
| jg| _td| j�� �| _t � | _
| j� � }|D ]�\}}| j� |�
� � |dkrpqN|jdkr�| j
�|� qN|jdkr�| j
�|j|� qN|jdkr�| j
�|| j�|�� qNt| j��qNdS )z+Populate the in-tree state from the branch.N� r r r )�
_set_basisr
r3 �
NULL_REVISIONrN r r1 Zget_revision_idr, r
r% Ziter_entries_by_dirrS �copyr! rT r rF Zput_filer: rG rV )r Zinventory_entriesr9 r> r r r rV � s(
�z MemoryTree._populate_from_branchc C s | j �||� dS )z*See MutableTree.put_file_bytes_non_atomic.N)r% Z put_bytes)r r9 rI r r r �put_file_bytes_non_atomic� s z$MemoryTree.put_file_bytes_non_atomicc C sZ | j dkrHd| _g | _d| _z| j�� W d| _ d| _qVd| _ d| _0 n| j d8 _ dS )zvRelease a lock.
This frees all cached state when the last lock context for the tree is
left.
r Nr )r r1 rN r, r rX r r r r r rX � s
�
zMemoryTree.unlockc C s� | � � �h t� }|D ]*}| �|�}|du r4t�|��|�|� q|D ] }| j�|�rD| j�|� qDW d � n1 sv0 Y dS )a Remove the paths from the current versioned set.
When a file_id is unversioned, all of its children are automatically
unversioned.
:param paths: The paths to stop versioning.
:raises: NoSuchId if any fileid is not currently versioned.
N) r# �setr@ r Z
NoSuchFilerS r, Zhas_idZremove_recursive_id)r �pathsZfile_idsr9 r" r r r � unversion s
zMemoryTree.unversionFc C sR |D ]}t �|� qt|�dkr0g | _t j| _n|| _|d | _|| _| �� dS )�#See MutableTree.set_parent_trees().r N)r3 Zcheck_not_reserved_idrE rN r_ r
�_allow_leftmost_as_ghostr^ )r Z revision_ids�allow_leftmost_as_ghostr r r r �set_parent_ids& s
zMemoryTree.set_parent_idsc C sL z| j j�| j�| _W n0 tjyF | jr@| j j�tj �| _n� Y n0 d S r )
r �
repository�
revision_treer
r1 r ZNoSuchRevisionrf r3 r_ r r r r r^ 3 s �
�zMemoryTree._set_basisc C s8 | � � � | j�|�W d � S 1 s*0 Y d S r )rL r% �readlinkr8 r r r �get_symlink_target> s
z MemoryTree.get_symlink_targetc C s� t |�dkr&g | _| jj�tj�| _n�|d d du rL|sLt� |d d ��dd� |D �| _|d d du s||d d dkr�| jj�tj�| _n|d d | _|d d | _
dS )re r r Nc S s g | ] \}}|�qS r r )�.0Z parent_idZtreer r r �
<listcomp>L � z/MemoryTree.set_parent_trees.<locals>.<listcomp>s null:) rE rN r ri rj r3 r_ r1 r ZGhostRevisionUnusableHerer
)r Z parents_listrg r r r �set_parent_treesB s � �zMemoryTree.set_parent_trees)N)N)F)F)$�__name__�
__module__� __qualname__�__doc__r r r r r r0 r2 � staticmethodr5 r6 r: r< r? rD rK rO rP rR r! rT r4 rL r# r\ rV ra rX rd rh r^ rl rp r r r r r & sB
r )rt Z
__future__r rA r& r] r r r r3 Z
bzr.inventoryr Zbzr.inventorytreer Zosutilsr Ztransport.memoryr
r r r r r �<module> s