U 楡c!@s^dZddlmZddlmZmZddlmZmZm Z m Z m Z m Z m Z mZe rdddlmZddlmZe eeefZe edfZdZe eed ge edffdd d d Zeeed ddZe eeeeedddZededdddZeeeedddZeeedddZde e edfeee edfdddZdeeeedddZdS) zBModule with functions which are supposed to be as fast as possible)S_ISDIR) safe_decodedefenc)CallableListMutableSequenceSequenceTuple TYPE_CHECKINGUnionoverload)ReadableBuffer)GitCmdObjectDBN)tree_to_streamtree_entries_from_datatraverse_trees_recursivetraverse_tree_recursiver )entrieswritereturnc Cstd}d}|D]\}}}d}tdD]"}t||d?|@|g|}q&|d|krb|dd}t|trx|t} n|} |d|d | d |fqdS) zWrite the give list of entries into a stream using its write method :param entries: **sorted** list of tuples with (binsha, mode, name) :param write: write method which takes a data string0rN )ordrangebytes isinstancestrencoderjoin) rrord_zeroZbit_maskZbinshamodenameZmode_stri name_bytesr*3/tmp/pip-unpacked-wheel-_pbxsds5/git/objects/fun.pyr&s      r)datarc Cstd}td}t|}d}g}||krd}|||krV|d>|||}|d7}q,|d7}|}||dkrx|d7}qb|||}t|} |d7}|||d} |d}|| || fq |S)zReads the binary representation of a tree and returns tuples of Tree items :param data: data block with tree data (as bytes) :return: list(tuple(binsha, mode, tree_relative_path), ...)r rrr)rlenrappend) r,r%Z space_ordZlen_datar(outr&nsr)r'shar*r*r+rEs*     r) tree_datar'is_dirstart_atrcCsz:||}|r8|d|kr8t|d|kr8d||<|WSWntk rNYnXt|D]8\}}|rX|d|krXt|d|krXd||<|SqXdS)zreturn data entry matching the given name and tree mode or None. Before the item is returned, the respective data item is set None in the tree_data list to mark it donerN)r IndexError enumerate)r4r'r5r6itemindexr*r*r+ _find_by_namess    r<)r: path_prefixrcCsdSNr*r:r=r*r*r+ _to_full_pathsr@cCsdSr>r*r?r*r*r+r@scCs"|s|S|d|d||dfS)z$Rebuild entry with given path prefixrrr7r*r?r*r*r+r@sr.)odb tree_shasr=rc s0g}t|}|D]2}|dkr"g}ntt||}||qg}t|D]\}} t| D]\} } | snq`ddt|D} | | |<| \} }}t|}t|d||D]"}||}t ||||| | |<q|r| t |dd| D|dn|t fdd| Dd| | <q`| dd=qP|S) a :return: list of list with entries according to the given binary tree-shas. The result is encoded in a list of n tuple|None per blob/commit, (n == len(tree_shas)), where * [0] == 20 byte sha * [1] == mode as int * [2] == path relative to working tree root The entry tuple is None if the respective blob/commit did not exist in the given tree. :param tree_shas: iterable of shas pointing to trees. All trees must be on the same level. A tree-sha may be None in which case None :param path_prefix: a prefix to be added to the returned paths on this level, set it '' for the first iteration :note: The ordering of the returned items will be partially lostNcSsg|]}dqSr>r*).0_r*r*r+ sz,traverse_trees_recursive..rcSsg|]}|r|dpdqS)rNr*)rCeir*r*r+rEs/c3s|]}t|VqdSr>)r@)rCer=r*r+ sz+traverse_trees_recursive..) r/listrstreamreadr0r9rrr<extendrtuple)rArBr=Z trees_datanttree_shar,r1Ztir4iir:rZ_shar&r'r5Ztior*rIr+rs>      r)rArQr=rcCsbg}t||}|D]B\}}}t|rH|t||||dq|||||fq|S)a& :return: list of entries of the tree pointed to by the binary tree_sha. An entry has the following format: * [0] 20 byte sha * [1] mode as int * [2] path relative to the repository :param path_prefix: prefix to prepend to the front of all returned pathsrG)rrLrMrrNrr0)rArQr=rr,r3r&r'r*r*r+rsr) __doc__statrZ git.compatrrtypingrrrrr r r r Z _typeshedr gitrr intr"ZEntryTupZEntryTupOrNone__all__rrboolr<r@rrr*r*r*r+s. (    (. N