private void traverseAndFind(Class type, [[#variablee07f820]] node, List nodeList) {
if (type.isInstance(node.getUserObject())) {
nodeList.add(node);
}
Enumeration enumNode = node.children();
while (enumNode.hasMoreElements()) {
[[#variablee07f820]] child = ( [[#variablee07f820]]) enumNode.nextElement();
traverseAndFind(type, child, nodeList);
}
}
private [[#variablee07f820]] traverseAndFind(TestElement userObject, [[#variablee07f820]] node) {
if (userObject == node.getUserObject()) {
return node;
}
Enumeration enumNode = node.children();
while (enumNode.hasMoreElements()) {
[[#variablee07f820]] child = ( [[#variablee07f820]]) enumNode.nextElement();
[[#variablee07f820]] result = traverseAndFind(userObject, child);
if (result != null) {
return result;
}
}
return null;
}
public HashTree getCurrentSubTree( [[#variablee07f820]] node) {
ListedHashTree hashTree = new ListedHashTree(node);
Enumeration enumNode = node.children();
while (enumNode.hasMoreElements()) {
[[#variablee07f820]] child = ( [[#variablee07f820]]) enumNode.nextElement();
hashTree.add(node, getCurrentSubTree(child));
}
return hashTree;
}
public HashTree [[#variablee07f620]]() {
return getCurrentSubTree(( [[#variablee07f820]]) (( [[#variablee07f820]]) this.getRoot()).getChildAt(0));
}
|