for (int counter = 0; counter < RESOLVE_MODES.length; counter++) { if (resolvemode.equals(RESOLVE_MODES[counter])) { found = true; break; } }
while (exStr.hasMoreTokens()) { if (DirectoryScanner.match(exStr.nextToken(), pName)) { 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/starteam/TreeBasedTask.java
Method name: void setResolvemode(String) Method name: boolean matchPatterns(String, String)
Number of AST nodes: 4 Number of AST nodes: 3
1
for (int counter = 0; counter < RESOLVE_MODES.length; counter++) {
2
            if (resolvemode.equals(RESOLVE_MODES[counter])) {
3
                found = true;
4
                break
1
while (exStr.hasMoreTokens()) {
2
            if (DirectoryScanner.match(exStr.nextToken(), pName)) {
5
;
3
                return true;
6
            }
4
            }
7
        }
5
        }
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.2
Clones locationClones are in different classes having the same super class
Number of node comparisons1