o U h@@sdZddlZddlZddlmZddlmZddlmZm Z m Z m Z m Z ddl mZddlmZmZmZd Zd ZeefZd ZGd d d ZGdddZGdddZddfddZdS)z=General implementation of walking commits and their contents.N)chain)Optional)RENAME_CHANGE_TYPESRenameDetector TreeChange tree_changestree_changes_for_merge)MissingCommitError)CommitObjectIDTagdatetopoc@s2eZdZdZd ddZd ddZdefdd ZdS) WalkEntryz1Object encapsulating a single result from a walk.returnNcCs(||_|j|_|j|_i|_|j|_dSN)commitstore_store get_parents _get_parents_changesrename_detector_rename_detector)selfwalkerrr`/var/www/html/construction_image-detection-poc/venv/lib/python3.10/site-packages/dulwich/walk.py__init__3s  zWalkEntry.__init__c sHj|}|durj}|st}d}nct|dkr?t}j|dj}|r>|jj |\}}j|}n;t }fdd|D}|rzfdd|D}g}|D]} z | jj |\}} Wn t ysYq\w| | q\|j} |rj| } | jj |\}} t |j|| jd}|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. Nrrcsg|]}j|jqSr)rtree.0prrr Wsz%WalkEntry.changes..csg|]}j|qSr)rr"r%rrr&Ys)r)rgetrrrlenrr! lookup_path __getitem__r KeyErrorappendlistr) r path_prefixcachedr changes_funcparentmode subtree_sha parent_treesr$stcommit_tree_sha commit_treerr%rchanges:s`        zWalkEntry.changescCsd|jjd|dS)Nz)ridr8r%rrr__repr__wszWalkEntry.__repr__rNr)__name__ __module__ __qualname____doc__r r8strr;rrrrr0s   =rc@sBeZdZdZdddZdeddfd d Zdd d Zd dZeZ dS)_CommitTimeQueuez3Priority queue of WalkEntry objects by commit time.rWalkerrNcCsx||_|j|_|j|_|j|_g|_t|_ t|_ t|_ |j |_ d|_t|_d|_t|j|jD]}||q2dS)NF)_walkerrrrrexcluded _excluded_pqset_pq_set_seen_donesince _min_time_last_MAX_EXTRA_COMMITS_extra_commits_left _is_finishedrinclude_push)rr commit_idrrrr ~s z_CommitTimeQueue.__init__ object_idc Csz|j|}Wnty}zt||d}~wwt|tr(||jddS|}|j|jvrQ|j|j vrSt |j |j |f|j|j|j|jdSdSdSNr)rr+r isinstancer rSobjectr:rIrKheapqheappushrG commit_timeaddrJ)rrUobjexcrrrrrSs  z_CommitTimeQueue._pushcCsd|j}|j}|g}|r0|}||D]}||vr&||vr&||j|||q|s dSdSr)rFrJpoprr,rr\)rrrEseentodor1rrr_exclude_parentss  z!_CommitTimeQueue._exclude_parentscs,jrdSjrtj\}}|j}j||jvrqj| |D]} |q*d}|j v}|re |jret fddjDrejd\}}jrc|jjjkrcd}nd}jdurr|jjkrrd}|rxt_n jd8_jsn|s|_tj|Sjsd_dS)NTc3s |] \}}|jjvVqdSr)r:rF)r#_cr%rr sz(_CommitTimeQueue.next..rFr)rQrGrYheappopr:rIremoverKr\rrSrFrballrNr[rMrOrPrrD)rrcrsha parent_idreset_extra_commits is_excludednrr%rnextsB       -z_CommitTimeQueue.next)rrCrNr<) r=r>r?r@r bytesrSrbrn__next__rrrrrB{s  3rBc@seZdZdZdddddddddddef deedeeed ed e d ee d eeed ee de dee dee ddfddZ de fddZ de fddZdee fddZddZddZddZdS) rCzObject 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. NrFcC|jSrparentsrrrrzWalker.rRexcludeorderreverse max_entriespathsrfollowrLuntilrcCs|tvr td|||_t|tr|g}||_t|pg|_||_||_ ||_ |r/t|p0d|_ | r:|s:t |}||_ | |_| |_| |_| |_d|_| ||_t|_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 ValueErrorrrWrorRrHrErxryrzr{rrrr|rLr} _num_entries_queue collectionsdeque _out_queue)rrrRrwrxryrzr{rr|rLr}r queue_clsrrrr s*,  zWalker.__init__cCsX|durdS|jdur dS|jD]}||krdS||r)|t|dkr)dSqdS)NFT/)r{ startswithr()r changed_path followed_pathrrr _path_matches/s  zWalker._path_matchescCsj|jsJ|s dS|jj}|jj}||r,|jr*|jtvr*|j||j |dS||r3dSdS)NFT) r{oldpathnewrr|typerr\rg)rchangeold_pathnew_pathrrr_change_matches>s     zWalker._change_matchescCs|j}|jdur|j|jkrdS|jdur|j|jkrdS|j|jvr%dS|jdur,dSt||dkrL| D]}|D] }| |rHdSq=q9dS| D] }| |rZdSqPdS)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) rrLr[r}r:rEr{r(rr8r)rentryr path_changesrrrr_should_returnNs,     zWalker._should_returncCs|j}|dus |j|krGt|j}|dur|j||dus&t|jtkr>|js+dS|j}| |r>|jd7_|S|dus |j|ks dSrV) rzrrnrrr,r(rOpopleftr)rrzrrrr_nextos     z Walker._nextcCs,|jtkr t||j}|jrtt|}|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. )rx ORDER_TOPO _topo_reorderrryreversedr-)rresultsrrr_reorder~s  zWalker._reordercCst|t|jdSr)iterrrr%rrr__iter__szWalker.__iter__)r=r>r?r@rBr-rorrAboolintrr rrrrrrrrrrrCsT        E! rCcCrqrrrrtrrrrurvruc cst}i}tt}|D]}||||jD] }||d7<qq|rb|}|j}|j}||r;|||<q&||D]} || d8<|| sZ|| d} | rZ| | q?|V|s(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 defaultdictrr,rrr:r_ appendleft) entriesrrapending num_childrenrr$rrTrj parent_entryrrrrs2       r)r@rrY itertoolsrtypingr diff_treerrrrr errorsr objectsr r r ORDER_DATErr~rOrrBrCrrrrrs"   Kh/