char ch1 = target [ 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;
char ch1 = target .setIndex( offset++ ) ; char ch2 = target .setIndex( 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, String, int) Method name: boolean regionMatchesIgnoreCase(CharacterIterator, int, int, int, int)
Number of AST nodes: 10 Number of AST nodes: 10
1
char ch1 =  target [  offset++ ] ;
1
char ch1 =  target .setIndex(  offset++ ) ;
2
              char ch2 = part.charAt(i++);
2
              char ch2 =  target .setIndex(  i++ ) ;
3
              if (ch1 == ch2)
3
              if (ch1 == ch2)
4
                  continue;
4
                  continue;
5
              char uch1 = Character.toUpperCase(ch1);
5
              char uch1 = Character.toUpperCase(ch1);
6
              char uch2 = Character.toUpperCase(ch2);
6
              char uch2 = Character.toUpperCase(ch2);
7
              if (uch1 == uch2)
7
              if (uch1 == uch2)
8
                  continue;
8
                  continue;
9
              if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))
9
              if (Character.toLowerCase(uch1) != Character.toLowerCase(uch2))
10
                  return false;
10
                  return false;
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 comparisons44
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements9
    Number of unmapped statements in the first code fragment1
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)2.2
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    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
    7
    char ch1 = target.setIndex(offset++);
                                                                      
    8
    char ch2 = target.setIndex(i++);
    Preondition Violations
    Unmatched statement char ch2=target.setIndex(i++); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    8
    char ch2 = target.setIndex(i++);
    8
    char ch2 = part.charAt(i++);
    8
    char ch2 = part.charAt(i++);
    Preondition Violations
    Unmatched statement char ch2=part.charAt(i++); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                                              
    9
    if (ch1 == ch2)
    9
    if (ch1 == ch2)
    10
    continue;
    10
    continue;
    10
    continue;
    Preondition Violations
    Statement continue; without innermost loop
    Statement continue; without innermost loop
    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;
    14
    continue;
    Preondition Violations
    Statement continue; without innermost loop
    Statement continue; without innermost loop
    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 (8)
    Row Violation
    1Unmatched statement char ch2=target.setIndex(i++); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    2Unmatched statement char ch2=part.charAt(i++); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    3Statement continue; without innermost loop
    4Statement continue; without innermost loop
    5Statement continue; without innermost loop
    6Statement continue; without innermost loop
    7Conditional return false;
    8Conditional return false;