Copyright (c) 2012-2016 The go-diff authors. All rights reserved. https://github.com/sergi/go-diff See the included LICENSE file for license details. go-diff is a Go implementation of Google's Diff, Match, and Patch library Original library is Copyright (c) 2006 Google Inc. http://code.google.com/p/google-diff-match-patch/

package diffmatchpatch

import (
	
	
	
	
	
	
	
	
	
	
	
)
Operation defines the operation of a diff item.
type Operation int8
go:generate stringer -type=Operation -trimprefix=Diff
DiffDelete item represents a delete diff.
DiffInsert item represents an insert diff.
DiffEqual item represents an equal diff.
	DiffEqual Operation = 0
)
Diff represents one diff operation
type Diff struct {
	Type Operation
	Text string
}
splice removes amount elements from slice at index index, replacing them with elements.
func ( []Diff,  int,  int,  ...Diff) []Diff {
Easy case: overwrite the relevant items.
		copy([:], )
		return 
	}
Fewer new items than old. Copy in the new items.
Shift the remaining items left.
Calculate the new end of the slice.
Zero stranded elements at end so that they can be garbage collected.
		 := [:]
		for  := range  {
			[] = Diff{}
		}
		return [:]
More new items than old. Make room in slice for new elements. There's probably an even more efficient way to do this, but this is simple and clear.
	 := len() -  + len()
	for len() <  {
		 = append(, Diff{})
Shift slice elements right to make room for new elements.
Copy in new elements.
	copy([:], )
	return 
}
DiffMain finds the differences between two texts. If an invalid UTF-8 sequence is encountered, it will be replaced by the Unicode replacement character.
func ( *DiffMatchPatch) (,  string,  bool) []Diff {
	return .DiffMainRunes([]rune(), []rune(), )
}
DiffMainRunes finds the differences between two rune sequences. If an invalid UTF-8 sequence is encountered, it will be replaced by the Unicode replacement character.
func ( *DiffMatchPatch) (,  []rune,  bool) []Diff {
	var  time.Time
	if .DiffTimeout > 0 {
		 = time.Now().Add(.DiffTimeout)
	}
	return .diffMainRunes(, , , )
}

