d@dZddlZddlZddlmZddlmZmZmZm Z m Z ddl m Z m Z mZmZddlmZddlmZmZmZd Zd ZeefZd ZGd d ZGddZGddZdfdZdS)z=General implementation of walking commits and their contents.N)chain)DequeListOptionalSetTuple)RENAME_CHANGE_TYPESRenameDetector tree_changestree_changes_for_merge)MissingCommitError)CommitObjectIDTagdatetopoc&eZdZdZdZddZdZdS) WalkEntryz1Object encapsulating a single result from a walk.cj||_|j|_|j|_i|_|j|_dSN)commitstore_store get_parents _get_parents_changesrename_detector_rename_detector)selfwalkerrs P/home/feoh/.local/pipx/venvs/poetry/lib/python3.11/site-packages/dulwich/walk.py__init__zWalkEntry.__init__.s5 l ". & 6Ncj|}|j}|s t}d}nt |dkret}j|dj}|r0|jj |\}}j|}nt}fd|D}|r^fd|D}g}|D]K} | jj |\}} | | <#t$rYHwxYw|j} |r0j| } | jj |\}} t|j|| j}|j|<j|S)a-Get the tree changes for this entry. Args: path_prefix: Portion of the path in the repository to use to filter changes. Must be a directory name. Must be a full, valid, path reference (no partial names or wildcards). Returns: For commits with up to one parent, a list of TreeChange objects; if the commit has no parents, these will be relative to the empty tree. For merge commits, a list of lists of TreeChange objects; see dulwich.diff.tree_changes_for_merge. Nr rc4g|]}j|jS)rtree.0pr!s r# z%WalkEntry.changes..Rs"QQQ!$+a.-QQQr%c*g|]}j|Sr()rr*s r#r-z%WalkEntry.changes..Ts#C#C#CqDKN#C#C#Cr%)r)rgetrrr lenrr) lookup_path __getitem__r appendKeyErrorlistr ) r! path_prefixcachedr changes_funcparentmode subtree_sha parent_treesr,stcommit_tree_sha commit_trees ` r#changeszWalkEntry.changes5s "";// >[F$$V,, .+ T&&v..//144+ T%6%6v%>%>q%ABG6(.(:(: /#))%D+"[5F5 QQQQt7H7H7P7PQQQ .#C#C#C#CF#C#C#CLF) . ..'(}} $ 7 +((HD"#MM"---- (!!! D!%kO "k/: (3(?(?K+))%o K#$($9 F*0DM+ &}[))s#E  EEcfd|jj|S)Nz#)formatridr@r!s r#__repr__zWalkEntry.__repr__rs,4;; KN LLNN   r%r)__name__ __module__ __qualname____doc__r$r@rEr(r%r#rr+sM;;777;*;*;*;*z     r%rc6eZdZdZd dZdefdZdZdZeZ d S) _CommitTimeQueuez3Priority queue of WalkEntry objects by commit time.r"Walkerc||_|j|_|j|_|j|_g|_t|_ t|_ t|_ |j |_ d|_t|_d|_t%|j|jD]}||dS)NF)_walkerrrrrexcluded _excluded_pqset_pq_set_seen_donesince _min_time_last_MAX_EXTRA_COMMITS_extra_commits_left _is_finishedrinclude_push)r!r" commit_ids r#r$z_CommitTimeQueue.__init__|s l ".-/&)ee $'EE $'EE  #5 !v~v?? " "I JJy ! ! ! ! " "r% object_idc |j|}n"#t$r}t||d}~wwxYwt|tr"||jddS|}|j|jvrp|j|j vrdtj |j |j |f|j|j|j|jdSdSdSNr )rr4r isinstancerr]objectrCrSrUheapqheappushrQ commit_timeaddrT)r!r_objexcrs r#r]z_CommitTimeQueue._pushs 9+i(CC 9 9 9$Y//S 8 9 c3    JJsz!} % % % F 9DL ( (VYdj-H-H N48v'9&96%B C C C L  VY ' ' ' JNN69 % % % % % ) (-H-Hs  /*/c|j}|j}|g}|rm|}||D]?}||vr$||vr ||j|||@|kdSdSr)rPrTpoprr3rrg)r!rrOseentodor9s r#_exclude_parentsz!_CommitTimeQueue._exclude_parentss>zx %XXZZF++F33 % %))fnn KK F 3444 V$$$$ % % % % %r%cjrdSjrntjj\}}|j}j||jvrOj| |D]} |d}|j v}|rm |jrQtfdjDr1jd\}}jr|jjjkrd}nd}j|jjkrd}|r t"_nxjdzc_jsn&|s|_t'j|Sjnd_dS)NTc3:K|]\}}|jjvVdSr)rCrP)r+_cr!s r# z(_CommitTimeQueue.next..s0#P#Ptq!ADDN$:#P#P#P#P#P#Pr%rFr )r[rQrdheappoprCrSremoverUrgrr]rPrnallrXrfrWrYrZrrN)r!rqrsha parent_idreset_extra_commits is_excludedns` r#nextz_CommitTimeQueue.nexts   4h, 7 dh//IAv)C L   $ $ $dj   JNN3   !..v66 & &  9%%%%"& /K 4%%f---8 4#P#P#P#Ptx#P#P#P P P 48A;DAqz4amtz7M&M&M /3++.3+~)f.@4>.Q.Q ',#" +=((((A-((/ 7#  v666Yh, 7Z!tr%N)r"rL) rFrGrHrIr$bytesr]rnr|__next__r(r%r#rKrKysi==""""" &u & & & & % % %111fHHHr%rKceZdZdZddddddddddef deedeeeded e d ee d eeed ee d e dee dee fdZ dZ dZdZdZdZdZdS)rLzObject for performing a walk of commits in a store. Walker objects are initialized with a store and other options and can then be treated as iterators of Commit objects. NrFc|jSrparentsrs r#zWalker.s6>r%r\excludeorderreverse max_entriespathsrfollowrVuntilc|tvrtd|z||_t|tr|g}||_t |pg|_||_||_ ||_ |rt |pd|_ | r|st|}||_ | |_| |_| |_| |_d|_| ||_t)j|_dS)aConstructor. Args: store: ObjectStore instance for looking up objects. include: Iterable of SHAs of commits to include along with their ancestors. exclude: Iterable of SHAs of commits to exclude along with their ancestors, overriding includes. order: ORDER_* constant specifying the order of results. Anything other than ORDER_DATE may result in O(n) memory usage. reverse: If True, reverse the order of output, requiring O(n) memory. max_entries: The maximum number of entries to yield, or None for no limit. paths: Iterable of file or subtree paths to show entries for. rename_detector: diff.RenameDetector object for detecting renames. follow: If True, follow path across renames/copies. Forces a default rename_detector. since: Timestamp to list commits after. until: Timestamp to list commits before. get_parents: Method to retrieve the parents of a commit queue_cls: A class to use for a queue of commits, supporting the iterator protocol. The constructor takes a single argument, the Walker. zUnknown walk order %sNr) ALL_ORDERS ValueErrorrrbr}r\rRrOrrrrr rrrrVr _num_entries_queue collectionsdeque _out_queue)r!rr\rrrrrrrrVrr queue_clss r#r$zWalker.__init__sX  " "4u<== = gu % % iG GMr**   &)s5zz1T  4/ 4,U33O.&   ioo ,7,=,?,?r%c|dS|jdS|jD]<}||krdS||r|t|dkrdS=dS)NFT/)r startswithr0)r! changed_path followed_paths r# _path_matcheszWalker._path_matches-sx  5 : 4!Z  M},,tt'' 66  ]!3!34??ttur%c,|sdS|jj}|jj}||rK|jrB|jt vr4|j||j |dS||rdSdS)NFT) oldpathnewrrtyper rrgru)r!changeold_pathnew_paths r#_change_matcheszWalker._change_matches<s 5:?:?   h ' ' { ,v{.AAA x((( !!(+++4    ) ) 4ur%c|j}|j|j|jkrdS|j|j|jkrdS|j|jvrdS|jdSt||dkr6| D] }|D]}| |rdS!n/| D]}| |rdSdS)a Determine if a walk entry should be returned.. Args: entry: The WalkEntry to consider. Returns: True if the WalkEntry should be returned by this walk, or False otherwise (e.g. if it doesn't match any requested paths). NFTr ) rrVrfrrCrOrr0rr@r)r!entryr path_changesrs r#_should_returnzWalker._should_returnKs : !f&84:&E&E5 : !f&84:&E&E5 9 % %5 : 4 t'' ( (1 , , %  $ $ +$$F++F33$#ttt$$  $ --//  ''// 44 tr%cx|j}| |j|krt|j}||j||t |jtkrI|jsdS|j}| |r|xjdz c_|S||j|kdSra) rrr|rrr3r0rYpopleftr)r!rrs r#_nextz Walker._nextls& !T%6%D%D%%E &&u---}DO 4 47I I I 4//11&&u--!%%*%% L!T%6%D%Dtr%c|jtkrt||j}|jrt t |}|S)aPossibly reorder a results iterator. Args: results: An iterator of WalkEntry objects, in the order returned from the queue_cls. Returns: An iterator or list of WalkEntry objects, in the order required by the Walker. )r ORDER_TOPO _topo_reorderrrreversedr5)r!resultss r#_reorderzWalker._reorder{sE : # ##GT-=>>G < .tG}}--Gr%clt|t|jdSr)iterrrrDs r#__iter__zWalker.__iter__s(DMM$tz4"8"899:::r%)rFrGrHrIrKrr}rstrboolintr r$rrrrrrr(r%r#rLrLsb*.%)'+48##11"C@C@eC@$u+& C@  C@  C@c]C@U $C@".1C@C@}C@}C@C@C@C@J      B      ;;;;;r%rLc|jSrrrs r#rrsfnr%c#Ktj}i}tjt}|D]:}||||jD]}||xxdz cc<;|r|}|j}|j}||r|||<2||D]G} || xxdzcc<|| s-|| d} | r| | H|V|dSdS)aReorder an iterable of entries topologically. This works best assuming the entries are already in almost-topological order, e.g. in commit time order. Args: entries: An iterable of WalkEntry objects. get_parents: Optional function for getting the parents of a commit. Returns: iterator over WalkEntry objects from entries in FIFO order, except where a parent would be yielded before any of its children. r N) rr defaultdictrr3rrrCrk appendleft) entriesrrmpending num_childrenrr,rr^rx parent_entrys r#rrsZ    DG*3//L!! EU\** ! !A OOOq OOOO !   I  " !&GI  $V,, 2 2I  # # #q ( # # # * 2&{{9d;; 2OOL111       r%)rIrrd itertoolsrtypingrrrrr diff_treer r r r errorsrobjectsrrr ORDER_DATErrrYrrKrLrr(r%r#rs*DC 44444444444444000000000000&&&&&&**********   * % K K K K K K K K \eeeeeeeePj;j;j;j;j;j;j;j;Z(E'D!!!!!!r%