synchronized (accumulators) {
accumulators.clear(); // Should not be needed, but just in case previous run does not clear up.
}
for (int i = 0; i < separators.length; i++) {
if (ch == separators[i]) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/reporters/Summariser.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/commons/cli/avalon/CLArgsParser.java
|
Method name: void testStarted(String)
|
|
Method name: boolean isSeparator(char, char[])
|
Number of AST nodes: 2
|
|
Number of AST nodes: 3
|
|
1 | synchronized (accumulators) {↵ | | |
|
2 | accumulators.clear(); // Should not be needed, but just in case previous run does not clear up.↵ | | 1 | for (int i = 0; i < separators.length; i++) {↵
|
| | | 2 | if (ch == separators[i]) {↵
|
| | | 3 | return true;↵
|
| | | 4 | }↵
|
3 | } | | 5 | }
|
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |