if (strIdxStart > strIdxEnd) {
// All characters in the string are used. Check if only '*'s are
// left in the pattern. If so, we succeeded. Otherwise failure.
for (int i = patIdxStart; i <= patIdxEnd; i++) {
if (patArr[i] != '*') {
return false;
}
}
return true;
}
if (strIdxStart > strIdxEnd) {
// All characters in the string are used. Check if only '*'s are
// left in the pattern. If so, we succeeded. Otherwise failure.
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: 5
|
|
Number of AST nodes: 5
|
|
1 | if (strIdxStart > strIdxEnd) {↵ | | 1 | if (strIdxStart > strIdxEnd) {↵
|
2 | // All characters in the string are used. Check if only '*'s are↵ | | 2 | // All characters in the string are used. Check if only '*'s are↵
|
3 | // left in the pattern. If so, we succeeded. Otherwise failure.↵ | | 3 | // left in the pattern. If so, we succeeded. Otherwise failure.↵
|
4 | for (int i = patIdxStart; i <= patIdxEnd; i++) {↵ | | 4 | for (int i = patIdxStart; i <= patIdxEnd; i++) {↵
|
5 | if (patArr[i] != '*') {↵ | | 5 | if (patArr[i] != '*') {↵
|
6 | return false;↵ | | 6 | return false;↵
|
7 | }↵ | | 7 | }↵
|
8 | }↵ | | 8 | }↵
|
9 | return true;↵ | | 9 | return true;↵
|
10 | } | | 10 | }
|
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.4 |
Clones location | Clones are in the same method |
Number of node comparisons | 13 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 5 |
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) | 1.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
34 | if (strIdxStart > strIdxEnd) | | 47 | if (strIdxStart > strIdxEnd) |
35 | for (int i = patIdxStart; i <= patIdxEnd; i++) | | 48 | for (int i = patIdxStart; i <= patIdxEnd; i++) |
36 | | | 49 | |
37 | | | 50 | |
38 | | | 51 | |
Precondition Violations (4)
Row |
Violation |
1 | Conditional return false; |
2 | Conditional return false; |
3 | Conditional return true; |
4 | Conditional return true; |