int index = -1; for (int i = 0; i < entries.size() && index == -1; ++i) { Object element = entries.elementAt(i); if (element instanceof ClassCPInfo) { ClassCPInfo classinfo = (ClassCPInfo) element; if (classinfo.getClassName().equals(className)) { index = i; } } } return index;
int index = -1; for (int i = 0; i < entries.size() && index == -1; ++i) { 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; } } } return index;
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/depend/constantpool/ConstantPool.java
Method name: int getClassEntry(String) Method name: int getFieldRefEntry(String, String, String)
Number of AST nodes: 8 Number of AST nodes: 8
1
int index = -1;
1
int index = -1;
2
        for (int i = 0; i < entries.size() && index == -1; ++i) {
2
        for (int i = 0; i < entries.size() && index == -1; ++i) {
3
            Object element = entries.elementAt(i);
3
            Object element = entries.elementAt(i);
4
            if (element instanceof ClassCPInfo) {
4
            if (element instanceof FieldRefCPInfo) {
5
                ClassCPInfo classinfo = (ClassCPInfo) element;
5
                FieldRefCPInfo fieldRefEntry = (FieldRefCPInfo) element;
6
                if (classinfo.getClassName().equals(className)
6
                if (fieldRefEntry.getFieldClassName().equals(fieldClassName)
7
                     && fieldRefEntry.getFieldName().equals(fieldName)
7
) {
8
                     && fieldRefEntry.getFieldType().equals(fieldType)) {
8
                    index = i;
9
                    index = i;
9
                }
10
                }
10
            }
11
            }
11
        }
12
        }
12
        return index;
13
        return index;
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 declared in the same class
Number of node comparisons1