Object element = entries.elementAt(i); if (element instanceof NameAndTypeCPInfo) { NameAndTypeCPInfo nameAndTypeEntry = (NameAndTypeCPInfo) element; if (nameAndTypeEntry.getName().equals(name) && nameAndTypeEntry.getType().equals(type)) { index = i; } }
for (Iterator i = filesList.iterator(); i.hasNext();) { File f = (File) i.next(); File newFile = new File(destDir, f.getName()); if (newFile.exists()) { filesToRemove.add(f); } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/depend/constantpool/ConstantPool.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/image/Image.java
Method name: int getNameAndTypeEntry(String, String) Method name: void execute()
Number of AST nodes: 5 Number of AST nodes: 5
1
Object element = entries.elementAt(i);
2
            if (element instanceof NameAndTypeCPInfo) {
3
                NameAndTypeCPInfo nameAndTypeEntry
4
                    = (NameAndTypeCPInfo) element;
5
                if (nameAndTypeEntry.getName().equals(name)
6
                     && nameAndTypeEntry.getType().equals(type)) {
7
                    index = i;
1
for (Iterator i = filesList.iterator(); i.hasNext();) {
2
                    File f = (File) i.next();
3
                    File newFile = new File(destDir, f.getName());
4
                    if (newFile.exists()) {
5
                        filesToRemove.add(f);
8
                }
6
                    }
9
            }
7
                }
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.1
Clones locationClones are in different classes
Number of node comparisons1