func ( *DiffMatchPatch) (,  []rune,  bool,  time.Time) []Diff {
	if runesEqual(, ) {
		var  []Diff
		if len() > 0 {
			 = append(, Diff{DiffEqual, string()})
		}
		return
Trim off common prefix (speedup).
	 := commonPrefixLength(, )
	 := [:]
	 = [:]
	 = [:]
Trim off common suffix (speedup).
	 = commonSuffixLength(, )
	 := [len()-:]
	 = [:len()-]
	 = [:len()-]
Compute the diff on the middle block.
	 := .diffCompute(, , , )
Restore the prefix and suffix.
	if len() != 0 {
		 = append([]Diff{Diff{DiffEqual, string()}}, ...)
	}
	if len() != 0 {
		 = append(, Diff{DiffEqual, string()})
	}

	return .DiffCleanupMerge()
}
diffCompute finds the differences between two rune slices. Assumes that the texts do not have any common prefix or suffix.
func ( *DiffMatchPatch) (,  []rune,  bool,  time.Time) []Diff {
	 := []Diff{}
Just add some text (speedup).
		return append(, Diff{DiffInsert, string()})
Just delete some text (speedup).
		return append(, Diff{DiffDelete, string()})
	}

	var ,  []rune
	if len() > len() {
		 = 
		 = 
	} else {
		 = 
		 = 
	}

	if  := runesIndex(, );  != -1 {
Swap insertions for deletions if diff is reversed.
		if len() > len() {
			 = DiffDelete
Shorter text is inside the longer text (speedup).
		return []Diff{
			Diff{, string([:])},
			Diff{DiffEqual, string()},
			Diff{, string([+len():])},
		}
Single character string. After the previous speedup, the character can't be an equality.
		return []Diff{
			Diff{DiffDelete, string()},
			Diff{DiffInsert, string()},
Check to see if the problem can be split in two.
A half-match was found, sort out the return data.
		 := [0]
		 := [1]
		 := [2]
		 := [3]
Send both pairs off for separate processing.
		 := .diffMainRunes(, , , )
Merge the results.
		 := 
		 = append(, Diff{DiffEqual, string()})
		 = append(, ...)
		return 
	} else if  && len() > 100 && len() > 100 {
		return .diffLineMode(, , )
	}
	return .diffBisect(, , )
}
diffLineMode does a quick line-level diff on both []runes, then rediff the parts for greater accuracy. This speedup can produce non-minimal diffs.
Scan the text on a line-by-line basis first.
	, ,  := .diffLinesToRunes(, )

	 := .diffMainRunes(, , false, )
Convert the diff back to original text.
Eliminate freak matches (e.g. blank lines)
	 = .DiffCleanupSemantic()
Rediff any replacement blocks, this time character-by-character. Add a dummy entry at the end.
	 = append(, Diff{DiffEqual, ""})

	 := 0
	 := 0
	 := 0
NOTE: Rune slices are slower than using strings in this case.
	 := ""
	 := ""

	for  < len() {
		switch [].Type {
		case DiffInsert:
			++
			 += [].Text
		case DiffDelete:
			++
			 += [].Text
Upon reaching an equality, check for prior redundancies.
Delete the offending records and add the merged ones.
				 = splice(, --,
					+)

				 =  -  - 
				 := .diffMainRunes([]rune(), []rune(), false, )
				for  := len() - 1;  >= 0; -- {
					 = splice(, , 0, [])
				}
				 =  + len()
			}

			 = 0
			 = 0
			 = ""
			 = ""
		}
		++
	}

	return [:len()-1] // Remove the dummy entry at the end.
}
DiffBisect finds the 'middle snake' of a diff, split the problem in two and return the recursively constructed diff. If an invalid UTF-8 sequence is encountered, it will be replaced by the Unicode replacement character. See Myers 1986 paper: An O(ND) Difference Algorithm and Its Variations.
Unused in this code, but retained for interface compatibility.
	return .diffBisect([]rune(), []rune(), )
}
diffBisect finds the 'middle snake' of a diff, splits the problem in two and returns the recursively constructed diff. See Myers's 1986 paper: An O(ND) Difference Algorithm and Its Variations.
Cache the text lengths to prevent multiple calls.
	,  := len(), len()

	 := ( +  + 1) / 2
	 := 
	 := 2 * 

	 := make([]int, )
	 := make([]int, )
	for  := range  {
		[] = -1
		[] = -1
	}
	[+1] = 0
	[+1] = 0
If the total number of characters is odd, then the front path will collide with the reverse path.
Offsets for start and end of k loop. Prevents mapping of space beyond the grid.
	 := 0
	 := 0
	 := 0
	 := 0
Bail out if deadline is reached.
		if !.IsZero() && %16 == 0 && time.Now().After() {
			break
		}
Walk the front path one step.
		for  := - + ;  <= -;  += 2 {
			 :=  + 
			var  int

			if  == - || ( !=  && [-1] < [+1]) {
				 = [+1]
			} else {
				 = [-1] + 1
			}

			 :=  - 
			for  <  &&  <  {
				if [] != [] {
					break
				}
				++
				++
			}
			[] =
Ran off the right of the graph.
				 += 2
Ran off the bottom of the graph.
				 += 2
			} else if  {
				 :=  +  -
Mirror x2 onto top-left coordinate system.
					 :=  - []
Overlap detected.
						return .diffBisectSplit(, , , , )
					}
				}
			}
Walk the reverse path one step.
		for  := - + ;  <= -;  += 2 {
			 :=  + 
			var  int
			if  == - || ( !=  && [-1] < [+1]) {
				 = [+1]
			} else {
				 = [-1] + 1
			}
			var  =  - 
			for  <  &&  <  {
				if [--1] != [--1] {
					break
				}
				++
				++
			}
			[] =
Ran off the left of the graph.
				 += 2
Ran off the top of the graph.
				 += 2
			} else if ! {
				 :=  +  - 
				if  >= 0 &&  <  && [] != -1 {
					 := []
Mirror x2 onto top-left coordinate system.
					 =  -
Overlap detected.
						return .diffBisectSplit(, , , , )
					}
				}
			}
		}
