FileSet resultFileSet = (FileSet)p.getReference(RESULT_FILESET); DirectoryScanner scanner = resultFileSet.getDirectoryScanner(p); String[] scannedFiles = scanner.getIncludedFiles(); Hashtable files = new Hashtable(); for (int i = 0; i < scannedFiles.length; ++i) { files.put(scannedFiles[i], scannedFiles[i]); }
FileSet resultFileSet = (FileSet) project.getReference(RESULT_FILESET); DirectoryScanner scanner = resultFileSet.getDirectoryScanner(project); String[] scannedFiles = scanner.getIncludedFiles(); Hashtable files = new Hashtable(); for (int i = 0; i < scannedFiles.length; ++i) { files.put(scannedFiles[i], scannedFiles[i]); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/types/optional/depend/ClassFileSetTest.java File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/optional/depend/DependTest.java
Method name: void testComboSet() Method name: Hashtable getResultFiles()
Number of AST nodes: 6 Number of AST nodes: 6
1
FileSet resultFileSet = (FileSet)p.getReference(RESULT_FILESET);
1
FileSet resultFileSet = (FileSet) project.getReference(RESULT_FILESET);
2
        DirectoryScanner scanner = resultFileSet.getDirectoryScanner(p);
2
        DirectoryScanner scanner = resultFileSet.getDirectoryScanner(project);
3
        String[] scannedFiles = scanner.getIncludedFiles();
3
        String[] scannedFiles = scanner.getIncludedFiles();
4
        Hashtable files = new Hashtable();
4
        Hashtable files = new Hashtable();
5
        for (int i = 0; i < scannedFiles.length; ++i) {
5
        for (int i = 0; i < scannedFiles.length; ++i) {
6
            files.put(scannedFiles[i], scannedFiles[i]);
6
            files.put(scannedFiles[i], scannedFiles[i]);
7
        }
7
        }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.2
Clones locationClones are in different classes having the same super class
Number of node comparisons12
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements6
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)12.3
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    3
    FileSet resultFileSet = (FileSet)p.getReference(RESULT_FILESET);
    3
    FileSet resultFileSet = (FileSet)p.getReference(RESULT_FILESET);
    1
    FileSet resultFileSet = (FileSet)project.getReference(RESULT_FILESET);
    Differences
    Expression1Expression2Difference
    pprojectVARIABLE_NAME_MISMATCH
    1
    FileSet resultFileSet = (FileSet)project.getReference(RESULT_FILESET);
    4
    DirectoryScanner scanner = resultFileSet.getDirectoryScanner(p);
    4
    DirectoryScanner scanner = resultFileSet.getDirectoryScanner(p);
    2
    DirectoryScanner scanner = resultFileSet.getDirectoryScanner(project);
    Differences
    Expression1Expression2Difference
    pprojectVARIABLE_NAME_MISMATCH
    2
    DirectoryScanner scanner = resultFileSet.getDirectoryScanner(project);
    5
    String[] scannedFiles = scanner.getIncludedFiles();
    3
    String[] scannedFiles = scanner.getIncludedFiles();
    6
    Hashtable files = new Hashtable();
    4
    Hashtable files = new Hashtable();
    7
    for (int i = 0; i < scannedFiles.length; ++i)
    5
    for (int i = 0; i < scannedFiles.length; ++i)
    8
    files.put(scannedFiles[i], scannedFiles[i]);
    6
    files.put(scannedFiles[i], scannedFiles[i]);
    Precondition Violations (0)
    Row Violation