Package | Description |
---|---|
com.github.difflib.algorithm.myers |
Modifier and Type | Field and Description |
---|---|
PathNode |
PathNode.prev
The previous node in the path.
|
Modifier and Type | Method and Description |
---|---|
private PathNode |
MeyersDiff.buildPath(java.util.List<T> orig,
java.util.List<T> rev,
DiffAlgorithmListener progress)
Computes the minimum diffpath that expresses de differences between the
original and revised sequences, according to Gene Myers differencing
algorithm.
|
PathNode |
PathNode.previousSnake()
Skips sequences of
PathNodes until a snake or bootstrap node is found, or the end of the
path is reached. |
Modifier and Type | Method and Description |
---|---|
private java.util.List<Change> |
MeyersDiff.buildRevision(PathNode actualPath,
java.util.List<T> orig,
java.util.List<T> rev)
Constructs a
Patch from a difference path. |
Constructor and Description |
---|
PathNode(int i,
int j,
boolean snake,
boolean bootstrap,
PathNode prev)
Concatenates a new path node with an existing diffpath.
|