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: 10 | Number of AST nodes: 10 | |||
1 | char ch1 = target [ offset++ ] ;↵ | 1 | char ch1 = target [ offset++ ] ;↵ | |
2 | char ch2 = part.charAt(i++);↵ | 2 | char ch2 = target [ i++ ] ;↵ | |
3 | if (ch1 == ch2)↵ | 3 | if (ch1 == ch2)↵ | |
4 | continue;↵ | 4 | continue;↵ | |
5 | char uch1 = Character.toUpperCase(ch1);↵ | 5 | char uch1 = Character.toUpperCase(ch1);↵ | |
6 | char uch2 = Character.toUpperCase(ch2);↵ | 6 | char uch2 = Character.toUpperCase(ch2);↵ | |
7 | if (uch1 == uch2)↵ | 7 | if (uch1 == uch2)↵ | |
8 | continue;↵ | 8 | continue;↵ | |
9 | if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))↵ | 9 | if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))↵ | |
10 | return false; | 10 |
| |
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.6 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 44 |
Number of mapped statements | 10 |
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.9 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
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; |
Row | Violation |
---|---|
1 | Statement continue; without innermost loop |
2 | Statement continue; without innermost loop |
3 | Statement continue; without innermost loop |
4 | Statement continue; without innermost loop |
5 | Clone fragment #1 returns variables offset, i , while Clone fragment #2 returns variables offset, i |
6 | Conditional return false; |
7 | Conditional return false; |