descriptors = new String[args.length - index];
for (int i = 0; index < args.length; ++i) {
descriptors[i] = args[index++];
}
descriptors = new String[args.length - index];
for (int i = 0; index < args.length; ++i) {
descriptors[i] = args[index++];
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/ejb/DDCreatorHelper.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/ejb/EjbcHelper.java
|
Method name: void DDCreatorHelper(String[])
|
|
Method name: void EjbcHelper(String[])
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | descriptors = new String[args.length - index];↵ | | 1 | descriptors = new String[args.length - index];↵
|
2 | for (int i = 0; index < args.length; ++i) {↵ | | 2 | for (int i = 0; index < args.length; ++i) {↵
|
3 | descriptors[i] = args[index++];↵ | | 3 | descriptors[i] = args[index++];↵
|
4 | } | | 4 | }
|
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 | 5 |
-
{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) | 0.7 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
4 | descriptors = new String[args.length - index]; | | 7 | descriptors = new String[args.length - index]; |
5 | for (int i = 0; index < args.length; ++i) | | 8 | for (int i = 0; index < args.length; ++i) |
6 | descriptors[i] = args[index++]; | | 9 | descriptors[i] = args[index++]; |
Precondition Violations (0)
Row |
Violation |