|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use PathNode | |
---|---|
difflib.myers |
The diff.myers package
implements Gene Myers'
differencing algorithm. |
Uses of PathNode in difflib.myers |
---|
Subclasses of PathNode in difflib.myers | |
---|---|
class |
DiffNode
A diffnode in a diffpath. |
class |
Snake
Represents a snake in a diffpath. |
Fields in difflib.myers declared as PathNode | |
---|---|
PathNode |
PathNode.prev
The previous node in the path. |
Methods in difflib.myers that return PathNode | |
---|---|
PathNode |
MyersDiff.buildPath(List<T> orig,
List<T> rev)
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 DiffNodes until a
Snake or bootstrap node is found, or the end
of the path is reached. |
Methods in difflib.myers with parameters of type PathNode | |
---|---|
Patch<T> |
MyersDiff.buildRevision(PathNode path,
List<T> orig,
List<T> rev)
Constructs a Patch from a difference path. |
Constructors in difflib.myers with parameters of type PathNode | |
---|---|
DiffNode(int i,
int j,
PathNode prev)
Constructs a DiffNode. |
|
PathNode(int i,
int j,
PathNode prev)
Concatenates a new path node with an existing diffpath. |
|
Snake(int i,
int j,
PathNode prev)
Constructs a snake node. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |