Package | Description |
---|---|
org.eclipse.emf.compare.internal.dmp |
Modifier and Type | Field and Description |
---|---|
LinkedList<diff_match_patch.Diff> |
diff_match_patch.Patch.diffs |
Modifier and Type | Method and Description |
---|---|
LinkedList<diff_match_patch.Diff> |
LineBasedDiff.computeLineBasedDiff(String text1,
String text2)
Computes differences between
text1 and text2 based on lines only (as opposed to
character or word-based diffing). |
protected LinkedList<diff_match_patch.Diff> |
diff_match_patch.diff_bisect(String text1,
String text2,
long deadline)
Find the 'middle snake' of a diff, split the problem in two and return the recursively constructed
diff.
|
LinkedList<diff_match_patch.Diff> |
diff_match_patch.diff_fromDelta(String text1,
String delta)
Given the original text1, and an encoded string which describes the operations required to transform
text1 into text2, compute the full diff.
|
LinkedList<diff_match_patch.Diff> |
diff_match_patch.diff_main(String text1,
String text2)
Find the differences between two texts.
|
LinkedList<diff_match_patch.Diff> |
diff_match_patch.diff_main(String text1,
String text2,
boolean checklines)
Find the differences between two texts.
|
Modifier and Type | Method and Description |
---|---|
protected void |
diff_match_patch.diff_charsToLines(LinkedList<diff_match_patch.Diff> diffs,
List<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(LinkedList<diff_match_patch.Diff> diffs)
Reduce the number of edits by eliminating operationally trivial equalities.
|
void |
diff_match_patch.diff_cleanupMerge(LinkedList<diff_match_patch.Diff> diffs)
Reorder and merge like edit sections.
|
void |
diff_match_patch.diff_cleanupSemantic(LinkedList<diff_match_patch.Diff> diffs)
Reduce the number of edits by eliminating semantically trivial equalities.
|
void |
diff_match_patch.diff_cleanupSemanticLossless(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. e.g: The cat came. -> The cat came.
|
int |
diff_match_patch.diff_levenshtein(LinkedList<diff_match_patch.Diff> diffs)
Compute the Levenshtein distance; the number of inserted, deleted or substituted characters.
|
String |
diff_match_patch.diff_prettyHtml(LinkedList<diff_match_patch.Diff> diffs)
Convert a Diff list into a pretty HTML report.
|
String |
diff_match_patch.diff_text1(LinkedList<diff_match_patch.Diff> diffs)
Compute and return the source text (all equalities and deletions).
|
String |
diff_match_patch.diff_text2(LinkedList<diff_match_patch.Diff> diffs)
Compute and return the destination text (all equalities and insertions).
|
String |
diff_match_patch.diff_toDelta(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(LinkedList<diff_match_patch.Diff> diffs,
int loc)
loc is a location in text1, compute and return the equivalent location in text2. e.g.
|
LinkedList<diff_match_patch.Patch> |
diff_match_patch.patch_make(LinkedList<diff_match_patch.Diff> diffs)
Compute a list of patches to turn text1 into text2. text1 will be derived from the provided diffs.
|
LinkedList<diff_match_patch.Patch> |
diff_match_patch.patch_make(String text1,
LinkedList<diff_match_patch.Diff> diffs)
Compute a list of patches to turn text1 into text2. text2 is not provided, diffs are the delta between
text1 and text2.
|
LinkedList<diff_match_patch.Patch> |
diff_match_patch.patch_make(String text1,
String text2,
LinkedList<diff_match_patch.Diff> diffs)
Deprecated.
Prefer patch_make(String text1, LinkedList
|
Copyright (c) 2006, 2015 Obeo and others. All rights reserved.