void |
DiffMatch.diff_cleanupEfficiency(LinkedList<DiffMatch.Diff> diffs) |
Reduce the number of edits by eliminating operationally trivial
equalities.
|
void |
DiffMatch.diff_cleanupMerge(LinkedList<DiffMatch.Diff> diffs) |
Reorder and merge like edit sections.
|
void |
DiffMatch.diff_cleanupSemantic(LinkedList<DiffMatch.Diff> diffs) |
Reduce the number of edits by eliminating semantically trivial
equalities.
|
void |
DiffMatch.diff_cleanupSemanticLossless(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.diff_levenshtein(LinkedList<DiffMatch.Diff> diffs) |
Compute the Levenshtein distance; the number of inserted, deleted or
substituted characters.
|
String |
DiffMatch.diff_prettyHtml(LinkedList<DiffMatch.Diff> diffs) |
Convert a Diff list into a pretty HTML report.
|
String |
DiffMatch.diff_text1(LinkedList<DiffMatch.Diff> diffs) |
Compute and return the source text (all equalities and deletions).
|
String |
DiffMatch.diff_text2(LinkedList<DiffMatch.Diff> diffs) |
Compute and return the destination text (all equalities and insertions).
|
String |
DiffMatch.diff_toDelta(LinkedList<DiffMatch.Diff> diffs) |
Crush the diff into an encoded string which describes the operations
required to transform text1 into text2.
|
int |
DiffMatch.diff_xIndex(LinkedList<DiffMatch.Diff> diffs,
int loc) |
loc is a location in text1, compute and return the equivalent location in
text2.
|
LinkedList<DiffMatch.Patch> |
DiffMatch.patch_make(String text1,
LinkedList<DiffMatch.Diff> diffs) |
Compute a list of patches to turn text1 into text2.
|
LinkedList<DiffMatch.Patch> |
DiffMatch.patch_make(LinkedList<DiffMatch.Diff> diffs) |
Compute a list of patches to turn text1 into text2.
|