§
    ÎÑßjõ"  ã                   óò  — d Z g d¢ZddlmZ ddlmZmZ ddlmZm	Z	m
Z
mZmZmZmZmZ erddlmZ ddlmZ eeeef         Zeedf         Zd	ee         d
edgeedf         f         ddfd„Zdede	e         fd„Zde
e         dedededef
d„Zedddeddfd„¦   «         Zedededefd„¦   «         Zdededefd„Zdddeeedf                  dede	eedf                  fd„Zdddedede	e         fd „ZdS )!z6Functions that are supposed to be as fast as possible.)Útree_to_streamÚtree_entries_from_dataÚtraverse_trees_recursiveÚtraverse_tree_recursiveé    )ÚS_ISDIR)Úsafe_decodeÚdefenc)ÚCallableÚListÚMutableSequenceÚSequenceÚTupleÚTYPE_CHECKINGÚUnionÚoverload)ÚReadableBuffer)ÚGitCmdObjectDBNÚentriesÚwriter   Úreturnc           
      óv  — t          d¦  «        }d}| D ]¤\  }}}d}t          d¦  «        D ]!}t          ||dz  z	  |z  |z   g¦  «        |z   }Œ"|d         |k    r
|dd…         }t          |t          ¦  «        r|                     t          ¦  «        }	n|}	 |d                     |d	|	d
|f¦  «        ¦  «         Œ¥dS )zéWrite 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.
    Ú0é   ó    é   é   r   é   Nó    ó    )ÚordÚrangeÚbytesÚ
isinstanceÚstrÚencoder	   Újoin)
r   r   Úord_zeroÚbit_maskÚbinshaÚmodeÚnameÚmode_strÚiÚ
name_bytess
             úC/opt/saltstack/salt/lib/python3.11/site-packages/git/objects/fun.pyr   r   )   sñ   € õ �3‰xŒx€HØ€Hà%ð Eð EÑˆ��dØˆÝ�q‘”ð 	Uð 	UˆAÝ ¨¨Q©¡°8Ñ;¸xÑGÐHÑIÔIÈHÑTˆHˆHð �AŒ;˜(Ò"Ð"Ø   ”|ˆHõ �d�CÑ Ô ð 	ØŸš¥VÑ,Ô,ˆJˆJàˆJØˆˆc�hŠh˜ $¨
°E¸6ÐBÑCÔCÑDÔDÐDÐDð)Eð Er   Údatac                 óì  — t          d¦  «        }t          d¦  «        }t          | ¦  «        }d}g }||k     r¼d}| |         |k    r"|dz  | |         |z
  z   }|dz  }| |         |k    °"|dz  }|}| |         dk    r|dz  }| |         dk    °| ||…         }t          t          |¦  «        ¦  «        }	|dz  }t          | ||dz   …         ¦  «        }
|dz   }|                     |
||	f¦  «         ||k     °¼|S )z÷Read 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   ú r   r   r   é   )r    Úlenr   r"   Úappend)r0   r'   Ú	space_ordÚlen_datar-   Úoutr*   Únsr.   r+   Úshas              r/   r   r   M   s7  € õ �3‰xŒx€HÝ�C‘”€IÝ�4‰yŒy€HØ	€AØ
€CØ
ˆhŠ,ˆ,Øˆð
 �1Œg˜Ò"Ð"ð ˜A‘I $ q¤'¨HÑ"4Ñ5ˆDØ�‰FˆAð	 �1Œg˜Ò"Ð"ð 	
ˆQ‰ˆð ˆØ�1Œg˜ŠlˆlØ�‰FˆAð �1Œg˜Šlˆlð ˜"˜Q˜$”Zˆ
Ý�5 Ñ,Ô,Ñ-Ô-ˆð 	
ˆQ‰ˆÝ�D˜˜Q ™V˜Ô$Ñ%Ô%ˆØ�‰FˆØ�
Š
�C˜˜tÐ$Ñ%Ô%Ð%ðA ˆhŠ,ˆ,ðD €Jr   Ú	tree_datar+   Úis_dirÚstart_atc                 ó   — 	 | |         }|r,|d         |k    r t          |d         ¦  «        |k    rd| |<   |S n# t          $ r Y nw xY wt          | ¦  «        D ]5\  }}|r.|d         |k    r"t          |d         ¦  «        |k    r	d| |<   |c S Œ6dS )z½Return 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=   ÚitemÚindexs         r/   Ú_find_by_namerD   �   sÍ   € ðØ˜Ô"ˆØð 	�D˜”G˜t’O�O­°°Q´Ñ(8Ô(8¸FÒ(BÐ(BØ"&ˆI�hÑØˆKøøÝð ð ð Øˆðøøøõ ! Ñ+Ô+ð ð ‰ˆˆtØð 	�D˜”G˜t’O�O­°°Q´Ñ(8Ô(8¸FÒ(BÐ(BØ#ˆI�eÑØˆKˆKˆKøð ˆ4s   ‚59 ¹
AÁArB   Úpath_prefixc                 ó   — d S ©N© ©rB   rE   s     r/   Ú_to_full_pathrJ   ™   s   € Ø9<¸r   c                 ó   — d S rG   rH   rI   s     r/   rJ   rJ   �   s   € ØADÀr   c                 ó>   — | s| S | d         | d         || d         z   fS )z%Rebuild entry with given path prefix.r   r   r?   rH   rI   s     r/   rJ   rJ   ¡   s-   € àð ØˆØ�ŒG�T˜!”W˜k¨D°¬GÑ3Ð4Ð4r   Úodbr   Ú	tree_shas.c           
      óþ  ‡— g }t          |¦  «        }|D ]]}|€g }nAt          t          |                      |¦  «                             ¦   «         ¦  «        ¦  «        }|                     |¦  «         Œ^g }t          |¦  «        D ]ø\  }}	t          |	¦  «        D ]Þ\  }
}|sŒd„ t          |¦  «        D ¦   «         }|||<   |\  }}}t          |¦  «        }t          |dz   ||z   ¦  «        D ]"}||z  }t          ||         |||
¦  «        ||<   Œ#|r5| 
                    t          | d„ |D ¦   «         ‰|z   dz   ¦  «        ¦  «         n.|                     t          ˆfd„|D ¦   «         ¦  «        ¦  «         d|	|
