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: boolean regionMatchesIgnoreCase(char[], int, int, String, int)
|
Method name: boolean regionMatchesIgnoreCase(char[], int, int, int, int)
|
|||
Number of AST nodes: 17 | Number of AST nodes: 17 | |||
1 | if (offset < 0) return false;↵ | 1 | if (offset < 0) return false;↵ | |
2 | if (limit-offset < partlen)↵ | 2 | if (limit-offset < partlen)↵ | |
3 | return false;↵ | 3 | return false;↵ | |
4 | int i = 0;↵ | 4 | int i = offset2;↵ | |
5 | while (partlen-- > 0) {↵ | 5 | while (partlen-- > 0) {↵ | |
6 | char ch1 = target [ offset++ ] ;↵ | 6 | char ch1 = target [ offset++ ] ;↵ | |
7 | char ch2 = part.charAt(i++);↵ | 7 | char ch2 = target [ i++ ] ;↵ | |
8 | if (ch1 == ch2)↵ | 8 | if (ch1 == ch2)↵ | |
9 | continue;↵ | 9 | continue;↵ | |
10 | char uch1 = Character.toUpperCase(ch1);↵ | 10 | char uch1 = Character.toUpperCase(ch1);↵ | |
11 | char uch2 = Character.toUpperCase(ch2);↵ | 11 | char uch2 = Character.toUpperCase(ch2);↵ | |
12 | if (uch1 == uch2)↵ | 12 | if (uch1 == uch2)↵ | |
13 | continue;↵ | 13 | continue;↵ | |
14 | if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))↵ | 14 | if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))↵ | |
15 | return false;↵ | 15 | return false;↵ | |
16 | }↵ | 16 | }↵ | |
17 | return true; | 17 |
| |
See real code fragment | See real code fragment |
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.8 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 69 |
Number of mapped statements | 17 |
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) | 3.0 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | if (offset < 0) | 1 | if (offset < 0) | |||||||||||||
2 | return false; | 2 | return false; | |||||||||||||
3 | if (limit - offset < partlen) | 3 | if (limit - offset < partlen) | |||||||||||||
4 | return false; | 4 | return false; | |||||||||||||
5 | int i = 0; |
| 5 | int i = offset2; | ||||||||||||
6 | while (partlen-- > 0) | 6 | while (partlen-- > 0) | |||||||||||||
7 | char ch1 = target[offset++]; | 7 | char ch1 = target[offset++]; | |||||||||||||
8 | char ch2 = part.charAt(i++); |
| 8 | char ch2 = target[i++]; | ||||||||||||
9 | if (ch1 == ch2) | 9 | if (ch1 == ch2) | |||||||||||||
10 | continue; | 10 | continue; | |||||||||||||
11 | char uch1 = Character.toUpperCase(ch1); | 11 | char uch1 = Character.toUpperCase(ch1); | |||||||||||||
12 | char uch2 = Character.toUpperCase(ch2); | 12 | char uch2 = Character.toUpperCase(ch2); | |||||||||||||
13 | if (uch1 == uch2) | 13 | if (uch1 == uch2) | |||||||||||||
14 | continue; | 14 | continue; | |||||||||||||
15 | if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2)) | 15 | if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2)) | |||||||||||||
16 | return false; | 16 | return false; | |||||||||||||
17 | return true; | 17 | return true; |
Row | Violation |
---|---|
1 | Expression part.charAt(i++) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression target[i++] cannot be parameterized, because it has dependencies to/from statements that will be extracted |