| Modifier and Type | Field and Description |
|---|---|
java.util.LinkedList<Diff> |
Patch.diffs |
| Modifier and Type | Method and Description |
|---|---|
protected java.util.LinkedList<Diff> |
DiffMatchPatch.diff_bisect(java.lang.String text1,
java.lang.String text2,
long deadline)
Find the 'middle snake' of a diff, split the problem in two
and return the recursively constructed diff.
|
java.util.LinkedList<Diff> |
DiffMatchPatch.diff_lineMode(java.lang.String text1,
java.lang.String text2,
long deadline)
Do a quick line-level diff on both strings, then rediff the parts for
greater accuracy.
|
java.util.LinkedList<Diff> |
DiffMatchPatch.diff_main(java.lang.String text1,
java.lang.String text2)
Find the differences between two texts.
|
java.util.LinkedList<Diff> |
DiffMatchPatch.diff_main(java.lang.String text1,
java.lang.String text2,
boolean checklines)
Find the differences between two texts.
|
java.util.LinkedList<Diff> |
DiffMatchPatch.diffFromDelta(java.lang.String text1,
java.lang.String delta)
Given the original text1, and an encoded string which describes the
operations required to transform text1 into text2, compute the full diff.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
DiffMatchPatch.diff_charsToLines(java.util.LinkedList<Diff> diffs,
java.util.List<java.lang.String> lineArray)
Rehydrate the dmp in a diff from a string of line hashes to real lines of
dmp.
|
void |
DiffMatchPatch.diff_cleanupEfficiency(java.util.LinkedList<Diff> diffs)
Reduce the number of edits by eliminating operationally trivial equalities.
|
void |
DiffMatchPatch.diff_cleanupMerge(java.util.LinkedList<Diff> diffs)
Reorder and merge like edit sections.
|
void |
DiffMatchPatch.diff_cleanupSemanticLossless(java.util.LinkedList<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 |
DiffMatchPatch.diff_levenshtein(java.util.LinkedList<Diff> diffs)
Compute the Levenshtein distance; the number of inserted, deleted or
substituted characters.
|
java.lang.String |
DiffMatchPatch.diff_text1(java.util.LinkedList<Diff> diffs)
Compute and return the source dmp (all equalities and deletions).
|
java.lang.String |
DiffMatchPatch.diff_text2(java.util.LinkedList<Diff> diffs)
Compute and return the destination dmp (all equalities and insertions).
|
java.lang.String |
DiffMatchPatch.diff_toDelta(java.util.LinkedList<Diff> diffs)
Crush the diff into an encoded string which describes the operations
required to transform text1 into text2.
|
int |
DiffMatchPatch.diff_xIndex(java.util.LinkedList<Diff> diffs,
int loc)
loc is a location in text1, compute and return the equivalent location in
text2.
|
void |
DiffMatchPatch.diffCleanupSemantic(java.util.LinkedList<Diff> diffs)
Reduce the number of edits by eliminating semantically trivial equalities.
|
java.lang.String |
DiffMatchPatch.diffPrettyHtml(java.util.LinkedList<Diff> diffs)
Convert a Diff list into a pretty HTML report.
|
java.util.LinkedList<Patch> |
DiffMatchPatch.patch_make(java.util.LinkedList<Diff> diffs)
Compute a list of patches to turn text1 into text2.
|
java.util.LinkedList<Patch> |
DiffMatchPatch.patch_make(java.lang.String text1,
java.util.LinkedList<Diff> diffs)
Compute a list of patches to turn text1 into text2.
|
java.util.LinkedList<Patch> |
DiffMatchPatch.patch_make(java.lang.String text1,
java.lang.String text2,
java.util.LinkedList<Diff> diffs)
Deprecated.
Prefer patch_make(String text1, LinkedList<Diff> diffs).
|
Copyright © 2018. All Rights Reserved.