.Ph@dZddlZddlZddlmZddlmZddlmZm Z m Z m Z m Z ddl mZddlmZmZmZd Zd ZeefZd ZGd d ZGddZGddZdfdZdS)z=General implementation of walking commits and their contents.N)chain)Optional)RENAME_CHANGE_TYPESRenameDetector TreeChange tree_changestree_changes_for_merge)MissingCommitError)CommitObjectIDTagdatetopoc.eZdZdZddZddZdefdZdS) WalkEntryz1Object encapsulating a single result from a walk.returnNcj||_|j|_|j|_i|_|j|_dSN)commitstore_store get_parents _get_parents_changesrename_detector_rename_detector)selfwalkerrs L/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/dulwich/walk.py__init__zWalkEntry.__init__3s5 l ".57 & 6cj|}|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. Nrrc4g|]}j|jS)rtree.0prs r! z%WalkEntry.changes..Ws"QQQ!$+a.-QQQr#c*g|]}j|Sr&)rr(s r!r+z%WalkEntry.changes..Ys#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.changes:s "";// >[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  EEcLd|jjd|dS)Nz)ridr>rs r!__repr__zWalkEntry.__repr__ws'QDKNQQdllnnQQQQr#rNr)__name__ __module__ __qualname____doc__r"r>strrCr&r#r!rr0se;;7777;*;*;*;*zR#RRRRRRr#rc<eZdZdZd dZdeddfdZd d Zd ZeZ dS) _CommitTimeQueuez3Priority queue of WalkEntry objects by commit time.r WalkerrNc||_|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)rr 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)rr2r isinstancerr]objectrArSrUheapqheappushrQ commit_timeaddrT)rr_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)rPrTpoprr1rrg)rrrOseentodor7s 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)rArP)r)_crs r! z(_CommitTimeQueue.next..s0#P#Ptq!ADDN$:#P#P#P#P#P#Pr#rFr)r[rQrdheappoprArSremoverUrgrr]rPrnallrXrfrWrYrZrrN)rrqrsha 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#)r rLrNrD) rErFrGrHr"bytesr]rnr|__next__r&r#r!rKrK{su==""""" &u & & & & & % % % %111fHHHr#rKceZdZdZddddddddddef deedeeeded e d ee d eeed ee d e dee dee ddfdZ de fdZ de fdZdee fdZdZdZdZdS)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_entriespathsrfollowrVuntilrc|tvrtd|||_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 Nr) ALL_ORDERS ValueErrorrrbr}r\rRrOrrrrrrrrrVr _num_entries_queue collectionsdeque _out_queue)rrr\rrrrrrrrVrr queue_clss r!r"zWalker.__init__sX  " ":5::;; ; gu % % iG GMr**   &*E 3t  4/ 4,U33O.&   ioo 8C8I8K8Kr#c|dS|jdS|jD]<}||krdS||r|t|dkrdS=dS)NFT/)r startswithr.)r changed_path followed_paths r! _path_matcheszWalker._path_matches/sx  5 : 4!Z  M},,tt'' 66  ]!3!34??ttur#c>|jsJ|sdS|jj}|jj}||rK|jrB|jtvr4|j||j |dS||rdSdS)NFT) roldpathnewrrtyperrgru)rchangeold_pathnew_paths r!_change_matcheszWalker._change_matches>sz 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) rrVrfrrArOrr.rr>r)rentryr path_changesrs r!_should_returnzWalker._should_returnNs : !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|rrr1r.rYpopleftr)rrrs r!_nextz Walker._nextos& !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_reorderrrreversedr3)rresultss r!_reorderzWalker._reorder~sE : # ##GT-=>>G < .tG}}--Gr#clt|t|jdSr)iterrrrBs r!__iter__zWalker.__iter__s(DMM$tz4"8"899:::r#)rErFrGrHrKr3r}rrIboolintrr"rrrrrrr&r#r!rLrLs*.%)'+48##11"CLCLeCL$u+& CL  CL  CLc]CLU $CL".1CLCL}CL}CL CLCLCLCLJ T     x~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. rN) rr defaultdictrr1rrrArk 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#)rHrrd itertoolsrtypingr diff_treerrrr r errorsr objectsr r r ORDER_DATErrrYrrKrLrr&r#r!rs,DC '&&&&&**********   * % HRHRHRHRHRHRHRHRVeeeeeeeePk;k;k;k;k;k;k;k;\(E'D!!!!!!r#