while (exStr.hasMoreTokens()) { if (DirectoryScanner.match(exStr.nextToken(), pName)) { return true; } }
for (int i = 0; i < includes.length; i++) { if (matchPatternStart(includes[i], name, isCaseSensitive()) && isMorePowerfulThanExcludes(name, includes[i]) && isDeeper(includes[i], name)) { return true; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/scm/AntStarTeamCheckOut.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
Method name: boolean matchPatterns(String, String) Method name: boolean couldHoldIncluded(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
while (exStr.hasMoreTokens()) {
2
            if (DirectoryScanner.match(exStr.nextToken(), pN
1
for (int i = 0; i < includes.length; i++) {
2
            if (matchPatternStart(includes[i], name, isCaseSensitive())
3
                && isMorePowerfulThanExcludes(name, includes[i])
3
ame)) {
4
                && isDeeper(includes[i], name)) {
4
                return true;
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