int ch = op.getData();
if (dx > 0) {
if (offset >= con.limit || ch != target .charAt( offset ) )
return -1;
offset ++;
} else {
int o1 = offset-1;
if (o1 >= con.limit || o1 < 0 || ch != target .charAt( o1 ) )
return -1;
offset = o1;
}
int ch = op.getData();
if (dx > 0) {
if (offset >= con.limit || ch != target .setIndex( offset ) )
return -1;
offset ++;
} else {
int o1 = offset-1;
if (o1 >= con.limit || o1 < 0 || ch != target .setIndex( o1 ) )
return -1;
offset = o1;
}
Clone fragments detected by clone detection tool
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:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | int ch = op.getData();↵ | | 1 | int ch = op.getData();↵
|
2 | if (dx > 0) {↵ | | 2 | if (dx > 0) {↵
|
3 | if (offset >= con.limit || ch != target .charAt( 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 || ch != target .charAt( 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 |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |