if (offset < 0) return false; if (limit-offset < partlen) return false; int i = 0; while (partlen-- > 0) { if ( target .setIndex( offset++ ) != part.charAt(i++)) return false; } return true;
if (offset < 0) return false; if (limit-offset < partlen) return false; int i = offset2; while (partlen-- > 0) { if ( target .setIndex( offset++ ) != target .setIndex( i++ ) ) return false; } return true;
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: boolean regionMatches(CharacterIterator, int, int, String, int) Method name: boolean regionMatches(CharacterIterator, int, int, int, int)
Number of AST nodes: 9 Number of AST nodes: 9
1
if (offset < 0)  return false;
1
if (offset < 0)  return false;
2
          if (limit-offset < partlen)
2
          if (limit-offset < partlen)
3
              return false;
3
              return false;
4
          int i = 0;
4
          int i = offset2;
5
          while (partlen-- > 0) {
5
          while (partlen-- > 0) {
6
              if ( target .setIndex(  offset++ )  != part.charAt(i++))
6
              if ( target .setIndex(  offset++ )  !=  target .setIndex(  i++ ) )
7
                  return false;
7
                  return false;
8
          }
8
          }
9
          return true;
9
          return true;
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.2
Clones locationClones are declared in the same class
Number of node comparisons1