/opt/cloudlinux/venv/lib/python3.11/site-packages/git/objects/__pycache__
Edit: /opt/cloudlinux/venv/lib/python3.11/site-packages/git/objects/__pycache__/fun.cpython-311.pyc (9300B)
2uˬ d Z ddlmZ ddlmZmZ ddlmZmZm Z m
Z
m Z m Z m
Z
mZ e r ddlmZ ddlmZ e eeef Ze
edf ZdZd e
e d
ed ge
edf f d dfd
Zded ee fdZde e dededed ef
dZ eddded dfd Z ededed efd Z deded efdZ ddd e
e
edf ded ee ed f fd Z ddd eded ee fd Z dS )!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_recursiveentrieswriter returnc
v t d }d}| D ]\ }}}d}t d D ]!}t ||dz z |z |z g |z }"|d |k r
|dd }t |t r| t } n|} |d |d | d
|f dS ) 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 string0 r N )ordrangebytes
isinstancestrencoder join)
r r ord_zerobit_maskbinshamodenamemode_stri
name_bytess
a/builddir/build/BUILD/cloudlinux-venv-1.0.12/venv/lib/python3.11/site-packages/git/objects/fun.pyr r & s
3xxHH % E Edq U UA Q8 ;x G HIIHTHH A;( " " |H dC V,,JJ J
chh$
E6BCCDDDD)E Er datac t d }t d }t | }d}g }||k rd}| | |k r"|dz | | |z
z }|dz
}| | |k "|dz
}|}| | dk r|dz
}| | dk | || }t | } |dz
}| ||dz }
|dz }| |
|| f ||k |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 r r r )r lenr append) r0 r' space_ordlen_datar- outr* nsr. r+ shas r/ r r F s'
3xxHCI4yyH A
C
h,,
1g"" AI$q'H"45D
FA 1g""
Q 1gll
FA 1gll "Q$Z
:&&
Q1q2v:
F
Ct$%%%A h,,D Jr tree_datar+ is_dirstart_atc | | }|r,|d |k r t |d |k rd| |< |S n# t $ r Y nw xY wt | D ]5\ }}|r.|d |k r"t |d |k r d| |< |c S 6dS )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 r N)r
IndexError enumerate)r; r+ r< r= itemindexs r/
_find_by_namerD u s
" DGtOOQ(8(8F(B(B"&Ih K
!++ t DGtOOQ(8(8F(B(B #Ie KKK 4s 59
AArB path_prefixc d S N rB rE s r/
_to_full_pathrJ Cr c d S rG rH rI s r/ rJ rJ rK r c > | s| S | d | d || d z fS )z$Rebuild entry with given path prefixr r r? rH rI s r/ rJ rJ s- GT!WkDG 3 44r odbr tree_shas.c
g }t | }|D ]]}|g }nAt t | | }| | ^g }t
| D ]\ }} t
| D ]\ }
} | sd t | D } | | |< | \ }
}}t | }t |dz ||z D ]"}||z }t || |||
| |< #|r5|
t | d | D |z dz n.| t fd| D d| |
< | 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 lostNc g | ]}d S rG rH ).0_s r/
z,traverse_trees_recursive.. s ///t///r r c & g | ]}|r|d pdS )r NrH )rR eis r/ rT z,traverse_trees_recursive.. s% DDDb2<"Q%0DDDDr /c 3 8 K | ]}t | V d S rG )rJ )rR erE s r/ z+traverse_trees_recursive.. s- P P1 q+!>!> P P P P P Pr )
r4 listr streamreadr5 rA r! r rD extendr tuple)rN rO rE
trees_datanttree_shar0 r8 tir; iirB r _shar* r+ r< tios ` r/ r r s " .0J Y B )+DD .szz(/C/C/H/H/J/JKKLLD$ -/C
#:.. & &
I!),, ! !HB
0/U2YY///G GBK # D$ T]]F
R!VR"W--
P
PBh ,Z_dFB O O
R
,DDGDDD#d*S0
5 P P P P P P PPPQQQ !IbMM
aaaLL Jr rb c . g }t | | }|D ][\ }}}t | r+| t | |||z dz @| ||||z f \|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 pathsrW )r r\ r] r r^ r r5 )rN rb rE r r0 r: r* r+ s r/ r r s G !#**X"6"6";";"="= > >D < <T4 4== < NN23[4=ORU=UVV W W W W NNC{T'9: ; ; ; ; Nr ) __doc__statr
git.compatr r typingr r r r r
r r r
_typeshedr gitr r" intr$ EntryTupEntryTupOrNone__all__r r boolrD rJ r r rH r r/ rs s H H + * * * * * * * #(((((("""""" S !x~&
EHX . ExAQ@RTYZ]_cZcTd@d7e Ejn E E E E@, ,4> , , , ,^_^ < C QU ad iw .
3 4
s x
5 5S 5^ 5 5 5 5K K&.uUD[/A&BKQTK %#
$%K K K K\!1 U QT Y]^fYg r