if (isSet(opts, IGNORE_CASE)) {
tok = tok.getCaseInsensitiveToken();
if (!tok.match(ch)) {
if (ch >= 0x10000) return -1;
char uch;
if (!tok.match(uch = Character.toUpperCase((char)ch))
&& !tok.match(Character.toLowerCase(uch)))
return -1;
}
} else {
if (!tok.match(ch)) return -1;
}
if (isSet(opts, IGNORE_CASE)) {
tok = tok.getCaseInsensitiveToken();
if (!tok.match(ch)) {
if (ch >= 0x10000) return -1;
char uch;
if (!tok.match(uch = Character.toUpperCase((char)ch))
&& !tok.match(Character.toLowerCase(uch)))
return -1;
}
} else {
if (!tok.match(ch)) return -1;
}
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/xml/type/internal/RegEx.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (isSet(opts, IGNORE_CASE)) {↵ | | 1 | if (isSet(opts, IGNORE_CASE)) {↵
|
2 | tok = tok.getCaseInsensitiveToken();↵ | | 2 | tok = tok.getCaseInsensitiveToken();↵
|
3 | if (!tok.match(ch)) {↵ | | 3 | if (!tok.match(ch)) {↵
|
4 | if (ch >= 0x10000) return -1;↵ | | 4 | if (ch >= 0x10000) return -1;↵
|
5 | char uch;↵ | | 5 | char uch;↵
|
6 | if (!tok.match(uch = Character.toUpperCase((char)ch))↵ | | 6 | if (!tok.match(uch = Character.toUpperCase((char)ch))↵
|
7 | && !tok.match(Character.toLowerCase(uch)))↵ | | 7 | && !tok.match(Character.toLowerCase(uch)))↵
|
8 | return -1;↵ | | 8 | return -1;↵
|
9 | }↵ | | 9 | }↵
|
10 | } else {↵ | | 10 | } else {↵
|
11 | if (!tok.match(ch)) return -1;↵ | | 11 | if (!tok.match(ch)) return -1;↵
|
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 |