for (int i = 1; i < result.groups(); i++) {
value = result.group(i);
if (value != null) {
break;
}
}
for (int i = 0; i < exts.length; i++) {
if (filename.endsWith(exts[i])) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/protocol/http/modifier/URLRewritingModifier.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/gui/JMeterFileFilter.java
|
Method name: void process()
|
|
Method name: boolean accept(String)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 1; i < result.groups(); i++) {↵ | | 1 | for (int i = 0; i < ↵
|
2 | value = result.group(i);↵ | | 2 | exts.length; i++) {↵
|
| | | 3 | if (filename.endsWith(exts[i])) {↵
|
3 | if (value != null) {↵ | | 4 | ↵
|
4 | break;↵ | | 5 | return true;↵
|
5 | }↵ | | 6 | }↵
|
6 | } | | 7 | }
|
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 |