result = subTree.getTree(target);
if (result != null) {
// short circuit traversal when found
throw new RuntimeException(FOUND);
}
if (!Close.performAction(e)) {
return;
}
// Load the file for this recent file command
loadProjectFile(e, getRecentFile(e), false);
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/action/LoadRecentProject.java
|
Method name: void addNode(Object, HashTree)
|
|
Method name: void doAction(ActionEvent)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | result = subTree.getTree(target);↵ | | |
|
2 | if (result != null) {↵ | | |
|
3 | // short circuit traversal wh↵ | | 1 | if (!Close.performAction(e)) {↵
|
| | | 2 | return;↵
|
| | | 3 | }↵
|
4 | en found↵ | | 4 | // Load the file for this recent f↵
|
5 | throw new RuntimeException(FOUND);↵ | | |
|
6 | } | | 5 | ile command↵
|
| | | 6 | loadProjectFile(e, getRecentFile(e), false);
|
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 |