if (!range.match(ch)) { char ch1 = Character.toUpperCase((char)ch); if (!range.match(ch1)) if (!range.match(Character.toLowerCase(ch1))) continue; }
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 (!range.match(ch)) {
1
if (!range.match(ch)) {
2
                              char ch1 = Character.toUpperCase((char)ch);
2
                              char ch1 = Character.toUpperCase((char)ch);
3
                              if (!range.match(ch1))
3
                              if (!range.match(ch1))
4
                                  if (!range.match(Character.toLowerCase(ch1)))
4
                                  if (!range.match(Character.toLowerCase(ch1)))
5
                                      continue;
5
                                      continue;
6
                          }
6
                          }
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