A diffnode in a diffpath.
A DiffNode and its previous node mark a delta between
two input sequences, that is, two differing subsequences
between (possibly zero length) matching sequences.
DiffNodes and Snakes allow for compression
of diffpaths, as each snake is represented by a single Snake
node and each contiguous series of insertions and deletions is represented
by a single DiffNodes.
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public boolean | Returns: false, alwaysImplements abstract org. Snake node?
|
| DiffNode | back to summary |
|---|---|
| public DiffNode(int i, int j, PathNode prev) Constructs a DiffNode.
DiffNodes are compressed. That means that
the path pointed to by the
| |
| isSnake | back to summary |
|---|---|
| public boolean isSnake() Implements abstract org. Doc from org. Is this node a
| |