|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
diff.myers package
implements Gene Myers'
differencing algorithm.
See:
Description
| Interface Summary | |
|---|---|
| Equalizer<T> | Specifies when two compared elements in the Myers algorithm are equal. |
| Class Summary | |
|---|---|
| DiffNode | A diffnode in a diffpath. |
| MyersDiff<T> | A clean-room implementation of Eugene Myers differencing algorithm. |
| PathNode | A node in a diffpath. |
| Snake | Represents a snake in a diffpath. |
| Exception Summary | |
|---|---|
| DifferentiationFailedException | Thrown whenever the differencing engine cannot produce the differences between two revisions of ta text. |
| DiffException | Base class for all exceptions emanating from this package. |
The diff.myers package
implements Gene Myers'
differencing algorithm.
Myer's algorithm produces optimum results (minimum diffs), but consumes considerably more memory than SimpleDiff, so its not suitable for very large files.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||