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 matches(String, int, int, Match)
|
Method name: boolean matches(CharacterIterator, Match)
|
|||
Number of AST nodes: 13 | Number of AST nodes: 13 | |||
1 | for (matchStart = con.start; matchStart <= limit; matchStart ++) {↵ | 1 | for (matchStart = con.start; matchStart <= limit; matchStart ++) {↵ | |
2 | int ch = target .charAt( matchStart ) ;↵ | 2 | int ch = target .setIndex( matchStart ) ;↵ | |
3 | if (REUtil.isHighSurrogate(ch) && matchStart+1 < con.limit) {↵ | 3 | if (REUtil.isHighSurrogate(ch) && matchStart+1 < con.limit) {↵ | |
4 | ch = REUtil.composeFromSurrogates(ch, target .charAt( matchStart+1 ) );↵ | 4 | ch = REUtil.composeFromSurrogates(ch, target .setIndex( matchStart+1 ) );↵ | |
5 | if (!range.match(ch)) continue;↵ | 5 | if (!range.match(ch)) continue;↵ | |
6 | } else {↵ | 6 | } else {↵ | |
7 | if (!range.match(ch)) {↵ | 7 | if (!range.match(ch)) {↵ | |
8 | char ch1 = Character.toUpperCase((char)ch);↵ | 8 | char ch1 = Character.toUpperCase((char)ch);↵ | |
9 | if (!range.match(ch1))↵ | 9 | if (!range.match(ch1))↵ | |
10 | if (!range.match(Character.toLowerCase(ch1)))↵ | 10 | if (!range.match(Character.toLowerCase(ch1)))↵ | |
11 | continue;↵ | 11 | continue;↵ | |
12 | }↵ | 12 | }↵ | |
13 | }↵ | 13 | }↵ | |
14 | if (0 <= (matchEnd = this. matchString (con, this.operations,↵ | 14 | if (0 <= (matchEnd = this. matchCharacterIterator (con, this.operations,↵ | |
15 | matchStart, 1, this.options)))↵ | 15 | matchStart, 1, this.options)))↵ | |
16 | break;↵ | 16 | break;↵ | |
17 | } | 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) | 1.6 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 30 |
Number of mapped statements | 13 |
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) | 4.4 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
66 | for (matchStart = con.start; matchStart <= limit; matchStart++) | 63 | for (matchStart = con.start; matchStart <= limit; matchStart++) | |||||||||||||||||
67 | int ch = target.charAt(matchStart); |
| 64 | int ch = target.setIndex(matchStart); | ||||||||||||||||
68 | if (REUtil.isHighSurrogate(ch) && matchStart + 1 < con.limit) | 65 | if (REUtil.isHighSurrogate(ch) && matchStart + 1 < con.limit) | |||||||||||||||||
69 | ch = REUtil.composeFromSurrogates(ch, target.charAt(matchStart + 1)); |
| 66 | ch = REUtil.composeFromSurrogates(ch, target.setIndex(matchStart + 1)); | ||||||||||||||||
70 | if (!range.match(ch)) | 67 | if (!range.match(ch)) | |||||||||||||||||
71 | continue; | 68 | continue; | |||||||||||||||||
else | else | |||||||||||||||||||
72 | if (!range.match(ch)) | 69 | if (!range.match(ch)) | |||||||||||||||||
73 | char ch1 = Character.toUpperCase((char)ch); | 70 | char ch1 = Character.toUpperCase((char)ch); | |||||||||||||||||
74 | if (!range.match(ch1)) | 71 | if (!range.match(ch1)) | |||||||||||||||||
75 | if (!range.match(Character.toLowerCase(ch1))) | 72 | if (!range.match(Character.toLowerCase(ch1))) | |||||||||||||||||
76 | continue; | 73 | continue; | |||||||||||||||||
77 | if (0 <= (matchEnd = this.matchString(con, this.operations, matchStart, 1, this.options))) |
| 74 | if (0 <= (matchEnd = this.matchCharacterIterator(con, this.operations, matchStart, 1, this.options))) | ||||||||||||||||
78 | break; | 75 | break; |
Row | Violation |
---|---|
1 | Expression target.charAt(matchStart) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression target.setIndex(matchStart) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
3 | Type java.lang.String of variable target does not match with type java.text.CharacterIterator of variable target |
4 | Expression target.charAt(matchStart + 1) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
5 | Expression target.setIndex(matchStart + 1) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
6 | Type java.lang.String of variable target does not match with type java.text.CharacterIterator of variable target |
7 | Expression this.matchString(con,this.operations,matchStart,1,this.options) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
8 | Expression this.matchCharacterIterator(con,this.operations,matchStart,1,this.options) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
9 | Clone fragment #1 returns variables matchEnd, matchStart , while Clone fragment #2 returns variables matchEnd, matchStart |