1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
|
17 |
|
|
18 |
|
|
19 |
|
|
20 |
|
|
21 |
|
|
22 |
|
|
23 |
|
package net.sf.infrared.web.treecontrolmodel; |
24 |
|
|
25 |
|
import java.util.ArrayList; |
26 |
|
import java.util.List; |
27 |
|
|
28 |
|
import net.sf.infrared.base.model.AggregateExecutionTime; |
29 |
|
import net.sf.infrared.base.util.TreeNode; |
30 |
|
|
31 |
|
public class IRIntermediateNode implements net.sf.jsptree.tree.TreeNode { |
32 |
|
public TreeNode node; |
33 |
|
|
34 |
|
public NodeToStringConverter nodeToStringConverter; |
35 |
|
|
36 |
|
private AggrApiJspTreeNode treeNode; |
37 |
|
|
38 |
|
private List children; |
39 |
|
|
40 |
0 |
public IRIntermediateNode(TreeNode node, NodeToStringConverter nodeToStringConverter) { |
41 |
0 |
this.node = node; |
42 |
0 |
this.nodeToStringConverter = nodeToStringConverter; |
43 |
0 |
treeNode = new AggrApiJspTreeNode((AggregateExecutionTime) node.getValue() |
44 |
|
,nodeToStringConverter); |
45 |
0 |
children = new ArrayList(); |
46 |
0 |
} |
47 |
|
|
48 |
|
public Object getData() { |
49 |
0 |
return treeNode; |
50 |
|
} |
51 |
|
|
52 |
|
public List getChildNodes() { |
53 |
0 |
List nodeList = node.getChildren(); |
54 |
|
|
55 |
0 |
if (children.size() == 0) { |
56 |
0 |
for (int i = 0; i < nodeList.size(); i++) { |
57 |
0 |
net.sf.infrared.base.util.TreeNode childNode = |
58 |
|
(net.sf.infrared.base.util.TreeNode) nodeList.get(i); |
59 |
0 |
if (childNode.getChildren().size() == 0) { |
60 |
0 |
AggregateExecutionTime aggApiTime = (AggregateExecutionTime) childNode |
61 |
|
.getValue(); |
62 |
0 |
children.add(new IRLeafNode(childNode,nodeToStringConverter)); |
63 |
|
} |
64 |
|
else { |
65 |
0 |
children.add(new IRIntermediateNode(childNode,nodeToStringConverter)); |
66 |
|
} |
67 |
|
} |
68 |
|
} |
69 |
0 |
return children; |
70 |
|
} |
71 |
|
|
72 |
|
public int getDepth() { |
73 |
0 |
return node.getDepth(); |
74 |
|
} |
75 |
|
|
76 |
|
public boolean hasChildren() { |
77 |
0 |
if (node.getChildren().size() > 0) |
78 |
0 |
return true; |
79 |
|
else |
80 |
0 |
return false; |
81 |
|
} |
82 |
|
|
83 |
|
public int getChildCount() { |
84 |
0 |
return node.getChildren().size(); |
85 |
|
} |
86 |
|
|
87 |
|
public Object clone() throws CloneNotSupportedException { |
88 |
0 |
return (IRIntermediateNode) super.clone(); |
89 |
|
} |
90 |
|
|
91 |
|
public int hashCode() { |
92 |
0 |
return treeNode.hashCode(); |
93 |
|
} |
94 |
|
|
95 |
|
} |