for (int i = 0; i < patArr.length; i++) {
if (patArr[i] == '*') {
containsStar = true;
break;
}
}
for (int i = patIdxStart + 1; i <= patIdxEnd; i++) {
if (patArr[i] == '*') {
patIdxTmp = i;
break;
}
}
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 = 0; i < patArr.length; i++) {↵ | | 1 | for (int i = patIdxStart + 1; i <= patIdxEnd; i++) {↵
|
2 | if (patArr[i] == '*') {↵ | | 2 | if (patArr[i] == '*') {↵
|
3 | containsStar = true;↵ | | 3 | ↵
|
| | | 4 | patIdxTmp = i;↵
|
4 | break;↵ | | 5 | break;↵
|
5 | }↵ | | 6 | ↵
|
| | | 7 | }↵
|
6 | } | | 8 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 10 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.4 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
10 | if (patArr[i] == '*') | | 55 | if (patArr[i] == '*') |
11 | | | | |
| | | 56 | |
12 | | | 57 | |
Precondition Violations (3)
Row |
Violation |
1 | Unmatched statement patIdxTmp=i; cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted |
2 | Statement break; without innermost loop |
3 | Statement break; without innermost loop |