| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public <S extends Sequence> EditList | diffNonCommon(SequenceComparator<? super S>
the comparator supplying the element equivalence function. cmp, S the first (also known as old or pre-image) sequence. Edits
returned by this algorithm will reference indexes using the
'A' side: a, S org.,
org..the second (also known as new or post-image) sequence. Edits
returned by this algorithm will reference indexes using the
'B' side: b)org.,
org..Implements abstract org. Compare two sequences and identify a list of edits between them. |
| public abstract < type of Sequence compared S extends Sequence> void | diffNonCommon(EditList
result list to append the region's edits onto. edits, HashedSequenceComparator<S> the comparator supplying the element equivalence function. cmp, HashedSequence<S> the first (also known as old or pre-image) sequence. Edits
returned by this algorithm will reference indexes using the
'A' side: a, HashedSequence<S> org.,
org..the second (also known as new or post-image) sequence. Edits
returned by this algorithm will reference indexes using the
'B' side: b, Edit org.,
org..the region being compared within the two sequences. region)Compare two sequences and identify a list of edits between them. |
| LowLevelDiffAlgorithm | back to summary |
|---|---|
| public LowLevelDiffAlgorithm() | |
| diffNonCommon | back to summary |
|---|---|
| public <S extends Sequence> EditList diffNonCommon(SequenceComparator<? super S> cmp, S a, S b) Implements abstract org. Doc from org. Compare two sequences and identify a list of edits between them.
This method should be invoked only after the two sequences have been
proven to have no common starting or ending elements. The expected
elimination of common starting and ending elements is automatically
performed by the
| |
| diffNonCommon | back to summary |
|---|---|
| public abstract <S extends Sequence> void diffNonCommon(EditList edits, HashedSequenceComparator<S> cmp, HashedSequence<S> a, HashedSequence<S> b, Edit region) Compare two sequences and identify a list of edits between them.
This method should be invoked only after the two sequences have been
proven to have no common starting or ending elements. The expected
elimination of common starting and ending elements is automatically
performed by the
| |