public final class DiffNode extends PathNode
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.
Snakes allow for compression
of diffpaths, as each snake is represented by a single
node and each contiguous series of insertions and deletions is represented
by a single
|Constructor and Description|
Constructs a DiffNode.
|Modifier and Type||Method and Description|
Is this node a
isBootstrap, previousSnake, toString
public DiffNode(int i, int j, PathNode prev)
DiffNodes are compressed. That means that
the path pointed to by the
will be followed using
until a non-diff node is found.
i- the position in the original sequence
j- the position in the revised sequence
prev- the previous node in the path.
Copyright © 2013–2018 AssertJ. All rights reserved.