for (int i = 0; i < delims.length; ++i) {
if (delims[i] == ch) {
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/util/StringTokenizer.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
|
Method name: boolean isDelim(char)
|
|
Method name: boolean couldHoldIncluded(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < delims.length; ++i) {↵ | | 1 | for (int i = 0; i < includes.length; i++) {↵
|
2 | if (delims[i] == ch↵ | | 2 | if (matchPatternStart(includes[i], name, isCaseSensitive())↵
|
| | | 3 | && isMorePowerfulThanExcludes(name, includes[i])↵
|
3 | ) {↵ | | 4 | && isDeeper(includes[i], name)) {↵
|
4 | return true;↵ | | 5 | return true;↵
|
5 | }↵ | | 6 | }↵
|
6 | } | | 7 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |