for (int i = 0; i < check.length; i++) {
if (check[i] == false) {
checkCount++;
}
}
for (int i = 0; i < check.length; i++) {
if (check[i] == false) {
checkCount++;
}
}
Clone fragments detected by clone detection tool
File path: /sql12/test/src/net/sourceforge/squirrel_sql/fw/util/FileTest.java
|
|
File path: /sql12/test/src/net/sourceforge/squirrel_sql/fw/util/FileTest.java
|
Method name: void test_listFiles()
|
|
Method name: void test_list()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < check.length; i++) {↵ | | 1 | for (int i = 0; i < check.length; i++) {↵
|
2 | if (check[i] == false) {↵ | | 2 | if (check[i] == false) {↵
|
3 | checkCount++;↵ | | 3 | checkCount++;↵
|
4 | }↵ | | 4 | }↵
|
5 | } | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.5 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 14 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
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) | 2.9 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
53 | for (int i = 0; i < check.length; i++) | | 38 | for (int i = 0; i < check.length; i++) |
54 | | | 39 | |
55 | | | 40 | |
Precondition Violations (0)
Row |
Violation |