| org.eclipse.ui.internal.texteditor.quickdiff.compare.rangedifferencer |
|
QuickDiff Internal
Copy of the respective classes in org.eclipse.compare.rangedifferencer in order to avoid circular dependencies.
|
| Java Source File Name | Type | Comment |
| IRangeComparator.java | Interface | For breaking an object to compare into a sequence of comparable entities.
It is used by RangeDifferencer to find longest sequences of
matching and non-matching ranges.
For example, to compare two text documents and find longest common sequences
of matching and non-matching lines, the implementation must break the document
into lines. |
| Levenshtein.java | Class | Levenshtein distance and edit script computation using a dynamic programming algorithm.
The algorithm is O(n*m) in time where n and m are the number of elements in
the two ranges to compare. |
| LinkedRangeDifference.java | Class | |
| LinkedRangeFactory.java | Class | Memory-monitoring factory for LinkedRangeDifference. |
| RangeDifference.java | Class | Description of a change between two or three ranges of comparable entities.
RangeDifference objects are the elements of a compare result returned from
the RangeDifferencer find* methods.
Clients use these objects as they are returned from the differencer.
This class is not intended to be instantiated or subclassed.
Note: A range in the RangeDifference object is given as a start index
and length in terms of comparable entities. |
| RangeDifferencer.java | Class | A RangeDifferencer finds the differences between two or three IRangeComparators.
To use the differencer, clients provide an IRangeComparator
that breaks their input data into a sequence of comparable entities. |