Diff took too long and hit the deadline or number of diffs equals number of characters, no commonality at all.
	return []Diff{
		Diff{DiffDelete, string()},
		Diff{DiffInsert, string()},
	}
}

func ( *DiffMatchPatch) (,  []rune, ,  int,
	 time.Time) []Diff {
	 := [:]
	 := [:]
	 := [:]
	 := [:]
Compute both diffs serially.
	 := .diffMainRunes(, , false, )
	 := .diffMainRunes(, , false, )

	return append(, ...)
}
DiffLinesToChars splits two texts into a list of strings, and educes the texts to a string of hashes where each Unicode character represents one line. It's slightly faster to call DiffLinesToRunes first, followed by DiffMainRunes.
func ( *DiffMatchPatch) (,  string) (string, string, []string) {
	, ,  := .DiffLinesToRunes(, )
	return string(), string(), 
}
DiffLinesToRunes splits two texts into a list of runes. Each rune represents one line.
'\x00' is a valid character, but various debuggers don't like it. So we'll insert a junk entry to avoid generating a null character.
	 := []string{""}    // e.g. lineArray[4] == 'Hello\n'
	 := map[string]int{} // e.g. lineHash['Hello\n'] == 4

	 := .diffLinesToRunesMunge(, &, )
	 := .diffLinesToRunesMunge(, &, )

	return , , 
}

func ( *DiffMatchPatch) (,  []rune) ([]rune, []rune, []string) {
	return .DiffLinesToRunes(string(), string())
}
diffLinesToRunesMunge splits a text into an array of strings, and reduces the texts to a []rune where each Unicode character represents one line. We use strings instead of []runes as input mainly because you can't use []rune as a map key.
Walk the text, pulling out a substring for each line. text.split('\n') would would temporarily double our memory footprint. Modifying text would create many large strings to garbage collect.
	 := 0
	 := -1
	 := []rune{}

	for  < len()-1 {
		 = indexOf(, "\n", )

		if  == -1 {
			 = len() - 1
		}

		 := [ : +1]
		 =  + 1
		,  := []

		if  {
			 = append(, rune())
		} else {
			* = append(*, )
			[] = len(*) - 1
			 = append(, rune(len(*)-1))
		}
	}

	return 
}
DiffCharsToLines rehydrates the text in a diff from a string of line hashes to real lines of text.
func ( *DiffMatchPatch) ( []Diff,  []string) []Diff {
	 := make([]Diff, 0, len())
	for ,  := range  {
		 := .Text
		 := make([]string, len())

		for ,  := range  {
			[] = []
		}

		.Text = strings.Join(, "")
		 = append(, )
	}
	return 
}
DiffCommonPrefix determines the common prefix length of two strings.
Unused in this code, but retained for interface compatibility.
	return commonPrefixLength([]rune(), []rune())
}
DiffCommonSuffix determines the common suffix length of two strings.
Unused in this code, but retained for interface compatibility.
	return commonSuffixLength([]rune(), []rune())
}
commonPrefixLength returns the length of the common prefix of two rune slices.
Linear search. See comment in commonSuffixLength.
	 := 0
	for ;  < len() &&  < len(); ++ {
		if [] != [] {
			return 
		}
	}
	return 
}
commonSuffixLength returns the length of the common suffix of two rune slices.
Use linear search rather than the binary search discussed at https://neil.fraser.name/news/2007/10/09/. See discussion at https://github.com/sergi/go-diff/issues/54.
	 := len()
	 := len()
	for  := 0; ; ++ {
		--
		--
		if  < 0 ||  < 0 || [] != [] {
			return 
		}
	}
}
DiffCommonOverlap determines if the suffix of one string is the prefix of another.
Cache the text lengths to prevent multiple calls.
	 := len()
