if (isSet(this.options, SINGLE_LINE)) {
matchStart = con.start;
matchEnd = this. matchCharArray (con, this.operations, con.start, 1, this.options);
} else {
boolean previousIsEOL = true;
for (matchStart = con.start; matchStart <= limit; matchStart ++) {
int ch = target [ matchStart ] ;
if (isEOLChar(ch)) {
previousIsEOL = true;
} else {
if (previousIsEOL) {
if (0 <= (matchEnd = this. matchCharArray (con, this.operations,
matchStart, 1, this.options)))
break;
}
previousIsEOL = false;
if (isSet(this.options, SINGLE_LINE)) {
matchStart = con.start;
matchEnd = this. matchCharacterIterator (con, this.operations, con.start, 1, this.options);
} else {
boolean previousIsEOL = true;
for (matchStart = con.start; matchStart <= limit; matchStart ++) {
int ch = target .setIndex( matchStart ) ;
if (isEOLChar(ch)) {
previousIsEOL = true;
} else {
if (previousIsEOL) {
if (0 <= (matchEnd = this. matchCharacterIterator (con, this.operations,
matchStart, 1, this.options)))
break;
}
previousIsEOL = false;
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 | if (isSet(this.options, SINGLE_LINE)) {↵ | | 1 | if (isSet(this.options, SINGLE_LINE)) {↵
|
2 | matchStart = con.start;↵ | | 2 | matchStart = con.start;↵
|
3 | matchEnd = this. matchCharArray (con, this.operations, con.start, 1, this.options);↵ | | 3 | matchEnd = this. matchCharacterIterator (con, this.operations, con.start, 1, this.options);↵
|
4 | } else {↵ | | 4 | } else {↵
|
5 | boolean previousIsEOL = true;↵ | | 5 | boolean previousIsEOL = true;↵
|
6 | for (matchStart = con.start; matchStart <= limit; matchStart ++) {↵ | | 6 | for (matchStart = con.start; matchStart <= limit; matchStart ++) {↵
|
7 | int ch = target [ matchStart ] ;↵ | | 7 | int ch = target .setIndex( matchStart ) ;↵
|
8 | if (isEOLChar(ch)) {↵ | | 8 | if (isEOLChar(ch)) {↵
|
9 | previousIsEOL = true;↵ | | 9 | previousIsEOL = true;↵
|
10 | } else {↵ | | 10 | } else {↵
|
11 | if (previousIsEOL) {↵ | | 11 | if (previousIsEOL) {↵
|
12 | if (0 <= (matchEnd = this. matchCharArray (con, this.operations,↵ | | 12 | if (0 <= (matchEnd = this. matchCharacterIterator (con, this.operations,↵
|
13 | matchStart, 1, this.options)))↵ | | 13 | matchStart, 1, this.options)))↵
|
14 | break;↵ | | 14 | break;↵
|
15 | }↵ | | 15 | }↵
|
16 | previousIsEOL = false;↵ | | 16 | previousIsEOL = false;↵
|
17 | | | 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 |