Package | Description |
---|---|
com.openkm.util |
Modifier and Type | Field and Description |
---|---|
LinkedList<DiffMatchPatch.Diff> |
DiffMatchPatch.Patch.diffs |
Modifier and Type | Method and Description |
---|---|
protected LinkedList<DiffMatchPatch.Diff> |
DiffMatchPatch.diffBisect(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<DiffMatchPatch.Diff> |
DiffMatchPatch.diffFromDelta(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<DiffMatchPatch.Diff> |
DiffMatchPatch.diffMain(String text1,
String text2)
Find the differences between two texts.
|
LinkedList<DiffMatchPatch.Diff> |
DiffMatchPatch.diffMain(String text1,
String text2,
boolean checklines)
Find the differences between two texts.
|
Modifier and Type | Method and Description |
---|---|
protected void |
DiffMatchPatch.diffCharsToLines(LinkedList<DiffMatchPatch.Diff> diffs,
List<String> lineArray)
Rehydrate the text in a diff from a string of line hashes to real lines of
text.
|
void |
DiffMatchPatch.diffCleanupEfficiency(LinkedList<DiffMatchPatch.Diff> diffs)
Reduce the number of edits by eliminating operationally trivial equalities.
|
void |
DiffMatchPatch.diffCleanupMerge(LinkedList<DiffMatchPatch.Diff> diffs)
Reorder and merge like edit sections.
|
void |
DiffMatchPatch.diffCleanupSemantic(LinkedList<DiffMatchPatch.Diff> diffs)
Reduce the number of edits by eliminating semantically trivial equalities.
|
void |
DiffMatchPatch.diffCleanupSemanticLossless(LinkedList<DiffMatchPatch.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.diffLevenshtein(LinkedList<DiffMatchPatch.Diff> diffs)
Compute the Levenshtein distance; the number of inserted, deleted or
substituted characters.
|
String |
DiffMatchPatch.diffPrettyHtml(LinkedList<DiffMatchPatch.Diff> diffs)
Convert a Diff list into a pretty HTML report.
|
String |
DiffMatchPatch.diffText1(LinkedList<DiffMatchPatch.Diff> diffs)
Compute and return the source text (all equalities and deletions).
|
String |
DiffMatchPatch.diffText2(LinkedList<DiffMatchPatch.Diff> diffs)
Compute and return the destination text (all equalities and insertions).
|
String |
DiffMatchPatch.diffToDelta(LinkedList<DiffMatchPatch.Diff> diffs)
Crush the diff into an encoded string which describes the operations
required to transform text1 into text2.
|
int |
DiffMatchPatch.diffXIndex(LinkedList<DiffMatchPatch.Diff> diffs,
int loc)
loc is a location in text1, compute and return the equivalent location in
text2.
|
LinkedList<DiffMatchPatch.Patch> |
DiffMatchPatch.patchMake(LinkedList<DiffMatchPatch.Diff> diffs)
Compute a list of patches to turn text1 into text2.
|
LinkedList<DiffMatchPatch.Patch> |
DiffMatchPatch.patchMake(String text1,
LinkedList<DiffMatchPatch.Diff> diffs)
Compute a list of patches to turn text1 into text2.
|
LinkedList<DiffMatchPatch.Patch> |
DiffMatchPatch.patchMake(String text1,
String text2,
LinkedList<DiffMatchPatch.Diff> diffs)
Deprecated.
Prefer patch_make(String text1, LinkedList
|
Copyright © 2018 Open Knowledge Management System S.L.. All rights reserved.