for (int i = 0; i < includes.length; i++) {
if (matchPatternStart(includes[i], name, isCaseSensitive())
&& isMorePowerfulThanExcludes(name, includes[i])
&& isDeeper(includes[i], name)) {
return true;
}
}
while (searchParents && parent != null && parent.exists()) {
if (checkFile(new File(parent, filename),
filename + " in " + parent)) {
return true;
}
parent = parent.getParentFile();
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Available.java
|
Method name: boolean couldHoldIncluded(String)
|
|
Method name: boolean checkFile()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < includes.length; i++) {↵ | | |
|
| | | 1 | while (searchParents && parent != null && parent.exists()) {↵
|
2 | if (matchPatternStart(includes[i], name, isCaseSensitive())↵ | | 2 | if (↵
|
3 | && isMorePowerfulThanExcludes(name, includes[i])↵ | | |
|
4 | && isDeeper(includes[i], name↵ | | 3 | checkFile(new File(parent, filename),↵
|
5 | )) {↵ | | 4 | filename + " in " + parent)) {↵
|
6 | return true;↵ | | 5 | return true;↵
|
7 | }↵ | | 6 | ↵
|
| | | 7 | }↵
|
| | | 8 | parent = parent.getParentFile();↵
|
8 | } | | 9 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |