if (bIt.hasNext()) {
bVal = (Comparable) bIt.next();
} else {
loop = false;
aIt.remove();
}
if (bIt.hasNext()) {
bVal = (Comparable) bIt.next();
} else {
loop = false;
aIt.remove();
}
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 intersect(List, List)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if (bIt.hasNext()) {↵ | | 1 | if (bIt.hasNext()) {↵
|
2 | bVal = (Comparable) bIt.next();↵ | | 2 | bVal = (Comparable) bIt.next();↵
|
3 | } else {↵ | | 3 | } else {↵
|
4 | loop = false;↵ | | 4 | loop = false;↵
|
5 | aIt.remove();↵ | | 5 | aIt.remove();↵
|
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.1 |
Clones location | Clones are in the same method |
Number of node comparisons | 17 |
-
{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) | 4.4 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
30 | if (bIt.hasNext()) | | 34 | if (bIt.hasNext()) |
31 | bVal = (Comparable)bIt.next(); | | 35 | bVal = (Comparable)bIt.next(); |
| | | | |
32 | | | 36 | |
33 | | | 37 | |
Precondition Violations (1)
Row |
Violation |
1 | Clone fragment #1 returns variables loop, bVal , while Clone fragment #2 returns variables loop, bVal |