for (int counter = 0; counter < RESOLVE_MODES.length; counter++) { if (resolvemode.equals(RESOLVE_MODES[counter])) { found = true; break; } }
for (int i = 0; i < delims.length; ++i) { if (delims[i] == ch) { 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/util/StringTokenizer.java
Method name: void setResolvemode(String) Method name: boolean isDelim(char)
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 < delims.length; ++i) {
2
            if (resolvemode.equals(RESOLVE_MODES[counter])) {
2
            if (
3
                found = true;
4
                break
3
delims[i] == ch) {
5
;
4
                return true;
6
            }
5
            }
7
        }
6
        }
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 having the same super class
Number of node comparisons1