<   Œß|	dd…= Œù|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.
    Nc                 ó   — g | ]}d ‘ŒS rG   rH   )Ú.0Ú_s     r/   ú
<listcomp>z,traverse_trees_recursive.<locals>.<listcomp>Ü   s   € Ð/Ð/Ð/ �tÐ/Ð/Ð/r   r   c                 ó&   — g | ]}|r|d          pd‘ŒS )r   NrH   )rQ   Úeis     r/   rS   z,traverse_trees_recursive.<locals>.<listcomp>î   s%   € ÐDÐDÐD°b˜2˜< " Q¤%Ð0¨DÐDÐDÐDr   ú/c              3   ó8   •K  — | ]}t          |‰¦  «        V — Œd S rG   )rJ   )rQ   ÚerE   s     €r/   ú	<genexpr>z+traverse_trees_recursive.<locals>.<genexpr>ó   s-   øè è € Ð PÐ PÀ1¥¨q°+Ñ!>Ô!>Ð PÐ PÐ PÐ PÐ PÐ Pr   )r4   Úlistr   ÚstreamÚreadr5   rA   r!   r   rD   Úextendr   Útuple)rM   rN   rE   Ú
trees_dataÚntÚtree_shar0   r8   Útir;   ÚiirB   r   Ú_shar*   r+   r<   Útios     `               r/   r   r   ¨   sî  ø€ ð8 .0€Jå	ˆY‰Œ€BØð  ð  ˆØÐØ)+ˆDˆDõ Õ.¨s¯zªz¸(Ñ/CÔ/C×/HÒ/HÑ/JÔ/JÑKÔKÑLÔLˆDà×Ò˜$ÑÔÐÐð -/€Cõ
 # :Ñ.Ô.ð %ð %‰ˆˆIÝ! )Ñ,Ô,ð  	!ð  	!‰HˆB�Øð Øð 0Ð/¥U¨2¡Y¤YÐ/Ñ/Ô/ˆGØˆG�B‰KØ#ÑˆD�$˜Ý˜T‘]”]ˆFõ
 ˜R !™V R¨"¡WÑ-Ô-ð Pð P�Ø˜B‘h�Ý,¨Z¸¬_¸dÀFÈBÑOÔO�˜‘�ð ð 	RØ—
’
Ý,ØØDÐD¸GÐDÑDÔDØ# dÑ*¨SÑ0ñô ñô ð ð ð —
’
�5Ð PÐ PÐ PÐ PÈÐ PÑ PÔ PÑPÔPÑQÔQÐQð !ˆI�b‰MˆMð �a�a�aˆLˆLà€Jr   ra   c           	      ó.  — g }t          |                      |¦  «                             ¦   «         ¦  «        }|D ][\  }}}t          |¦  «        r+|                     t          | |||z   dz   ¦  «        ¦  «         Œ@|                     ||||z   f¦  «         Œ\|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   )r   r[   r\   r   r]   r   r5   )rM   ra   rE   r   r0   r:   r*   r+   s           r/   r   r      s¨   € ð €GÝ! #§*¢*¨XÑ"6Ô"6×";Ò";Ñ"=Ô"=Ñ>Ô>€Dð  ð <ð <‰ˆˆT�4Ý�4‰=Œ=ð 	<Ø�NŠNÕ2°3¸¸[È4Ñ=OÐRUÑ=UÑVÔVÑWÔWÐWÐWà�NŠN˜C  {°TÑ'9Ð:Ñ;Ô;Ð;Ð;ð €Nr   ) Ú__doc__Ú__all__Ústatr   Ú
git.compatr   r	   Útypingr
   r   r   r   r   r   r   r   Ú	_typeshedr   Úgitr   r"   Úintr$   ÚEntryTupÚEntryTupOrNoner   r   ÚboolrD   rJ   r   r   rH   r   r/   ú<module>rr      sÆ  ðð =Ð <ðð ð €ð Ð Ð Ð Ð Ð à *Ð *Ð *Ð *Ð *Ð *Ð *Ð *ð	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð 	ð ð #Ø(Ð(Ð(Ð(Ð(Ð(à"Ð"Ð"Ð"Ð"Ð"à�˜˜S�Ô!€Ø�x �~Ô&€ð
 E˜H XÔ.ð  E°xÐAQÐ@RÐTYÐZ]Ð_cÐZcÔTdÐ@dÔ7eð  EÐjnð  Eð  Eð  Eð  EðH1 ð 1¨4°¬>ð 1ð 1ð 1ð 1ðh˜_¨^Ô<ð ÀCð ÐQUð Ðadð Ðiwð ð ð ð ð0 
Ø <˜Ð <¨3Ð <°4Ð <Ð <Ð <ñ 
„Ø <ð 
Ø D˜Ð D¨sÐ D°xÐ DÐ DÐ Dñ 
„Ø Dð5˜ð 5°Sð 5¸^ð 5ð 5ð 5ð 5ðUØ	ðUØ&.¨u°U¸D°[Ô/AÔ&BðUØQTðUà	ˆ%� Ð#Ô
$Ô%ðUð Uð Uð UðpÐ!1ð ¸Uð ÐQTð ÐY]Ð^fÔYgð ð ð ð ð ð r   