String[] classLocationsList = classLocations.list(); Vector classFileList = new Vector(); for (int i = 0; i < classLocationsList.length; ++i) { File dir = new File(classLocationsList[i]); if (dir.isDirectory()) { addClassFiles(classFileList, dir, dir); } } return classFileList;
Vector files = new Vector(); // File[] filesInDir = directory.listFiles(); String[] filesInDir = directory.list(); if (filesInDir != null) { int length = filesInDir.length; for (int i = 0; i < length; ++i) { files.addElement(new File(directory, filesInDir[i])); } } return files;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/depend/Depend.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/depend/DirectoryIterator.java
Method name: Vector getClassFiles(Path) Method name: Vector getDirectoryEntries(File)
Number of AST nodes: 7 Number of AST nodes: 7
1
String[] classLocationsList = classLocations.list
1
Vector files = new Vector();
2
();
2
        // File[] filesInDir = directory.listFiles();
3
        Vector classFileList = new Vector();
3
        String[] filesInDir = directory.list();
4
        for (int i = 0; i < classLocationsList.length; ++i) {
4
        
5
            File dir = new File(classLocationsList[i]);
5
if (filesInDir != null) {
6
            int length = filesInDir.length;
6
            if (dir.isDirectory()) {
7
            
7
                addClassFiles(classFileList, dir, dir
8
for (int i = 0; i < length; ++i) {
8
);
9
                files.addElement(new File(directory, filesInDir[i]));
9
            }
10
            }
10
        }
11
        }
11
        return classFileList;
12
        return files;
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones locationClones are in different classes
Number of node comparisons1