.Ph" dZgdZddlmZddlmZmZddlmZm Z m Z m Z m Z m Z mZmZe r ddlmZddlmZe eeefZeedfZd e ed ed geedffd dfd Zded e efdZde edededed ef dZeddded dfdZededed efdZdeded efdZddde eedfded e e edffdZdddeded e efd 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 vtd}d}|D]\}}}d}tdD]!}t||dzz |z|zg|z}"|d|kr |dd}t|tr|t } n|} |d|d | d |fdS) 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 isinstancestrencoder join) rrord_zerobit_maskbinshamodenamemode_stri name_bytess O/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/git/objects/fun.pyrr)s3xxHH%EEdq U UAQ8;xGHIIHTHH A;( " "|H dC  V,,JJJ chh$ E6BCCDDDD)EErdatactd}td}t|}d}g}||krd}|||kr"|dz|||z z}|dz }|||k"|dz }|}||dkr|dz }||dk|||}t|} |dz }|||dz} |dz}|| || f||k|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)r lenrappend) r0r' space_ordlen_datar-outr*nsr.r+shas r/rrMs'3xxHCI4yyH A C h,, 1g""AI$q'H"45D FA 1g"" Q1gll FA1gll "Q$Z :&& Q1q2v: F Ct$%%%A h,,D Jr tree_datar+is_dirstart_atc  ||}|r,|d|kr t|d|krd||<|Sn#t$rYnwxYwt|D]5\}}|r.|d|kr"t|d|kr d||<|cS6dS)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)r;r+r<r=itemindexs r/ _find_by_namerDs "  DGtOOQ(8(8F(B(B"&Ih K      !++ t  DGtOOQ(8(8F(B(B#Ie KKK 4s59 AArB path_prefixcdSNrBrEs r/ _to_full_pathrJs9<rcdSrGrHrIs r/rJrJsADrc>|s|S|d|d||dzfS)z%Rebuild entry with given path prefix.rrr?rHrIs r/rJrJs-  GT!WkDG3 44rodbr tree_shas.c g}t|}|D]]}|g}nAtt||}||^g}t |D]\}} t | D]\} } | sdt|D} | | |<| \} }}t|}t|dz||zD]"}||z}t||||| | |<#|r5| t|d| D|zdzn.|tfd| Dd| | <| dd=|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. Ncg|]}dSrGrH).0_s r/ z,traverse_trees_recursive..s///t///rrc&g|]}|r|dpdS)rNrH)rQeis r/rSz,traverse_trees_recursive..s%DDDb2<"Q%0DDDDr/c38K|]}t|VdSrG)rJ)rQerEs r/ z+traverse_trees_recursive..s- P P1q+!>!> P P P P P Pr) r4listrstreamreadr5rAr!rrDextendrtuple)rMrNrE trees_datanttree_shar0r8tir;iirBr_shar*r+r<tios ` r/rrs8.0J YB    )+DD.szz(/C/C/H/H/J/JKKLLD$-/C #:..%% I!),, ! !HB 0/U2YY///GGBK# D$T]]F R!VR"W-- P PBh,Z_dFBOO  R ,DDGDDD#d*S0 5 P P P P P P PPPQQQ!IbMM aaaLL Jrrac .g}t||}|D][\}}}t|r+|t ||||zdz@|||||zf\|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. rV)rr[r\rr]rr5)rMrarErr0r:r*r+s r/rrsG !#**X"6"6";";"="= > >D <<T4 4== < NN23[4=ORU=UVV W W W W NNC{T'9: ; ; ; ; Nr) __doc____all__statr git.compatrr typingr r r r rrrr _typeshedrgitrr"intr$EntryTupEntryTupOrNonerrboolrDrJrrrHrr/rrs=<   ********                    #(((((("""""" S !x~& EHX. ExAQ@RTYZ]_cZcTd@d7e Ejn E E E EH114>1111h_^<CQUadiw0 <<3<4<<< < DDsDxDDD D55S5^5555U U&.uUD[/A&BUQTU %# $%UUUUp!1UQTY]^fYgr