for (int i = patIdxStart; i <= patIdxEnd; i++) {
if (patArr[i] != '*') {
return false;
}
}
return true;
for (int i = patIdxStart; i <= patIdxEnd; i++) {
if (patArr[i] != '*') {
return false;
}
}
return true;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/SelectorUtils.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/SelectorUtils.java
|
Method name: boolean match(String, String, boolean)
|
|
Method name: boolean match(String, String, boolean)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = patIdxStart; i <= patIdxEnd; i++) {↵ | | 1 | for (int i = patIdxStart; i <= patIdxEnd; i++) {↵
|
2 | if (patArr[i] != '*') {↵ | | 2 | if (patArr[i] != '*') {↵
|
3 | return false;↵ | | 3 | return false;↵
|
4 | }↵ | | 4 | }↵
|
5 | }↵ | | 5 | }↵
|
6 | return true; | | 6 | return true;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3 |
Clones location | Clones are in the same method |
Number of node comparisons | 11 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 3.8 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
35 | for (int i = patIdxStart; i <= patIdxEnd; i++) | | 48 | for (int i = patIdxStart; i <= patIdxEnd; i++) |
36 | | | 49 | |
37 | | | 50 | |
38 | return true; | | 51 | return true; |
Precondition Violations (0)
Row |
Violation |