if (includes != null) {
for (int i = 0; i < includes.length; i++) {
defaultPatterns.createInclude().setName(includes[i]);
}
directoryScanner = null;
}
if (incl != null) {
for (int i = 0; i < incl.length; i++) {
createInclude().setName(incl[i]);
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/AbstractFileSet.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/PatternSet.java
|
Method name: void appendIncludes(String[])
|
|
Method name: void append(PatternSet, Project)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | if (includes != null) {↵ | | 1 | if (incl != null) {↵
|
2 | for (int i = 0; i < includes.length; i++) {↵ | | 2 | for (int i = 0; i < incl.length; i++) {↵
|
3 | defaultPatterns.createInclude().setName(includes[i]);↵ | | 3 | createInclude().setName(incl[i]);↵
|
4 | }↵ | | 4 | }↵
|
5 | directoryScanner = null;↵ | | |
|
6 | } | | 5 | }
|
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 | 6 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.7 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
3 | if (includes != null) | | 4 | if (incl != null) |
4 | for (int i = 0; i < includes.length; i++) | | 5 | for (int i = 0; i < incl.length; i++) |
5 | defaultPatterns.createInclude().setName(includes[i]); | | 6 | createInclude().setName(incl[i]); |
6 | | | | |
Precondition Violations (0)
Row |
Violation |