for (int i = 0; i < ok.length; i++) {
if (response.startsWith("" + ok[i])) {
return true;
}
}
return false;
for (int i = 0; i < includes.length; i++) {
if (matchPatternStart(includes[i], name, isCaseSensitive())
&& isMorePowerfulThanExcludes(name, includes[i])
&& isDeeper(includes[i], name)) {
return true;
}
}
return false;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/mail/MailMessage.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
|
Method name: boolean isResponseOK(String, int[])
|
|
Method name: boolean couldHoldIncluded(String)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < ok.length; i++) {↵ | | 1 | for (int i = 0; i < includes.length; i++) {↵
|
2 | if (response.startsWith("" + ok[i])) {↵ | | 2 | if (↵
|
| | | 3 | matchPatternStart(includes[i], name, isCaseSensitive())↵
|
| | | 4 | && isMorePowerfulThanExcludes(name, includes[i])↵
|
| | | 5 | && isDeeper(includes[i], name)) {↵
|
3 | return true;↵ | | 6 | return true;↵
|
4 | }↵ | | 7 | ↵
|
5 | }↵ | | 8 | }↵
|
| | | 9 | }↵
|
6 | return false; | | 10 | return false;
|
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 |