while (partlen-- > 0) { char ch1 = target [ offset++ ] ; char ch2 = target [ i++ ] ; if (ch1 == ch2) continue; char uch1 = Character.toUpperCase(ch1); char uch2 = Character.toUpperCase(ch2); if (uch1 == uch2) continue; if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2)) return false; }
while (partlen-- > 0) { char ch1 = target .setIndex( offset++ ) ; char ch2 = part.charAt(i++); if (ch1 == ch2) continue; char uch1 = Character.toUpperCase(ch1); char uch2 = Character.toUpperCase(ch2); if (uch1 == uch2) continue; if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2)) return false; }
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 regionMatchesIgnoreCase(char[], int, int, int, int) Method name: boolean regionMatchesIgnoreCase(CharacterIterator, int, int, String, int)
Number of AST nodes: 11 Number of AST nodes: 11
1
while (partlen-- > 0) {
1
while (partlen-- > 0) {
2
              char ch1 =  target [  offset++ ] ;
2
              char ch1 =  target .setIndex(  offset++ ) ;
3
              char ch2 =  target [  i++ ] ;
3
              char ch2 = part.charAt(i++);
4
              if (ch1 == ch2)
4
              if (ch1 == ch2)
5
                  continue;
5
                  continue;
6
              char uch1 = Character.toUpperCase(ch1);
6
              char uch1 = Character.toUpperCase(ch1);
7
              char uch2 = Character.toUpperCase(ch2);
7
              char uch2 = Character.toUpperCase(ch2);
8
              if (uch1 == uch2)
8
              if (uch1 == uch2)
9
                  continue;
9
                  continue;
10
              if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))
10
              if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))
11
                  return false;
11
                  return false;
12
          }
12
          }
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.6
Clones locationClones are declared in the same class
Number of node comparisons52
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements11
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)2.8
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    6
    while (partlen-- > 0)
    6
    while (partlen-- > 0)
    7
    char ch1 = target[offset++];
    7
    char ch1 = target[offset++];
    7
    char ch1 = target.setIndex(offset++);
    Differences
    Expression1Expression2Difference
    target[offset++]target.setIndex(offset++)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
    7
    char ch1 = target.setIndex(offset++);
    8
    char ch2 = target[i++];
    8
    char ch2 = target[i++];
    8
    char ch2 = part.charAt(i++);
    Differences
    Expression1Expression2Difference
    target[i++]part.charAt(i++)TYPE_COMPATIBLE_REPLACEMENT
    Preondition Violations
    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
    8
    char ch2 = part.charAt(i++);
    9
    if (ch1 == ch2)
    9
    if (ch1 == ch2)
    10
    continue;
    10
    continue;
    11
    char uch1 = Character.toUpperCase(ch1);
    11
    char uch1 = Character.toUpperCase(ch1);
    12
    char uch2 = Character.toUpperCase(ch2);
    12
    char uch2 = Character.toUpperCase(ch2);
    13
    if (uch1 == uch2)
    13
    if (uch1 == uch2)
    14
    continue;
    14
    continue;
    15
    if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))
    15
    if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))
    16
    return false;
    16
    return false;
    16
    return false;
    Preondition Violations
    Conditional return false;
    Conditional return false;
    16
    return false;
    Precondition Violations (6)
    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
    5Conditional return false;
    6Conditional return false;