pw.prok.kdiff.myers

Class DiffNode

java.lang.Object

pw.prok.kdiff.myers.PathNode

pw.prok.kdiff.myers.DiffNode

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.

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.

Field Summary

Fields inherited from class pw.prok.kdiff.myers.PathNode

original, prev, revised

Constructor Summary

Constructors

Constructor and Description
DiffNode(int original, int revised, PathNode prev) Constructs a DiffNode.

Method Summary

Modifier and Type	Method and Description
boolean	isSnake() Is this node a Snake node?

Methods inherited from class pw.prok.kdiff.myers.PathNode

isBootstrap, previousSnake, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

DiffNode

public DiffNode(int original,
                int revised,
                PathNode prev)

Constructs a DiffNode.

DiffNodes are compressed. That means that the path pointed to by the prev parameter will be followed using PathNode.previousSnake() until a non-diff node is found.

Parameters:

original - the position in the original sequence

revised - the position in the revised sequence

prev - the previous node in the path.

Method Detail

isSnake

public boolean isSnake()

Is this node a Snake node?

Specified by:

isSnake in class PathNode

Returns:

false, always