o ﯪg" @sdZgdZddlmZddlmZmZddlmZm Z m Z m Z m Z m Z mZmZe r6ddlmZddlmZe eeefZeedfZd e ed ed geedffd dfd dZded e efddZde edededed ef ddZeddded dfddZededed efddZdeded efddZddd e eedfded e e ed!ffd"d#Zddd$eded e efd%d&ZdS)'z6Functions that are supposed to be as fast as possible.)tree_to_streamtree_entries_from_datatraverse_trees_recursivetraverse_tree_recursive)S_ISDIR) safe_decodedefenc)CallableListMutableSequenceSequenceTuple TYPE_CHECKINGUnionoverload)ReadableBuffer)GitCmdObjectDBNentrieswriterreturnc Cstd}d}|D]B\}}}d}tdD]}t||d?|@|g|}q|d|kr1|dd}t|tr<|t} n|} |d|d | d |fqdS) zWrite the given list of entries into a stream using its ``write`` method. :param entries: **Sorted** list of tuples with (binsha, mode, name). :param write: A ``write`` method which takes a data string. 0rN )ordrangebytes isinstancestrencoderjoin) rrord_zerobit_maskbinshamodenamemode_stri name_bytesr-K/var/www/html/chatdoc2/venv/lib/python3.10/site-packages/git/objects/fun.pyr)s       rdatac Cstd}td}t|}d}g}||krld}|||kr0|d>|||}|d7}|||ks|d7}|}||dkrF|d7}||dks<|||}t|} |d7}|||d} |d}|| || f||ks|S)zRead the binary representation of a tree and returns tuples of :class:`~git.objects.tree.Tree` items. :param data: Data block with tree data (as bytes). :return: list(tuple(binsha, mode, tree_relative_path), ...) r rrr)rlenrappend) r/r% space_ordlen_datar+outr(nsr,r)shar-r-r.rMs0     "r tree_datar)is_dirstart_atcCsz||}|r|d|krt|d|krd||<|WSWn ty&Ynwt|D]\}}|rG|d|krGt|d|krGd||<|Sq+dS)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 done. rN)r IndexError enumerate)r9r)r:r;itemindexr-r-r. _find_by_names   rAr? path_prefixcCdSNr-r?rBr-r-r. _to_full_pathrFcCrCrDr-rEr-r-r.rFrGcCs"|s|S|d|d||dfS)z%Rebuild entry with given path prefix.rrr<r-rEr-r-r.rFsodbr tree_shas.c s0g}t|}|D]}|durg}n tt||}||qg}t|D]m\}} t| D]_\} } | s7q0ddt|D} | | |<| \} }}t|}t|d||D]}||}t ||||| | |<qV|r}| t |dd| D|dn|t fdd| Dd| | <q0| dd=q(|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 lost. NcSsg|]}dqSrDr-).0_r-r-r. sz,traverse_trees_recursive..rcSsg|] }|r |dp dqS)rNr-)rJeir-r-r.rLs/c3s|]}t|VqdSrD)rF)rJerBr-r. sz+traverse_trees_recursive..) r2listrstreamreadr3r>rrrAextendrtuple)rHrIrB trees_datanttree_shar/r6tir9iir?r_shar(r)r:tior-rPr.rs>      rrYcCsbg}t||}|D]!\}}}t|r$|t||||dq |||||fq |S)aA :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 paths. rN)rrSrTrrUrr3)rHrYrBrr/r8r(r)r-r-r.rsr) __doc____all__statr git.compatrrtypingr r r r r rrr _typeshedrgitrr intr"EntryTupEntryTupOrNonerrboolrArFrrr-r-r-r.s8 (   ,$"4 "X