U 楡c7@sUddlmZmZddlmZddlmZddlmZddl m Z m Z ddl m Z ddlmZdd lmZmZdd lmZmZmZmZmZmZmZmZmZmZmZdd lm Z m!Z!erdd l"m#Z#dd l$m%Z%ee&e'e(fZ)eeede edfZ*ddZ+ee(e(ge'fe,d<dZ-e)e)e'dddZ.ee)ee)e)ge'fddddZ/Gddde0Z1Gddde ej2ej3ej4Z5e5e5j6e5j7<dS)) IterableList join_pathN) to_bin_sha)util) IndexObject IndexObjUnion)Blob) Submodule)tree_entries_from_datatree_to_stream) AnyCallableDictIterableIteratorListTupleTypeUnioncast TYPE_CHECKING)PathLikeLiteral)Repo)BytesIO)TreeN)r r cCs||k||kSN)abrr4/tmp/pip-unpacked-wheel-_pbxsds5/git/objects/tree.py4r"cmp) TreeModifierr)t1t2returncCsX|d|d}}t|t|}}t||}t|d||d|}|rP|S||S)N)lenminr$)r&r'rr Zlen_alen_bZmin_lenZmin_cmprrr!git_cmp9s r-)rr$r(cCst|dkrdSt|d}|d|}||d}t||t||d}d}d}|t|kr|t|kr|||||dkr||||<|d}n||||<|d}|d}qT|t|kr||||<|d}|d}q|t|kr ||||<|d}|d}qdS)Nr)rr)r* merge_sort)rr$ZmidZlefthalfZ righthalfijkrrr!r.Fs2              r.c@seZdZdZdZeeddddZee ddd Z dd d d Z de e ee ddddZe e eddddZeddddZdS)r%zA utility class providing methods to alter the underlying cache in a list-like fashion. Once all adjustments are complete, the _cache, which really is a reference to the cache of a tree, will be sorted. Assuring it will be in a serializable state_cacheN)cacher(cCs ||_dSr)r2)selfr3rrr!__init__rszTreeModifier.__init__)namer(cCs,t|jD]\}}|d|kr |Sq dS)z7:return: index of an item with name, or -1 if not foundr)) enumerater2)r4r6r/trrr!_index_by_nameus  zTreeModifier._index_by_namer(cCst|jt|S)zCall this method once you are done modifying the tree information. It may be called several times, but be aware that each call will cause a sort operation :return self:)r.r2r-r4rrr!set_dones zTreeModifier.set_doneF)shamoder6forcer(cCsd|krtd|d?tjkr*td|t|}||}|||f}|dkr\|j|n>|rl||j|<n.|j|}|d|ks|d|krtd||S) aAAdd the given item to the tree. If an item with the given name already exists, nothing will be done, but a 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: 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/z$Name must not contain '/' characters z(Invalid object type according to mode %or7rrz)Item %r existed with different properties) ValueErrorr_map_id_to_typerr:r2append)r4r>r?r6r@indexitemZex_itemrrr!adds       zTreeModifier.add)binshar?r6r(cCs<t|trt|trt|ts"t|||f}|j|dS)zAdd the given item to the tree, its correctness is assumed, which puts the caller into responsibility to assure the input is correct. For more information on the parameters, see ``add`` :param binsha: 20 byte binary shaN) isinstancebytesintstrAssertionErrorr2rE)r4rIr?r6Z tree_cacherrr! add_uncheckeds" zTreeModifier.add_uncheckedcCs||}|dkr|j|=dS)z0Deletes an item with the given name if it existsr7N)r:r2)r4r6rFrrr! __delitem__s zTreeModifier.__delitem__)F)__name__ __module__ __qualname____doc__ __slots__r TreeCacheTupr5rMrLr:r=rKboolrHrOrPrrrr!r%is  $ r%c sZeZdZUdZdZeded<dZdZdZ dZ dZ ee e e e e iZeeeefed <e d >d fd eeeed fd fdd ZeeeededfdddZed dfdd ZeeeedddZeedddZ eedddZ!e"e#dd d!d"Z$e"e#e d d#d$Z%e"e&d d%d&Z'd'd(d)d(d*d+d,d-d,fe(eee)fege*fe(eee)fege*fee*e*ee*eeeee)fd.fd/d0 Z+e,e,e-ed1fd2d3 Z.eee#ed4d5d6Z/eed d7d8Z0ed d9d:Z1eeee2fed;dd?Z4eed d@dAZ5dBddCdDdEZ6dBddCdFdGZ7Z8S)HrzTree objects represent an ordered list of Blobs and other Trees. ``Tree as a list``:: Access a specific blob using the tree['filename'] notation. You may as well access by index blob = tree[0] treetyper2 rDrBNr)reporIr?pathcstt|||||dSr)superrr5)r4r^rIr?r_ __class__rr!r5sz Tree.__init__)r.r) index_objectr(cCs|jdkrt||jSdS)NrXr)rYtuple_iter_convert_to_objectr2)clsrcrrr!_get_intermediate_itemss zTree._get_intermediate_items)attrr(cs<|dkr(|jj|j}t||_ntt| |dS)Nr2) r^ZodbstreamrIr readr2r`r _set_cache_)r4rhZostreamrarr!rkszTree._set_cache_)iterabler(c csv|D]l\}}}t|j|}z |j|d?|j|||VWqtk rn}ztd||f|W5d}~XYqXqdS)zwIterable yields tuples of (binsha, mode, name), which will be converted to the respective object representationrBz0Unknown mode %o found in tree data for path '%s'N)rr_rDr^KeyError TypeError)r4rlrIr?r6r_errr!res   zTree._iter_convert_to_object)filer(c Csd}d|kr|}|}|d}t|D]D\}}||}|jdkrF|}q&|t|dkrbt|||Sq&||krt|||S|jD]F}|d|kr|j|dd?|j|d|dt|j |dSqt||dS) zFind the named object in this tree's contents :return: ``git.Blob`` or ``git.Tree`` or ``git.Submodule`` :raise KeyError: if given file or tree does not exist in treezBlob or Tree named %r not foundrArXrr)rBrN) splitr8rYr*rmr2rDr^rr_) r4rpmsgrXrGtokensr/tokeninforrr!joins0        z Tree.joincCs ||S)z For PY3 only)rv)r4rprrr! __truediv__&szTree.__truediv__r;cCsdd|DS)z?:return: list(Tree, ...) list of trees directly below this treecSsg|]}|jdkr|qS)rXrY.0r/rrr! -s zTree.trees..rr<rrr!trees*sz Tree.treescCsdd|DS)z?:return: list(Blob, ...) list of blobs directly below this treecSsg|]}|jdkr|qS)blobrxryrrr!r{2s zTree.blobs..rr<rrr!blobs/sz Tree.blobscCs t|jS)aM :return: An object allowing to modify the internal cache. This can be used to change the tree's contents. When done, make sure you call ``set_done`` on the tree modifier, or serialization behaviour will be incorrect. See the ``TreeModifier`` for more information on how to alter the cache)r%r2r<rrr!r34sz Tree.cachecCsdS)NTrr/drrr!r"?r#z Tree.cCsdS)NFrrrrr!r"@r#r7TFr) predicateprunedepth branch_first visit_once ignore_selfas_edger(c s0ttttttftt|||||||S)zFor documentation, see util.Traversable._traverse() Trees are set to visit_once = False to gain more performance in the traversal)rrrrTraversedTreeTupr`rZ _traverse)r4rrrrrrrrarr!traverse=s z Tree.traverse)argskwargsr(cstt|j||S)z :return: IterableList with the results of the traversal as produced by traverse() Tree -> IterableList[Union['Submodule', 'Tree', 'Blob']] )r`rZ_list_traverse)r4rrrarr! list_traverse`szTree.list_traverse)r/r0r(cCst||j||Sr)listrer2)r4r/r0rrr! __getslice__jszTree.__getslice__cCs ||jSr)rer2r<rrr!__iter__msz Tree.__iter__cCs t|jSr)r*r2r<rrr!__len__psz Tree.__len__)rGr(cCsjt|trF|j|}|j|dd?|j|d|dt|j|dSt|trZ||St d|dS)NrrBrr)zInvalid index type: %r) rJrLr2rDr^rr_rMrvrn)r4rGrurrr! __getitem__ss   2  zTree.__getitem__cCsZt|tr,|jD]}|j|dkrdSqn*|j}|jD]}|t||dkr8dSq8dS)NrTr)F)rJrr2rIr_r)r4rGrur_rrr! __contains__s    zTree.__contains__cCst||jSr)reversedrer2r<rrr! __reversed__szTree.__reversed__r)rir(cCst|j|j|S)a Serialize this tree into the stream. Please note that 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 r2writer4rirrr! _serializeszTree._serializecCst||_|Sr)r rjr2rrrr! _deserializeszTree._deserialize)9rQrRrSrTrYr__annotations__rUZ commit_idZblob_idZ symlink_idtree_idr r rDrrLrrrKrrr5 classmethodrrgrMrkrrVrrervrwpropertyrr|r~r%r3rrrWrr rrrrrslicerrrrr __classcell__rrrar!rs|       " #  r)8Zgit.utilrrZgit.diffZdiffZgit_diffrrbaserrr}r Zsubmodule.baser Zfunr r typingr rrrrrrrrrrZ git.typesrrZgit.reporiorrKrLrMrVrr$r__all__r-r.objectr%ZDiffableZ TraversableZ SerializablerrDrrrrr!s.     4    "#Xe