int index = -1; for (int i = 0; i < entries.size() && index == -1; ++i) { Object element = entries.elementAt(i); if (element instanceof ConstantCPInfo) { ConstantCPInfo constantEntry = (ConstantCPInfo) element; if (constantEntry.getValue().equals(constantValue)) { 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 NameAndTypeCPInfo) { NameAndTypeCPInfo nameAndTypeEntry = (NameAndTypeCPInfo) element; if (nameAndTypeEntry.getName().equals(name) && nameAndTypeEntry.getType().equals(type)) { 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 getConstantEntry(Object) Method name: int getNameAndTypeEntry(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 ConstantCPInfo) {
4
            if (element instanceof NameAndTypeCPInfo) {
5
                ConstantCPInfo constantEntry = (Constant
5
                NameAndTypeCPInfo nameAndTypeEntry
6
CPInfo) element;
6
                    = (NameAndTypeCPInfo) element;
7
                if (constantEntry.getValue().equals(constantValu
7
                if (nameAndTypeEntry.getName().equals(name)
8
e)) {
8
                     && nameAndTypeEntry.getType().equals(type)) {
9
                    index = i;
9
                    index = i;
10
                }
10
                }
11
            }
11
            }
12
        }
12
        }
13
        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