U dn5@sHdZdZddlZddlZddlZddlZGdddZGdddZdS)axDiff Match and Patch Copyright 2018 The diff-match-patch Authors. https://github.com/google/diff-match-patch Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. zfraser@google.com (Neil Fraser)Nc@sDeZdZdZddZdZdZdZdMd d Zd d Z d dZ ddZ ddZ ddZ ddZddZddZddZddZdd Zd!d"Zed#Zed$Zd%d&Zd'd(Zd)d*Zd+d,Zd-d.Zd/d0Zd1d2Zd3d4Z d5d6Z!d7d8Z"d9d:Z#d;d<Z$d=d>Z%dNd?d@Z&dAdBZ'dCdDZ(dEdFZ)dGdHZ*dIdJZ+dKdLZ,dS)Odiff_match_patchz_Class containing the diff, match and patch methods. Also contains the behaviour settings. cCs.d|_d|_d|_d|_d|_d|_d|_dS)zxInits a diff_match_patch object with default settings. Redefine these in your program to override the defaults. ?g?i N) Diff_Timeout Diff_EditCostMatch_ThresholdMatch_DistancePatch_DeleteThreshold Patch_Margin Match_MaxBitsselfrE/tmp/pip-unpacked-wheel-y8mi38gx/diff_match_patch/diff_match_patch.py__init__(szdiff_match_patch.__init__rTNc Cs|dkr(|jdkrtj}nt|j}|dks8|dkr@td||kr\|rX|j|fgSgS|||}|d|}||d}||d}|||}|dkrd}n*|| d}|d| }|d| }|||||}|r|j|fg|dd<|r| |j|f| ||S)aFind the differences between two texts. Simplifies the problem by stripping any common prefix or suffix off the texts before diffing. Args: text1: Old string to be diffed. text2: New string to be diffed. checklines: Optional speedup flag. If present and false, then don't run a line-level diff first to identify the changed areas. Defaults to true, which does a faster, slightly less optimal diff. deadline: Optional time when the diff should be complete by. Used internally for recursive calls. Users should set DiffTimeout instead. Returns: Array of changes. NrzNull inputs. (diff_main)) rsysmaxsizetime ValueError DIFF_EQUALdiff_commonPrefixdiff_commonSuffix diff_computeappenddiff_cleanupMerge) rtext1text2 checklinesdeadline commonlength commonprefixZ commonsuffixdiffsrrr diff_mainNs6        zdiff_match_patch.diff_maincCs~|s|j|fgS|s |j|fgSt|t|kr<||}}n ||}}||}|dkr|j|d|f|j|f|j||t|dfg}t|t|kr|j|ddf|d<|j|ddf|d<|St|dkr|j|f|j|fgS|||} | r@| \} } } } }|| | ||}|| | ||}||j|fg|S|rpt|dkrpt|dkrp||||S||||S)aFind the differences between two texts. Assumes that the texts do not have any common prefix or suffix. Args: text1: Old string to be diffed. text2: New string to be diffed. checklines: Speedup flag. If false, then don't run a line-level diff first to identify the changed areas. If true, then run a faster, slightly less optimal diff. deadline: Time when the diff should be complete by. Returns: Array of changes. rNrrd) DIFF_INSERT DIFF_DELETElenfindrdiff_halfMatchr& diff_lineMode diff_bisect)rrr r!r"longtext shorttextir%hmtext1_atext1_btext2_atext2_b mid_commonZdiffs_aZdiffs_brrrrs8       "zdiff_match_patch.diff_computec CsH|||\}}}|||d|}|||||||jdfd}d}d}d} d} |t|kr<||d|jkr|d7}| ||d7} n||d|jkr|d7}| ||d7} np||d|jkr2|dkr"|dkr"|| | d|} | |||||<|||t| }d}d}d} d} |d7}q\| |S)aKDo a quick line-level diff on both strings, then rediff the parts for greater accuracy. This speedup can produce non-minimal diffs. Args: text1: Old string to be diffed. text2: New string to be diffed. deadline: Time when the diff should be complete by. Returns: Array of changes. Frrr) diff_linesToCharsr&diff_charsToLinesdiff_cleanupSemanticrrr+r)r*pop) rrr r"Z linearrayr%pointer count_delete count_insert text_delete text_insertZsubDiffrrrr.s:   zdiff_match_patch.diff_lineModec CsRt|}t|}||dd}|}d|}dg|} d| |d<| dd} ||} | ddk} d} d}d}d}t|D]}t|krq>t| | |d|dD] }||}|| ks||kr| |d| |dkr| |d}n| |dd}||}||krD||krD||||krD|d7}|d7}q || |<||kr`|d7}q||krt| d7} q| r|| |}|dkr||kr| |dkr|| |}||kr||||||Sqt| ||d|dD]N}||}|| ks(||kr6| |d| |dkr6| |d}n| |dd}||}||kr||kr|| d|| dkr|d7}|d7}qN|| |<||kr|d7}n||kr|d7}nt| s|| |}|dkr||kr| |dkr| |}|||}||}||kr||||||Sqqz|j|f|j|fgS)a}Find the 'middle snake' of a diff, split the problem in two and return the recursively constructed diff. See Myers 1986 paper: An O(ND) Difference Algorithm and Its Variations. Args: text1: Old string to be diffed. text2: New string to be diffed. deadline: Time at which to bail if not yet complete. Returns: Array of diff tuples. rr'rrN)r+rangerdiff_bisectSplitr*r))rrr r" text1_length text2_lengthZmax_dZv_offsetZv_lengthZv1Zv2deltaZfrontZk1startZk1endZk2startZk2enddZk1Z k1_offsetx1y1Z k2_offsetZx2Zk2y2rrrr/s      *        0      "   zdiff_match_patch.diff_bisectc CsX|d|}|d|}||d}||d} |||d|} ||| d|} | | S)agGiven the location of the 'middle snake', split the diff in two parts and recurse. Args: text1: Old string to be diffed. text2: New string to be diffed. x: Index of split point in text1. y: Index of split point in text2. deadline: Time at which to bail if not yet complete. Returns: Array of diff tuples. NF)r&) rrr xyr"Ztext1aZtext2aZtext1bZtext2br%ZdiffsbrrrrCis    z!diff_match_patch.diff_bisectSplitcsDgidfdd}d||}d||}||fS)aSplit two texts into an array of strings. Reduce the texts to a string of hashes where each Unicode character represents one line. Args: text1: First string. text2: Second string. Returns: Three element tuple, containing the encoded text1, the encoded text2 and the array of unique strings. The zeroth element of the array of unique strings is intentionally blank. rcsg}d}d}|t|dkr|d|}|dkr.diff_linesToCharsMungei*, i)r)rrr rWchars1chars2rrUrr9s  %z"diff_match_patch.diff_linesToCharscCsXtt|D]F}g}||dD]}||t|q ||dd|f||<q dS)zRehydrate the text in a diff from a string of line hashes to real lines of text. Args: diffs: Array of diff tuples. lineArray: Array of unique strings. rrrN)rBr+rordrO)rr%rVr2rPcharrrrr:s z"diff_match_patch.diff_charsToLinescCs~|r|r|d|dkrdSd}tt|t|}|}d}||krz||||||krd|}|}n|}||d|}q:|S)zDetermine the common prefix of two strings. Args: text1: First string. text2: Second string. Returns: The number of characters common to the start of each string. rr'minr+)rrr pointermin pointermax pointermidZ pointerstartrrrrs z"diff_match_patch.diff_commonPrefixcCs|r|r|d|dkrdSd}tt|t|}|}d}||kr|| t|||| t||krx|}|}n|}||d|}q:|S)zDetermine the common suffix of two strings. Args: text1: First string. text2: Second string. Returns: The number of characters common to the end of each string. rrr'r\)rrr r^r_r`Z pointerendrrrrs z"diff_match_patch.diff_commonSuffixc Cst|}t|}|dks |dkr$dS||kr<|| d}n||krP|d|}t||}||krf|Sd}d}|| d}||} | dkr|S|| 7}| dks|| d|d|krn|}|d7}qndS)aDetermine if the suffix of one string is the prefix of another. Args: text1 First string. text2 Second string. Returns: The number of characters common to the end of the first string and the start of the second string. rNrr)r+r]r,) rrr rDrEZ text_lengthbestlengthpatternfoundrrrdiff_commonOverlap s*    "z#diff_match_patch.diff_commonOverlapcsjdkrdSt|t|kr*||}}n ||}}t|dksTt|dt|krXdSfdd}|||t|dd}|||t|dd}|s|sdS|s|}n,|s|}n"t|dt|dkr|}n|}t|t|kr|\} } } } } n|\} } } } } | | | | | fS) aDo the two texts share a substring which is at least half the length of the longer text? This speedup can produce non-minimal diffs. Args: text1: First string. text2: Second string. Returns: Five element Array, containing the prefix of text1, the suffix of text1, the prefix of text2, the suffix of text2 and the common middle. Or None if there was no match. rNrr'c s|||t|d}d}||}|dkr||d||d}|d||d|}t|||kr||||||||}|d||}|||d} |d||} |||d} |||d}q&t|dt|kr || | | |fSdSdS)a3Does a substring of shorttext exist within longtext such that the substring is at least half the length of longtext? Closure, but does not reference any external variables. Args: longtext: Longer string. shorttext: Shorter string. i: Start index of quarter length substring within longtext. Returns: Five element Array, containing the prefix of longtext, the suffix of longtext, the prefix of shorttext, the suffix of shorttext and the common middle. Or None if there was no match. rrrNrr')r+r,rr) r0r1r2seedZ best_commonjZ prefixLengthZ suffixLengthZbest_longtext_aZbest_longtext_bZbest_shorttext_aZbest_shorttext_br rrdiff_halfMatchILs0 z8diff_match_patch.diff_halfMatch..diff_halfMatchIr)rr+)rrr r0r1rhZhm1Zhm2r3r4r5r6r7r8rr rr-4s.     ,zdiff_match_patch.diff_halfMatchcCsd}g}d}d}d\}}d\}} |t|krf||d|jkrl|||d}}| d}} ||d}n||d|jkr|t||d7}n| t||d7} |r\t|t||kr\t|t|| kr\||d|j|f|j||dddf||dd<|t|r,|t|r@|d}nd}d\}}d\}} d}d}|d7}q |rv||| |d}|t|kr||dd|jkr ||d|jkr ||dd} ||d} | | | } | | | } | | kr| t| dks | t| dkr|||j| d| f|j| dt| | f||d<|j| | df||d<|d7}n| t| dks| t| dkr|||j| d| f|j| dt| | f||d<|j| | df||d<|d7}|d7}|d7}qdS) zReduce the number of edits by eliminating semantically trivial equalities. Args: diffs: Array of diff tuples. FNr)rrrrTg@) r+rrr)maxinsertr*r<rdiff_cleanupSemanticLosslessre)rr%changes equalities lastEqualityr=Zlength_insertions1Zlength_deletions1Zlength_insertions2Zlength_deletions2ZdeletionZ insertionZoverlap_length1Zoverlap_length2rrrr;s                   z%diff_match_patch.diff_cleanupSemanticcsfdd}d}|t|dkr||ddjkr||ddjkr||dd}||d}||dd}||}|r|| d}|d| }||d| }||}|} |} |} ||||||} |r\|r\|d|dkr\||d7}|dd|d}|dd}||||||} | | kr| } |} |} |} q||dd| kr| r||dd| f||d<n||d=|d8}||d| f||<| r||dd| f||d<n||d=|d8}|d7}qdS)zLook for single edits surrounded on both sides by equalities which can be shifted sideways to align the edit to a word boundary. e.g: The cat came. -> The cat came. Args: diffs: Array of diff tuples. c s|r|s dS|d}|d}| }| }|o:|}|oF|}|oZ|dkpZ|dk}|on|dkpn|dk} |o~j|} | oj|} | s| rdS|s| rdS|r|s|rdS|s|rd S|s|rd SdS) aKGiven two strings, compute a score representing whether the internal boundary falls on logical boundaries. Scores range from 6 (best) to 0 (worst). Closure, but does not reference any external variables. Args: one: First string. two: Second string. Returns: The score. rr rMrrir'r)isalnumisspace BLANKLINEENDsearchBLANKLINESTARTmatch) ZoneZtwoZchar1Zchar2ZnonAlphaNumeric1ZnonAlphaNumeric2Z whitespace1Z whitespace2Z lineBreak1Z lineBreak2Z blankLine1Z blankLine2r rrdiff_cleanupSemanticScores.      zPdiff_match_patch.diff_cleanupSemanticLossless..diff_cleanupSemanticScorerrN)r+rr)rr%ryr=Z equality1ZeditZ equality2Z commonOffsetZ commonStringZ bestEquality1ZbestEditZ bestEquality2Z bestScorescorerr rrlsf 2      z-diff_match_patch.diff_cleanupSemanticLosslessz\n\r?\n$z ^\r?\n\r?\nc Csd}g}d}d}d}d}d}d} |t|kr||d|jkrt||d|jkr~|s^| r~|||}| }||d}ng}d}d}} n||d|jkrd} nd}|r|r|r|r| st||jdkr|||| dkr||d|j|f|j||dddf||dd<|d}|rN|rNd}} g}n2t|r`|t|rt|d}nd}d}} d}|d7}q |r||dS) zReduce the number of edits by eliminating operationally trivial equalities. Args: diffs: Array of diff tuples. FNrrTr'rir) r+rrrr*rkr)r<r) rr%rmrnror=Zpre_insZpre_delZpost_insZpost_delrrrdiff_cleanupEfficiencysr        z'diff_match_patch.diff_cleanupEfficiencyc Cs||jdfd}d}d}d}d}|t|kr||d|jkrf|d7}|||d7}|d7}q$||d|jkr|d7}|||d7}|d7}q$||d|jkr$||dkrD|dkr|dkr|||}|dkrv|||d}|dkr<||d|jkr<||d||d|d|f||<n"|d|j|d|f|d7}||d}||d}|||}|dkr||d|| d||df||<|d| }|d| }g} t|dkr| |j|ft|dkr| |j|f|||8}| |||||<|t| d7}nf|dkr||dd|jkr||dd||dd||df||d<||=n|d7}d}d}d}d}q$|dddkr|d} d}|t|dkr||dd|jkr||dd|jkr||d ||ddr||dddkr||d||dd||ddt||dd f||<||dd||dd||ddf||d<||d=d} n||d ||ddr||dd||dd||ddf||d<||d||dt||ddd||ddf||<||d=d} |d7}q| r| |dS)zReorder and merge like edit sections. Merge equalities. Any edit section can move as long as it doesn't cross an equality. Args: diffs: Array of diff tuples. rrrNrFT) rrr+r)r*rrkrr<endswith startswithr) rr%r=r>r?r@rAr#rKZnew_opsrmrrrrs            "   $     "  z"diff_match_patch.diff_cleanupMergec Csd}d}d}d}tt|D]P}||\}} ||jkrB|t| 7}||jkrX|t| 7}||krdqn|}|}qt||kr||d|jkr|S|||S)aloc is a location in text1, compute and return the equivalent location in text2. e.g. "The cat" vs "The big cat", 1->1, 5->8 Args: diffs: Array of diff tuples. loc: Location within text1. Returns: Location within text2. r)rBr+r)r*) rr%locrXrYZ last_chars1Z last_chars2rKoprPrrr diff_xIndexHs"      zdiff_match_patch.diff_xIndexcCsg}|D]x\}}|dddddddd}||jkrN|d |q||jkrh|d |q||jkr|d |qd |S) zConvert a diff array into a pretty HTML report. Args: diffs: Array of diff tuples. Returns: HTML representation. &z&z>rMz ¶
z)%sz)%sz%sr)replacer)rr*rrO)rr%htmlrdatarPrrrdiff_prettyHtmlhs(      z diff_match_patch.diff_prettyHtmlcCs0g}|D]\}}||jkr||qd|S)zCompute and return the source text (all equalities and deletions). Args: diffs: Array of diff tuples. Returns: Source text. r)r)rrOrr%rPrrrrr diff_text1s    zdiff_match_patch.diff_text1cCs0g}|D]\}}||jkr||qd|S)zCompute and return the destination text (all equalities and insertions). Args: diffs: Array of diff tuples. Returns: Destination text. r)r*rrOrrrr diff_text2s    zdiff_match_patch.diff_text2cCs|d}d}d}|D]X\}}||jkr0|t|7}q||jkrH|t|7}q||jkr|t||7}d}d}q|t||7}|S)zCompute the Levenshtein distance; the number of inserted, deleted or substituted characters. Args: diffs: Array of diff tuples. Returns: Number of changes. r)r)r+r*rrj)rr%Z levenshteinZ insertionsZ deletionsrrrrrdiff_levenshteins     z!diff_match_patch.diff_levenshteincCsg}|D]p\}}||jkr>|d}|dtj|dq||jkr\|dt|q||jkr|dt|qd |S)aWCrush the diff into an encoded string which describes the operations required to transform text1 into text2. E.g. =3 -2 +ing -> Keep 3 chars, delete 2 chars, insert 'ing'. Operations are tab-separated. Inserted text is escaped using %xx notation. Args: diffs: Array of diff tuples. Returns: Delta text. utf-8+!~*'();/?:@&=+$,# z-%dz=%d ) r)encoderurllibparsequoter*r+rrOrrrr diff_toDeltas      zdiff_match_patch.diff_toDeltac Cs4g}d}|d}|D]}|dkr$q|dd}|ddkrZtj|}||j|fq|ddksr|ddkrz t|}Wn tk rtd |YnX|dkrtd |||||} ||7}|ddkr||j| fn||j | fqtd |dq|t |kr0td |t |f|S) a>Given the original text1, and an encoded string which describes the operations required to transform text1 into text2, compute the full diff. Args: text1: Source string for the diff. delta: Delta text. Returns: Array of diff tuples. Raises: ValueError: If invalid input. rrrrNr-=z"Invalid number in diff_fromDelta: z#Negative number in diff_fromDelta: z*Invalid diff operation in diff_fromDelta: z9Delta length (%d) does not equal source text length (%d).) splitrrunquoterr)intrrr*r+) rrrFr%r=tokenstokenparamnrPrrrdiff_fromDeltas@         zdiff_match_patch.diff_fromDeltacCsr|dks|dkrtdtdt|t|}||kr8dS|s@dS|||t||kr\|S||||}|SdS)zLocate the best instance of 'pattern' in 'text' near 'loc'. Args: text: The text to search. pattern: The pattern to search for. loc: The location to search around. Returns: Best match index or -1. NzNull inputs. (match_main)rr)rrjr]r+ match_bitap)rrPrcr~rxrrr match_mains zdiff_match_patch.match_maincsd}fdd}j}|}|dkrpt|d||}|t}|dkrpt|d||}dtd>}d}tt|} d} ttD]} d} | } | | kr|| | |kr| } n| } | | d| } q| } td| d}t| t|t}dg|d}d| >d||d<t||ddD]}t||dkrfd}n|||dd}| dkr||dd>dB|@||<nD||dd>dB|@| |d| |Bd>dBB| |dB||<|||@rJ|| |d}||krJ|}|d}|kr6tdd|}nq@qJ|| d|krZq`|} q|S)a Locate the best instance of 'pattern' in 'text' near 'loc' using the Bitap algorithm. Args: text: The text to search. pattern: The pattern to search for. loc: The location to search around. Returns: Best match index or -1. cs@t|t}t|}js.|r*dp,|S||tjS)aCompute and return the score for a match with e errors and x location. Accesses loc and pattern through being a closure. Args: e: Number of errors in match. x: Location of match. Returns: Overall score for match (0.0 = good, 1.0 = bad). r)floatr+absr )erKZaccuracyZ proximityr~rcrrrmatch_bitapScore8s   z6diff_match_patch.match_bitap..match_bitapScorerrrNr') match_alphabetrr,r]rfindr+rBrjget)rrPrcr~srZscore_thresholdZbest_locZ matchmaskZbin_maxZlast_rdrGZbin_minZbin_midstartfinishrdrgZ charMatchrzrrrr%sd       zdiff_match_patch.match_bitapcCsPi}|D] }d||<qtt|D](}|||dt||d>O<q"|S)zInitialise the alphabet for the Bitap algorithm. Args: pattern: The text to encode. Returns: Hash of character locations. rr)rBr+)rrcrr[r2rrrrs  &zdiff_match_patch.match_alphabetcCsdt|dkrdS||j|j|j}d}||||kr|jdksbt||j|j|jkr||j7}|td|j||j|j|}q*||j7}|td|j||j}|r|j|fg|j dd<||j|j|j|j|}|r|j |j|f|j t|8_ |jt|8_|jt|t|7_|j t|t|7_ dS)zIncrease the context until it is unique, but don't let the pattern expand beyond Match_MaxBits. Args: patch: The patch to grow. text: Source text. rN) r+start2length1r,rr r rjrr%rstart1length2)rpatchrPrcpaddingprefixsuffixrrrpatch_addContexts8    z!diff_match_patch.patch_addContextcCsd}d}t|trXt|trX|dkrX|}|||d}t|dkr||||nt|tr|dkr|dkr|}||}nVt|trt|tr|dkr|}|}n0t|trt|trt|tr|}|}ntd|sgSg}t }d}d} |} |} t t|D]} || \} }t|j dkr@| |j kr@||_ | |_| |jkr|j || |jt|7_| d| || | d} n| |jkr|jt|7_|j || | d| | | t|d} nv| |j krRt|d|jkrRt|j dkrRt|| dkrR|j || |jt|7_|jt|7_| |j krt|d|jkrt|j dkr||| ||t }| } | }| |jkr|t|7}| |jkr| t|7} qt|j dkr||| |||S)a Compute a list of patches to turn text1 into text2. Use diffs if provided, otherwise compute it ourselves. There are four ways to call this function, depending on what data is available to the caller: Method 1: a = text1, b = text2 Method 2: a = diffs Method 3 (optimal): a = text1, b = diffs Method 4 (deprecated, use method 3): a = text1, b = text2, c = diffs Args: a: text1 (methods 1,3,4) or Array of diff tuples for text1 to text2 (method 2). b: text2 (methods 1,4) or Array of diff tuples for text1 to text2 (method 3) or undefined (method 2). c: Array of diff tuples for text1 to text2 (method 4) or undefined (methods 1,2,3). Returns: Array of Patch objects. NTr'z"Unknown call format to patch_make.rr) isinstancestrr&r+r;r{listrr patch_objrBr%rrrr)rrr*rr r)rabcrr%patchesrZ char_count1Z char_count2Z prepatch_textZpostpatch_textrK diff_type diff_textrrr patch_makes                   zdiff_match_patch.patch_makecCsRg}|D]D}t}|jdd|_|j|_|j|_|j|_|j|_||q|S)zGiven an array of patches, return another array that is identical. Args: patches: Array of Patch objects. Returns: Array of Patch objects. N)rr%rrrrr)rrZ patchesCopyrZ patchCopyrrrpatch_deepCopyGs  zdiff_match_patch.patch_deepCopyc Cs|s |gfS||}||}|||}||d}g}|D]>}|j|}||j}d} t||jkr|||d|j|} | dkr||||j d|t||j} | dks| | krd} n||||} | dkr| d||j |j 8}qB| d| |}| dkr4|| | t|} n|| | |j} || kr~|d| | |j|| t|d}qB| || d} t||jkr|| tt||jkrd|d<qB|| d} |jD]\}}||jkr|| | }||jkr*|d| |||| |d}n<||jkrf|d| ||| || | t|d}||jkr| t|7} qqB|t|t| }||fS)a;Merge a set of patches onto the text. Return a patched text, as well as a list of true/false values indicating which patches were applied. Args: patches: Array of Patch objects. text: Old text. Returns: Two element Array, containing the new text and an array of boolean values. rrNFT)rpatch_addPaddingpatch_splitMaxrrr%r+r rrrrrr&rrr rlrrr)r*)rrrP nullPaddingrFresultsrZ expected_locrZend_locZ start_locr r%Zindex1rrindex2rrr patch_apply\s                        zdiff_match_patch.patch_applyc Cs&|j}d}td|dD]}|t|7}q|D] }|j|7_|j|7_q.|d}|j}|rt|dd|jkr|d|j|f|j|8_|j|8_|j|7_|j |7_ n|t |ddkrZ|t |dd}|t |ddd|dd}|dd|f|d<|j|8_|j|8_|j|7_|j |7_ |d}|j}|r|dd|jkr| |j|f|j|7_|j |7_ nr|t |ddkr"|t |dd}|dd|d|}|dd|f|d<|j|7_|j |7_ |S)zAdd some padding on text start and end so that edges can match something. Intended to be called only from within patch_apply. Args: patches: Array of Patch objects. Returns: The padding string added to each side. rrrNr) r rBrNrrr%rrkrrr+r) rrZ paddingLengthrrKrr%Z extraLengthZnewTextrrrrsH $z!diff_match_patch.patch_addPaddingc Cs@|j}|dkrdStt|D]}||j|kr4q||}||=|d8}|j}|j}d}t|jdkrt}d} |t||_|t||_|rt||_|_|j |j |ft|jdkrl|j||j krl|jd\} } | |j kr(|jt| 7_|t| 7}|j |j dd} q| |jkrt|jdkr|jdd|j krt| d|kr|jt| 7_|t| 7}d} |j | | f|jd=q| d||j|j } |jt| 7_|t| 7}| |j kr |jt| 7_|t| 7}nd} |j | | f| |jddkr<|jd=q|jdd|jddt| df|jd<q||j}||j d}||jd|j } | r |jt| 7_|jt| 7_t|jdkr|jdd|j kr|j |jdd| f|jd<n|j |j | f| sZ|d7}|||qZqdS) zLook through the patches and break up any which are longer than the maximum limit of the match algorithm. Intended to be called only from within patch_apply. Args: patches: Array of Patch objects. rNrrTFr'r)r rBr+rrrr%rrrrr r)r<r*rrrk) rrZ patch_sizerKZbigpatchrrZ precontextremptyrrZ postcontextrrrrs            & zdiff_match_patch.patch_splitMaxcCs&g}|D]}|t|qd|S)zTake a list of patches and return a textual representation. Args: patches: Array of Patch objects. Returns: Text representation of patches. r)rrrO)rrrPrrrr patch_toTextas zdiff_match_patch.patch_toTextcCsg}|s |S|d}t|dkrtd|d}|sHtd|dt}||t|d|_ |ddkr|j d8_ d|_ n4|ddkrd|_ n|j d8_ t|d|_ t|d |_ |d dkr|j d8_ d|_ n6|d dkr d|_ n|j d8_ t|d |_ |d=t|dkr|drT|dd}nd}t j|ddd }|d kr|j|j|fnf|d kr|j|j|fnH|dkr|j|j|fn*|dkrqn|dkrntd||f|d=q0q|S)zParse a textual representation of patches and return a list of patch objects. Args: textline: Text representation of patches. Returns: Array of Patch objects. Raises: ValueError: If invalid input. rMrz$^@@ -(\d+),?(\d*) \+(\d+),?(\d*) @@$zInvalid patch string: rr'r0rirNrr @zInvalid patch mode: '%s' %s)rr+rerxrrrrgrouprrrrrrrr%r)r*r)rZtextlinerrPmrsignrTrrrpatch_fromTextosZ           zdiff_match_patch.patch_fromText)TN)NN)-__name__ __module__ __qualname____doc__rr*r)rr&rr.r/rCr9r:rrrer-r;rlrcompilerurwr{rrrrrrrrrrrrrrrrrrrrrrrr"sP" <>9h?*[yt  N{ 6m, wi:brc@s eZdZdZddZddZdS)rz*Class representing one patch operation. cCs"g|_d|_d|_d|_d|_dS)z-Initializes with an empty list of diffs. Nr)r%rrrrr rrrrs zpatch_obj.__init__cCs*|jdkrt|jd}n6|jdkr4t|jd}nt|jddt|j}|jdkrjt|jd}n6|jdkrt|jd}nt|jddt|j}d|d|dg}|jD]j\}}|tjkr|dn*|tj kr|d n|tj kr|d | d }|t j |d d qd|S)zEmulate GNU diff's format. Header: @@ -382,8 +481,9 @@ Indices are printed as 1-based, not 0-based. Returns: The GNU diff string. rz,0r,z@@ -z +z @@ rrrrrrMr)rrrrrr%rr)rr*rrrrrrO)rZcoords1Zcoords2rPrrrrr__str__s*           zpatch_obj.__str__N)rrrrrrrrrrrs r) r __author__rrr urllib.parserrrrrrrs,%