X nSrSSKJrJr SSKJr SSKJr SSKrSSK J r J r Sr Sr S rS rS rS r\\4r\ "SSS5rS rSrSrSr"SS\"S/SQ55rSrSrSrS$SjrSrS%SjrSrSr S&Sjr!Sr"Sr#Sr$S&Sjr%S r&"S!S"\'5r(\r)\r*\#r+SS#K,JrJrJ#r# g!\-a gf=f)'z&Utilities for diffing files and trees.) defaultdict namedtuple)BytesIO)chainN) S_ISGITLINK TreeEntryaddmodifydeleterenamecopy unchangedd<c8\rSrSrSr\S5r\S5rSrg) TreeChange8z.Named tuple a single change between two trees.c&U"[[U5$N) CHANGE_ADD _NULL_ENTRY)clsnews $lib/third_party/dulwich/diff_tree.pyr TreeChange.add;s:{C00c&U"[U[5$r) CHANGE_DELETEr)rolds rr TreeChange.delete?s=#{33rN) __name__ __module__ __qualname____firstlineno____doc__ classmethodr r __static_attributes__r"rrrr8s+81144rr)typer rc/nU(dU$URSS9H#nURURU55 M% U$)NT) name_order) iteritemsappendin_path)pathtreeresultentrys r _tree_entriesr4Ds> F  40 emmD)*1 Mrcd[X5n[X5nS=pV[U5n[U5n/n XW:aXh:aX5n XFn U RU R:aU RU [45 US- nOSU RU R:aU R[U 45 US- nOU RX45 US- nUS- nXW:aXh:aM[ XW5Hn U RX<[45 M [ Xh5Hn U R[XL45 M U $)aMerge the entries of two trees. Args: path: A path to prepend to all tree entry names. tree1: The first Tree object to iterate, or None. tree2: The second Tree object to iterate, or None. Returns: A list of pairs of TreeEntry objects for each pair of entries in the trees. If an entry exists in one tree but not the other, the other entry will have all attributes set to None. If neither entry's path is None, they are guaranteed to match. r)r4lenr0r.rrange) r0tree1tree2entries1entries2i1i2len1len2r2entry1entry2is r_merge_entriesrDMsT)HT)HKB x=D x=D F )  ;; $ MM6;/ 0 !GB [[6;; & MM;/ 0 !GB MM6* + !GB !GB ) 2_ x{K01 2_ {HK01 MrcNURnUcg[R"U5$NF)modestatS_ISDIR)r3rGs r_is_treerJus" ::D | << rc ## U=(a [R=(d SnU=(a [R=(d Sn[SXA5[SXR54/nU(aUR5upx[ U5n [ U5n U(aU (aU (aXx:XaMKU =(a XR =(d Sn U =(a XR =(d Sn UR =(d UR n UR[[XU 555 Xx4v U(aMgg7f)aRecursively walk all the entries of two trees. Iteration is depth-first pre-order, as in e.g. os.walk. Args: store: An ObjectStore for looking up objects. tree1_id: The SHA of the first Tree object to iterate, or None. tree2_id: The SHA of the second Tree object to iterate, or None. param prune_identical: If True, identical subtrees will not be walked. Returns: Iterator over Pairs of TreeEntry objects for each pair of entries in the trees and their subtrees recursively. If an entry exists in one tree but not the other, the other entry will have all attributes set to None. If neither entry's path is None, they are guaranteed to match. Nr) rHS_IFDIRrpoprJshar0extendreversedrD)storetree1_idtree2_idprune_identicalmode1mode2todorArBis_tree1is_tree2r9r:r0s r walk_treesrZ|s&  % -E  % -E sE ,iU.M N OD F#F# xH9I .U::.6$.U::.6${{)fkk H^D?@An $s D8D><D>cURb,U(d+[R"UR5(a[$U$r)rGrHrIr)r3 include_treess r _skip_treer]s+ zz-DLL4L4L Lrc#b# Ub$Ub!UbURUUUUS9HnUv M g[XX#(+S9nUHupX:Xa U(dM[X5n [X5n U [:waU [:wa[R "U R 5[R "U R 5:wa+U(d$[RU 5v [n [n O7X:Xa[n O+[n O$U [:wa[n OU [:wa[n OM[XU 5v M g7f)a=Find the differences between the contents of two trees. Args: store: An ObjectStore for looking up objects. tree1_id: The SHA of the source tree. tree2_id: The SHA of the target tree. want_unchanged: If True, include TreeChanges for unmodified entries as well. include_trees: Whether to include trees rename_detector: RenameDetector object for detecting renames. change_type_same: Whether to report change types in the same entry or as delete+add. Returns: Iterator over TreeChange instances for each change between the source and target tree. Nwant_unchangedr\)rT) changes_with_renamesrZr]rrHS_IFMTrGrr rCHANGE_UNCHANGED CHANGE_MODIFYr) rQrRrSr`rename_detectorr\change_type_samechangeentriesrArB change_types r tree_changesrjs2"x';@T%::  )' ; F L    4FG"  N F2F2 [ V{%: FKK(DKK ,DD(!''//$( !. + { "'K { "$K f559"sD-D/c2UHnU"U5U:wdM g g)NFTr")seqkeyvaluees r_all_eqrps  q6U? rc2[USSX"US55$)Nr6r)rp)rlrms r _all_samerrs 3qr7CSV --rc #^# UVs/sH n[XX#S9PM nn[U5m[U4Sj5n[U5HVupxUHKn U R[ :XaU R Rn OU RRn XU U'MM MX Sn Sn [UR55H~up[U5T:XdeUVs/sH ocMUPM nn[UU [ 5(a[UU 5(dUv MYM[[UU 5(dUv MrSU;dMzUv M gs snfs snf7f)aGet the tree changes for a merge tree relative to all its parents. Args: store: An ObjectStore for looking up objects. parent_tree_ids: An iterable of the SHAs of the parent trees. tree_id: The SHA of the merge tree. rename_detector: RenameDetector object for detecting renames. Returns: Iterator over lists of TreeChange objects, one per conflicted path in the merge. Each list contains one element per parent, with the TreeChange for that path relative to that parent. An element may be None if it never existed in one parent and was deleted in two others. A path is only included in the output if it is a conflict, i.e. its SHA in the merge tree is not found in any of the parents, or in the case of deletes, if not all of the old SHAs match. )rec>S/T-$rr") num_parentssr(tree_changes_for_merge..s 4&;*>rc.URR$r)r rNcs rold_sha'tree_changes_for_merge..old_shasuuyyrcUR$r)r*rys rri+tree_changes_for_merge..change_types vv rN) rjr7r enumerater*rr r0rsorteditemsrprr)rQparent_tree_idstree_idretall_parent_changeschanges_by_pathrCparent_changesrgr0r{ri_changesrzhaverus @rtree_changes_for_mergers5.! A UwH o&K!">?O''9:$F{{m+zzzz'-D !! $ %;_2245 7|{***"47a74 4m 4 4T7++ ,4--M  M6/25s)E D?B:E E E&A E 6E @c[[5n[5nSnURnURnUR nUR n[R"UR55HknURSS5nU"U5 US- nUS:Xd U[:XdM4U"5n U[U 5==[U 5- ss'U"S5 U"5 SnMm US:a&U"5n U[U 5==[U 5- ss'U$)zCount the blocks in an object. Splits the data into blocks either on lines or <=64-byte chunks of lines. Args: obj: The object to count blocks for. Returns: A dict of block hashcode -> total bytes occurring. rr6big )rintrwriteseektruncategetvaluer from_iterable as_raw_chunksto_bytes _BLOCK_SIZEhashr7) obj block_countsblockn block_write block_seekblock_truncateblock_getvaluerzrn last_blocks r _count_blocksr4ss#L IE A++KJ^^N^^N  !2!2!4 5 JJq% A Q :k)"$E e %U 3 % qM  A6 1u#% T*%&#j/9& rc[U5[U5:aXpSnUR5H-up4URU5nU(dMU[XE5- nM/ U$)a;Count the number of common bytes in two block count dicts. Args: block1: The first dict of block hashcode -> total bytes. block2: The second dict of block hashcode -> total bytes. Returns: The number of bytes in common between blocks1 and blocks2. This is only approximate due to possible hash collisions. r)r7rgetmin)blocks1blocks2scorercount1count2s r _common_bytesrXsY 7|c'l"" E  U# 6 S( (E) LrcUc0nURU;a[U5X R'URU;a[U5X!R'[X RX!R5n[UR 5UR 55nU(d[ $[ [U5[ -U- 5$)aCompute a similarity score for two objects. Args: obj1: The first object to score. obj2: The second object to score. block_cache: An optional dict of SHA to block counts to cache results between calls. Returns: The similarity score between the two objects, defined as the number of bytes in common between the two objects divided by the maximum size, scaled to the range 0-100. )idrrmax raw_length _MAX_SCORErfloat)obj1obj2 block_cache common_bytesmax_sizes r_similarity_scorerms  wwk!,T2 GG wwk!,T2 GG WW!5{777KLL4??$doo&78H  u\"Z/(: ;;rctURRnURRnUcUnUcUnX4$r)r r0r)r3path1path2s r_tree_change_keyrs8 IINNE IINNE } } >rc\rSrSrSr\\\S4SjrSr Sr Sr Sr S r S rS rS rS rSrSrSrSrSSjrSrg)RenameDetectoriz7Object for handling rename detection between two trees.FcNXlX lX@lX0lXPlSUlg)a0Initialize the rename detector. Args: store: An ObjectStore for looking up objects. rename_threshold: The threshold similarity score for considering an add/delete pair to be a rename/copy; see _similarity_score. max_files: The maximum number of adds and deletes to consider, or None for no limit. The detector is guaranteed to compare no more than max_files ** 2 add/delete pairs. This limit is provided because rename detection can be quadratic in the project size. If the limit is exceeded, no content rename detection is attempted. rewrite_threshold: The threshold similarity score below which a modify should be considered a delete/add, or None to not break modifies; see _similarity_score. find_copies_harder: If True, consider unmodified files when detecting copies. FN)_store_rename_threshold_rewrite_threshold _max_files_find_copies_harder_want_unchanged)selfrQrename_threshold max_filesrewrite_thresholdfind_copies_harders r__init__RenameDetector.__init__s(2 !1"3##5 $rc./Ul/Ul/Ulgr)_adds_deletes_changesrs r_resetRenameDetector._resets   rc^URbBUR[:wd.URRUR R:XagUR URRnUR UR Rn[X#5UR:$rF)rr*rdr rNrrr)rrgold_objnew_objs r _should_splitRenameDetector._should_splitsw  # # +{{m+zz~~/++fjjnn-++fjjnn- 2T5L5LLLrcUR[:XaURRU5 gUR[:XaUR RU5 gUR U5(aqUR R[RUR55 URR[RUR55 gUR(aUR[:XdUR[:XaUR RU5 gURRU5 gr)r*rrr.rrrrr r r rrrcrdr)rrgs r _add_changeRenameDetector._add_changes ;;* $ JJ  f % [[M ) MM  (    ' ' MM !2!26::!> ? JJ  jnnVZZ8 9  $ $8H)H [[M ) MM  ( MM  (rcUR=(d URn[URUUUURS9HnUR U5 M g)Nr_)rrrjr_include_treesr)rrRrSr`rgs r_collect_changesRenameDetector._collect_changessP11IT5I5I" KK  )--  F   V $ rc URVs/sH o3RRU;dMUPM" snUlURVs/sH oDRRU;dMUPM" snUlgs snfs snfr)rrr0rr )r add_paths delete_pathsads r_pruneRenameDetector._prunesY!%KAuuzz/JaK $(MMTMqUUZZ|5SMT LTsA<A< B-Bc [[5nURH4nXRRR UR5 M6 [[5nUR HInUR[:HnX4RRR URU45 MK [5n[5nUR5GH[upXn [X5Huupn [R"U R5[R"U R5:waMLU(aUR!U R"5 UR!U R"5 U=(a [$=(d [&n UR(R [+XU 55 M [-U 5[-U 5- nU SSn US:dGM X*SHGn UR!U R"5 UR(R [+[&X55 MI GM^ UR/Xg5 g)Nr)rlistrrrNr.rr*rr setrziprHrbrGr r0 CHANGE_RENAME CHANGE_COPYrrr7r)radd_mapr delete_mapr is_deleterrrN sha_deletessha_addsr rnew_typenum_extra_addss r_find_exact_renames"RenameDetector._find_exact_renamessd#::C GGKK ' ' 0 & mmF }4I zz~~ & - -vzz9.E F $ E u * 0 0 2 C|H),[)C% #;;sxx(DKK,AA $$SXX. chh'$6E+ $$Zs%CD*D!]S-==Na.#C!#O$45CMM#((+MM((K)JK6!3$ I,rcx[UR5[UR5-URS-:*$)N)r7rrrrs r_should_find_content_renames+RenameDetector._should_find_content_renames s,4::T]]!33t!7KKKrcU(a4URRURR:Xa[$UR[ :wa[ $[$r)r r0rrdr*rrr)r check_pathsr r s r _rename_typeRenameDetector._rename_type s> 6::??cggll:! [[M ) rc/=olUR5(dg0nURSLnURGHKn[ UR R 5(aM*UR RnURUn[U5X%'URHn[R"UR R 5[R"URR 5:waM[URURRn[XhUS9n XR:dMURX4U5n [!XR UR5n UR#U *U 45 M GMN g)N)r) _candidatesrrrrr rGrNrrrrHrbrrrrr.) r candidatesrrr r{rr rrrr s r_find_content_rename_candidates.RenameDetector._find_content_rename_candidatess&(** %0022  ,,D8 mmF6::??++jjnnGkk'*G#0#9K zz;;vzz/4;;sww||3LL++cggkk2)' T111#00cJH'**cggFF%%vv&67" $rc URR5 [5n[5nURHup4URRnXR;aM"UR RnUR nXa;a%[[UR UR5nU[:waURU5 URU5 URRU5 M URX!5 gr) rsortrrr0r r*rrr rr.r)rrrrrgnew_pathold_path orig_types r_choose_content_renames&RenameDetector._choose_content_renames5s u E ))IAzzH$zzH I'#KVZZHK'  * MM( # MM  (* I,rc&URcg0n[SUR55nURHnURR nUR U5nUcM/[R"URR5[R"URR5:XdM[[URUR5X'M URVs/sH ofRR U;dMUPM" snUlURVs/sH ofRR U;dMUPM" snUlU=RUR5- sl gs snfs snf)Nc3P# UHoRRU4v M g7fr)r r0).0rs r 0RenameDetector._join_modifies..RsA=a55::q/=s$&)rdictrrrr0rrHrbr rGrrdrvalues)rmodifiesrr r0r rs r_join_modifiesRenameDetector._join_modifiesMs  " " * A4==AA ::C77<r*s$*-       $k2dD)     4L*@A 4%P!HB6J.8v !H*<6f&Vf&T "     s B++B43B4