Eliminate the null case.
	if  == 0 ||  == 0 {
		return 0
Truncate the longer string.
	if  >  {
		 = [-:]
	} else if  <  {
		 = [0:]
	}
Quick check for the worst case.
	if  ==  {
		return 
	}
Start by looking for a single character match and increase length until no match is found. Performance analysis: http://neil.fraser.name/news/2010/11/04/
	 := 0
	 := 1
	for {
		 := [-:]
		 := strings.Index(, )
		if  == -1 {
			break
		}
		 += 
		if  == 0 || [-:] == [0:] {
			 = 
			++
		}
	}

	return 
}
DiffHalfMatch checks whether the two texts share a substring which is at least half the length of the longer text. This speedup can produce non-minimal diffs.
Unused in this code, but retained for interface compatibility.
	 := .diffHalfMatch([]rune(), []rune())
	if  == nil {
		return nil
	}

	 := make([]string, len())
	for ,  := range  {
		[] = string()
	}
	return 
}

func ( *DiffMatchPatch) (,  []rune) [][]rune {
Don't risk returning a non-optimal diff if we have unlimited time.
		return nil
	}

	var ,  []rune
	if len() > len() {
		 = 
		 = 
	} else {
		 = 
		 = 
	}

	if len() < 4 || len()*2 < len() {
		return nil // Pointless.
	}
First check if the second quarter is the seed for a half-match.
	 := .diffHalfMatchI(, , int(float64(len()+3)/4))
Check again based on the third quarter.
	 := .diffHalfMatchI(, , int(float64(len()+1)/2))

	 := [][]rune{}
	if  == nil &&  == nil {
		return nil
	} else if  == nil {
		 = 
	} else if  == nil {
		 =
Both matched. Select the longest.
		if len([4]) > len([4]) {
			 = 
		} else {
			 = 
		}
	}
A half-match was found, sort out the return data.
	if len() > len() {
		return 
	}

	return [][]rune{[2], [3], [0], [1], [4]}
}
diffHalfMatchI checks if a substring of shorttext exist within longtext such that the substring is at least half the length of longtext? Returns a slice containing the prefix of longtext, the suffix of longtext, the prefix of shorttext, the suffix of shorttext and the common middle, or null if there was no match.
func ( *DiffMatchPatch) (,  []rune,  int) [][]rune {
	var  []rune
	var  []rune
	var  int
	var  []rune
	var  []rune
	var  []rune
	var  []rune
Start with a 1/4 length substring at position i as a seed.
	 := [ : +len()/4]

	for  := runesIndexOf(, , 0);  != -1;  = runesIndexOf(, , +1) {
		 := commonPrefixLength([:], [:])
		 := commonSuffixLength([:], [:])

		if  < + {
			 = [- : ]
			 = [ : +]
			 = len() + len()
			 = [:-]
			 = [+:]
			 = [:-]
			 = [+:]
		}
	}

	if *2 < len() {
		return nil
	}

	return [][]rune{
		,
		,
		,
		,
		append(, ...),
	}
}
DiffCleanupSemantic reduces the number of edits by eliminating semantically trivial equalities.
func ( *DiffMatchPatch) ( []Diff) []Diff {
Stack of indices where equalities are found.
	 := make([]int, 0, len())
Always equal to diffs[equalities[equalitiesLength - 1]][1]
Number of characters that changed prior to the equality.
Number of characters that changed after the equality.
	var ,  int

	for  < len() {
Equality found.
			 = append(, )
			 = 
			 = 
			 = 0
			 = 0
			 = [].Text
An insertion or deletion.

			if [].Type == DiffInsert {
				 += len([].Text)
			} else {
				 += len([].Text)
Eliminate an equality that is smaller or equal to the edits on both sides of it.
			 := int(math.Max(float64(), float64()))
			 := int(math.Max(float64(), float64()))
			if len() > 0 &&
				(len() <= ) &&
Duplicate record.
				 := [len()-1]
				 = splice(, , 0, Diff{DiffDelete, })
Change second copy to insert.
Throw away the equality we just deleted.
				 = [:len()-1]

				if len() > 0 {
					 = [:len()-1]
				}
				 = -1
				if len() > 0 {
					 = [len()-1]
				}

				 = 0 // Reset the counters.
				 = 0
				 = 0
				 = 0
				 = ""
				 = true
			}
		}
		++
	}
