for (i = 0; i < SCOPE_ELEMENTS.length; i++) {
if (next.equals (SCOPE_ELEMENTS[i])) {
break;
}
}
for (int i=0; i<l1.length; i++) {
if (!l1[i].equals(l2[i])) {
assertTrue(msg, !shouldBeEqual);
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Javadoc.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/AntTest.java
|
Method name: void setScope(String)
|
|
Method name: void targetStarted(BuildEvent)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (i = 0; i < SCOPE_ELEMENTS.length; i++) {↵ | | 1 | for (int i=0; i<l1.length; i++) {↵
|
2 | if (next.equals (SCOPE_ELEMENTS[i])) {↵ | | 2 | if (!l1[i].equals(l2[i])) {↵
|
3 | break;↵ | | 3 | ↵
|
| | | 4 | assertTrue(msg, !shouldBeEqual);↵
|
4 | }↵ | | 5 | ↵
|
| | | 6 | }↵
|
5 | } | | 7 | }
|
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 in different classes |
Number of node comparisons | 5 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.3 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
14 | if (next.equals(SCOPE_ELEMENTS[i])) | | 20 | if (!l1[i].equals(l2[i])) |
15 | | | | |
| | | 21 | assertTrue(msg, !shouldBeEqual); |
Precondition Violations (1)
Row |
Violation |
1 | Unmatched break; |