>SrSSKrSSKrSSKJr SSKJrJrJrJ r SSK J r SSK J r SrSr\\4rS r"S S \5r"S S \5r"SS\5rS4Sjrg)z=General implementation of walking commits and their contents.N)chain)RENAME_CHANGE_TYPES tree_changestree_changes_for_mergeRenameDetector)MissingCommitError)Tagdatetopoc.\rSrSrSrSrSSjrSrSrg) WalkEntry2z1Object encapsulating a single result from a walk.cX lURUlURUl0UlUR UlgN)commitstore_store get_parents _get_parents_changesrename_detector_rename_detector)selfwalkerrs lib/third_party/dulwich/walk.py__init__WalkEntry.__init__5s5 ll ".. & 6 6Nc RURRU5nUGcURnURU5(d [nSnGO5[ URU55S:Xap[nUR URU5SRnU(a7URUR RU5upgUR UnO[nURU5Vs/sHoR URPM nnU(acUVs/sHoR UPM n n/nU H=nURUR RU5upjURU 5 M? URn U(a7UR U n U RUR RU5upk[U"UR UU URS95nX RU'URU$s snfs snf![a Mf=f)aGet 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)r)rgetrrrlenrtree lookup_path __getitem__rappendKeyErrorlistr) r path_prefixcachedr changes_funcparentmode subtree_shap parent_treesstcommit_tree_sha commit_trees rchangesWalkEntry.changes<s"";/ >[[F$$V,,+ T&&v./14+ T%6%6v%>q%ABGG(.(:(: //#)%D"[[5F5 7;7H7H7PQ7P!++a.--7PQ)ridr5rs r__repr__WalkEntry.__repr__ys KKNN LLN  r)rrrrrr) __name__ __module__ __qualname____firstlineno____doc__rr5r;__static_attributes__rrrr2s;7;*z rrc4\rSrSrSrSrSrSrSr\r Sr g) _CommitTimeQueuez3Priority queue of WalkEntry objects by commit time.cXlURUlURUlUR Ul/Ul[5Ul [5Ul [5Ul URUl SUl[UlSUl[%UR&UR 5HnUR)U5 M g)NF)_walkerrrrrexcluded _excluded_pqset_pq_set_seen_donesince _min_time_last_MAX_EXTRA_COMMITS_extra_commits_left _is_finishedrinclude_push)rr commit_ids rr_CommitTimeQueue.__init__s ll "..u U U  #5 !v~~v?I JJy !@rcURUn[U[5(aUR UR S5 gUnURUR;aURUR;ay[R"URUR*U45 URRUR5 URRUR5 ggg![a [U5ef=fNr!)rr(r isinstancer rWobjectr9rMrOheapqheappushrK commit_timeaddrN)r object_idobjrs rrW_CommitTimeQueue._pushs 0++i(C c3   JJszz!} %  99DLL (VYYdjj-H NN488v'9'9&96%B C LL  VYY ' JJNN699 %.I ( 0$Y/ / 0s C66D cURnURnU/nU(akUR5nURU5H<nXR;a#XS;aUR UR U5 UR U5 M> U(aMjggr)rJrNpoprr'rra)rrrIseentodor-s r_exclude_parents!_CommitTimeQueue._exclude_parentssr>>zzxXXZF++F3)fn KK F 34 V$4drc"^TR(agTR(Ga[R"TR5upURnTR R U5 UTR;aMmTRRU5 TRU5HnTRU5 M SnUTR;nU(aTRU5 TR(ao[U4SjTR55(aKTRSupTR(a'URTRR:aSnOSnTR bURTR :aSnU(a ["TlO'T=R$S-slTR$(dO8U(dUTl['TR(U5$TR(aGMSTlg)NTc3Z># UH upURTR;v M" g7fr)r9rJ).0_crs r (_CommitTimeQueue.next..s #PxtqADDDNN$:xs(+rFr!)rUrKr^heappopr9rMremoverOrarrWrJriallrRr`rQrSrTrrH)rrnrsha parent_idreset_extra_commits is_excludedns` rnext_CommitTimeQueue.nexts   hhh dhh/IA))C LL   $djj  JJNN3 !..v6  9%7#' /K%%f-88#Ptxx#P P P88A;DAzzammtzz7M7M&M /3+.3+~~)f.@.@4>>.Q ',#"+=(((A-(//#  v66YhhhZ!r) rOrJrTrrUrRrQrKrMrNrrHN) r=r>r?r@rArrWrirz__next__rBrCrrrErEs!="" & %1fHrrEc ^\rSrSrSrS\SSSSSSSS\4 SjrSrSr S r S r S r S r S rg)WalkerzObject 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. NFcUR$rparentsrs rWalker.s6>>rcU[;a[SU-5eXl[U[5(aU/nX l[ U=(d /5UlX@lXPl X`l U=(a [ U5=(d SUl U (aU(d [U5nXl XlXlXlXlSUlU "U5Ul[(R*"5Ulg)a&Constructor. 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 ValueErrorrr\bytesrVrLrIorderreverse max_entriespathsrrrfollowrPuntil _num_entries_queue collectionsdeque _out_queue)rrrVexcluderrrrrrrPrr queue_clss rrWalker.__init__sX  "4u<= = gu % %iG GMr*   &)s5z1T /,U3O.&   o %++-rcUcgURH6nX:Xa gURU5(dM"U[U5S:XdM6 g g)NFT/)r startswithr#)r changed_path followed_paths r _path_matchesWalker._path_matches4sM  !ZZM,'' 66 ]!34?(rc~U(dgURRnURRnURU5(a\UR(aJUR [ ;a6URRU5 URRU5 gURU5(agg)NFT) oldpathnewrrtyperrrars)rchangeold_pathnew_paths r_change_matchesWalker._change_matchesAs::??::??   h ' '{{v{{.AA x( !!(+    ) )rcURnURbURUR:agURbURUR:agURUR ;agUR cg[URU55S:a:UR5H%nUHnURU5(dM g M' gUR5HnURU5(dM g g)zDetermine 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!) rrPr`rr9rIrr#rr5r)rentryr path_changesrs r_should_returnWalker._should_returnPs :: !f&8&84::&E :: !f&8&84::&E 99 % ::  t' (1 , %  +F++F33#+ !0 --/''//*rcURnUbURU:a[UR5nUbURR U5 Ub[ UR5[:aYUR(dgURR5nURU5(aU=RS- slU$UcMURU:aMgr[) rrrzrrr'r#rSpopleftr)rrrs r_next Walker._nextqs&& !T%6%6%D%E &&u-}DOO 47I I//1&&u--%%*% L!T%6%6%DrcUR[:Xa[XR5nUR(a[ [ U55nU$)zPossibly 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_reorderrrreversedr))rresultss r_reorderWalker._reorders: :: ##G-=-=>G <<tG}-Grc^[UR[URS555$r)iterrrr:s r__iter__Walker.__iter__s!DMM$tzz4"89::r)rrrrIrrrVrrrrrrPrr)r=r>r?r@rA ORDER_DATErErrrrrrrrBrCrrr~r~sP1"C.J  B  ;rr~cUR$rrrs rrrsfnnrc#(# [R"5n0n[R"[5nUH9nUR U5 U"UR 5HnXF==S- ss'M M; U(aUR 5nUR nURnXH(aXSU'M>U"U5HFn XI==S-ss'XI(aMURU S5n U (dM5URU 5 MH Uv U(aMgg7f)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 defaultdictintr'rrr9rf appendleft) entriesrrhpending num_childrenrr0rrXrv parent_entrys rrrs    DG**3/L EU\\*A Oq O+  II  "!&I  $V,I  #q ( #**&{{9d; <OOL1 -   $sC DD. DD)rArr^ itertoolsrdulwich.diff_treerrrrdulwich.errorsrdulwich.objectsr rrrrSr]rrEr~rrCrrrs*D    * % K K \evePh;Vh;V(E!r