Normalize the diff.
	if  {
		 = .DiffCleanupMerge()
	}
Find any overlaps between deletions and insertions. e.g: <del>abcxxx</del><ins>xxxdef</ins> -> <del>abc</del>xxx<ins>def</ins> e.g: <del>xxxabc</del><ins>defxxx</ins> -> <ins>def</ins>xxx<del>abc</del> Only extract an overlap if it is as big as the edit ahead or behind it.
	 = 1
	for  < len() {
		if [-1].Type == DiffDelete &&
			[].Type == DiffInsert {
			 := [-1].Text
			 := [].Text
			 := .DiffCommonOverlap(, )
			 := .DiffCommonOverlap(, )
			if  >=  {
				if float64() >= float64(len())/2 ||
					float64() >= float64(len())/2 {
Overlap found. Insert an equality and trim the surrounding edits.
					 = splice(, , 0, Diff{DiffEqual, [:]})
					[-1].Text =
						[0 : len()-]
					[+1].Text = [:]
					++
				}
			} else {
				if float64() >= float64(len())/2 ||
Reverse overlap found. Insert an equality and swap and trim the surrounding edits.
					 := Diff{DiffEqual, [:]}
					 = splice(, , 0, )
					[-1].Type = DiffInsert
					[-1].Text = [0 : len()-]
					[+1].Type = DiffDelete
					[+1].Text = [:]
					++
				}
			}
			++
		}
		++
	}

	return 
}
Define some regex patterns for matching boundaries.
var (
	nonAlphaNumericRegex = regexp.MustCompile(`[^a-zA-Z0-9]`)
	whitespaceRegex      = regexp.MustCompile(`\s`)
	linebreakRegex       = regexp.MustCompile(`[\r\n]`)
	blanklineEndRegex    = regexp.MustCompile(`\n\r?\n$`)
	blanklineStartRegex  = regexp.MustCompile(`^\r?\n\r?\n`)
)
diffCleanupSemanticScore computes 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.
func (,  string) int {
Edges are the best.
		return 6
	}
Each port of this function behaves slightly differently due to subtle differences in each language's definition of things like 'whitespace'. Since this function's purpose is largely cosmetic, the choice has been made to use each language's native features rather than force total conformity.
	,  := utf8.DecodeLastRuneInString()
	,  := utf8.DecodeRuneInString()
	 := string()
	 := string()

	 := nonAlphaNumericRegex.MatchString()
	 := nonAlphaNumericRegex.MatchString()
	 :=  && whitespaceRegex.MatchString()
	 :=  && whitespaceRegex.MatchString()
	 :=  && linebreakRegex.MatchString()
	 :=  && linebreakRegex.MatchString()
	 :=  && blanklineEndRegex.MatchString()
	 :=  && blanklineEndRegex.MatchString()
Five points for blank lines.
		return 5
Four points for line breaks.
		return 4
Three points for end of sentences.
		return 3
Two points for whitespace.
		return 2
