void | 
DiffMatch.diffCleanupEfficiency(LinkedList<DiffMatch.Diff> diffs) | 
 Reduce the number of edits by eliminating operationally trivial
 equalities. 
 | 
void | 
DiffMatch.diffCleanupMerge(LinkedList<DiffMatch.Diff> diffs) | 
 Reorder and merge like edit sections. 
 | 
void | 
DiffMatch.diffCleanupSemantic(LinkedList<DiffMatch.Diff> diffs) | 
 Reduce the number of edits by eliminating semantically trivial
 equalities. 
 | 
void | 
DiffMatch.diffCleanupSemanticLossless(LinkedList<DiffMatch.Diff> diffs) | 
 Look for single edits surrounded on both sides by equalities which can be
 shifted sideways to align the edit to a word boundary. 
 | 
int | 
DiffMatch.diffLevenshtein(LinkedList<DiffMatch.Diff> diffs) | 
 Compute the Levenshtein distance; the number of inserted, deleted or
 substituted characters. 
 | 
String | 
DiffMatch.diffPrettyHtml(List<DiffMatch.Diff> diffs) | 
 Convert a Diff list into a pretty HTML report. 
 | 
String | 
DiffMatch.diffText1(LinkedList<DiffMatch.Diff> diffs) | 
 Compute and return the source text (all equalities and deletions). 
 | 
String | 
DiffMatch.diffText2(LinkedList<DiffMatch.Diff> diffs) | 
 Compute and return the destination text (all equalities and insertions). 
 | 
String | 
DiffMatch.diffToDelta(LinkedList<DiffMatch.Diff> diffs) | 
 Crush the diff into an encoded string which describes the operations
 required to transform text1 into text2. 
 | 
int | 
DiffMatch.diffXIndex(LinkedList<DiffMatch.Diff> diffs,
          int loc) | 
 loc is a location in text1, compute and return the equivalent location in
 text2. 
 | 
LinkedList<DiffMatch.Patch> | 
DiffMatch.patchMake(String text1,
         LinkedList<DiffMatch.Diff> diffs) | 
 Compute a list of patches to turn text1 into text2. 
 | 
LinkedList<DiffMatch.Patch> | 
DiffMatch.patchMake(LinkedList<DiffMatch.Diff> diffs) | 
 Compute a list of patches to turn text1 into text2. 
 |