File manager - Edit - /opt/saltstack/salt/lib/python3.10/site-packages/git/objects/__pycache__/tree.cpython-310.pyc
Back
o ;jJ6 � @ st d dgZ ddlZddlZddlmZ ddlmZmZm Z ddl m Z ddl m Z mZ ddlmZ dd lmZmZ dd lmZ dd lmZmZmZmZmZm Z m Z m Z m Z m Z m!Z! ej"d krddd lm#Z# ndd l$m#Z# ddl%m&Z& e r~ddl'm(Z( ddl)m*Z* e e+e,e-f Z.e e e d e e d f Z/de-de-de,fdd�Z0G dd � d �Z1G dd� deej2e j3e j4�Z5e5e5j6e5j7< dS )� TreeModifier�Tree� N)� IterableList� join_path� to_bin_sha� )�util)� IndexObjUnion� IndexObject)�Blob)�tree_entries_from_data�tree_to_stream)� Submodule) �Any�Callable�Dict�Iterable�Iterator�List�Tuple� TYPE_CHECKING�Type�Union�cast)� � )�Literal)�PathLike)�BytesIO)�Repo)r N)r r �a�b�returnc C s | |k| |k S �N� )r r! r$ r$ �D/opt/saltstack/salt/lib/python3.10/site-packages/git/objects/tree.py�cmp7 � r& c @ s� e Zd ZdZdZdee ddfdd�Zdede fd d �Z dd d �Z dde de dede dd f dd�Zde de deddfdd�Zdeddfdd�ZdS )r a A utility class providing methods to alter the underlying cache in a list-like fashion. Once all adjustments are complete, the :attr:`_cache`, which really is a reference to the cache of a tree, will be sorted. This ensures it will be in a serializable state. ��_cache�cacher" Nc C s || _ d S r# r( )�selfr* r$ r$ r% �__init__F � zTreeModifier.__init__�namec C s, t | j�D ]\}}|d |kr| S qdS )z7:return: index of an item with name, or -1 if not found� ���)� enumerater) )r+ r. �i�tr$ r$ r% �_index_by_nameI s �zTreeModifier._index_by_namec C s | j jdd� d� | S )z�Call this method once you are done modifying the tree information. This may be called several times, but be aware that each call will cause a sort operation. :return: self c S s& | d t jd> kr| d d S | d S )Nr � r/ �/)r �tree_id)�xr$ r$ r% �<lambda>\ s & z'TreeModifier.set_done.<locals>.<lambda>)�key)r) �sort�r+ r$ r$ r% �set_doneS s zTreeModifier.set_doneF�sha�mode�forcec C s� d|v rt d��|d? tjvrt d| ��t|�}| �|�}|||f}|dkr/| j�|� | S |r8|| j|< | S | j| }|d |ksI|d |krOt d| ��| S ) a� Add the given item to the tree. If an item with the given name already exists, nothing will be done, but a :exc:`ValueError` will be raised if the sha and mode of the existing item do not match the one you add, unless `force` is ``True``. :param sha: The 20 or 40 byte sha of the item to add. :param mode: :class:`int` representing the stat-compatible mode of the item. :param force: If ``True``, an item with your name and information will overwrite any existing item with the same name, no matter which information it has. :return: self r6 z$Name must not contain '/' charactersr5 z(Invalid object type according to mode %or0 r r z)Item %r existed with different properties)� ValueErrorr �_map_id_to_typer r4 r) �append)r+ r> r? r. r@ �index�itemZex_itemr$ r$ r% �addb s" � � zTreeModifier.add�binshac C s< t |t�rt |t�rt |t�sJ �|||f}| j�|� dS )a Add the given item to the tree. Its correctness is assumed, so it is the caller's responsibility to ensure that the input is correct. For more information on the parameters, see :meth:`add`. :param binsha: 20 byte binary sha. N)� isinstance�bytes�int�strr) rC )r+ rG r? r. Z tree_cacher$ r$ r% � add_unchecked� s " zTreeModifier.add_uncheckedc C s" | � |�}|dkr| j|= dS dS )z0Delete an item with the given name if it exists.r0 N)r4 r) )r+ r. rD r$ r$ r% � __delitem__� s �zTreeModifier.__delitem__)r" r )F)�__name__� __module__� __qualname__�__doc__� __slots__r � TreeCacheTupr, rK rJ r4 r= rI �boolrF rL rM r$ r$ r$ r% r ; s ,c sx e Zd ZU dZdZed ed< dZdZdZ dZ dZ ee e e e e iZeeee f ed < e d > d fd d dededeed f f� fdd� Zededeed ed f fdd��Zdedd f� fdd� Zd e e de e fd d �Z d edefd d!�Z d edefd"d#�Z!e"de#d fd$d%��Z$e"de#e fd&d'��Z%e"de&fd(d)��Z'd*d+� d,d+� d-d.d/d0d/fd1e(eee)f ege*f d2e(eee)f ege*f d3ed4e*d5e*d6ed7e*dee e e e) f f� fd8d9� Z+d:e,d;e,de-e f� fd<d=� Z.d>ed?ede#e fd@dA�Z/de e fdBdC�Z0defdDdE�Z1dFeeee2f defdGdH�Z3dFeeef de*fdIdJ�Z4de e fdKdL�Z5dSdOdP�Z6dSdQdR�Z7� Z8S )Tr a� Tree objects represent an ordered list of :class:`~git.objects.blob.Blob`\s and other :class:`Tree`\s. See :manpage:`gitglossary(7)` on "tree object": https://git-scm.com/docs/gitglossary#def_tree_object Subscripting is supported, as with a list or dict: * Access a specific blob using the ``tree["filename"]`` notation. * You may likewise access by index, like ``blob = tree[0]``. �tree�typer( � r � � rB r5 N�repor rG r? �pathc s t � �||||� d S r# )�superr, )r+ rZ rG r? r[ �� __class__r$ r% r, � s z Tree.__init__� index_objectr" )r .r$ c C s |j dkr t|�|j��S dS )NrU r$ )rV �tuple�_iter_convert_to_objectr) )�clsr_ r$ r$ r% �_get_intermediate_items� s z Tree._get_intermediate_items�attrc s: |dkr| j j�| j�}t|�� �| _d S t� �|� d S )Nr) ) rZ Zodb�streamrG r �readr) r\ � _set_cache_)r+ rd Zostreamr] r$ r% rg � s zTree._set_cache_�iterablec c sl � |D ]0\}}}t | j|�}z| j|d? | j|||�V W q ty3 } z td||f �|�d}~ww dS )z�Iterable yields tuples of (binsha, mode, name), which will be converted to the respective object representation. r5 z0Unknown mode %o found in tree data for path '%s'N)r r[ rB rZ �KeyError� TypeError)r+ rh rG r? r. r[ �er$ r$ r% ra � s � ���z Tree._iter_convert_to_object�filec C s� d}t �|�}d|v rF| }| }|�d�}t|�D ]!\}}|| }|jdkr(|}q|t|�d kr6t|| ��| S || krDt|| ��|S | jD ]#}|d |krl| j|d d? | j |d |d t | j |d �� S qIt|| ��)a Find the named object in this tree's contents. :return: :class:`~git.objects.blob.Blob`, :class:`Tree`, or :class:`~git.objects.submodule.base.Submodule` :raise KeyError: If the given file or tree does not exist in this tree. z Blob or Tree named %r not foundr6 rU r r/ r5 r ) �os�fspath�splitr1 rV �lenri r) rB rZ r r[ ) r+ rl �msgrU rE �tokensr2 �token�infor$ r$ r% �join� s. �� z Tree.joinc C s | � |�S )zaThe ``/`` operator is another syntax for joining. See :meth:`join` for details. )ru )r+ rl r$ r$ r% � __truediv__ s zTree.__truediv__c C � dd� | D �S )z?:return: list(Tree, ...) List of trees directly below this treec S � g | ] }|j d kr|�qS )rU �rV ��.0r2 r$ r$ r% � <listcomp> � z Tree.trees.<locals>.<listcomp>r$ r< r$ r$ r% �trees � z Tree.treesc C rw )z?:return: list(Blob, ...) List of blobs directly below this treec S rx )�blobry rz r$ r$ r% r| ! r} z Tree.blobs.<locals>.<listcomp>r$ r< r$ r$ r% �blobs r z Tree.blobsc C � t | j�S )a� :return: An object allowing modification of the internal cache. This can be used to change the tree's contents. When done, make sure you call :meth:`~TreeModifier.set_done` on the tree modifier, or serialization behaviour will be incorrect. :note: See :class:`TreeModifier` for more information on how to alter the cache. )r r) r< r$ r$ r% r* # s z Tree.cachec C � dS )NTr$ �r2 �dr$ r$ r% r9 3 � z Tree.<lambda>c C r� )NFr$ r� r$ r$ r% r9 4 r� r0 TFr � predicate�prune�depth� branch_first� visit_once� ignore_self�as_edgec s, t ttt tt f t� �||||||��S )z�For documentation, see `Traversable._traverse() <git.objects.util.Traversable._traverse>`. Trees are set to ``visit_once = False`` to gain more performance in the traversal. )r r r r �TraversedTreeTupr\ Z _traverse)r+ r� r� r� r� r� r� r� r] r$ r% �traverse1 s ��z Tree.traverse�args�kwargsc s t � j|i |��S )z� :return: :class:`~git.util.IterableList` with the results of the traversal as produced by :meth:`traverse` Tree -> IterableList[Union[Submodule, Tree, Blob]] )r\ Z_list_traverse)r+ r� r� r] r$ r% � list_traverseX s zTree.list_traverser2 �jc C s t | �| j||� ��S r# )�listra r) )r+ r2 r� r$ r$ r% � __getslice__d s zTree.__getslice__c C s | � | j�S r# )ra r) r< r$ r$ r% �__iter__g s z Tree.__iter__c C r� r# )rp r) r< r$ r$ r% �__len__j r- z Tree.__len__rE c C sf t |t�r#| j| }| j|d d? | j|d |d t| j|d ��S t |t�r-| �|�S t d| ��)Nr r5 r r/ zInvalid index type: %r) rH rJ r) rB rZ r r[ rK ru rj )r+ rE rt r$ r$ r% � __getitem__m s 2 zTree.__getitem__c C s\ t |t�r| jD ] }|j|d kr dS qdS | j}| jD ]}|t||d �kr+ dS q dS )Nr Tr/ F)rH r r) rG r[ r )r+ rE rt r[ r$ r$ r% � __contains__y s �� �zTree.__contains__c C s t | �| j��S r# )�reversedra r) r< r$ r$ r% � __reversed__� r' zTree.__reversed__re r c C s t | j|j� | S )a9 Serialize this tree into the stream. Assumes sorted tree data. :note: We will assume our tree data to be in a sorted state. If this is not the case, serialization will not generate a correct tree representation as these are assumed to be sorted by algorithms. )r r) �write�r+ re r$ r$ r% � _serialize� s zTree._serializec C s t |�� �| _| S r# )r rf r) r� r$ r$ r% � _deserialize� s zTree._deserialize)re r r" r )9rN rO rP rQ rV r �__annotations__rR Z commit_idZblob_idZ symlink_idr7 r r rB r rJ r r rI r r r, � classmethodr rc rK rg r rS r ra ru rv �propertyr r~ r� r r* r r� rT r� r r r� r� r� r� �slicer� r� r� r� r� � __classcell__r$ r$ r] r% r � s� � ���� � � � (�������� � ' )8�__all__rm �sysZgit.diff�diffZgit_diffZgit.utilr r r � r �baser r r� r Zfunr r Zsubmodule.baser �typingr r r r r r r r r r r � version_infor Ztyping_extensionsZ git.typesr �ior Zgit.repor rI rJ rK rS r� r& r ZDiffableZ TraversableZ Serializabler rB r7 r$ r$ r$ r% �<module> s2 4 j ~
| ver. 1.4 |
Github
|
.
| PHP 8.2.30 | Generation time: 0 |
proxy
|
phpinfo
|
Settings