if (isSet(opts, IGNORE_CASE)) { int ch = op.getData(); if (dx > 0) { if (offset >= con.limit || !matchIgnoreCase(ch, target .charAt( offset ) )) return -1; offset ++; } else { int o1 = offset-1; if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target .charAt( o1 ) )) return -1; offset = o1; } } else { 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;
if (isSet(opts, IGNORE_CASE)) { int ch = op.getData(); if (dx > 0) { if (offset >= con.limit || !matchIgnoreCase(ch, target .setIndex( offset ) )) return -1; offset ++; } else { int o1 = offset-1; if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target .setIndex( o1 ) )) return -1; offset = o1; } } else { 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
if (isSet(opts, IGNORE_CASE)) {
1
if (isSet(opts, IGNORE_CASE)) {
2
                      int ch = op.getData();
2
                      int ch = op.getData();
3
                      if (dx > 0) {
3
                      if (dx > 0) {
4
                          if (offset >= con.limit || !matchIgnoreCase(ch,  target .charAt(  offset ) ))
4
                          if (offset >= con.limit || !matchIgnoreCase(ch,  target .setIndex(  offset ) ))
5
                              return -1;
5
                              return -1;
6
                          offset ++;
6
                          offset ++;
7
                      } else {
7
                      } else {
8
                          int o1 = offset-1;
8
                          int o1 = offset-1;
9
                          if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch,  target .charAt(  o1 ) ))
9
                          if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch,  target .setIndex(  o1 ) ))
10
                              return -1;
10
                              return -1;
11
                          offset = o1;
11
                          offset = o1;
12
                      }
12
                      }
13
                  } else {
13
                  } else {
14
                      int ch = op.getData();
14
                      int ch = op.getData();
15
                      if (dx > 0) {
15
                      if (dx > 0) {
16
                          if (offset >= con.limit || ch !=  target .charAt(  offset ) )
16
                          if (offset >= con.limit || ch !=  target .setIndex(  offset ) )
17
                              return -1;
17
                              return -1;
18
                          offset ++;
18
                          offset ++;
19
                      } else {
19
                      } else {
20
                          int o1 = offset-1;
20
                          int o1 = offset-1;
21
                          if (o1 >= con.limit || o1 < 0 || ch !=  target .charAt(  o1 ) )
21
                          if (o1 >= con.limit || o1 < 0 || ch !=  target .setIndex(  o1 ) )
22
                              return -1;
22
                              return -1;
23
                          offset = o1;
23
                          offset = o1;
24
                      
24
                      
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0