for (int i = 0; i < container.length; i++) {
if (container[i] == item) {
return true;
}
}
return false;
for (int i = 0; i < separators.length; i++) {
if (ch == separators[i]) {
return true;
}
}
return false;
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/gui/tree/JMeterTreeListener.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/commons/cli/avalon/CLArgsParser.java
|
Method name: boolean contains(Object[], Object)
|
|
Method name: boolean isSeparator(char, char[])
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < container.length; i++) {↵ | | 1 | for (int i = 0; i < separators.length; i++) {↵
|
2 | if (container[i] == item) {↵ | | 2 | if (ch == separators[i]) {↵
|
3 | return true;↵ | | 3 | return true;↵
|
4 | }↵ | | 4 | }↵
|
5 | }↵ | | 5 | }↵
|
|
6 | return false; | | 6 | return 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 |