for (int i = 0; i < count; i++) {
Object o = additionalPatterns.elementAt(i);
ps.append((PatternSet) o, p);
}
return ps;
for (int i = 0; i < count; i++) {
Object o = additionalPatterns.elementAt(i);
ps.append((PatternSet) o, p);
}
return ps;
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/org/apache/tools/ant/types/AbstractFileSet.java
|
Method name: PatternSet mergePatterns(Project)
|
|
Method name: PatternSet mergePatterns(Project)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < count; i++) {↵ | | 1 | for (int i = 0; i < count; i++) {↵
|
2 | Object o = additionalPatterns.elementAt(i);↵ | | 2 | Object o = additionalPatterns.elementAt(i);↵
|
3 | ps.append((PatternSet) o, p);↵ | | 3 | ps.append((PatternSet) o, p);↵
|
4 | }↵ | | 4 | }↵
|
5 | return ps; | | 5 | return ps;
|
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.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 10 |
-
{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) | 2.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
6 | for (int i = 0; i < count; i++) | | 5 | for (int i = 0; i < count; i++) |
7 | Object o = additionalPatterns.elementAt(i); | | 6 | Object o = additionalPatterns.elementAt(i); |
8 | ps.append((PatternSet)o, p); | | 7 | ps.append((PatternSet)o, p); |
9 | return ps; | | 8 | return ps; |
Precondition Violations (0)
Row |
Violation |