if (REUtil.isHighSurrogate(ch) && matchStart+1 < con.limit) { ch = REUtil.composeFromSurrogates(ch, target .charAt( matchStart+1 ) ); if (!range.match(ch)) continue; } else { if (!range.match(ch)) { char ch1 = Character.toUpperCase((char)ch); if (!range.match(ch1)) if (!range.match(Character.toLowerCase(ch1))) continue;
if (REUtil.isHighSurrogate(ch) && matchStart+1 < con.limit) { ch = REUtil.composeFromSurrogates(ch, target .setIndex( matchStart+1 ) ); if (!range.match(ch)) continue; } else { if (!range.match(ch)) { char ch1 = Character.toUpperCase((char)ch); if (!range.match(ch1)) if (!range.match(Character.toLowerCase(ch1))) continue;
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 (REUtil.isHighSurrogate(ch) && matchStart+1 < con.limit) {
1
if (REUtil.isHighSurrogate(ch) && matchStart+1 < con.limit) {
2
                          ch = REUtil.composeFromSurrogates(ch,  target .charAt(  matchStart+1 ) );
2
                          ch = REUtil.composeFromSurrogates(ch,  target .setIndex(  matchStart+1 ) );
3
                          if (!range.match(ch))  continue;
3
                          if (!range.match(ch))  continue;
4
                      } else {
4
                      } else {
5
                          if (!range.match(ch)) {
5
                          if (!range.match(ch)) {
6
                              char ch1 = Character.toUpperCase((char)ch);
6
                              char ch1 = Character.toUpperCase((char)ch);
7
                              if (!range.match(ch1))
7
                              if (!range.match(ch1))
8
                                  if (!range.match(Character.toLowerCase(ch1)))
8
                                  if (!range.match(Character.toLowerCase(ch1)))
9
                                      continue;
9
                                      continue;
10
                          
10
                          
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