com.unitesk.requality.merge
Class Tree

java.lang.Object
  extended by com.unitesk.requality.merge.Tree
Direct Known Subclasses:
Fragment

public class Tree
extends java.lang.Object


Constructor Summary
protected Tree()
           
  Tree(org.w3c.dom.Document doc)
           
  Tree(org.w3c.dom.Node domNode)
           
 
Method Summary
static Node findLCA(java.util.List<Node> nodes)
           
 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, boolean deep)
           
 java.util.List<Node> nearestMatch(Node x, NodeFilter f)
           
 java.util.List<Node> nearestMatch(Node x, Node parent, NodeFilter f)
           
 java.util.List<Node> nearestMatch(Node x, Node parent, NodeFilter f, boolean deep)
           
 java.util.Iterator<Node> traverse()
           
 void updateTree()
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

Tree

protected Tree()

Tree

public Tree(org.w3c.dom.Node domNode)

Tree

public Tree(org.w3c.dom.Document doc)
Method Detail

makeLevelOrderedTraversalSequence

protected void makeLevelOrderedTraversalSequence(org.w3c.dom.Node root)

traverse

public java.util.Iterator<Node> traverse()

getTraversalSequence

public java.util.List<Node> getTraversalSequence()

getRoot

public Node getRoot()

nearestMatch

public java.util.List<Node> nearestMatch(Node x)

nearestMatch

public java.util.List<Node> nearestMatch(Node x,
                                         NodeFilter f)

nearestMatch

public java.util.List<Node> nearestMatch(Node x,
                                         Node parent)

nearestMatch

public java.util.List<Node> nearestMatch(Node x,
                                         Node parent,
                                         boolean deep)

nearestMatch

public java.util.List<Node> nearestMatch(Node x,
                                         Node parent,
                                         NodeFilter f)

nearestMatch

public java.util.List<Node> nearestMatch(Node x,
                                         Node parent,
                                         NodeFilter f,
                                         boolean deep)

isEqual

public boolean isEqual(Tree t)

updateTree

public void updateTree()

findLCA

public static Node findLCA(java.util.List<Node> nodes)