aIt.remove();
if (aIt.hasNext()) {
aVal = (Comparable) aIt.next();
} else {
return;
}
aIt.remove();
if (aIt.hasNext()) {
aVal = (Comparable) aIt.next();
} else {
return;
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/main/java/org/columba/core/base/ListTools.java
|
|
File path: /columba-1.4-src/core/src/main/java/org/columba/core/base/ListTools.java
|
Method name: void intersect(List, List)
|
|
Method name: void substract(List, List)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | aIt.remove();↵ | | 1 | aIt.remove();↵
|
|
2 | if (aIt.hasNext()) {↵ | | 2 | if (aIt.hasNext()) {↵
|
3 | aVal = (Comparable) aIt.next();↵ | | 3 | aVal = (Comparable) aIt.next();↵
|
4 | } else {↵ | | 4 | } else {↵
|
5 | return;↵ | | 5 | return;↵
|
6 | } | | 6 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 12 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 8.3 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
21 | aIt.remove(); | | 22 | aIt.remove(); |
22 | if (aIt.hasNext()) | | 23 | if (aIt.hasNext()) |
23 | aVal = (Comparable)aIt.next(); | | 24 | aVal = (Comparable)aIt.next(); |
| | | | |
24 | | | 25 | |
Precondition Violations (2)
Row |
Violation |
1 | Conditional return; |
2 | Conditional return; |