D,jBldZgdZddlmZddlZddlmZddlm Z ddl m Z m Z m Z mZmZmZmZddlZddlZddlmZddlmZdd lmZmZdd lmZmZmZmZdd l m!Z!m"Z"dd l#m$Z$m%Z%m&Z&dd l'm(Z(m)Z)ddl*m+Z+m,Z,m-Z-m.Z.m/Z/ddl0m1Z1m2Z2ddl3m4Z4m5Z5m6Z6m7Z7m8Z8m9Z9m:Z:m;Z;mZ>e8rddl?m@Z@ddlAmBZBddlCmDZDe e zZE e.ZFdeGde>deGfdZHdeGdeGfdZIdeGdddeGddfdZJd eKdeKfd!ZLde(fd"e7e;e,d#fd$e5eMd%e;deMfd&e:e(ddf d'ZNd$e5eMde9eKeKffd(ZOd)e;e,e>eKfde9e>eKffd*ZPd$e5eMde9eKe4e9e>eKfd#feMeMffd+ZQ d7d"e6e-d,d-d.eRd/eKde9eMe6d0ff d1ZSd2d0d3eKde,fd4ZTd,d-d5e7eMde6e,fd6ZUdS)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) CE_EXTENDEDBaseIndexEntry IndexEntry CE_NAMEMASK CE_STAGESHIFT)packunpack) DictIOListSequence TYPE_CHECKINGTupleTypeUnioncast)PathLike)GitCmdObjectDB) TreeCacheTup) IndexFilenamegit_dirreturnc.tj|d|S)zK:return: path to the given named hook in the given git repository directoryhooks)ospjoin)r8r9s \/home/rurouni/.local/share/uv/tools/aider-chat/lib/python3.11/site-packages/git/index/fun.pyr r >s 8GWd + ++pathc6tj|dS)Nr#)r=splitext)rAs r?_has_file_extensionrDCs <  a  r@indexr7argsct||jj}tj|tjsdStj}ttj |j |d<d|d<|g} tj dkrQt|sBt||jj}d|g}t%|t'|z|t(jt(j|jj}g}g} t-||j| jt0d|} d| } |jd krAt7| t8} t7| t8} t;||j| | dS#t<$r} t;|| | d} ~ wwxYw) a:Run 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 repor9osaccessX_OKenvironcopyrfspathrAsysplatformrDr relative_to working_diras_posixrlist subprocessPIPErappendr"r> returncoderrr Exception) r8rErFhprLcmd relative_hpprocess stdout_list stderr_listrMrNexs r?rrGs 4+ , ,B 9R ! ! *//  C' %*(=(=>>CC  $CM <7 " "+>r+B+B "r((..uz/EFFOOQQK{+C $t** ?? &    "$ !# g{'9;;MO_```%%%%   " "//F//F$R);VVLL L # " 111 R((b01s B#G G,G''G,modect|rtSt|st|tkrtSt |t zrdpdzS)zZConvert the given mode from a stat call to the corresponding index mode and return it.ii)rrrrrrr)rjs r?rrzsTt}}t}}t 33 dWn.7% 88r@entriesr&streamextension_data ShaStreamClsc||}|j}|j}td|Drdnd}|d|td|t ||D]X}|} ||j||jt|j} t| t} t | tz} | t | ksJd|jz| |j tzz} |jr | tz} |td|j|j|j|j|j|j|j| |jr|td |j|| || z d zd z}|d | |z|z zZ||||d S)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). c3$K|] }|jV dS)N)extended_flags).0entrys r? zwrite_cache..s%AAu+AAAAAAr@DIRC>LL)encodingz"Path %s too long to fit into index >LLLLLL20sH>HN)tellwriteanyr)len ctime_bytes mtime_bytesstrrArrr'flagsCE_NAMEMASK_INVrrr$devinoderjuidgidsizebinsha write_sha)rlrmrnro stream_sharrversionrt beginoffsetpath_strrAplenr real_sizes r?rrs/.f%%J ?D  EAAAAAAAHaaqG E'NNN E$ugs7|| , ,---<<dff  e    e   uz??!(V<<<4yy;&s4yy   "F"S    o56   ! [ E               4 E$tU122 3 3 3 d TVVk)A-3  e i/44669:;;;;!(((r@c  |d}|dkrtd|zttttft d|d}|\}}|dvs Jd|z||fS)z>Return tuple(version_long, num_entries) from the given stream.rxzInvalid index file header: %rryr})r#rwrvz@Unsupported git index version %i, only 1, 2, and 3 are supported)readAssertionErrorr3r0intr*)rmtype_idunpackedr num_entriess r? read_headerrskk!nnG'` dictionary. :param entry: One instance of type BaseIndexEntry or the path and the stage. r#r ) r isinstancer%rAstager3r0r4r)rt entry_firsts r?rrsb 5zzQAh +~66666 +"344U8S=)511 r@cRt|\}}d}i}|j}|j}||kr!|}td|dd}td|dd} td|d\} } } } }}}}d}|tzrtd|dd}|t z}||t}||z dzdz}|||z|z t| ||||| | | | |||f }||||j f<|d z }||k!|d }t|d ksJd t|z|d d}|dd }||||fS)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>8sr}r{.r|rwr~r#zNIndex Footer was not at least a sha on content as it was only %i bytes in sizeiN) rrrr*r$r'decoderr&rr)rmrrcountrlrrrctimemtimerinorjrrrsharrr path_sizerArrtrn content_shas r?rrs'v..G[ E8:G ;D ;D +  dff udd1gg&&q)udd1gg&&q)7=mTTR`MaMa7b7b4c4c4e ;  6#D$$q''2215NK' tI%%f--TVVk)A-3  kI% /000D#udE5#sCQTVZ\jkll',u{#$  ! +  2[[__N ~   # # #X[^_m[n[nn $ # #!&K$DSD)N Wnk ::r@odbr5slsir6c g}|j}|j}||kr&||}|jdkrt||dz }|jd|}|dkr0||j|j|j|dfn|j||} |} | |krH|| } | jd|} | dks| j|| | krn | dz } | |kHt||t|dz | |dz\} }|| t| f| }||k&t}t||j|d|t#t$t'||}|j|fS)aNCreate 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)startstoprrrAfindr`rrjrslicer r r rseekstorerrrgetvalue)rlrrr tree_itemsciendrtrboundbasexioentryorboundr_tree_entry_listsioistreams r?rr+s.(*J B 'C s((  ;!  &u-- - ab)) R<<   u|UZBCCI J J J J:bi(DBs((  +**333b==FK7 $;t$C$Ca s((%:'3bSTfVXHYHY[ade[e$f$f !C!   sGT2 3 3 3B; s((D ))C:sy)))HHQKKKii s3<<>>/B/BCHHIIG NJ ''r@ tree_entryrc\t|d|d|tz|dfS)Nr#r rw)r%r()rrs r?_tree_entry_to_baseindexentryrps- :a=*Q--9OQ[\]Q^_ ` ``r@ tree_shascVg}t|dvr?t||ddD]%}|t|d&|St|dkrt dt|zt ||dD]\}}}|&||D|d|dkr$|d|dkr|d|dks6|d|dkr|d|dkr||d|dkrj|t|d|t|d |t|d|d|dks|d|dkr%|t|d/|t|dT|d|dks|d|dkrF|t|d|t|d ||d|dks|d|dkrF|t|d|t|d0|)|J|t|d[|%|t|d|d|dks|d|dkrH|t|d |t|d|t|d|S) a7 :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. )r#rwrrPr rvzCannot handle %i trees at onceNr#rw)rrr`r ValueErrorr)rroutrtrourstheirss r?aggressive_tree_mergerts!#C 9~~,S)B-DD @ @E JJ4UA>> ? ? ? ?  9~~9C NNJKKK7sIrJJAGAGdF  %Q47**tAw&)/C/CQSYZ[S\H\H\Q47**tAw&)/C/CQSYZ[S\H\H\ #@q#I#IJJJ #@q#I#IJJJ #@#K#KLLLLaDG++tAw$q'/A/A #@q#I#IJJJJ #@#K#KLLLLAw$q'))T!WQ-?-? #@q#I#IJJJ #@q#I#IJJJ>ayDG++vayDG/C/C #@q#I#IJJJ #@#K#KLLL|))) 8CCDDDD 8qAABBBB7fQi''47fQi+?+?JJrs     MMMMMMMMMMMMMMMMMM ######66666666CCCCCCCCCCCC<<<<<<<< ;:::::::TTTTTTTTTTTTTTUTTTTTTTTTTTTTTTTTTTTT %%%%%%------ ,,C,(,s,,,, !c!c!!!!/M#/Mk/M#/M$/M/M/M/Mf9#9#9999*..A FF eNL89 :F uIF$+&F*+ F  FFFFR  5  eCHo     eNHc9:uXs]?S07; uI7; 3U8S=)<78% FG7;7;7;7;vLMB(B( * B($4B(:?B(EHB( 5$~& &'B(B(B(B(JanaSa^aaaac/cHUOcPTUcPdccccccr@