while (iter.hasNext()) {
if (iter.next().getName().equals(prop)) {
iter.remove();
}
}
for (int i = 0; i < container.length; i++) {
if (container[i] == item) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/testelement/property/CollectionProperty.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/report/gui/tree/ReportTreeListener.java
|
Method name: void remove(String)
|
|
Method name: boolean contains(Object[], Object)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | while (iter.hasNext()) {↵ | | |
|
2 | if (iter.next().getName().equals(prop)) {↵ | | |
|
3 | iter.remove()↵ | | 1 | for (int i = 0; i < container.length; i++) {↵
|
| | | 2 | if (container[i] == item) {↵
|
4 | ;↵ | | 3 | return true;↵
|
5 | }↵ | | 4 | }↵
|
6 | } | | 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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |