o ﯪg6@stUddgZddlZddlmZddlmZmZmZddl m Z ddl m Z m Z ddlmZdd lmZmZdd lmZdd lmZmZmZmZmZmZmZmZmZmZm Z ej!d kradd lm"Z"ndd l#m"Z"ddl$m%Z%er{ddl&m'Z'ddl(m)Z)ee*e+e,fZ-eeede edfZ.ddZ/ee,e,ge+fe0d<GdddZ1Gddde ej2e j3e j4Z5e5e5j6e5j7<dS) TreeModifierTreeN) IterableList join_path to_bin_sha)util) IndexObjUnion IndexObject)Blob)tree_entries_from_datatree_to_stream) Submodule) AnyCallableDictIterableIteratorListTuple TYPE_CHECKINGTypeUnioncast))Literal)PathLike)BytesIO)Repo)rN)rrcCs||k||kSN)abr!r!L/var/www/html/chatdoc2/venv/lib/python3.10/site-packages/git/objects/tree.py5sr%cmpc @seZdZdZdZdeeddfddZdede fd d Z dd d Z dde de dede ddf ddZde de deddfddZdeddfddZdS)raA 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. _cachecachereturnNcCs ||_dSr r')selfr)r!r!r$__init__C zTreeModifier.__init__namecCs,t|jD]\}}|d|kr|SqdS)z7:return: index of an item with name, or -1 if not found) enumerater()r+r.itr!r!r$_index_by_nameFs  zTreeModifier._index_by_namecCs|jjddd|S)zCall 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 cSs&|dtjd>kr|ddS|dS)Nr r//)rtree_id)xr!r!r$r%Ys&z'TreeModifier.set_done..)key)r(sortr+r!r!r$set_donePs zTreeModifier.set_doneFshamodeforcecCsd|vrtd|d?tjvrtd|t|}||}|||f}|dkr/|j||S|r8||j|<|S|j|}|d|ksI|d|krOtd||S) aAdd 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 r6z$Name must not contain '/' charactersr5z(Invalid object type according to mode %or0rrz)Item %r existed with different properties) ValueErrorr_map_id_to_typerr4r(append)r+r=r>r.r?indexitemex_itemr!r!r$add_s"        zTreeModifier.addbinshacCs<t|trt|trt|tsJ|||f}|j|dS)aAdd 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) isinstancebytesintstrr(rB)r+rGr>r. tree_cacher!r!r$ add_uncheckeds" zTreeModifier.add_uncheckedcCs"||}|dkr|j|=dSdS)z0Delete an item with the given name if it exists.r0N)r4r()r+r.rCr!r!r$ __delitem__s  zTreeModifier.__delitem__)r*r)F)__name__ __module__ __qualname____doc__ __slots__r TreeCacheTupr,rKrJr4r<rIboolrFrMrNr!r!r!r$r8s ,csxeZdZUdZdZeded<dZdZdZ dZ dZ ee e e e e iZeeeefed <e d >d fd d dededeed fffdd ZededeededffddZdedd ffdd ZdeedeefddZdedefd d!Z dedefd"d#Z!e"de#dfd$d%Z$e"de#e fd&d'Z%e"de&fd(d)Z'd*d+d,d+d-d.d/d0d/fd1e(eee)fege*fd2e(eee)fege*fd3ed4e*d5e*d6ed7e*deeeee)fffd8d9 Z+d:e,d;e,de-effded?ede#efd@dAZ/deefdBdCZ0defdDdEZ1dFeeee2fdefdGdHZ3dFeeefde*fdIdJZ4deefdKdLZ5dSdOdPZ6dSdQdRZ7Z8S)TraTree 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]``. treetyper'r rAr5NreporrGr>pathcst||||dSr )superr,)r+r[rGr>r\ __class__r!r$r,sz Tree.__init__ index_objectr*)r.r!cCs|jdkr t||jSdS)NrVr!)rWtuple_iter_convert_to_objectr()clsr`r!r!r$_get_intermediate_itemss zTree._get_intermediate_itemsattrcs:|dkr|jj|j}t||_dSt|dS)Nr() r[odbstreamrGr readr(r] _set_cache_)r+reostreamr^r!r$riszTree._set_cache_iterablec csl|D]0\}}}t|j|}z|j|d?|j|||VWqty3}z td||f|d}~wwdS)zIterable yields tuples of (binsha, mode, name), which will be converted to the respective object representation. r5z0Unknown mode %o found in tree data for path '%s'N)rr\rAr[KeyError TypeError)r+rkrGr>r.r\er!r!r$rbs  zTree._iter_convert_to_objectfilec Csd}d|vrA|}|}|d}t|D]!\}}||}|jdkr#|}q|t|dkr1t|||S||kr?t|||S|jD]#}|d|krg|j|dd?|j|d|dt|j |dSqDt||)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. zBlob or Tree named %r not foundr6rVrr/r5r) splitr1rWlenrlr(rAr[rr\) r+romsgrVrDtokensr2tokeninfor!r!r$joins,        z Tree.joincCs ||S)zaThe ``/`` operator is another syntax for joining. See :meth:`join` for details. )rv)r+ror!r!r$ __truediv__s zTree.__truediv__cCdd|DS)z?:return: list(Tree, ...) List of trees directly below this treecSg|] }|jdkr|qS)rVrW.0r2r!r!r$ zTree.trees..r!r;r!r!r$treesz Tree.treescCrx)z?:return: list(Blob, ...) List of blobs directly below this treecSry)blobrzr{r!r!r$r}r~zTree.blobs..r!r;r!r!r$blobsrz Tree.blobscC t|jS)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. )rr(r;r!r!r$r)s z Tree.cachecCdS)NTr!r2dr!r!r$r%/z Tree.cCr)NFr!rr!r!r$r%0rr0TFr predicateprunedepth branch_first visit_once ignore_selfas_edgec s,ttttttft||||||S)zFor documentation, see `Traversable._traverse() `. Trees are set to ``visit_once = False`` to gain more performance in the traversal. )rrrr TraversedTreeTupr] _traverse)r+rrrrrrrr^r!r$traverse-sz Tree.traverseargskwargscstj|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]_list_traverse)r+rrr^r!r$ list_traverseTszTree.list_traverser2jcCst||j||Sr )listrbr()r+r2rr!r!r$ __getslice__`szTree.__getslice__cCs ||jSr )rbr(r;r!r!r$__iter__cs z Tree.__iter__cCrr )rqr(r;r!r!r$__len__fr-z Tree.__len__rDcCsft|tr#|j|}|j|dd?|j|d|dt|j|dSt|tr-||St d|)Nrr5rr/zInvalid index type: %r) rHrJr(rAr[rr\rKrvrm)r+rDrur!r!r$ __getitem__is  2   zTree.__getitem__cCs\t|tr|jD] }|j|dkrdSqdS|j}|jD]}|t||dkr+dSqdS)NrTr/F)rHr r(rGr\r)r+rDrur\r!r!r$ __contains__us   zTree.__contains__cCst||jSr )reversedrbr(r;r!r!r$ __reversed__szTree.__reversed__rgrcCst|j|j|S)a9Serialize 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(writer+rgr!r!r$ _serializeszTree._serializecCst||_|Sr )r rhr(rr!r!r$ _deserializeszTree._deserialize)rgrr*r)9rOrPrQrRrWr__annotations__rS commit_idblob_id symlink_idr7rr rArrJrr rIrrr, classmethodrrdrKrirrTrrbrvrwpropertyrrrrr)rrrUrrrrrrrslicerrrrr __classcell__r!r!r^r$rs        ' '    )8__all__sysgit.diffdiffgit_diffgit.utilrrrrbaser r rr funr r submodule.basertypingrrrrrrrrrrr version_infortyping_extensions git.typesriorgit.reporrIrJrKrTrr&rrDiffable Traversable SerializablerrAr7r!r!r!r$s0     4     j}