for (i = 0; i < SCOPE_ELEMENTS.length; i++) {
if (next.equals (SCOPE_ELEMENTS[i])) {
break;
}
}
for (Iterator i = additionalPatterns.iterator(); i.hasNext();) {
if (hasPatterns((PatternSet) i.next())) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Javadoc.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/resources/Files.java
|
Method name: void setScope(String)
|
|
Method name: boolean hasPatterns()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (i = 0; i < SCOPE_ELEMENTS.length; i++) {↵ | | 1 | for (↵
|
2 | if (next.equals (SCOPE_ELEMENTS[i]↵ | | 2 | Iterator i = additionalPatterns.iterator(); i.hasNext();) {↵
|
3 | )) {↵ | | 3 | if (hasPatterns((PatternSet) i.next())) {↵
|
4 | break;↵ | | 4 | ↵
|
5 | }↵ | | |
|
6 | ↵ | | 5 | return true;↵
|
| | | 6 | }↵
|
7 | } | | 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 having the same super class |
Number of node comparisons | 1 |