com.unitesk.requality.merge
public class Tree extends java.lang.Object
Modifier and Type | Class and Description |
---|---|
static interface |
Tree.NodeFilter |
Modifier | Constructor and Description |
---|---|
protected |
Tree() |
|
Tree(org.w3c.dom.Document doc) |
|
Tree(org.w3c.dom.Node domNode) |
Modifier and Type | Method and Description |
---|---|
Node |
getRoot() |
java.util.List<Node> |
getTraversalSequence() |
boolean |
isEqual(Tree t) |
protected void |
makeLevelOrderedTraversalSequence(org.w3c.dom.Node root) |
java.util.List<Node> |
nearestMatch(Node x) |
java.util.List<Node> |
nearestMatch(Node x,
Node parent) |
java.util.List<Node> |
nearestMatch(Node x,
Node parent,
Tree.NodeFilter f) |
java.util.List<Node> |
nearestMatch(Node x,
Tree.NodeFilter f) |
java.util.Iterator<Node> |
traverse() |
void |
updateTree() |
protected Tree()
public Tree(org.w3c.dom.Node domNode)
public Tree(org.w3c.dom.Document doc)
protected void makeLevelOrderedTraversalSequence(org.w3c.dom.Node root)
public java.util.Iterator<Node> traverse()
public java.util.List<Node> getTraversalSequence()
public Node getRoot()
public java.util.List<Node> nearestMatch(Node x, Tree.NodeFilter f)
public java.util.List<Node> nearestMatch(Node x, Node parent, Tree.NodeFilter f)
public boolean isEqual(Tree t)
public void updateTree()