o [ @sTddlmZ dZddlZddlZddlZddlZGdddZGdddZdS))divisionzfraser@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_MaxBitsselfrW/var/www/html/env/lib/python3.10/site-packages/diff_match_patch/diff_match_patch_py2.py__init__*s zdiff_match_patch.__init__rTNc Cs|dkr|jdkr tj}nt|j}|dks|dkr td||kr.|r,|j|fgSgS|||}|d|}||d}||d}|||}|dkrSd}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)) rsysmaxinttime ValueError DIFF_EQUALdiff_commonPrefixdiff_commonSuffix diff_computeappenddiff_cleanupMerge) rtext1text2 checklinesdeadline commonlength commonprefix commonsuffixdiffsrrr diff_mainPs6        zdiff_match_patch.diff_maincCsv|s|j|fgS|s|j|fgSt|t|kr||}}n||}}||}|dkrf|j|d|f|j|f|j||t|dfg}t|t|krd|j|ddf|d<|j|ddf|d<|St|dkrv|j|f|j|fgS|||} | r| \} } } } }|| | ||}|| | ||}||j|fg|S|rt|dkrt|dkr||||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)rr r!r"r#longtext shorttextir'hmtext1_atext1_btext2_atext2_b mid_commondiffs_adiffs_brrrrs6       zdiff_match_patch.diff_computec CsJ|||\}}}|||d|}|||||||jdfd}d}d}d} d} |t|kr||d|jkrJ|d7}| ||d7} nK||d|jkr`|d7}| ||d7} n5||d|jkr|dkr|dkr|| | d|} | |||||<|||t| }d}d}d} d} |d7}|t|ks4| |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) rr r!r# linearrayr'pointer count_delete count_insert text_delete text_insertsubDiffrrrr0s<    zdiff_match_patch.diff_lineModec Cst|}t|}||dd}|}d|}dg|} d| |d<| dd} ||} | ddk} d} d}d}d}t|D]}}t|krInst| | |d|dD]}||}|| ksq||krx| |d| |dkrx| |d}n| |dd}||}||kr||kr||||kr|d7}|d7}||kr||kr||||ks|| |<||kr|d7}qV||kr| d7} qV| r|| |}|dkr||kr| |dkr|| |}||kr||||||SqVt| ||d|dD]}||}|| ks||kr"| |d| |dkr"| |d}n| |dd}||}||krh||krh|| d|| dkrh|d7}|d7}||krh||krh|| d|| dksG|| |<||krv|d7}q||kr|d7}q| s|| |}|dkr||kr| |dkr| |}|||}||}||kr||||||Sqq=|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-xrangerdiff_bisectSplitr,r+)rr r!r# text1_length text2_lengthmax_dv_offsetv_lengthv1v2deltafrontk1startk1endk2startk2enddk1 k1_offsetx1y1 k2_offsetx2k2y2rrrr1s              "   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() rr r!xyr#text1atext2atext1btext2br'diffsbrrrrIfs    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|dkrh|d|}|dkrt|d}|||d}|vr4|t|n(tkrD||d}t|}|td|<|ttd|d}|t|dksd|S)a!Split a text into an array of strings. Reduce the texts to a string of hashes where each Unicode character represents one line. Modifies linearray and linehash through being a closure. Args: text: String to encode. Returns: Encoded string. rrr Nr)r-r.runichrjoin)textchars lineStartlineEndline lineArraylineHashmaxLinesrrdiff_linesToCharsMunges&       zBdiff_match_patch.diff_linesToChars..diff_linesToCharsMungei@i)r)rr r!rschars1chars2rrorr=s  % z"diff_match_patch.diff_linesToCharscCsXtt|D]#}g}||dD] }||t|q||dd|f||<qdS)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)rHr-rordri)rr'rpr4rjcharrrrr>s z"diff_match_patch.diff_charsToLinescCs|r |r |d|dkrdSd}tt|t|}|}d}||kr@||||||kr2|}|}n|}||d|}||ks!|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-)rr r! pointermin pointermax pointermid pointerstartrrrrs z"diff_match_patch.diff_commonPrefixcCs|r |r |d|dkrdSd}tt|t|}|}d}||krJ|| t|||| t||kr<|}|}n|}||d|}||ks!|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)rx)rr r!rzr{r| pointerendrrrrs  z"diff_match_patch.diff_commonSuffixc Cst|}t|}|dks|dkrdS||kr|| d}n ||kr(|d|}t||}||kr3|Sd}d} || d}||} | dkrJ|S|| 7}| dks_|| d|d|kre|}|d7}q8)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. rNrTr)r-ryr.) rr r!rJrK text_lengthbestlengthpatternfoundrrrdiff_commonOverlaps.    "z#diff_match_patch.diff_commonOverlapcsjdkrdSt|t|kr||}}n||}}t|dks*t|dt|kr,dSfdd}|||t|dd}|||t|dd}|sP|sPdS|sU|}n|sZ|}nt|dt|dkri|}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}||}|dkrw||d||d}|d||d|}t|||krk||||||||}|d||}|||d} |d||} |||d} |||d}|dkst|dt|kr|| | | |fSdS)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) r2r3r4seed best_commonj prefixLength suffixLengthbest_longtext_abest_longtext_bbest_shorttext_abest_shorttext_brrrdiff_halfMatchIGs*  z8diff_match_patch.diff_halfMatch..diff_halfMatchIr)rr-)rr r!r2r3rhm1hm2r5r6r7r8r9r:rrrr//s.     %zdiff_match_patch.diff_halfMatchcCs"d}g}d}d}d\}}d\}} |t|kr||d|jkr5|||d}}| d}} ||d}ns||d|jkrI|t||d7}n | t||d7} |rt|t||krt|t|| kr||d|j|f|j||dddf||dd<|t|r|t|r|d}nd}d\}}d\}} d}d}|d7}|t|ks|r||| |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}nA| t| dksP| t| dkr|||j| d| f|j| dt| | f||d<|j| | df||d<|d7}|d7}|d7}|t|ksdSdS) zReduce the number of edits by eliminating semantically trivial equalities. Args: diffs: Array of diff tuples. FNr)rrrrTg@) r-rrr+maxinsertr,r@rdiff_cleanupSemanticLosslessr)rr'changes equalities lastEqualityrBlength_insertions1length_deletions1length_insertions2length_deletions2deletion insertionoverlap_length1overlap_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| } |} |} |} |r|r|d|dks|||dd| kr| r||dd| f||d<n ||d=|d8}||d| f||<| r||dd| f||d<n ||d=|d8}|d7}|t|dksdSdS)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|sdS|d}|d}| }| }|o|}|o#|}|o-|dkp-|dk}|o7|dkp7|dk} |o?j|} | oGj|} | sL| rNdS|sR| rTdS|r\|s\|r\dS|s`|rbd S|sf|rhd 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 rgrrr)r)isalnumisspace BLANKLINEENDsearchBLANKLINESTARTmatch) onetwochar1char2nonAlphaNumeric1nonAlphaNumeric2 whitespace1 whitespace2 lineBreak1 lineBreak2 blankLine1 blankLine2rrrdiff_cleanupSemanticScores.      zPdiff_match_patch.diff_cleanupSemanticLossless..diff_cleanupSemanticScorerrN)r-rr)rr'rrB equality1edit equality2 commonOffset commonString bestEquality1bestEdit bestEquality2 bestScorescorerrrrsZ 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|jkrGt||d|jkr>|s.| r>|||}| }||d}ng}d}d}} ns||d|jkrSd} nd}|r|r_|r_|r_| srt||jdkr|||| dkr||d|j|f|j||dddf||dd<|d}|r|rd}} g}nt|r|t|r|d}nd}d}} d}|d7}|t|ks|r||dSdS) zReduce the number of edits by eliminating operationally trivial equalities. Args: diffs: Array of diff tuples. FNrrTr)rr) r-rrrr,rr+r@r) rr'rrrrBpre_inspre_delpost_inspost_delrrrdiff_cleanupEfficiencyUsb      5z'diff_match_patch.diff_cleanupEfficiencyc Cs||jdfd}d}d}d}d}|t|kr_||d|jkr4|d7}|||d7}|d7}n%||d|jkrO|d7}|||d7}|d7}n ||d|jkrY||dkr|dkr|dkr|||}|dkr|||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}n3|dkrM||dd|jkrM||dd||dd||df||d<||=n|d7}d}d}d}d}|t|ks|dddkrl|d} d}|t|dkrU||dd|jkrH||dd|jkrH||d ||ddr||dddkr||d||dd||ddt||dd f||<||dd||dd||ddf||d<||d=d} nU||d ||ddrH||dd||dd||ddf||d<||d||dt||ddd||ddf||<||d=d} |d7}|t|dksy| r_| |dSdS)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,rrrr@endswith startswithr) rr'rBrCrDrErFr$r`new_opsrrrrrs            "  6  $   " z"diff_match_patch.diff_cleanupMergec Csd}d}d}d}tt|D](}||\}} ||jkr!|t| 7}||jkr,|t| 7}||kr2n|}|}qt||krH||d|jkrH|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)rHr-r+r,) rr'locrtru last_chars1 last_chars2r`oprjrrr diff_xIndexs"       zdiff_match_patch.diff_xIndexcCsg}|D]<\}}|dddddddd}||jkr'|d |q||jkr4|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>rgz ¶
z)%sz)%sz%sr)replacer+rr,rri)rr'htmlrdatarjrrrdiff_prettyHtml%s     z diff_match_patch.diff_prettyHtmlcC0g}|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+rrirr'rjrrrrr diff_text1:     zdiff_match_patch.diff_text1cCr)zCompute and return the destination text (all equalities and insertions). Args: diffs: Array of diff tuples. Returns: Destination text. r)r,rrirrrr diff_text2Irzdiff_match_patch.diff_text2cCs|d}d}d}|D],\}}||jkr|t|7}q||jkr$|t|7}q||jkr4|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,rr)rr' levenshtein insertions deletionsrrrrrdiff_levenshteinXs     z!diff_match_patch.diff_levenshteincCsg}|D]7\}}||jkr|d}|dt|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+encoderurllibquoter,r-rrirrrr diff_toDeltars      zdiff_match_patch.diff_toDeltac CsDt|tkr |d}g}d}|d}|D]y}|dkrq|dd}|ddkr:t|d}||j|fq|dd ksF|dd krzt |}Wn t yYt d |w|dkrdt d |||||} ||7}|dd kr||j | fq||j | fqt d |d|t |krt d|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. asciirrrrNrr-=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).)typeunicodersplitrunquotedecoderr+intrrr,r-) rr rQr'rBtokenstokenparamnrjrrrdiff_fromDeltasF            zdiff_match_patch.diff_fromDeltacCsn|dks|dkr tdtdt|t|}||krdS|s dS|||t||kr.|S||||}|S)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)rrryr- match_bitap)rrjrrrrrr match_mains zdiff_match_patch.match_maincs`}fdd}j}|}|dkr8t|d||}|t}|dkr8t|d||}dtd>}d}tt|} d} ttD]} d} | } | | krv|| | |krh| } n| } | | d| } | | ks\| } td| d}t| t|t}dg|d}d| >d||d<t||ddD]v}t||dkrd}n |||dd}| dkr||dd>dB|@||<n"||dd>dB|@| |d| |Bd>dBB| |dB||<|||@r|| |d}||kr|}|d}|krtdd|}qnq|| d|kr+|S|} qR|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|rdp|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 )er`accuracy proximityrrrrrmatch_bitapScores   z6diff_match_patch.match_bitap..match_bitapScorerrrNr)) match_alphabetr r.ryrfindr-rHrget)rrjrrsrscore_thresholdbest_loc matchmaskbin_maxlast_rdrWbin_minbin_midstartfinishrdr charMatchrrrrrsh     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)rHr-)rrrrwr4rrrrJs   &zdiff_match_patch.match_alphabetcCst|dkrdS||j|j|j}d}||||krd|jdks1t||j|j|jkrd||j7}|td|j||j|j|}||||krd|jdks1t||j|j|jks1||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 rrr'rstart1length2)rpatchrjrpaddingprefixsuffixrrrpatch_addContext\sB    z!diff_match_patch.patch_addContextcCsd}d}t|tr,t|tr,|dur,|}|||d}t|dkr+||||n@t|trA|durA|durA|}||}n+t|trTt|trT|durT|}|}nt|trht|trht|trh|}|}ntd|spgSg}t }d}d} |} |} t t|D]} || \} }t|j dkr| |j kr||_ | |_| |jkr|j || |jt|7_| d| || | d} nb| |jkr|jt|7_|j || | d| | | t|d} n;| |j kr$t|d|jkr$t|j dkr$t|| dkr$|j || |jt|7_|jt|7_| |j krNt|d|jkrNt|j dkrN||| ||t }| } | }| |jkrZ|t|7}| |jkrf| t|7} qt|j dkrz||| |||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) isinstance basestringr(r-r?rlistrr patch_objrHr'rr r r+rrr,r r r)rabcr r'patchesr char_count1 char_count2 prepatch_textpostpatch_textr` diff_type diff_textrrr patch_makes          "         zdiff_match_patch.patch_makecCsRg}|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'r r r rr)rr patchesCopyr patchCopyrrrpatch_deepCopys  zdiff_match_patch.patch_deepCopyc Cs|s|gfS||}||}|||}||d}g}|D]}|j|}||j}d} t||jkrg|||d|j|} | dkrf||||j d|t||j} | dksd| | krfd} n||||} | dkr| d||j |j 8}q!| d| |}| dkr|| | t|} n || | |j} || kr|d| | |j|| t|d}q!| || d} t||jkr|| tt||jkrd|d<q!|| d} |jD]R\}}||jkr|| | }||jkr|d| |||| |d}n||jkr-|d| ||| || | t|d}||jkr9| t|7} qq!|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)r%patch_addPaddingpatch_splitMaxr rr'r-r rrrr rr(rrr rrrr+r,)rrrj nullPaddingrQresultsr expected_locr end_loc start_locr!r'index1rrindex2rrr patch_apply sz                   zdiff_match_patch.patch_applyc Cs"|j}d}td|dD]}|t|7}q |D]}|j|7_|j|7_q|d}|j}|r:|dd|jkr`|d|j|f|j|8_|j|8_|j|7_|j |7_ nL|t |ddkr|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_ |S|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 rHchrr r r'rrr rr-r) rr paddingLengthr(r`rr' extraLengthnewTextrrrr&dsJ $ z!diff_match_patch.patch_addPaddingc Csd|j}|dkr dStt|D]}||j|krq||}||=|d8}|j}|j}d}t|jdkrt}d} |t||_|t||_|r[t||_|_|j |j |ft|jdkrA|j||j krA|jd\} } | |j kr|jt| 7_|t| 7}|j |j dd} n| |jkrt|jdkr|jdd|j krt| d|kr|jt| 7_|t| 7}d} |j | | f|jd=na| d||j|j } |jt| 7_|t| 7}| |j kr|jt| 7_|t| 7}nd} |j | | f| |jddkr|jd=n|jdd|jddt| df|jd<t|jdkrA|j||j ksl||j}||j d}||jd|j } | r|jt| 7_|jt| 7_t|jdkr|jdd|j kr|j |jdd| f|jd<n |j |j | f| s|d7}|||t|jdks5qdS) 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 rHr-r r r r'rrrrr r+r@r,rrr) rr patch_sizer`bigpatchr r  precontextremptyr r! postcontextrrrr's           %& 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)rstrri)rrrjrrrr patch_toTexts  zdiff_match_patch.patch_toTextcCs&t|tkr |d}g}|s|S|d}t|dkrtd|d}|s/td|dt}| |t | d|_ | ddkrQ|j d8_ d|_ n| dd kr\d|_ n|j d8_ t | d|_ t | d |_| d dkr|jd8_d|_n| d d krd|_n|jd8_t | d |_|d=t|dkr |dr|dd}nd}t|ddd }|d }|dkr|j |j|fn.|dkr|j |j|fn |dkr|j |j|fn|dkrn|dkrntd||f|d=t|dkst|dks|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. rrgrz$^@@ -(\d+),?(\d*) \+(\d+),?(\d*) @@$zInvalid patch string: rr)r0rrNrrr @zInvalid patch mode: '%s' %s)rrrrr-rerrrrrgroupr r r rrrrr'r+r,r)rtextlinerrjmrsignrnrrrpatch_fromTextsd     6zdiff_match_patch.patch_fromText)TN)NN)-__name__ __module__ __qualname____doc__rr,r+rr(rr0r1rIr=r>rrrr/r?rr>compilerrrrrrrrrrrrrrrr"r%r/r&r'r:rCrrrrr$sR" <;9f?*T_ p Gi 8j )rX:X rc@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'r r r rrrrrrVs  zpatch_obj.__init__cCs(|jdkr t|jd}n|jdkrt|jd}nt|jddt|j}|jdkr5t|jd}n|jdkrBt|jd}nt|jddt|j}d|d|dg}|jD]4\}}|tjkri|dn|tj krt|d n |tj kr~|d | d }|t |d d qZd|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 @@ rrr<rrrgr)r r9r rr r'rr+rr,rrrrri)rcoords1coords2rjrrrrr__str___s*            zpatch_obj.__str__N)rDrErFrGrrLrrrrrRs r) __future__r __author__r>rrrrrrrrrs0 <