for (int i = 0; i < SHARE_TAGS.length; i++) {
if (SHARE_TAGS[i].equals(mode)) {
return i;
}
}
result = subTree.getTree(target);
if (result != null) {
// short circuit traversal when found
throw new RuntimeException(FOUND);
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/config/CSVDataSetBeanInfo.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/collections/HashTree.java
|
Method name: int getShareModeAsInt(String)
|
|
Method name: void addNode(Object, HashTree)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < SHARE_TAGS.length; i++) {↵ | | |
|
2 | if (SHARE_TAGS[i].equals(mode)↵ | | 1 | result = subTree.getTree(target);↵
|
3 | ) {↵ | | 2 | if (result != null) {↵
|
4 | return i;↵ | | 3 | ↵
|
5 | }↵ | | |
|
6 | ↵ | | 4 | // short circuit traversal when found↵
|
| | | 5 | throw new RuntimeException(FOUND);↵
|
7 | } | | 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 |