ch6SS/rSSKrSSKJr SSKJrJrJr SSK J r SSK J r J r SSKJr SS KJrJr SS KJr SS KJrJrJrJrJrJrJrJrJrJrJ r \RBS :aSS KJ"r" OSS K#J"r" SSK$J%r% \(a SSK&J'r' SSK(J)r) \\*\+\,4r-\\\S\ \S4r.S\,S\,S\+4Sjr/"SS5r0"SS\ \Rb\ Rd\ Rf5r4\4\4Rj\4Rl'g) TreeModifierTreeN) IterableList join_path to_bin_sha)util) IndexObjUnion IndexObject)Blob)tree_entries_from_datatree_to_stream) Submodule) AnyCallableDictIterableIteratorListTuple TYPE_CHECKINGTypeUnioncast))Literal)PathLike)BytesIO)Repo)rN)rrabreturncX:X:- $N)r!r"s cC:\Users\julio\OneDrive\Documentos\Trabajo\Ideas Frescas\venv\Lib\site-packages\git/objects/tree.pycmpr(6s Eae c \rSrSrSrSrS\\SS4SjrS\ S\ 4S jr SS jr SS \ S \ S\ S \SS4 SjjrS\ S \ S\ SS4SjrS\ SS4SjrSrg)r:aA utility class providing methods to alter the underlying cache in a list-like fashion. Once all adjustments are complete, the :attr:`_cache`, which really is a reference to the cache of a tree, will be sorted. This ensures it will be in a serializable state. _cachecacher#NcXlgr%r,)selfr.s r'__init__TreeModifier.__init__Es r)namecZ[UR5Hup#USU:XdMUs $ g)z7:return: index of an item with name, or -1 if not found) enumerater-)r0r3its r'_index_by_nameTreeModifier._index_by_nameHs,dkk*DAtt|+ r)c:URRSS9 U$)zCall this method once you are done modifying the tree information. This may be called several times, but be aware that each call will cause a sort operation. :return: self cPUS[RS-:XaUSS-$US$)Nr r5/)rtree_id)xs r''TreeModifier.set_done..[s/qtt||r?Q7Q!s '[WXYZW['[r))key)r-sortr0s r'set_doneTreeModifier.set_doneRs [\ r)shamodeforcecSU;a [S5eUS- [R;a[SU-5e[U5nUR U5nXU4nUS:XaUR R U5 U$U(aX`R U'U$UR UnUSU:wd USU:wa[SU-5eU$) a4Add the given item to the tree. If an item with the given name already exists, nothing will be done, but a :exc:`ValueError` will be raised if the sha and mode of the existing item do not match the one you add, unless `force` is ``True``. :param sha: The 20 or 40 byte sha of the item to add. :param mode: :class:`int` representing the stat-compatible mode of the item. :param force: If ``True``, an item with your name and information will overwrite any existing item with the same name, no matter which information it has. :return: self r?z$Name must not contain '/' charactersr>z(Invalid object type according to mode %or6rrz)Item %r existed with different properties) ValueErrorr_map_id_to_typerr:r-append)r0rIrJr3rKindexitemex_items r'addTreeModifier.addas( $;CD D BJt33 3G$NO Oo##D)4  B; KK  t $ %) E" ++e,1:$ d(:$%PSW%WXX r)binshac[U[5(a*[U[5(a[U[5(deXU4nURR U5 g)zAdd the given item to the tree. Its correctness is assumed, so it is the caller's responsibility to ensure that the input is correct. For more information on the parameters, see :meth:`add`. :param binsha: 20 byte binary sha. N) isinstancebytesintstrr-rO)r0rUrJr3 tree_caches r' add_uncheckedTreeModifier.add_uncheckedsM&%((Zc-B-BzRVX[G\G\\\D)  :&r)cNURU5nUS:aURU gg)z0Delete an item with the given name if it exists.r6N)r:r-)r0r3rPs r' __delitem__TreeModifier.__delitem__s*##D) 2: E" r))r#r)F)__name__ __module__ __qualname____firstlineno____doc__ __slots__r TreeCacheTupr1rZrYr:rGrXboolrSr\r___static_attributes__r&r)r'rr:sId<0T33 *u*C*s*4*N*X 'E ' 'C 'D '###r)c^\rSrSr%SrSr\S\S'SrSr Sr Sr S r \ \ \ \\ \0r\\\\4\S '\ S -S 4S SS\S\S\\S 44U4Sjjjr\S\S\\S\S44Sj5rS\SS 4U4SjjrS\\S\\4Sjr S\S\4Sjr!S\S\4Sjr"\#S\$S4Sj5r%\#S\$\4S j5r&\#S\'4S!j5r(S"S#S$S%S&S'S&4S(\)\\\*4\/\+4S)\)\\\*4\/\+4S*\S+\+S,\+S-\S.\+S\\\\\*44U4S/jjjr,S0\-S1\-S\.\4U4S2jjr/S3\S4\S\$\4S5jr0S\\4S6jr1S\4S7jr2S8\\\\34S\4S9jr4S8\\\4S\+4S:jr5S\\4S;jr6S>S<jr7S>S=jr8Sr9U=r:$)?raTree objects represent an ordered list of :class:`~git.objects.blob.Blob`\s and other :class:`Tree`\s. See :manpage:`gitglossary(7)` on "tree object": https://git-scm.com/docs/gitglossary#def_tree_object Subscripting is supported, as with a list or dict: * Access a specific blob using the ``tree["filename"]`` notation. * You may likewise access by index, like ``blob = tree[0]``. treetyper,r rNr>Nrepor rUrJpathc&>[TU]XX45 gr%)superr1)r0rqrUrJrr __class__s r'r1 Tree.__init__s t2r) index_objectr#)r.r&clURS:Xa$[URUR55$g)Nrlr&)rmtuple_iter_convert_to_objectr-)clsrws r'_get_intermediate_itemsTree._get_intermediate_itemss1    &==l>Q>QRS Sr)attrc>US:XaNURRRUR5n[ UR 55Ulg[TU]!U5 g)Nr-) rqodbstreamrUr readr-rt _set_cache_)r0r~ostreamrus r'rTree._set_cache_sF 8 iimm**4;;7G.DW\\^.TDK G  %r)iterablec## UHCup#n[URU5nURUS- "URX#U5v ME g![an[ SX54-5UeSnAff=f7f)zqIterable yields tuples of (binsha, mode, name), which will be converted to the respective object representation. r>z0Unknown mode %o found in tree data for path '%s'N)rrrrNrqKeyError TypeError)r0rrUrJr3rres r'rzTree._iter_convert_to_objectsz#+ F$TYY-D j**42:6tyy&PTUU#+ j RVZUa abhii js(A/&A A/ A,A''A,,A/filec SnSU;avUnUnURS5n[U5H>upgX7nURS:XaUnMU[U5S- :wa [ X!-5eUs $ X@:Xa [ X!-5eU$UR HSnUSU:XdMUR USS- "URUSUS[URUS55s $ [ X!-5e)zFind the named object in this tree's contents. :return: :class:`~git.objects.blob.Blob`, :class:`Tree`, or :class:`~git.objects.submodule.base.Submodule` :raise KeyError: If the given file or tree does not exist in this tree. zBlob or Tree named %r not foundr?rlrr5r>r) splitr7rmlenrr-rNrqrrr) r0rmsgrlrQtokensr8tokeninfos r'join Tree.joins0 $;DDZZ_F%f-{99&DCK!O+&sz22K.|sz**K 7d?//Q2 > 47DGYtyy$q'5R$ 3:& &r)c$URU5$)zQThe ``/`` operator is another syntax for joining. See :meth:`join` for details. )r)r0rs r' __truediv__Tree.__truediv__s yyr)cTUVs/sHoRS:XdMUPM sn$s snf)z?:return: list(Tree, ...) List of trees directly below this treerlrmr0r8s r'trees Tree.trees% 44a66V#34444%%cTUVs/sHoRS:XdMUPM sn$s snf)z?:return: list(Blob, ...) List of blobs directly below this treeblobrrs r'blobs Tree.blobsrrc,[UR5$)aX :return: An object allowing modification of the internal cache. This can be used to change the tree's contents. When done, make sure you call :meth:`~TreeModifier.set_done` on the tree modifier, or serialization behaviour will be incorrect. :note: See :class:`TreeModifier` for more information on how to alter the cache. )rr-rFs r'r. Tree.cache!sDKK((r)cg)NTr&r8ds r'rB Tree.1s`dr)cg)NFr&rs r'rBr2s\ar)r6TFr predicateprunedepth branch_first visit_once ignore_selfas_edgec ~>[[[[[[4[ TU]UUUUUU55$)zFor documentation, see `Traversable._traverse() `. Trees are set to ``visit_once = False`` to gain more performance in the traversal. )rrrr TraversedTreeTuprt _traverse) r0rrrrrrrrus r'traverse Tree.traverse/sI6 (=)84D+EE F G     r)argskwargsc$>[TU]"U0UD6$)z :return: :class:`~git.util.IterableList` with the results of the traversal as produced by :meth:`traverse` Tree -> IterableList[Union[Submodule, Tree, Blob]] )rt_list_traverse)r0rrrus r' list_traverseTree.list_traverseVsw%t6v66r)r8jcN[URURX55$r%)listrzr-)r0r8rs r' __getslice__Tree.__getslice__bs!D00Q1ABCCr)c8URUR5$r%)rzr-rFs r'__iter__ Tree.__iter__es++DKK88r)c,[UR5$r%)rr-rFs r'__len__ Tree.__len__hs4;;r)rQc <[U[5(aTURUnURUSS- "URUSUS[ UR US55$[U[5(aURU5$[SU-5e)Nrr>rr5zInvalid index type: %r) rWrYr-rNrqrrrrZrr)r0rQrs r' __getitem__Tree.__getitem__ks dC ;;t$D''Q2 6tyy$q'4PQ7T]^b^g^gimnoipTqr r dC 99T? "04788r)c[U[5(a)URHnURUS:XdM g gURnURHnU[ X2S5:XdM g g)NrTr5F)rWr r-rUrrr)r0rQrrrs r' __contains__Tree.__contains__wsg dK ( ( ;;$q')$ 99D 9T733$r)cJ[URUR55$r%)reversedrzr-rFs r' __reversed__Tree.__reversed__s44T[[ABBr)cF[URUR5 U$)aSerialize this tree into the stream. Assumes sorted tree data. :note: We will assume our tree data to be in a sorted state. If this is not the case, serialization will not generate a correct tree representation as these are assumed to be sorted by algorithms. )rr-writer0rs r' _serializeTree._serializes t{{FLL1 r)cB[UR55UlU$r%)r rr-rs r' _deserializeTree._deserializes,V[[];  r))rrr#r);rarbrcrdrermr__annotations__rf commit_idblob_id symlink_idr@rr rNrrYrr rXrrr1 classmethodrr|rZrrrgrrzrrpropertyrrrrr.rrrhrrrrrrrslicerrrrrri __classcell__)rus@r'rrs  #D'&/"IIGJG 9D7OT#tM223rM&* 333 3 HdN# 33# u[!59, -&&& j0F j8TaKb j$'$'$'N 5tF|555tDz55 )| ) )TeOa! % U=2B#BCSI4OP% }.>>?EtKL%  %  %  % % %  x &1A(BB C% % N737#7,}:U7DcDcDd=.AD9(=19   9c3o 6 9= 9}h'>!?D&Ch}5C r))7__all__sysgit.diffdiffgit_diffgit.utilrrrr baser r rr funr rsubmodule.basertypingrrrrrrrrrrr version_infortyping_extensions git.typesriorgit.repor rXrYrZrgrr(rDiffable Traversable SerializablerrNr@r&r)r'rs 6 " 88,7%    v)UC_% u\2M5IaCbbcd 333e#e#Tv;))4+;+;T=N=Nvx&*T\\"r)