chASr/SQrSSKJr SSKrSSKJr SSKJ r SSK J r J r J r JrJrJrJr SSKrSSKrSSKJr SSKJr SS KJrJr SS KJrJrJrJr SS K J!r!J"r" SS K#J$r$J%r%J&r& SS K'J(r(J)r) SSK*J+r+J,r,J-r-J.r. SSK/J0r0J1r1 SSK2J3r3J4r4J5r5J6r6J7r7J8r8J9r9J:r:J;r; SSKJ?r? SSK@JArA SSKBJCrC \ \ -rD\-)rES\FS\=S\F4SjrGS\FS\F4SjrHS\FSSS\FSS4SjrIS \JS\J4S!jrKS\(4S"\6\:\+S#4S$\4\LS%\:S\L4S&\9\(SS4 S'jjrMS$\4\LS\8\J\J44S(jrNS)\:\+\=\J4S\8\=\J44S*jrOS$\4\LS\8\J\3\8\=\J4S#4\L\L44S+jrPS7S"\5\,S,S-S.\QS/\JS\8\L\5S044 S1jjrRS2S0S3\JS\+4S4jrSS,S-S5\6\LS\5\+4S6jrTg)8zVStandalone functions to accompany the index implementation and make it more versatile.) write_cache read_cachewrite_tree_from_cache entry_keystat_mode_to_index_mode S_IFGITLINKrun_commit_hook hook_path)BytesION)Path)S_IFDIRS_IFLNKS_IFMTS_IFREGS_ISDIRS_ISLNKS_IXUSR)IStream) str_tree_type)handle_process_output safer_popen)defenc force_bytes force_text safe_decode)HookExecutionErrorUnmergedEntriesError)traverse_tree_recursivetraverse_trees_recursivetree_to_stream)IndexFileSHA1Writerfinalize_process)BaseIndexEntry IndexEntry CE_NAMEMASK CE_STAGESHIFT)packunpack) DictIOListSequence TYPE_CHECKINGTupleTypeUnioncast)PathLike)GitCmdObjectDB) TreeCacheTup) IndexFilenamegit_dirreturnc2[R"USU5$)zK:return: path to the given named hook in the given git repository directoryhooks)ospjoin)r7r8s `C:\Users\julio\OneDrive\Documentos\Trabajo\Ideas Frescas\venv\Lib\site-packages\git/index/fun.pyr r >s 88GWd ++pathc4[R"U5S$)Nr#)r<splitext)r@s r>_has_file_extensionrCCs << a  r?indexr6argsc[XRR5n[R"U[R 5(dg[R R5n[[UR55US'SUS'U/n[RS:XaP[U5(d@[U5RURR 5R#5nSU/n[%U['U5-U[(R*[(R*URR S9n/n/n [-XxR.U R.[05 SR3U5n SR3U 5n UR4S :wa6[7U [85n [7U [85n [;X7R4X5eg![<an [;X<5U eSn A ff=f) aRun the commit hook of the given name. Silently ignore hooks that do not exist. :param name: Name of hook, like ``pre-commit``. :param index: :class:`~git.index.base.IndexFile` instance. :param args: Arguments passed to hook file. :raise git.exc.HookExecutionError: NGIT_INDEX_FILE: GIT_EDITORwin32zbash.exe)envstdoutstderrcwdr )r repor8osaccessX_OKenvironcopyrstrr@sysplatformrCr relative_to working_diras_posixrlist subprocessPIPErappendr"r= returncoderrr Exception) r7rDrEhprKcmd relative_hpprocess stdout_list stderr_listrLrMexs r>rrGs 4++ ,B 99R ! ! **// C'EJJ8CC  $CM <<7 "+>r+B+Br(..uzz/E/EFOOQK{+C $t* ???? &&  "$ !# g'9'9;;M;MO_`%%    "/F/F$R););VL L # 1 (b01sB-G G- G((G-modec[U5(a[$[U5(d[U5[:Xa[$[ U[ -=(a S=(d S-$)zVConvert the given mode from a stat call to the corresponding index mode and return it.ii)rrrrrrr)ris r>rrzsEt}}t}}t 3 dWn.7% 88r?entriesr%streamextension_data ShaStreamClsc6U"U5nURnURnSnU"S5 U"[SU[U555 UGH(nU"5n U"UR5 U"UR 5 [ UR5n [U [S9n [U 5[-n U [U 5:XdSUR-5eXR[--n U"[SURURURUR UR"UR$UR&U 5 5 U"U 5 U"5U - S-S-nU"S X-U"5- -5 GM+ UbURU5 UR)5 g ) aWrite the cache represented by entries to a stream. :param entries: **Sorted** list of entries. :param stream: Stream to wrap into the AdapterStreamCls - it is used for final output. :param ShaStreamCls: Type to use when writing to the stream. It produces a sha while writing to it, before the data is passed on to the wrapped stream. :param extension_data: Any kind of data to write as a trailer, it must begin a 4 byte identifier, followed by its size (4 bytes). DIRC>LL)encodingz"Path %s too long to fit into index >LLLLLL20sHN)tellwriter(len ctime_bytes mtime_bytesrVr@rrr&flagsCE_NAMEMASK_INVdevinoderiuidgidsizebinsha write_sha)rkrlrmrn stream_sharxryversionentry beginoffsetpath_strr@plenr} real_sizes r>rrsn.f%J ??D   EG 'N $ugs7| ,-f  e  e uzz?!(V<4y;&s4y S"F"SS  o56           d Vk)A-3  e /469:;18!(r?c URS5nUS:wa[SU-5e[[[[4[ SURS555nUup4US;d SU-5eX44$)z>Return tuple(version_long, num_entries) from the given stream.rqzInvalid index file header: %rrrrur#rpz read_headerrsykk!nG'` dictionary. :param entry: One instance of type BaseIndexEntry or the path and the stage. r#r ) rz isinstancer$r@stager2r/r3r)r entry_firsts r>rrs^ 5zQAh +~6666  +"3"344U8S=)51 r?c b[U5upSn0nURnURnX2:aU"5n[SU"S55Sn[SU"S55Sn [SU"S55upppnnU[-nU"U5R [ 5nU"5U- S-S-nU"UU-U"5- 5 [U UUUXXXU4 5nUUUUR4'US- nX2:aMURS5n[U5S :dS [U5-5eUS S nUS S nXUU4$) aRead a cache file from the given stream. :return: tuple(version, entries_dict, extension_data, content_sha) * *version* is the integer version number. * *entries_dict* is a dictionary which maps IndexEntry instances to a path at a stage. * *extension_data* is ``""`` or 4 bytes of type + 4 bytes of size + size bytes. * *content_sha* is a 20 byte sha on all cache file contents. r z>8srurt.rvr#zNIndex Footer was not at least a sha on content as it was only %i bytes in sizeiN) rrrxr)r&decoderr%rrz)rlrrcountrkrrxrctimemtimerinorirrrshar} path_sizer@rrrm content_shas r>rrsj'v.G E8:G ;;D ;;D  f ud1g&q)ud1g&q)7=mTR`Ma7b44ceK' I%%f-Vk)A-3  kI% /0D#udE#CVZ[\',u{{#$    ,[[_N ~  #X[^_m[nn #!&K$DS)N nk ::r?odbr4slsir5c Z/nURnURnXV:GaXnURS:wa [U5eUS- nURR SU5nUS:Xa6UR URURURUS45 OURX8n Un X:aEX n U RR SU5n U S:XdU RX<U :waO U S- n X:aME[X[US- U 5US-5upUR U [U 45 U nXV:aGM[5n[XOR5 URS5 UR![#[$['UR)55U55nURU4$)aCreate a tree from the given sorted list of entries and put the respective trees into the given object database. :param entries: **Sorted** list of :class:`~git.index.typ.IndexEntry`\s. :param odb: Object database to store the trees in. :param si: Start index at which we should start creating subtrees. :param sl: Slice indicating the range we should process on the entries list. :return: tuple(binsha, list(tree_entry, ...)) A tuple of a sha and a list of tree entries being a tuple of hexsha, mode, name. r r#/rN)startstoprrr@findr_rrirslicer r r ryseekstorerrrzgetvalue)rkrrr tree_itemsciendrrboundbasexioentryorboundr_tree_entry_listsioistreams r>rr%s.(*J B ''C (  ;;! &u- - ab) R<   u||UZZBCI J::b(DB(  ++**33b=FKK$;t$Ca (%:'bSTfVXHY[ade[e$f !C   sGT2 3B; (D )C:yy)HHQKii s3<<>/BCHIG NNJ ''r? tree_entryrc@[USUSU[-US45$)Nr#r rp)r$r')rrs r>_tree_entry_to_baseindexentryrjs* :a=*Q--9OQ[\]Q^_ ``r? tree_shasc/n[U5S;a3[XSS5HnUR[US55 M U$[U5S:a[ S[U5-5e[ XS5GH`upEnUGbUGbDUbUSUS:waUSUS:wa USUS:wd$USUS:wakUSUS:wa_USUS:waSUR[US55 UR[US55 UR[US55 MUSUS:wd USUS:waUR[US55 MUR[US55 MUSUS:wd USUS:wa9UR[US55 UR[US55 GMPGMSUcGMYUSUS:wd USUS:wa9UR[US55 UR[US55 GMGMUc#UceUR[US55 GMUcUR[US55 GMUSUS:wd USUS:wa9UR[US55 UR[US55 GMEUR[US55 GMc U$) a :return: List of :class:`~git.index.typ.BaseIndexEntry`\s representing the aggressive merge of the given trees. All valid entries are on stage 0, whereas the conflicting ones are left on stage 1, 2 or 3, whereas stage 1 corresponds to the common ancestor tree, 2 to our tree and 3 to 'their' tree. :param tree_shas: 1, 2 or 3 trees as identified by their binary 20 byte shas. If 1 or two, the entries will effectively correspond to the last given tree. If 3 are given, a 3 way merge is performed. rrrOr zCannot handle %i trees at oncer#rp)rzrr_r ValueErrorr)rroutrrourstheirss r>aggressive_tree_mergerns!#C 9~,SB-DE JJ4UA> ?E  9~9C NJKK7srJF  %Q47*tAw&)/CQSYZ[S\H\Q47*tAw&)/CQSYZ[S\H\ #@q#IJ #@q#IJ #@#KLaDG+tAw$q'/A #@q#IJ #@#KLAw$q')T!WQ-? #@q#IJ #@q#IJ.@>ayDG+vayDG/C #@q#IJ #@#KL0D|))) 8CD 8qAB7fQi'47fQi+?JJrsm  MMM #6CC< ;GGUTT%- ,,C,(,s, !c!c!/M#/Mk/M#/M$/Mf9#9#9*..A B eNL89 :B uIB$+&B*+ B  BJ  5  eCHo  eNHc9:uXs]?S04; uI4; 3U8S=)<78% FG4;pLMB( * B($4B(:?B(EHB( 5$~& &'B(JanaSa^ac/cHUOcPTUcPdcr?