for ( Iterator i = fileSets.iterator(); i.hasNext(); ) { FileSet fs = (FileSet) i.next(); DirectoryScanner ds = fs.getDirectoryScanner( getProject() ); String[] dsFiles = ds.getIncludedFiles(); for (int j = 0; j < dsFiles.length; j++) { File f = new File(dsFiles[j]); if ( !f.isFile() ) { f = new File( ds.getBasedir(), dsFiles[j] ); } files.add( f.getAbsolutePath() ); } }
for ( Iterator i = fileSets.iterator(); i.hasNext(); ) { FileSet fs = (FileSet) i.next(); DirectoryScanner ds = fs.getDirectoryScanner( getProject() ); String[] dsFiles = ds.getIncludedFiles(); for (int j = 0; j < dsFiles.length; j++) { File f = new File(dsFiles[j]); if ( !f.isFile() ) { f = new File( ds.getBasedir(), dsFiles[j] ); } files.add( f.getAbsolutePath() ); } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/tool/hbm2ddl/SchemaUpdateTask.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/tool/hbm2ddl/SchemaValidatorTask.java
Method name: String[] getFiles() Method name: String[] getFiles()
Number of AST nodes: 9 Number of AST nodes: 9
1
for ( Iterator i = fileSets.iterator(); i.hasNext(); ) {
1
for ( Iterator i = fileSets.iterator(); i.hasNext(); ) {
2
			FileSet fs = (FileSet) i.next();
2
			FileSet fs = (FileSet) i.next();
3
			DirectoryScanner ds = fs.getDirectoryScanner( getProject() );
3
			DirectoryScanner ds = fs.getDirectoryScanner( getProject() );
4
			String[] dsFiles = ds.getIncludedFiles();
4
			String[] dsFiles = ds.getIncludedFiles();
5
			for (int j = 0; j < dsFiles.length; j++) {
5
			for (int j = 0; j < dsFiles.length; j++) {
6
				File f = new File(dsFiles[j]);
6
				File f = new File(dsFiles[j]);
7
				if ( !f.isFile() ) {
7
				if ( !f.isFile() ) {
8
					f = new File( ds.getBasedir(), dsFiles[j] );
8
					f = new File( ds.getBasedir(), dsFiles[j] );
9
				}
9
				}
10
				files.add( f.getAbsolutePath() );
10
				files.add( f.getAbsolutePath() );
11
			}
11
			}
12
		}
12
		}
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.4
Clones locationClones are in different classes having the same super class
Number of node comparisons30
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements9
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)1.5
    Clone typeType 1
    Mapped Statements
    ID Statement ID Statement
    2
    for (Iterator i = fileSets.iterator(); i.hasNext(); )
    2
    for (Iterator i = fileSets.iterator(); i.hasNext(); )
    3
    FileSet fs = (FileSet)i.next();
    3
    FileSet fs = (FileSet)i.next();
    4
    DirectoryScanner ds = fs.getDirectoryScanner(getProject());
    4
    DirectoryScanner ds = fs.getDirectoryScanner(getProject());
    5
    String[] dsFiles = ds.getIncludedFiles();
    5
    String[] dsFiles = ds.getIncludedFiles();
    6
    for (int j = 0; j < dsFiles.length; j++)
    6
    for (int j = 0; j < dsFiles.length; j++)
    7
    File f = new File(dsFiles[j]);
    7
    File f = new File(dsFiles[j]);
    8
    if (!f.isFile())
    8
    if (!f.isFile())
    9
    f = new File(ds.getBasedir(), dsFiles[j]);
    9
    f = new File(ds.getBasedir(), dsFiles[j]);
    10
    files.add(f.getAbsolutePath());
    10
    files.add(f.getAbsolutePath());
    Precondition Violations (0)
    Row Violation