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: int matchCharArray(Context, Op, int, int, int)
|
Method name: int matchCharArray(Context, Op, int, int, int)
|
|||
Number of AST nodes: 12 | Number of AST nodes: 12 | |||
1 | RangeToken tok = op.getToken();↵ | 1 | RangeToken tok = op.getToken();↵ | |
2 | if (isSet(opts, IGNORE_CASE)) {↵ | 2 | if (isSet(opts, IGNORE_CASE)) {↵ | |
3 | tok = tok.getCaseInsensitiveToken();↵ | 3 | tok = tok.getCaseInsensitiveToken();↵ | |
4 | if (!tok.match(ch)) {↵ | 4 | if (!tok.match(ch)) {↵ | |
5 | if (ch >= 0x10000) return -1;↵ | 5 | if (ch >= 0x10000) return -1;↵ | |
6 | char uch;↵ | 6 | char uch;↵ | |
7 | if (!tok.match(uch = Character.toUpperCase((char)ch))↵ | 7 | if (!tok.match(uch = Character.toUpperCase((char)ch))↵ | |
8 | && !tok.match(Character.toLowerCase(uch)))↵ | 8 | && !tok.match(Character.toLowerCase(uch)))↵ | |
9 | return -1;↵ | 9 | return -1;↵ | |
10 | }↵ | 10 | }↵ | |
11 | } else {↵ | 11 | } else {↵ | |
12 | if (!tok.match(ch)) return -1;↵ | 12 | if (!tok.match(ch)) return -1;↵ | |
13 | }↵ | 13 | }↵ | |
14 | offset ++; | 14 | offset = o1; | |
See real code fragment | See real code fragment |
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) | 1.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 34 |
Number of mapped statements | 11 |
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) | 4.1 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |
---|---|---|---|---|
65 | RangeToken tok = op.getToken(); | 83 | RangeToken tok = op.getToken(); | |
66 | if (isSet(opts, IGNORE_CASE)) | 84 | if (isSet(opts, IGNORE_CASE)) | |
67 | tok = tok.getCaseInsensitiveToken(); | 85 | tok = tok.getCaseInsensitiveToken(); | |
68 | if (!tok.match(ch)) | 86 | if (!tok.match(ch)) | |
69 | if (ch >= 0x10000) | 87 | if (ch >= 0x10000) | |
70 | return -1; | 88 | return -1; | |
71 | char uch; | 89 | char uch; | |
72 | if (!tok.match(uch = Character.toUpperCase((char)ch)) && !tok.match(Character.toLowerCase(uch))) | 90 | if (!tok.match(uch = Character.toUpperCase((char)ch)) && !tok.match(Character.toLowerCase(uch))) | |
73 | return -1; | 91 | return -1; | |
else | else | |||
74 | if (!tok.match(ch)) | 92 | if (!tok.match(ch)) | |
75 | return -1; | 93 | return -1; | |
76 | offset++; | | ||
| 94 | offset = o1; |
Row | Violation |
---|