for (int counter = 0; counter < RESOLVE_MODES.length; counter++) { if (resolvemode.equals(RESOLVE_MODES[counter])) { found = true; break; } }
for (int i = 0; i < splitClasses.length; i++) { if (simplename.equals(splitClasses[i]) || simplename.startsWith(splitClasses[i] + '$')) { return true; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/perforce/P4Resolve.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/junit/JUnitTask.java
Method name: void setResolvemode(String) Method name: boolean isSplit(String)
Number of AST nodes: 4 Number of AST nodes: 3
1
for (int counter = 0; counter < RESOLVE_MODES.length; counter++) {
1
for (int i = 0; i < splitClasses.length; i++) {
2
            if (resolvemode.equals(RESOLVE_MODES[counter])) {
2
            
3
                found = true;
4
                break;
3
    if (simplename.equals(splitClasses[i])
4
                        || simplename.startsWith(splitClasses[i] + '$')) {
5
                    return true;
5
            }
6
                }
6
        }
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