TreePath[] paths = tree.getSelectionPaths();
if (paths == null) {
return new ReportTreeNode[] { getCurrentNode() };
}
ReportTreeNode[] nodes = new ReportTreeNode[paths.length];
for (int i = 0; i < paths.length; i++) {
nodes[i] = (ReportTreeNode) paths[i].getLastPathComponent();
}
return nodes;
TreePath[] paths = tree.getSelectionPaths();
if (paths == null) {
return new JMeterTreeNode[] { getCurrentNode() };
}
JMeterTreeNode[] nodes = new JMeterTreeNode[paths.length];
for (int i = 0; i < paths.length; i++) {
nodes[i] = (JMeterTreeNode) paths[i].getLastPathComponent();
}
return nodes;
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/report/gui/tree/ReportTreeListener.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/gui/tree/JMeterTreeListener.java
|
Method name: ReportTreeNode[] getSelectedNodes()
|
|
Method name: JMeterTreeNode[] getSelectedNodes()
|
Number of AST nodes: 7
|
|
Number of AST nodes: 7
|
|
1 | TreePath[] paths = tree.getSelectionPaths();↵ | | 1 | TreePath[] paths = tree.getSelectionPaths();↵
|
2 | if (paths == null) {↵ | | 2 | if (paths == null) {↵
|
3 | return new ReportTreeNode[] { getCurrentNode() };↵ | | 3 | return new JMeterTreeNode[] { getCurrentNode() };↵
|
4 | }↵ | | 4 | }↵
|
5 | ReportTreeNode[] nodes = new ReportTreeNode[paths.length];↵ | | 5 | JMeterTreeNode[] nodes = new JMeterTreeNode[paths.length];↵
|
6 | for (int i = 0; i < paths.length; i++) {↵ | | 6 | for (int i = 0; i < paths.length; i++) {↵
|
7 | nodes[i] = (ReportTreeNode) paths[i].getLastPathComponent();↵ | | 7 | nodes[i] = (JMeterTreeNode) paths[i].getLastPathComponent();↵
|
8 | }↵ | | 8 | }↵
|
|
9 | return nodes; | | 9 | return nodes;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 22 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 7 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 1.2 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | TreePath[] paths = tree.getSelectionPaths(); | | 1 | TreePath[] paths = tree.getSelectionPaths(); |
2 | if (paths == null) | | 2 | if (paths == null) |
3 | return new ReportTreeNode[] {getCurrentNode()}; | | 3 | return new JMeterTreeNode[] {getCurrentNode()}; |
4 | ReportTreeNode[] nodes = new ReportTreeNode[paths.length]; | | 4 | JMeterTreeNode[] nodes = new JMeterTreeNode[paths.length]; |
5 | for (int i = 0; i < paths.length; i++) | | 5 | for (int i = 0; i < paths.length; i++) |
6 | nodes[i] = (ReportTreeNode)paths[i].getLastPathComponent(); | | 6 | nodes[i] = (JMeterTreeNode)paths[i].getLastPathComponent(); |
7 | return nodes; | | 7 | return nodes; |
Precondition Violations (0)
Row |
Violation |