-
Given the original text1, and an encoded string which describes the
operations required to transform text1 into text2, compute the full diff.
Find the differences between two texts.
Find the differences between two texts.
void
Reduce the number of edits by eliminating operationally trivial
equalities.
void
Reorder and merge like edit sections.
void
Reduce the number of edits by eliminating semantically trivial
equalities.
void
Look for single edits surrounded on both sides by equalities which can be
shifted sideways to align the edit to a word boundary.
int
Compute the Levenshtein distance; the number of inserted, deleted or
substituted characters.
Convert a Diff list into a pretty HTML report.
Compute and return the source text (all equalities and deletions).
Compute and return the destination text (all equalities and insertions).
Crush the diff into an encoded string which describes the operations
required to transform text1 into text2.
int
loc is a location in text1, compute and return the equivalent location in
text2.
Compute a list of patches to turn text1 into text2.
Compute a list of patches to turn text1 into text2.