B %d7@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||kS)N)abrr]/work/yifan.wang/ringdown/master-ringdown-env/lib/python3.7/site-packages/git/objects/tree.py4r!cmp) TreeModifierr)t1t2returncCsX|d|d}}t|t|}}t||}t|d||d|}|rP|S||S)N)lenminr#)r%r&rrZlen_alen_bmin_lenZmin_cmprrr git_cmp9s r-)rr#r'cCst|dkrdSt|d}|d|}||d}t||t||d}d}d}xd|t|kr|t|kr|||||dkr||||<|d}n||||<|d}|d}qVWx,|t|kr||||<|d}|d}qWx.|t|kr||||<|d}|d}qWdS)Nr(rr)r) merge_sort)rr#midZlefthalfZ 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 ||_dS)N)r3)selfr4rrr __init__rszTreeModifier.__init__)namer'cCs,x&t|jD]\}}|d|kr |Sq WdS)z7:return: index of an item with name, or -1 if not foundr() enumerater3)r5r7r0trrr _index_by_nameus zTreeModifier._index_by_name)r'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.r3r-)r5rrr set_dones zTreeModifier.set_doneF)shamoder7forcer'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 %or8rrz)Item %r existed with different properties) ValueErrorr_map_id_to_typerr;r3append)r5r=r>r7r?indexitemZex_itemrrr adds       zTreeModifier.add)binshar>r7r'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) isinstancebytesintstrAssertionErrorr3rD)r5rHr>r7Z tree_cacherrr add_uncheckeds" zTreeModifier.add_uncheckedcCs||}|dkr|j|=dS)z0Deletes an item with the given name if it existsr8N)r;r3)r5r7rErrr __delitem__s zTreeModifier.__delitem__)F)__name__ __module__ __qualname____doc__ __slots__r TreeCacheTupr6rLrKr;r<rJboolrGrNrOrrrr 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] treetyper3 rCrANr)reporHr>pathcstt|||||dS)N)superrr6)r5r]rHr>r^) __class__rr r6sz Tree.__init__)r.r) index_objectr'cCs|jdkrt||jSdS)NrWr)rXtuple_iter_convert_to_objectr3)clsrarrr _get_intermediate_itemss zTree._get_intermediate_items)attrr'cs<|dkr(|jj|j}t||_ntt| |dS)Nr3) r]ZodbstreamrHr readr3r_r _set_cache_)r5rfZostream)r`rr riszTree._set_cache_)iterabler'c cszxt|D]l\}}}t|j|}y |j|d?|j|||VWqtk rp}ztd||f|Wdd}~XYqXqWdS)zwIterable yields tuples of (binsha, mode, name), which will be converted to the respective object representationrAz0Unknown mode %o found in tree data for path '%s'N)rr^rCr]KeyError TypeError)r5rjrHr>r7r^errr rcs   zTree._iter_convert_to_object)filer'c Csd}d|kr|}|}|d}xLt|D]@\}}||}|jdkrH|}q(|t|dkrdt|||Sq(W||krt|||SxL|jD]B}|d|kr|j|dd?|j|d|dt|j |dSqWt||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 foundr@rWrr(rArN) splitr9rXr)rkr3rCr]rr^) r5rnmsgrWrFtokensr0tokeninforrr joins(      &z Tree.joincCs ||S)z For PY3 only)rt)r5rnrrr __truediv__(szTree.__truediv__)r'cCsdd|DS)z?:return: list(Tree, ...) list of trees directly below this treecSsg|]}|jdkr|qS)rW)rX).0r0rrr /szTree.trees..r)r5rrr trees,sz Tree.treescCsdd|DS)z?:return: list(Blob, ...) list of blobs directly below this treecSsg|]}|jdkr|qS)blob)rX)rvr0rrr rw4szTree.blobs..r)r5rrr blobs1sz 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$r3)r5rrr r46sz Tree.cachecCsdS)NTr)r0drrr r!Ar"z Tree.cCsdS)NFr)r0r{rrr r!Br"r8TFr) 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_r _traverse)r5r|r}r~rrrr)r`rr 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)r5rr)r`rr list_traversebszTree.list_traverse)r0r1r'cCst||j||S)N)listrcr3)r5r0r1rrr __getslice__lszTree.__getslice__cCs ||jS)N)rcr3)r5rrr __iter__osz Tree.__iter__cCs t|jS)N)r)r3)r5rrr __len__rsz Tree.__len__)rFr'cCsjt|trF|j|}|j|dd?|j|d|dt|j|dSt|trZ||St d|dS)NrrArr(zInvalid index type: %r) rIrKr3rCr]rr^rLrtrl)r5rFrsrrr __getitem__us   2  zTree.__getitem__cCs^t|tr.xN|jD]}|j|dkrdSqWn,|j}x$|jD]}|t||dkrs.     4    "#Ze