char ch1 = ch = text.charAt(--index); char ch2 = this.pattern[--pindex]; if (ch1 != ch2) { ch1 = Character.toUpperCase(ch1); ch2 = Character.toUpperCase(ch2); if (ch1 != ch2 && Character.toLowerCase(ch1) != Character.toLowerCase(ch2)) break; } if (pindex == 0) return index;
char ch1 = ch = chars[--index]; char ch2 = this.pattern[--pindex]; if (ch1 != ch2) { ch1 = Character.toUpperCase(ch1); ch2 = Character.toUpperCase(ch2); if (ch1 != ch2 && Character.toLowerCase(ch1) != Character.toLowerCase(ch2)) break; } if (pindex == 0) return index;
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
char ch1 = ch = text.charAt(--index);
1
char ch1 = ch = chars[--index];
2
          char ch2 = this.pattern[--pindex];
2
          char ch2 = this.pattern[--pindex];
3
          if (ch1 != ch2)
3
          if (ch1 != ch2)
4
          {
4
          {
5
            ch1 = Character.toUpperCase(ch1);
5
            ch1 = Character.toUpperCase(ch1);
6
            ch2 = Character.toUpperCase(ch2);
6
            ch2 = Character.toUpperCase(ch2);
7
            if (ch1 != ch2 && Character.toLowerCase(ch1) != Character.toLowerCase(ch2))
7
            if (ch1 != ch2 && Character.toLowerCase(ch1) != Character.toLowerCase(ch2))
8
              break;
8
              break;
9
          }
9
          }
10
          if (pindex == 0)
10
          if (pindex == 0)
11
            return index;
11
            return index;
12
        
12
        
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