String[] s = getFiles(base, ds);
for (int j = 0; j < s.length; j++) {
totalFiles++;
fileNames.addElement(s[j]);
baseDirs.addElement(base);
}
for (int i=0;i<files.length;i++) {
File f = files[i];
if (!f.isDirectory()) {
collect.addElement(f);
} else {
getFiles(f, collect);
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/ExecuteOn.java
|
|
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/XmlPropertyTest.java
|
Method name: void runExec(Execute)
|
|
Method name: void getFiles(File, Vector)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | String[] s = getFiles(base, ds);↵ | | |
|
2 | for (int j = 0; j < s.length; j++) {↵ | | 1 | for (int i=0;i<files.length;i++) {↵
|
3 | totalFiles++;↵ | | 2 | ↵
|
4 | ↵ | | 3 | File f = files[i];↵
|
| | | 4 | if (!f.isDirectory()) {↵
|
5 | fileNames.addElement(s[j]);↵ | | 5 | collect.addElement(f);↵
|
6 | baseDirs.addElement(base↵ | | 6 | } else {↵
|
7 | );↵ | | 7 | getFiles(f, collect);↵
|
8 | ↵ | | 8 | }↵
|
9 | } | | 9 | }
|
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |