if (ch != '?') {
if (isCaseSensitive && ch != strArr[strIdxStart]) {
return false; // Character mismatch
}
if (!isCaseSensitive && Character.toUpperCase(ch)
!= Character.toUpperCase(strArr[strIdxStart])) {
return false; // Character mismatch
}
}
patIdxStart++;
strIdxStart++;
if (ch != '?') {
if (isCaseSensitive && ch != strArr[strIdxEnd]) {
return false; // Character mismatch
}
if (!isCaseSensitive && Character.toUpperCase(ch)
!= Character.toUpperCase(strArr[strIdxEnd])) {
return false; // Character mismatch
}
}
patIdxEnd--;
strIdxEnd--;
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:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (ch != '?') {↵ | | 1 | if (ch != '?') {↵
|
2 | if (isCaseSensitive && ch != strArr[strIdxStart]) {↵ | | 2 | if (isCaseSensitive && ch != strArr[strIdxEnd]) {↵
|
3 | return false; // Character mismatch↵ | | 3 | return false; // Character mismatch↵
|
4 | }↵ | | 4 | }↵
|
5 | if (!isCaseSensitive && Character.toUpperCase(ch)↵ | | 5 | if (!isCaseSensitive && Character.toUpperCase(ch)↵
|
6 | != Character.toUpperCase(strArr[strIdxStart])) {↵ | | 6 | != Character.toUpperCase(strArr[strIdxEnd])) {↵
|
7 | return false; // Character mismatch↵ | | 7 | return false; // Character mismatch↵
|
8 | }↵ | | 8 | }↵
|
9 | }↵ | | 9 | }↵
|
10 | patIdxStart++;↵ | | 10 | patIdxEnd--;↵
|
11 | strIdxStart++;↵ | | 11 | strIdxEnd--;↵
|
12 | | | 12 |
|
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.0 |
Clones location | |
Number of node comparisons | 0 |