for (int i = 0; i < values.length; i++) {
if (i != 0) {
sb.append(" | ");
}
sb.append(values[i]);
}
for (int i = 0; i < RMIC_CLASSNAMES.length; i++) {
if (i != 0) {
buf.append(", ");
}
buf.append(RMIC_CLASSNAMES[i]);
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/AntStructure.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/rmic/KaffeRmic.java
|
Method name: void printElementDecl(PrintWriter, Project, String, Class)
|
|
Method name: boolean execute()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < values.length; i++) {↵ | | 1 | for (int i = 0; i < RMIC_CLASSNAMES.length; i++) {↵
|
2 | if (i != 0) {↵ | | 2 | if (i != 0) {↵
|
3 | sb.append(" | ");↵ | | 3 | buf.append(", ");↵
|
4 | }↵ | | 4 | ↵
|
5 | sb.append(values[i]);↵ | | |
|
6 | ↵ | | 5 | }↵
|
|
| | | 6 | buf.append(RMIC_CLASSNAMES[i]);↵
|
7 | } | | 7 | }
|
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 |
Number of node comparisons | 9 |
-
{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) | 1.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
59 | for (int i = 0; i < values.length; i++) | | 6 | for (int i = 0; i < RMIC_CLASSNAMES.length; i++) |
60 | | | 7 | |
61 | | | 8 | |
62 | | | 9 | buf.append(RMIC_CLASSNAMES[i]); |
Precondition Violations (0)
Row |
Violation |