for (int i = 0; i < children.length; ++i) {
File file = children[i];
// Test here again to avoid method call for non-directories!
if (file.isDirectory()) {
removedCount += removeEmptyDirectories(file, true);
}
}
for (int i = 0; i < properties.length; i++) {
Property p = properties[i];
if (p.isPrimaryDescriptor()) {
return p;
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Sync.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/scm/AntStarTeamCheckOut.java
|
Method name: int removeEmptyDirectories(File, boolean)
|
|
Method name: Property getPrimaryDescriptor(Type)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < children.length; ++i) {↵ | | 1 | for (int i = 0; i < properties.length; i++) {↵
|
2 | File file = children[i];↵ | | 2 | ↵
|
3 | // Test here again to avoid method call for non-directories!↵ | | |
|
4 | ↵ | | 3 | Property p = properties[i];↵
|
|
5 | if (file.isDirectory()) {↵ | | 4 | if (p.isPrimaryDescriptor()) {↵
|
6 | removedCount += removeEmptyDirectories(file, true);↵ | | 5 | ↵
|
7 | ↵ | | 6 | return p;↵
|
8 | }↵ | | 7 | }↵
|
9 | } | | 8 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 1 |