01: package org.apache.commons.jrcs.diff.myers;
02:
03: /**
04: * <p>Title: </p>
05: * <p>Description: </p>
06: * <p>Copyright: Copyright (c) 2002</p>
07: * <p>Company: </p>
08: * @author not attributable
09: * @version 1.0
10: */
11:
12: /**
13: * A diffnode in a diffpath.
14: * <p>
15: * A DiffNode and its previous node mark a delta between two input sequences,
16: * that is, two differing subsequences between (possibly zero length) matching
17: * sequences. {@link DiffNode DiffNodes} and {@link Snake Snakes} allow for
18: * compression of diffpaths, as each snake is represented by a single
19: * {@link Snake Snake} node and each contiguous series of insertions and
20: * deletions is represented by a single {@link DiffNode DiffNodes}.
21: *
22: * @version $Revision: 7756 $ $Date: 2006-04-12 18:30:19 +0100 (Wed, 12 Apr
23: * 2006) $
24: * @author <a href="mailto:juanco@suigeneris.org">Juanco Anez</a>
25: */
26: public final class DiffNode extends PathNode {
27: /**
28: * Constructs a DiffNode.
29: * <p>
30: * DiffNodes are compressed. That means that the path pointed to by the
31: * <code>prev</code> parameter will be followed using
32: * {@link PathNode#previousSnake} until a non-diff node is found.
33: *
34: * @param the
35: * position in the original sequence
36: * @param the
37: * position in the revised sequence
38: * @param prev
39: * the previous node in the path.
40: */
41: public DiffNode(int i, int j, PathNode prev) {
42: super (i, j, (prev == null ? null : prev.previousSnake()));
43: }
44:
45: /**
46: * {@inheritDoc}
47: *
48: * @return false, always
49: */
50: public boolean isSnake() {
51: return false;
52: }
53:
54: }
|