| Package | Description |
|---|---|
| name.fraser.neil.plaintext |
External sources.
|
| Modifier and Type | Field and Description |
|---|---|
java.util.LinkedList<diff_match_patch.Diff> |
diff_match_patch.Patch.diffs |
| Modifier and Type | Method and Description |
|---|---|
protected java.util.LinkedList<diff_match_patch.Diff> |
diff_match_patch.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_match_patch.Diff> |
diff_match_patch.diff_fromDelta(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.
|
java.util.LinkedList<diff_match_patch.Diff> |
diff_match_patch.diff_main(java.lang.String text1,
java.lang.String text2)
Find the differences between two texts.
|
java.util.LinkedList<diff_match_patch.Diff> |
diff_match_patch.diff_main(java.lang.String text1,
java.lang.String text2,
boolean checklines)
Find the differences between two texts.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
diff_match_patch.diff_charsToLines(java.util.LinkedList<diff_match_patch.Diff> diffs,
java.util.List<java.lang.String> lineArray)
Rehydrate the text in a diff from a string of line hashes to real lines
of text.
|
void |
diff_match_patch.diff_cleanupEfficiency(java.util.LinkedList<diff_match_patch.Diff> diffs)
Reduce the number of edits by eliminating operationally trivial
equalities.
|
void |
diff_match_patch.diff_cleanupMerge(java.util.LinkedList<diff_match_patch.Diff> diffs)
Reorder and merge like edit sections.
|
void |
diff_match_patch.diff_cleanupSemantic(java.util.LinkedList<diff_match_patch.Diff> diffs)
Reduce the number of edits by eliminating semantically trivial
equalities.
|
void |
diff_match_patch.diff_cleanupSemanticLossless(java.util.LinkedList<diff_match_patch.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 |
diff_match_patch.diff_levenshtein(java.util.LinkedList<diff_match_patch.Diff> diffs)
Compute the Levenshtein distance; the number of inserted, deleted or
substituted characters.
|
java.lang.String |
diff_match_patch.diff_prettyHtml(java.util.LinkedList<diff_match_patch.Diff> diffs)
Convert a Diff list into a pretty HTML report.
|
java.lang.String |
diff_match_patch.diff_text1(java.util.LinkedList<diff_match_patch.Diff> diffs)
Compute and return the source text (all equalities and deletions).
|
java.lang.String |
diff_match_patch.diff_text2(java.util.LinkedList<diff_match_patch.Diff> diffs)
Compute and return the destination text (all equalities and insertions).
|
java.lang.String |
diff_match_patch.diff_toDelta(java.util.LinkedList<diff_match_patch.Diff> diffs)
Crush the diff into an encoded string which describes the operations
required to transform text1 into text2.
|
int |
diff_match_patch.diff_xIndex(java.util.LinkedList<diff_match_patch.Diff> diffs,
int loc)
loc is a location in text1, compute and return the equivalent location in
text2.
|
java.util.LinkedList<diff_match_patch.Patch> |
diff_match_patch.patch_make(java.util.LinkedList<diff_match_patch.Diff> diffs)
Compute a list of patches to turn text1 into text2.
|
java.util.LinkedList<diff_match_patch.Patch> |
diff_match_patch.patch_make(java.lang.String text1,
java.util.LinkedList<diff_match_patch.Diff> diffs)
Compute a list of patches to turn text1 into text2.
|
java.util.LinkedList<diff_match_patch.Patch> |
diff_match_patch.patch_make(java.lang.String text1,
java.lang.String text2,
java.util.LinkedList<diff_match_patch.Diff> diffs)
Deprecated.
Prefer patch_make(String text1, LinkedList
|