See: Description
| Interface | Description |
|---|---|
| Locator |
Represents the location of the best match.
|
| Class | Description |
|---|---|
| Bitap |
An implementation of the Bitap algorithm for finding a "fuzzy" location of a
match.
|
| Commonality |
A Commonality is shared text at the beginning, middle or end of two strings.
|
| CommonMiddle |
A CommonMiddle represents an overlap between a baseline/source text and a
changed/target text.
|
| Diff |
Computes the difference between two texts to create a list of differences.
|
| DiffCleanup |
Various Strategies to cleanup a diff list.
|
| Difference |
Represents a single difference, consisting of an EditType and associated
text.
|
| DifferenceEngine |
Builds a map of a baseline/source text and a changed/target text, navigating
it to determine differences.
|
| Distance |
Compute the distance between 2 strings.
|
| LineMap |
LineMap is a heuristic algorithm that allows the differencing of a
representation of lines.
|
| Match |
Computes the difference between two texts to create a patch.
|
| Patch |
Marshals a patch to a list of Differences, Differences to a patch and applies
a list of differences to text to patch it.
|
| Patch.PatchResults |
A holder of the results of a patch, with a results indicating which patch
entries were able to be applied.
|
| PatchEntry |
A PatchEntry is a single "instruction" in a Patch, consisting of a interval
over which differences are applied and the differences that should be
applied.
|
| Enum | Description |
|---|---|
| EditType |
An Enumeration of the possible Edits.
|
Based on the LGPL Diff_Match_Patch v1.5 javascript of Neil Fraser, Copyright (C) 2006
http://neil.fraser.name/software/diff_match_patch/