One point for non-alphanumeric.
		return 1
	}
	return 0
}
DiffCleanupSemanticLossless looks 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 c<ins>at c</ins>ame. -> The <ins>cat </ins>came.
func ( *DiffMatchPatch) ( []Diff) []Diff {
	 := 1
Intentionally ignore the first and last element (don't need checking).
	for  < len()-1 {
		if [-1].Type == DiffEqual &&
			[+1].Type == DiffEqual {
This is a single edit surrounded by equalities.
			 := [-1].Text
			 := [].Text
			 := [+1].Text
First, shift the edit as far left as possible.
			 := .DiffCommonSuffix(, )
			if  > 0 {
				 := [len()-:]
				 = [0 : len()-]
				 =  + [:len()-]
				 =  + 
			}
Second, step character by character right, looking for the best fit.
			 := 
			 := 
			 := 
			 := diffCleanupSemanticScore(, ) +
				diffCleanupSemanticScore(, )

			for len() != 0 && len() != 0 {
				,  := utf8.DecodeRuneInString()
				if len() <  || [:] != [:] {
					break
				}
				 += [:]
				 = [:] + [:]
				 = [:]
				 := diffCleanupSemanticScore(, ) +
The >= encourages trailing rather than leading whitespace on edits.
				if  >=  {
					 = 
					 = 
					 = 
					 = 
				}
			}
We have an improvement, save it back to the diff.
				if len() != 0 {
					[-1].Text = 
				} else {
					 = splice(, -1, 1)
					--
				}

				[].Text = 
				if len() != 0 {
					[+1].Text = 
				} else {
					 = append([:+1], [+2:]...)
					--
				}
			}
		}
		++
	}

	return 
}
DiffCleanupEfficiency reduces the number of edits by eliminating operationally trivial equalities.
func ( *DiffMatchPatch) ( []Diff) []Diff {
Stack of indices where equalities are found.
	type  struct {
		 int
		 *
	}
Always equal to equalities[equalitiesLength-1][1]
	 := ""
Is there an insertion operation before the last equality.
Is there a deletion operation before the last equality.
Is there an insertion operation after the last equality.
Is there a deletion operation after the last equality.
	 := false
	for  < len() {
		if [].Type == DiffEqual { // Equality found.
			if len([].Text) < .DiffEditCost &&
Candidate found.
				 = &{
					: ,
					: ,
				}
				 = 
				 = 
				 = [].Text
Not a candidate, and can never become one.
				 = nil
				 = ""
			}
			 = false
			 = false
		} else { // An insertion or deletion.
			if [].Type == DiffDelete {
				 = true
			} else {
				 = true
			}
Five types to be split: <ins>A</ins><del>B</del>XY<ins>C</ins><del>D</del> <ins>A</ins>X<ins>C</ins><del>D</del> <ins>A</ins><del>B</del>X<ins>C</ins> <ins>A</del>X<ins>C</ins><del>D</del> <ins>A</ins><del>B</del>X<del>C</del>
			var  int
			if  {
				++
			}
			if  {
				++
			}
			if  {
				++
			}
			if  {
				++
			}
			if len() > 0 &&
				(( &&  &&  && ) ||
					((len() < .DiffEditCost/2) &&  == 3)) {

				 := .
Duplicate record.
				 = splice(, , 0, Diff{DiffDelete, })
Change second copy to insert.
Throw away the equality we just deleted.
				 = .
				 = ""
No changes made which could affect previous entry, keep going.
					 = true
					 = true
					 = nil
				} else {
					if  != nil {
						 = .
					}
					if  != nil {
						 = .
					} else {
						 = -1
					}
					 = false
					 = false
				}
				 = true
			}
		}
		++
	}

	if  {
		 = .DiffCleanupMerge()
	}

	return 
}
DiffCleanupMerge reorders and merges like edit sections. Merge equalities. Any edit section can move as long as it doesn't cross an equality.
Add a dummy entry at the end.
	 = append(, Diff{DiffEqual, ""})
	 := 0
	 := 0
	 := 0
	 := 0
	 := []rune(nil)
	 := []rune(nil)

	for  < len() {
		switch [].Type {
		case DiffInsert:
			++
			 = append(, []rune([].Text)...)
			++
			break
		case DiffDelete:
			++
			 = append(, []rune([].Text)...)
			++
			break
Upon reaching an equality, check for prior redundancies.
			if + > 1 {
Factor out any common prefixies.
					 = commonPrefixLength(, )
					if  != 0 {
						 :=  -  - 
						if  > 0 && [-1].Type == DiffEqual {
							[-1].Text += string([:])
						} else {
							 = append([]Diff{Diff{DiffEqual, string([:])}}, ...)
							++
						}
						 = [:]
						 = [:]
Factor out any common suffixies.
					 = commonSuffixLength(, )
					if  != 0 {
						 := len() - 
						 := len() - 
						[].Text = string([:]) + [].Text
						 = [:]
						 = [:]
					}
Delete the offending records and add the merged ones.
				if  == 0 {
					 = splice(, -,
						+,
						Diff{DiffInsert, string()})
				} else if  == 0 {
					 = splice(, -,
						+,
						Diff{DiffDelete, string()})
				} else {
					 = splice(, --,
						+,
						Diff{DiffDelete, string()},
						Diff{DiffInsert, string()})
				}

				 =  -  -  + 1
				if  != 0 {
					++
				}
				if  != 0 {
					++
				}
Merge this equality with the previous one.
				[-1].Text += [].Text
				 = append([:], [+1:]...)
			} else {
				++
			}
			 = 0
			 = 0
			 = nil
			 = nil
			break
		}
	}

	if len([len()-1].Text) == 0 {
		 = [0 : len()-1] // Remove the dummy entry at the end.
	}
Second pass: look for single edits surrounded on both sides by equalities which can be shifted sideways to eliminate an equality. E.g: A<ins>BA</ins>C -> <ins>AB</ins>AC
	 := false
Intentionally ignore the first and last element (don't need checking).
	for  < (len() - 1) {
		if [-1].Type == DiffEqual &&
This is a single edit surrounded by equalities.
Shift the edit over the previous equality.
				[].Text = [-1].Text +
					[].Text[:len([].Text)-len([-1].Text)]
				[+1].Text = [-1].Text + [+1].Text
				 = splice(, -1, 1)
				 = true
Shift the edit over the next equality.
				[-1].Text += [+1].Text
				[].Text =
					[].Text[len([+1].Text):] + [+1].Text
				 = splice(, +1, 1)
				 = true
			}
		}
		++
	}
