int id = op.getData();
if (id >= 0) {
int previousOffset = con.offsets[id];
if (previousOffset < 0 || previousOffset != offset) {
con.offsets[id] = offset;
} else {
con.offsets[id] = -1;
op = op.next;
break;
}
}
int ret = this. matchCharArray (con, op.getChild(), offset, dx, opts);
if (id >= 0) con.offsets[id] = -1;
if (ret >= 0) return ret;
op = op.next;
int id = op.getData();
if (id >= 0) {
int previousOffset = con.offsets[id];
if (previousOffset < 0 || previousOffset != offset) {
con.offsets[id] = offset;
} else {
con.offsets[id] = -1;
op = op.next;
break;
}
}
int ret = this. matchCharacterIterator (con, op.getChild(), offset, dx, opts);
if (id >= 0) con.offsets[id] = -1;
if (ret >= 0) return ret;
op = op.next;
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 id = op.getData();↵ | | 1 | int id = op.getData();↵
|
2 | if (id >= 0) {↵ | | 2 | if (id >= 0) {↵
|
3 | int previousOffset = con.offsets[id];↵ | | 3 | int previousOffset = con.offsets[id];↵
|
4 | if (previousOffset < 0 || previousOffset != offset) {↵ | | 4 | if (previousOffset < 0 || previousOffset != offset) {↵
|
5 | con.offsets[id] = offset;↵ | | 5 | con.offsets[id] = offset;↵
|
6 | } else {↵ | | 6 | } else {↵
|
7 | con.offsets[id] = -1;↵ | | 7 | con.offsets[id] = -1;↵
|
8 | op = op.next;↵ | | 8 | op = op.next;↵
|
9 | break;↵ | | 9 | break;↵
|
10 | }↵ | | 10 | }↵
|
11 | }↵ | | 11 | }↵
|
| | | 12 | ↵
|
12 | int ret = this. matchCharArray (con, op.getChild(), offset, dx, opts);↵ | | 13 | int ret = this. matchCharacterIterator (con, op.getChild(), offset, dx, opts);↵
|
13 | if (id >= 0) con.offsets[id] = -1;↵ | | 14 | if (id >= 0) con.offsets[id] = -1;↵
|
14 | if (ret >= 0) return ret;↵ | | 15 | if (ret >= 0) return ret;↵
|
15 | op = op.next;↵ | | 16 | op = op.next;↵
|
16 | | | 17 |
|
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 |