Jwg:VdZ dZddlZddlZddlZddlZGddZGddZy)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)Nc4eZdZdZdZdZdZdZd*dZdZ d Z d Z d Z d Z d ZdZdZdZdZdZdZej,dZej,dZdZdZdZdZdZdZdZdZ dZ!dZ"d Z#d!Z$d"Z%d+d#Z&d$Z'd%Z(d&Z)d'Z*d(Z+d)Z,y),diff_match_patchzcClass containing the diff, match and patch methods. Also contains the behaviour settings. cfd|_d|_d|_d|_d|_d|_d|_y)zInits 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_MaxBitsselfs X/var/www/horilla/myenv/lib/python3.12/site-packages/diff_match_patch/diff_match_patch.py__init__zdiff_match_patch.__init__(sB  "# &)"  rNc6|dk(rA|jdkrtj}n!tj|jz}|dk(s|dk(r t d||k(r|r|j |fgSgS|j ||}|d|}||d}||d}|j||}|dk(rd}n|| d}|d| }|d| }|j||||}|r|j |fg|dd|r|j|j |f|j||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)) r sysmaxsizetime ValueError DIFF_EQUALdiff_commonPrefixdiff_commonSuffix diff_computeappenddiff_cleanupMerge) rtext1text2 checklinesdeadline commonlength commonprefix commonsuffixdiffss r diff_mainzdiff_match_patch.diff_mainNsY" t   A%;;99;):):: D=ETM78 8 E>%011I--eU; ]l+ lm$lm$--eU; 1 L ,0L.L=)E.L=)E!!% HE //<89E"1I  LL$//<8 9 u% rcD|s|j|fgS|s|j|fgSt|t|kDr||}}n||}}|j|}|dk7r|j|d|f|j|f|j||t|zdfg}t|t|kDr.|j|ddf|d<|j|ddf|d<|St|dk(r|j|f|j|fgS|j ||} | rE| \} } } } }|j | | ||}|j | | ||}||j|fgz|zS|r/t|dkDr!t|dkDr|j|||S|j|||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_bs rr zdiff_match_patch.diff_computes%%u-. .%%u-. . u:E "%*EyX%*EY MM) $ 7!!8BQ<0),!!8AI,>,@#ABE 5zCJ& ,,eAhqk:a ,,eAhqk:aL y>Q %%u-0@0@%/HI I  . ?A 2i=TVCV)ByM98#'#8#8r2x#XX5 Y:QBL!a%%-; Y$rM !8aBy1},=9q=@Q,QIM*BIM*Q.B"W%\)rcAg%a.8!GB!GB %\)rcAg%a.8!#9  $QJE,&qLG (5 02 5I A~)h*>2i=TVCV ]%]Y6)B.8#'#8#8r2x#XX= YGA YJ!!5)D,<,.diff_linesToCharsMungesEIGCIM)))D)4b=!$i!mGI! 48#LLXd^!459~1#IJ/"%d)$$T*%(^a%7HTNLLS^a%7!89#aK !CIM)"775> !ri*, i)r!) rr#r$r{chars1chars2rxryrzs @@@rrBz"diff_match_patch.diff_linesToCharssR  " "J'.'. **rctt|D]J}g}||dD]}|j|t|!||ddj |f||<Ly)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)rNr1r!ordrr)rr*rxr8rschars rrCz"diff_match_patch.diff_charsToLinessks5z" 4ADa  2 Ic$i01 2a RWWT]3E!H  4rc|r |r |d|dk7ryd}tt|t|}|}d}||kr#||||||k(r|}|}n|}||z dz|z}||kr#|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-minr1)rr#r$ pointermin pointermax pointermid pointerstarts rrz"diff_match_patch.diff_commonPrefixsEU1Xq%9 USZ0   :%\*-|J1OO' ) ' $z1a7*DJ :%rc|r |r |d|dk7ryd}tt|t|}|}d}||kr=|| t||z || t||z k(r|}|}n|}||z dz|z}||kr=|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)rr#r$rrr pointerends rrz"diff_match_patch.diff_commonSuffixsEU2Y%)%; USZ0   :%zkCJ$;<*s5zJ'>?@( ' ' $z1a7*DJ:%rct|}t|}|dk(s|dk(ry||kDr|| d}n ||kr|d|}t||}||k(r|Sd}d} || d}|j|} | dk(r|S|| z }| dk(s || d|d|k(r|}|dz }<)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)r1rr2) rr#r$rPrQ text_lengthbestlengthpatternfounds rdiff_commonOverlapz#diff_match_patch.diff_commonOverlap s5z 5z 1   1 , &<-.)E L (-<(E, 5 E>  VGHoGJJw'E{ eOFzUF78_gv>! rcjdkryt|t|kDr||}}n||}}t|dkst|dzt|kryfd}|||t|dzdz}|||t|dzdz}|s|sy|s|}n'|s|}n"t|dt|dkDr|}n|}t|t|kDr |\} } } } } 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|||t|dzz}d}|j|}|dk7r j||d||d} j|d||d|}t|||zkr1|||z |||||zz}|d||z }|||zd} |d||z } |||zd} |j||dz}|dk7rt|dzt|k\r   |fSy)auDoes 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-)r1r2rr) r6r7r8seed best_commonj prefixLength suffixLengthbest_longtext_abest_longtext_bbest_shorttext_abest_shorttext_brs rdiff_halfMatchIz8diff_match_patch.diff_halfMatch..diff_halfMatchILsNACMQ$6 67DKt$Ar'#55hqrlIabMR #55hrlIbqMR {#l\&AA!!l"2Q7#AL(89: '//A\1A&BO&.qs` rr3zdiff_match_patch.diff_halfMatch4s    ! u:E "%*EyX%*EY x=1 I 2S] B) Xh CMA4E!3KLh CMA4E!3KL3BB3q6{SQ[( u:E "?A !$(8(88&#eGnQ.?*@@&%U7^A->)??%!L)S1CEV-WWL)S1CEV-WWLLB$2B2BL1QR((jnq01!41E*R.1,- NN$:"(:",R."$<@9&(9<@9&(9#'L"G qLGWE "\   " "5 ) ))%0E "gk"1%)9)99'N1%)9)99 1-a0!'N1- "&"9"9(I"N"&"9"9)X"N"o5'3x=3+>>*c)ns.BB #dooyAQ/7R%S!,,$%Fs8}'FG.gk* !,,%o&67.gk* 1 (3x=3+>>*c)ns.BB #doox@P7Q%R!,,%&HI(HI.gk* !,,$_%56.gk* 1 1  qLG_E "rcfd}d}|t|dz krd||dz djk(r2||dzdjk(r||dz d}||d}||dzd}j||}|r|| d}|d| }||d| z}||z}|} |} |} ||||||z} |rU|rS|d|dk(rH||dz }|dd|dz}|dd}||||||z} | | k\r| } |} |} |} |r|r |d|dk(rH||dz d| k7rO| r||dz d| f||dz <n ||dz =|dz}||d| f||<| r||dzd| f||dz<n ||dz=|dz}|dz }|t|dz krcyy)a Look 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|r|sy|d}|d}|j }|j }|xr|j}|xr|j}|xr |dk(xs|dk(}|xr |dk(xs|dk(} |xr jj|} | xr jj |} | s| ry|s| ry|r|s|ry|s|ry |s|ry y) aGiven 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 rprrr-r)isalnumisspace BLANKLINEENDsearchBLANKLINESTARTmatch) onetwochar1char2nonAlphaNumeric1nonAlphaNumeric2 whitespace1 whitespace2 lineBreak1 lineBreak2 blankLine1 blankLine2rs rdiff_cleanupSemanticScorezPdiff_match_patch.diff_cleanupSemanticLossless..diff_cleanupSemanticScorescGEFE#(==?2 #(==?2 *>u}}K*>u}}K$I%4-*H5D=J$I%4-*H5D=J#E(9(9(@(@(EJ#F(;(;(A(A#(FJZz!++ !%5rrrN)r1rr)rr*rrG equality1edit equality2 commonOffset commonString bestEquality1bestEdit bestEquality2 bestScorescores` rrz-diff_match_patch.diff_cleanupSemanticLosslesss\0 dE Q&gk"1%8'A+&q)T__<"'A+.q1 W~a(!'A+.q1  $55iF #' #7L ).L= 9I'$~ *>>D ,y 8I!*  ) 5t-dI>? yT!W ! -Da(I8il2D )!" I5!41$ BCE )$) (1 #'(1 yT!W ! -D1%a(M9$.3GaK.@.C]-Sgk*!'A+.1 &+GnQ&7%BE'N$.3GaK.@.C]-Sgk*!'A+.1  qLGiE Q&rz\n\r?\n$z ^\r?\n\r?\ncd}g}d}d}d}d}d}d} |t|krU||d|jk(rIt||d|jkr"|s| r|j||}| }||d}ng}d}dx}} n||d|jk(rd} nd}|r|r|r|r| s)t||jdz kr||z|z| zdk(r|j |d|j|f|j ||ddzdf||ddz<|jd}|r |rdx}} g}n2t|r|jt|r|d}nd}dx}} d}|dz }|t|krU|r|j|yy) zReduce the number of edits by eliminating operationally trivial equalities. Args: diffs: Array of diff tuples. FNrrTr-rr) r1rr r!r0rr/rEr") rr*rrrrGpre_inspre_delpost_inspost_dels rdiff_cleanupEfficiencyz'diff_match_patch.diff_cleanupEfficiencys  E "W~a DOO3uW~a()D,>,>>%%g.&G&G#(>!#4L"$J#'L&++8>!$(8(88#H#H X(\*T-?-?!-CC$w.9HDJLLB$2B2BL1QR((jnq01!41E*R.1,-NN$#'L7.228%' z?&NN,z?&0nG&(G.338"G qLGuE "x   " "5 ) rc |j|jdfd}d}d}d}d}|t|kr$||d|jk(r|dz }|||dz }|dz }n||d|jk(r|dz }|||dz }|dz }n||d|jk(r||zdkDrJ|dk7r|dk7r|j ||}|dk7ro||z |z dz }|dk\r/||d|jk(r||d||d|d|zf||<n&|j d|j|d|f|dz }||d}||d}|j||}|dk7r&||d|| d||dzf||<|d| }|d| }g} t|dk7r| j|j|ft|dk7r| j|j|f|||zz}| ||||z|z|t| dzz }nK|dk7rA||dz d|jk(r)||dz d||dz d||dzf||dz <||=n|dz }d}d}d}d}|t|kr$|dddk(r|jd} d}|t|dz krb||dz d|jk(r1||dzd|jk(r||dj||dz drt||dz ddk7r]||d||dz d||ddt||dz d zf||<||dzd||dz d||dzdzf||dz<||dz =d} n||dj||dzdrd||dz d||dz d||dzdzf||dz <||d||dt||dzdd||dzdzf||<||dz=d} |dz }|t|dz krb| r|j|yy)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) r!rr1r/r0rrrrEendswith startswithr") rr*rGrHrIrJrKr'rgnew_opsrs rr"z"diff_match_patch.diff_cleanupMerges  door*+    E "W~a D$4$44! uW~a00 1 w"d&6&66! uW~a00 1 w"doo5,.2#q(\Q->'+'='=k;'W '1, ', 6 E IA Av%(1+*H$)!HQK$)!HQK+m|2L$L,"a !& $%]l9S'T!"!(1 *5lm*DK*5lm*DK'+'='=k;'W '1, %gq 1 +\MN ;eGnQ>O O.E'N+6n }*EK*5n }*EK G;'1,(8(8+'FG;'1,(8(8+'FG|l::GMTE'Gl$:\$IJs7|a//G\eGaK&8&;t&Ngk*1-gk*1-gq0AA*E'A+&gqLG    yE "| 9Q<2  IIK E Q&gk"1%8'A+&q)T__<>!$--eGaK.@.CDWq[)!,2!'N1-!'A+.q1#GnQ/0M3uWq[7I!7L3M2MNO*g "'A+.q1!'A+.q1E'A+4Fq4II.gk*gk*"G7^A&11%! 2DQ2GHgk*1-gk*1-gk0B10EE*E'A+& gq)gq)#eGaK.@.C*D*FG! ,Q/0&E'N gk*"G qLGCE Q&H   " "5 ) rc8d}d}d}d}tt|D]O}||\}} ||jk7r|t| z }||jk7r|t| z }||kDrn|}|}Qt|k7r||d|jk(r|S|||z zS)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)rNr1r/r0) rr*locr|r} last_chars1 last_chars2rgoprss r diff_xIndexzdiff_match_patch.diff_xIndexHs  s5z" !AqJRT%%%#d)#T%%%#d)#| K K ! u:?uQx{d.>.>> cK/00rcg}|D]\}}dt|k(r|jddjddjddjdd }||jk(r|jd |z{||jk(r|jd |z||j k(s|jd |zd j |S)zConvert a diff array into a pretty HTML report. Args: diffs: Array of diff tuples. Returns: HTML representation. r&z&z>rpz ¶
z)%sz)%sz%sr)r1replacer/r!r0rrr)rr*htmlrdatarss rdiff_prettyHtmlz diff_match_patch.diff_prettyHtmlhs 6HBCI~ S'*f%f%|,  T%%% G$NOt''' G$NOt& -45 6wwt}rc~g}|D]&\}}||jk7s|j|(dj|S)zCompute and return the source text (all equalities and deletions). Args: diffs: Array of diff tuples. Returns: Source text. r)r/r!rrrr*rsrrs r diff_text1zdiff_match_patch.diff_text1F "HBT%%% D! "wwt}rc~g}|D]&\}}||jk7s|j|(dj|S)zCompute and return the destination text (all equalities and insertions). Args: diffs: Array of diff tuples. Returns: Destination text. r)r0r!rrrs r diff_text2zdiff_match_patch.diff_text2rrcd}d}d}|D]d\}}||jk(r|t|z }$||jk(r|t|z }B||jk(sR|t ||z }d}d}f|t ||z }|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/r1r0rr)rr* levenshtein insertions deletionsrrs rdiff_levenshteinz!diff_match_patch.diff_levenshteins    HBT%%%c$i' t'''SY& t&s:y99     s:y11 rc g}|D]\}}||jk(rD|jd}|jdtjj |dzY||j k(r0|jdt|jddzz||jk(s|jdt|jddzzdj|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-%d utf-16-ber-z=%d ) r/encoder!urllibparsequoter0r1rrrrs r diff_toDeltazdiff_match_patch.diff_toDeltas JHBT%%%{{7+ C&,,"4"4T;O"PPQt''' ES[)A%Ba%GHIt& ES[)A%Ba%GHI Jyyrcg}|jd}d}|jd}|D]}|dk(r |dd}|ddk(r=tjj |}|j |j |fS|ddk(s|dd k(r t|} | dkrtd |z|||| d zzjd} || d zz }|dd k(r|j |j| f|j |j| ftd |dz|t|k7rtd|t|fz|S#t$rtd |zwxYw)abGiven 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. rrrrrNr-=z"Invalid number in diff_fromDelta: z#Negative number in diff_fromDelta: r-z*Invalid diff operation in diff_fromDelta: z9Delta length (%d) does not equal source text length (%d).) rsplitrrunquoter!r/intrdecoderr0r1) rr#rWr*as_utf16rGtokenstokenparamnrss rdiff_fromDeltazdiff_match_patch.diff_fromDeltas<< ,T" E{!"IEQx3 ,,U3 d..67qSE!HOSE Aq5$%JU%RSS'AE/:AA+N1q5 8s?LL$//4!89LL$"2"2D!9:!@58K3 8 c(m #KCM*+  )"S$%IE%QRRSs E  E$c |dk(s|dk(r tdtdt|t|}||k(ry|sy|||t|z|k(r|S|j |||}|S)aLocate 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)rrrr1 match_bitap)rrsrrrs r match_mainzdiff_match_patch.match_main s| 4<7d?89 9!Sc$i() 7? #c'l* +w 6J$$T7C8ELrcTj}fd}j}|j}|dk7rIt|d||}|j t z}|dk7rt|d||}dt dz z}d}t t |z} d} t t D]\} d} | } | | kr%|| | z|kr| } n| } | | z dz| z} | | kr%| } td| z dz}t| zt |t z}dg|dzz}d| zdz ||dz<t ||dz dD]}t ||dz krd}n|j||dz d}| dk(r||dzdzdz|z||<n2||dzdzdz|z| |dz| |zdzdzz| |dzz||<|||zs|| |dz }||ks|}|dz }|kDrtddz|z }n|| dz|kDr|S|} _|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. ct|tz }t|z }js |xrdxs|S||tjz zS)aICompute 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)floatr1absr )ergaccuracy proximityrrrs rmatch_bitapScorez6diff_match_patch.match_bitap..match_bitapScore;sXQx#g,.HC!G I&& (S4H4y51D1D+EEF FrrrrNr-) match_alphabetr r2rrfindr1rNrget)rrsrrsrscore_thresholdbest_loc matchmaskbin_maxlast_rdr]bin_minbin_midstartfinishrdr charMatchrs` `` rr zdiff_match_patch.match_bitap(s"    ( G&..99Wc* r>!"21h"?QOzz'3W+=>H2~"%&6q(&C_"U#g,*+ g,T*s7|$3 AGGG##AsW}5H%G%G"W,2W< G#G3=1,-EwD 2S\AF #B1f\BvzN6519b1 "t9A% !I !d1q5k1 5I6 Qi1n1Y>BqEa!e9>Q.);$QU^gaj8Q>!CE!!a%.)qE a59$,QA6E/*/#$q5#c>$'1s7X+=$>E"7 ": As+o=Gg3 hrci}|D]}d||< tt|D]$}|||xxdt||z dz zzcc<&|S)zInitialise the alphabet for the Bitap algorithm. Args: pattern: The text to encode. Returns: Hash of character locations. rr)rNr1)rrrrr8s rrzdiff_match_patch.match_alphabetsc  DAdG s7|$ 9A gajMQ3w u||ellU]]&BCii DJJw$77   ! #7|d0043D3DDtGXGXXX t(( (GAu||g-. 1MPW1WG ii DJJw$77   ! #7|d0043D3DDtGXGXXX 4$$$c!U\\G34u||D  $89EKKO LL5== (5<<%--+G'+Q   KK  8 9  F #  F #  Vs6{22  Vs6{22 rcd}d}t|trXt|trH|F|}|j||d}t|dkDr|j ||j |nt|t r|||}|j|}ngt|trt|t r||}|}n@t|tr%t|trt|t r|}|}n td|sgSg}t}d}d} |} |} tt|D]Z} || \} }t|jdk(r| |jk7r||_ | |_| |jk(rL|jj!|| |xj"t|z c_| d| |z| | dz} n| |j$k(rT|xj&t|z c_|jj!|| | d| | | t|zdz} n| |jk(rt|d|j(zkrt|jdk7rkt|| dzk7rZ|jj!|| |xj&t|z c_|xj"t|z c_| |jk(rdt|d|j(zk\rIt|jdk7r1|j+|| |j!|t}| } | }| |jk7r|t|z }| |j$k7sM| t|z } ]t|jdk7r#|j+|| |j!||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+r1rDrlistrr patch_objrNr*rr*r(r/r!r+r0r)rr0)rabcr#r*patchesr, char_count1 char_count2 prepatch_textpostpatch_textrg diff_type diff_texts r patch_makezdiff_match_patch.patch_makesj2 a *Q"4ENN5!T2E5zA~))%0++E2 4 QY19EOOE*E 3 Jq$$7AIEE 3 Jq#$6:a;NEEAB BI    s5z"3 .A%*1X "Y 5;;1$doo)E* * D,,, ""58, Y/ "%A%CDE T__, Na$*;*;&;; $)J!a%' ""58, Y/  Y/ DOO+I!dFWFWBW0Wu{{#q())%?NN5)%KE %3M"-KD,,,s9~- D,,,s9~- g3 .l u{{ q  ! !% 7 NN5 !rcg}|D]u}t}|jdd|_|j|_|j|_|j|_|j |_|j |w|S)zGiven an array of patches, return another array that is identical. Args: patches: Array of Patch objects. Returns: Array of Patch objects. N)r5r*r*r(r)r+r!)rr9 patchesCopyr, patchCopys rpatch_deepCopyzdiff_match_patch.patch_deepCopyJst  *E! I#kk!nIO$||I $||I  % I  % I    y ) *rc  |s|gfS|j|}|j|}||z|z}|j|d}g}|D]}|j|z}|j |j }d} t ||jkDrl|j||d|j|} | dk7rZ|j|||j d|t |z|jz } | dk(s| | k\rd} n|j|||} | dk(r.|jd||j|jz z}|jd| |z }| dk(r|| | t |z} n|| | |jz} || k(r5|d| |j|j z|| t |zdz}s|j|| d} t ||jkDr:|j| tt |z |j kDrd|d<|j#| d} |j D]\}}||j$k7r|j'| | }||j(k(r|d| z|z|| |zdz}n<||j*k(r-|d| z|| |j'| | t |zzdz}||j*k7s| t |z } |t |t | }||fS)aWMerge 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)rDpatch_addPaddingpatch_splitMaxr(rr*r1rrr!r+r)rr+rrr rrrr/r0)rr9rs nullPaddingrWresultsr, expected_locr#end_loc start_locr$r*index1rrindex2s r patch_applyzdiff_match_patch.patch_apply_ss": %%g.++G4 T!K/ G$ I 4E <<%/LOOEKK0EG5zD...!OO% 4$"4"45| ?"oot11134$s5z1D4F4FFG "} W(<$&  OOD%F Bu%66t$!L0b= YU-CDE Wt7I7I-IJEE>Zi(//%++67y3u:5789!NN5%?EE T%7%77 11%85U;LL445', 99%@!"(- 4HB!T__4)-)9)9%)H!T%5%55$()=9v+=$>&*%+&*9v+=+?&@%A!% "$t'7'7!7$()=9v+=$>&*(1*.*:*:5&3t9BT*U)V)X'&%&!% "T%5%55 &#d) 3%4oI 4VC $K(8'89grc|j}d}td|dzD]}|t|z }|D],}|xj|z c_|xj|z c_.|d}|j }|r|dd|j k7rs|jd|j |f|xj|zc_|xj|zc_|xj|z c_|xj|z c_ n|t|ddkDr|t|ddz }|t|ddd|ddz}|dd|f|d<|xj|zc_|xj|zc_|xj|z c_|xj|z c_ |d}|j }|r|dd|j k7rI|j|j |f|xj|z c_|xj|z c_ |S|t|ddkDrY|t|ddz }|dd|d|z}|dd|f|d<|xj|z c_|xj|z c_ |S)a Add 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) rrNrqr*r(r*rrr)r+r1r!) rr9 paddingLengthrHrgr,r* extraLengthnewTexts rrFz!diff_match_patch.patch_addPaddingsf))  q-!+, "A 3q6 !K " *E LLM )L LLM )L *   a t6 LLT__k: ; LLM )L LLM )L MM] *M MM] *M Sq!- -'#eAhqk*::K!#eAhqk"2"45a CGa W-E!H LLK 'L LLK 'L MM[ (M MM[ (M  b ! 7 LL$//;7 8 MM] *M MM] *MSr1. .'#eBil*;;KBil[+%>>Gr1w/E"I MM[ (M MM[ (Mrc |j}|dk(rytt|D]}||j|kr||}||=|dz}|j}|j }d}t|j dk7sWt}d} |t|z |_|t|z |_|r>t|x|_|_|j j|j|ft|j dk7r|j||jz krr|j d\} } | |jk(rd|xjt| z c_|t| z }|j j|j jdd} n| |jk(rt|j dk(r|j dd|jk(rkt| d|zkDrZ|xjt| z c_|t| z }d} |j j| | f|j d=n| d||jz |jz } |xjt| z c_|t| z }| |jk(r-|xjt| z c_|t| z }nd} |j j| | f| |j ddk(r|j d=n=|j dd|j ddt| df|j d<t|j dk7r|j||jz krr|j|j }||j d}|j!|j d|j} | r|xjt| z c_|xjt| z c_t|j dk7rN|j dd|jk(r/|j|j dd| zf|j d<n'|j j|j| f| s|dz }|j#||t|j dk7rky) 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)rrNr1r)r*r(r*r5r+r!rrr/rEr0rrr) rr9 patch_sizergbigpatchr*r( precontextr,emptyr>r? postcontexts rrGzdiff_match_patch.patch_splitMaxs9'' ? s7|$S -Aqz!!Z/qzH FA__F__FJhnn%*! %J7 %J7 47 OCEMEMKK&&'DE'1, T5F5F(FF-5^^A->*Y  D$4$44 Y7 #i.0 **8>>+=+=a+@A %!T%5%55 ,1!KKN1-@ NQ^; Y7 #i.0 % **Iy+AB$NN1-%.Lj5==84;L;LL%  Y7 #i.0$7!MMS^;M"c)n4F$)E **Iy+AB$q(9!(<< (q 1!)q 1! 4 (q 1! 4S^5E F1HNN1-O'1, T5F5F(FFX"__U[[9 '):):(:(<= "oohnn=>Q@Q@QR MMS%55MMMS%55M5;;'1,R1Ct1V OO!KKOA.<+ B  **DOO[+IJFANN1e,Shnn%*S -rcjg}|D]}|jt|dj|S)zTake a list of patches and return a textual representation. Args: patches: Array of Patch objects. Returns: Text representation of patches. r)r!r3rr)rr9rsr,s r patch_toTextzdiff_match_patch.patch_toTextds6 $E KKE # $wwt}rcxg}|s|S|jd}t|dk7rtjd|d}|st d|dzt }|j |t|jd|_ |jddk(r|xjdzc_ d|_ nP|jddk(rd|_ n4|xjdzc_ t|jd|_ t|jd |_ |jd dk(r|xjdzc_ d|_ nP|jd dk(rd|_ n4|xjdzc_ t|jd |_ |d=t|dk7r|dr |dd}nd}tjj|ddd }|d k(r(|j j |j"|fnw|d k(r(|j j |j$|fnJ|dk(r(|j j |j&|fn|dk(rn)|dk(rnt d|d||d=t|dk7rt|dk7r|S)aParse 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. rprz$^@@ -(\d+),?(\d*) \+(\d+),?(\d*) @@$zInvalid patch string: rr-r0rrNrr @zInvalid patch mode: 'z' )rr1rerrr5r!rgroupr*r)r(r+rrrr*r/r0r)rtextliner9rsmr,signrws rpatch_fromTextzdiff_match_patch.patch_fromTextrsLN~~d#$i1n@$q'JA !9DG!CDDKE NN5 !qwwqz?ELwwqzR ! ! s" !  ! #AGGAJ qwwqz?ELwwqzR ! ! s" !  ! #AGGAJ Qd)q.771:DD||++DGABK83;KK&&(8(8$'?@S[KK&&(8(8$'?@S[KK&&'>?S[RZ%tT%RSSG1d)q.9$i1njr)TN)NN)-__name__ __module__ __qualname____doc__rr0r/rr+r r4r5rOrBrCrrrr3rDrr`compilerrrr"rrrrrrr rr rr0r@rDrOrFrGr[rerrrr"s  DKKJ:x<8|7rfFP2=+~ 48>(TY@vwrqh2::k*LRZZ/NL*\y*v1@6  403nrus9" / VVr<++r