if (offset < 0) return false; if (limit-offset < partlen) return false; int i = offset2; while (partlen-- > 0) { if ( target [ offset++ ] != target [ i++ ] ) return false; } return true;
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;
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(char[], int, int, int, int) Method name: boolean regionMatches(CharacterIterator, int, int, String, 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 = offset2;
4
          int i = 0;
5
          while (partlen-- > 0) {
5
          while (partlen-- > 0) {
6
              if ( target [  offset++ ]  !=  target [  i++ ] )
6
              if ( target .setIndex(  offset++ )  != part.charAt(i++))
7
                  return false;
7
                  return false;
8
          }
8
          }
9
          return true;
9
          return true;
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.4
Clones locationClones are declared in the same class
Number of node comparisons22
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements9
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)1.3
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    if (offset < 0)
    1
    if (offset < 0)
    2
    return false;
    2
    return false;
    3
    if (limit - offset < partlen)
    3
    if (limit - offset < partlen)
    4
    return false;
    4
    return false;
    5
    int i = offset2;
    5
    int i = offset2;
    5
    int i = 0;
    Differences
    Expression1Expression2Difference
    offset20TYPE_COMPATIBLE_REPLACEMENT
    5
    int i = 0;
    6
    while (partlen-- > 0)
    6
    while (partlen-- > 0)
    7
    if (target[offset++] != target[i++])
    7
    if (target[offset++] != target[i++])
    7
    if (target.setIndex(offset++) != part.charAt(i++))
    Differences
    Expression1Expression2Difference
    target[offset++]target.setIndex(offset++)TYPE_COMPATIBLE_REPLACEMENT
    target[i++]part.charAt(i++)TYPE_COMPATIBLE_REPLACEMENT
    Preondition Violations
    Expression target[offset++] cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression target.setIndex(offset++) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression target[i++] cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression part.charAt(i++) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    7
    if (target.setIndex(offset++) != part.charAt(i++))
    8
    return false;
    8
    return false;
    9
    return true;
    9
    return true;
    Precondition Violations (4)
    Row Violation
    1Expression target[offset++] cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2Expression target.setIndex(offset++) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    3Expression target[i++] cannot be parameterized, because it has dependencies to/from statements that will be extracted
    4Expression part.charAt(i++) cannot be parameterized, because it has dependencies to/from statements that will be extracted