ConstantPoolEntry entry = constantPool.getEntry(i); if (entry != null && entry.getTag() == ConstantPoolEntry.CONSTANT_CLASS) { ClassCPInfo classEntry = (ClassCPInfo) entry; if (!classEntry.getClassName().equals(className)) { classRefs.addElement( ClassFileUtils.convertSlashName(classEntry.getClassName())); } }
Object element = entries.elementAt(i); if (element instanceof FieldRefCPInfo) { FieldRefCPInfo fieldRefEntry = (FieldRefCPInfo) element; if (fieldRefEntry.getFieldClassName().equals(fieldClassName) && fieldRefEntry.getFieldName().equals(fieldName) && fieldRefEntry.getFieldType().equals(fieldType)) { index = i; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/depend/ClassFile.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/depend/constantpool/ConstantPool.java
Method name: Vector getClassRefs() Method name: int getFieldRefEntry(String, String, String)
Number of AST nodes: 5 Number of AST nodes: 5
1
ConstantPoolEntry entry = constantPool.getEntry(i);
1
Object element = entries.elementAt(i);
2
            if (entry != null
2
            if (e
3
                && entry.getTag() == ConstantPoolEntry.CONSTANT_CLASS) {
3
lement instanceof FieldRefCPInfo) {
4
                ClassCPInfo classEntry = (ClassCPInfo) entry;
4
                FieldRefCPInfo fieldRefEntry = (FieldRefCPInfo) element;
5
                if (!classEntry.getClassName().equals(className)) {
5
                if (fieldRefEntry.getFieldClassName().equals(fieldClassName)
6
                    classRefs.addElement(
6
                    
7
                        ClassFileUtils.convertSlashName(classEntry.getClassName()))
7
 && fieldRefEntry.getFieldName().equals(fieldName)
8
                     && fieldRefEntry.getFieldType().equals(fieldType)) {
8
;
9
                    index = i;
9
                }
10
                }
10
            }
11
            }
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