int ret = this. matchString (con, op.elementAt(i), offset, dx, opts);
if (DEBUG) {
System.err.println("UNION: "+i+", ret="+ret);
}
if (ret >= 0) return ret;
int ret = this. matchCharacterIterator (con, op.elementAt(i), offset, dx, opts);
if (DEBUG) {
System.err.println("UNION: "+i+", ret="+ret);
}
if (ret >= 0) return ret;
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 ret = this. matchString (con, op.elementAt(i), offset, dx, opts);↵ | | 1 | int ret = this. matchCharacterIterator (con, op.elementAt(i), offset, dx, opts);↵
|
2 | if (DEBUG) {↵ | | 2 | if (DEBUG) {↵
|
3 | System.err.println("UNION: "+i+", ret="+ret);↵ | | 3 | System.err.println("UNION: "+i+", ret="+ret);↵
|
4 | }↵ | | 4 | }↵
|
5 | if (ret >= 0) return ret;↵ | | 5 | if (ret >= 0) return ret;↵
|
6 | | | 6 |
|
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 |