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)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]);
}
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/types/optional/depend/ClassFileSetTest.java
|
Method name: void testBasicSet()
|
|
Method name: void testMethodParamInner()
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | FileSet resultFileSet = (FileSet)p.getReference(RESULT_FILESET);↵ | | 1 | FileSet resultFileSet = (FileSet)p.getReference(RESULT_FILESET);↵
|
2 | DirectoryScanner scanner = resultFileSet.getDirectoryScanner(p);↵ | | 2 | DirectoryScanner scanner = resultFileSet.getDirectoryScanner(p);↵
|
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 | }
|
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 declared in the same class |
Number of node comparisons | 12 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 6 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 2.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
3 | FileSet resultFileSet = (FileSet)p.getReference(RESULT_FILESET); | | 3 | FileSet resultFileSet = (FileSet)p.getReference(RESULT_FILESET); |
4 | DirectoryScanner scanner = resultFileSet.getDirectoryScanner(p); | | 4 | DirectoryScanner scanner = resultFileSet.getDirectoryScanner(p); |
5 | String[] scannedFiles = scanner.getIncludedFiles(); | | 5 | String[] scannedFiles = scanner.getIncludedFiles(); |
6 | Hashtable files = new Hashtable(); | | 6 | Hashtable files = new Hashtable(); |
7 | for (int i = 0; i < scannedFiles.length; ++i) | | 7 | for (int i = 0; i < scannedFiles.length; ++i) |
8 | files.put(scannedFiles[i], scannedFiles[i]); | | 8 | files.put(scannedFiles[i], scannedFiles[i]); |
Precondition Violations (0)
Row |
Violation |