If shifts were made, the diff needs reordering and another shift sweep.
	if  {
		 = .()
	}

	return 
}
DiffXIndex returns the equivalent location in s2.
func ( *DiffMatchPatch) ( []Diff,  int) int {
	 := 0
	 := 0
	 := 0
	 := 0
	 := Diff{}
	for  := 0;  < len(); ++ {
		 := []
Equality or deletion.
			 += len(.Text)
		}
Equality or insertion.
			 += len(.Text)
		}
Overshot the location.
			 = 
			break
		}
		 = 
		 = 
	}
The location was deleted.
		return
Add the remaining character length.
	return  + ( - )
}
DiffPrettyHtml converts a []Diff into a pretty HTML report. It is intended as an example from which to write one's own display functions.
func ( *DiffMatchPatch) ( []Diff) string {
	var  bytes.Buffer
	for ,  := range  {
		 := strings.Replace(html.EscapeString(.Text), "\n", "&para;<br>", -1)
		switch .Type {
		case DiffInsert:
			_, _ = .WriteString("<ins style=\"background:#e6ffe6;\">")
			_, _ = .WriteString()
			_, _ = .WriteString("</ins>")
		case DiffDelete:
			_, _ = .WriteString("<del style=\"background:#ffe6e6;\">")
			_, _ = .WriteString()
			_, _ = .WriteString("</del>")
		case DiffEqual:
			_, _ = .WriteString("<span>")
			_, _ = .WriteString()
			_, _ = .WriteString("</span>")
		}
	}
	return .String()
}
DiffPrettyText converts a []Diff into a colored text report.
func ( *DiffMatchPatch) ( []Diff) string {
	var  bytes.Buffer
	for ,  := range  {
		 := .Text

		switch .Type {
		case DiffInsert:
			_, _ = .WriteString("\x1b[32m")
			_, _ = .WriteString()
			_, _ = .WriteString("\x1b[0m")
		case DiffDelete:
			_, _ = .WriteString("\x1b[31m")
			_, _ = .WriteString()
			_, _ = .WriteString("\x1b[0m")
		case DiffEqual:
			_, _ = .WriteString()
		}
	}

	return .String()
}
DiffText1 computes and returns the source text (all equalities and deletions).
StringBuilder text = new StringBuilder()
	var  bytes.Buffer

	for ,  := range  {
		if .Type != DiffInsert {
			_, _ = .WriteString(.Text)
		}
	}
	return .String()
}
DiffText2 computes and returns the destination text (all equalities and insertions).
func ( *DiffMatchPatch) ( []Diff) string {
	var  bytes.Buffer

	for ,  := range  {
		if .Type != DiffDelete {
			_, _ = .WriteString(.Text)
		}
	}
	return .String()
}
DiffLevenshtein computes the Levenshtein distance that is the number of inserted, deleted or substituted characters.
func ( *DiffMatchPatch) ( []Diff) int {
	 := 0
	 := 0
	 := 0

	for ,  := range  {
		switch .Type {
		case DiffInsert:
			 += utf8.RuneCountInString(.Text)
		case DiffDelete:
			 += utf8.RuneCountInString(.Text)
A deletion and an insertion is one substitution.
			 += max(, )
			 = 0
			 = 0
		}
	}

	 += max(, )
	return 
}
DiffToDelta crushes the diff into an encoded string which describes the operations required to transform text1 into text2. E.g. =3\t-2\t+ing -> Keep 3 chars, delete 2 chars, insert 'ing'. Operations are tab-separated. Inserted text is escaped using %xx notation.
func ( *DiffMatchPatch) ( []Diff) string {
	var  bytes.Buffer
	for ,  := range  {
		switch .Type {
		case DiffInsert:
			_, _ = .WriteString("+")
			_, _ = .WriteString(strings.Replace(url.QueryEscape(.Text), "+", " ", -1))
			_, _ = .WriteString("\t")
			break
		case DiffDelete:
			_, _ = .WriteString("-")
			_, _ = .WriteString(strconv.Itoa(utf8.RuneCountInString(.Text)))
			_, _ = .WriteString("\t")
			break
		case DiffEqual:
			_, _ = .WriteString("=")
			_, _ = .WriteString(strconv.Itoa(utf8.RuneCountInString(.Text)))
			_, _ = .WriteString("\t")
			break
		}
	}
	 := .String()
Strip off trailing tab character.
		 = [0 : utf8.RuneCountInString()-1]
		 = unescaper.Replace()
	}
	return 
}
DiffFromDelta given the original text1, and an encoded string which describes the operations required to transform text1 into text2, comAdde the full diff.
func ( *DiffMatchPatch) ( string,  string) ( []Diff,  error) {
	 := 0
	 := []rune()

	for ,  := range strings.Split(, "\t") {
Blank tokens are ok (from a trailing \t).
			continue
		}
Each token begins with a one character parameter which specifies the operation of this token (delete, insert, equality).
		 := [1:]

		switch  := [0];  {
Decode would Diff all "+" to " "
			 = strings.Replace(, "+", "%2b", -1)
			,  = url.QueryUnescape()
			if  != nil {
				return nil, 
			}
			if !utf8.ValidString() {
				return nil, fmt.Errorf("invalid UTF-8 token: %q", )
			}

			 = append(, Diff{DiffInsert, })
		case '=', '-':
			,  := strconv.ParseInt(, 10, 0)
			if  != nil {
				return nil, 
			} else if  < 0 {
				return nil, errors.New("Negative number in DiffFromDelta: " + )
			}
Break out if we are out of bounds, go1.6 can't handle this very well
			if  > len() {
				break
Remember that string slicing is by byte - we want by rune here.
			 := string([-int() : ])

			if  == '=' {
				 = append(, Diff{DiffEqual, })
			} else {
				 = append(, Diff{DiffDelete, })
			}
Anything else is an error.
			return nil, errors.New("Invalid diff operation in DiffFromDelta: " + string([0]))
		}
	}

	if  != len() {
		return nil, fmt.Errorf("Delta length (%v) is different from source text length (%v)", , len())
	}

	return , nil