result = subTree.getTree(target);
if (result != null) {
// short circuit traversal when found
throw new RuntimeException(FOUND);
}
for (int j=0; j < classes.length; j++) {
if (classes[j].isInstance(node.getUserObject())){
return true;
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/gui/util/MenuFactory.java
|
Method name: void addNode(Object, HashTree)
|
|
Method name: boolean foundClass(JMeterTreeNode[], Class[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | result = subTree.getTree(target);↵ | | 1 | for (int j=0; j < classes.length; j++) {↵
|
2 | if (result != null) {↵ | | 2 | if (classes[j].isInstance(node.getUserObject())){↵
|
3 | // short circuit traversal when found↵ | | 3 | ↵
|
4 | throw new RuntimeException(FOUND);↵ | | 4 | return true;↵
|
| | | 5 | } ↵
|
5 | } | | 6 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |