for (Iterator i = additionalPatterns.iterator(); i.hasNext();) {
if (hasPatterns((PatternSet) i.next())) {
return true;
}
}
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/types/resources/Files.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/AntTest.java
|
Method name: boolean hasPatterns()
|
|
Method name: void targetStarted(BuildEvent)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (Iterator i = additionalPatterns.iterator(); i.hasNext();) {↵ | | 1 | for (↵
|
2 | if (hasPatterns((PatternSet) i.next())) {↵ | | |
|
3 | return true;↵ | | |
|
4 | }↵ | | |
|
| | | 2 | int i=0; i<l1.length; i++) {↵
|
| | | 3 | if (!l1[i].equals(l2[i])) {↵
|
| | | 4 | assertTrue(msg, !shouldBeEqual);↵
|
| | | 5 | }↵
|
5 | } | | 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 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) | 2.6 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
6 | if (hasPatterns((PatternSet)i.next())) | | 20 | if (!l1[i].equals(l2[i])) |
7 | | | | |
| | | 21 | assertTrue(msg, !shouldBeEqual); |
Precondition Violations (1)
Row |
Violation |
1 | Unmatched return true; |