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 matchCharacterIterator(Context, Op, int, int, int)
|
|||
Number of AST nodes: 9 | Number of AST nodes: 9 | |||
1 | int ch = op.getData();↵ | 1 | int ch = op.getData();↵ | |
2 | if (dx > 0) {↵ | 2 | if (dx > 0) {↵ | |
3 | if (offset >= con.limit || !matchIgnoreCase(ch, target [ offset ] ))↵ | 3 | if (offset >= con.limit || ch != target .setIndex( offset ) )↵ | |
4 | return -1;↵ | 4 | return -1;↵ | |
5 | offset ++;↵ | 5 | offset ++;↵ | |
6 | } else {↵ | 6 | } else {↵ | |
7 | int o1 = offset-1;↵ | 7 | int o1 = offset-1;↵ | |
8 | if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target [ o1 ] ))↵ | 8 | if (o1 >= con.limit || o1 < 0 || ch != target .setIndex( o1 ) )↵ | |
9 | return -1;↵ | 9 | return -1;↵ | |
10 | offset = o1;↵ | 10 | offset = o1;↵ | |
11 | } | 11 |
| |
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.9 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 31 |
Number of mapped statements | 9 |
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) | 49.6 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
10 | int ch = op.getData(); | 19 | int ch = op.getData(); | |||||||||||||
11 | if (dx > 0) | 20 | if (dx > 0) | |||||||||||||
12 | if (offset >= con.limit || !matchIgnoreCase(ch, target[offset])) |
| 21 | if (offset >= con.limit || ch != target.setIndex(offset)) | ||||||||||||
13 | return -1; | 22 | return -1; | |||||||||||||
14 | offset++; | 23 | offset++; | |||||||||||||
else | else | |||||||||||||||
15 | int o1 = offset - 1; | 24 | int o1 = offset - 1; | |||||||||||||
16 | if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target[o1])) |
| 25 | if (o1 >= con.limit || o1 < 0 || ch != target.setIndex(o1)) | ||||||||||||
17 | return -1; | 26 | return -1; | |||||||||||||
18 | offset = o1; | 27 | offset = o1; |
Row | Violation |
---|---|
1 | Expression !matchIgnoreCase(ch,target[offset]) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression ch != target.setIndex(offset) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
3 | Expression !matchIgnoreCase(ch,target[o1]) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
4 | Expression ch != target.setIndex(o1) cannot be parameterized, because it has dependencies to/from statements that will be extracted |