if (isSet(opts, IGNORE_CASE)) { int ch = op.getData(); if (dx > 0) { if (offset >= con.limit || !matchIgnoreCase(ch, target .charAt( offset ) )) return -1; offset ++; } else { int o1 = offset-1; if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target .charAt( o1 ) )) return -1; offset = o1; } } else { int ch = op.getData(); if (dx > 0) { if (offset >= con.limit || ch != target .charAt( offset ) ) return -1; offset ++; } else { int o1 = offset-1; if (o1 >= con.limit || o1 < 0 || ch != target .charAt( o1 ) ) return -1; offset = o1; } }
if (isSet(opts, IGNORE_CASE)) { int ch = op.getData(); if (dx > 0) { if (offset >= con.limit || !matchIgnoreCase(ch, target .setIndex( offset ) )) return -1; offset ++; } else { int o1 = offset-1; if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target .setIndex( o1 ) )) return -1; offset = o1; } } else { int ch = op.getData(); if (dx > 0) { if (offset >= con.limit || ch != target .setIndex( offset ) ) return -1; offset ++; } else { int o1 = offset-1; if (o1 >= con.limit || o1 < 0 || ch != target .setIndex( o1 ) ) return -1; offset = o1; } }
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: int matchString(Context, Op, int, int, int) Method name: int matchCharacterIterator(Context, Op, int, int, int)
Number of AST nodes: 19 Number of AST nodes: 19
1
if (isSet(opts, IGNORE_CASE)) {
1
if (isSet(opts, IGNORE_CASE)) {
2
                      int ch = op.getData();
2
                      int ch = op.getData();
3
                      if (dx > 0) {
3
                      if (dx > 0) {
4
                          if (offset >= con.limit || !matchIgnoreCase(ch,  target .charAt(  offset ) ))
4
                          if (offset >= con.limit || !matchIgnoreCase(ch,  target .setIndex(  offset ) ))
5
                              return -1;
5
                              return -1;
6
                          offset ++;
6
                          offset ++;
7
                      } else {
7
                      } else {
8
                          int o1 = offset-1;
8
                          int o1 = offset-1;
9
                          if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch,  target .charAt(  o1 ) ))
9
                          if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch,  target .setIndex(  o1 ) ))
10
                              return -1;
10
                              return -1;
11
                          offset = o1;
11
                          offset = o1;
12
                      }
12
                      }
13
                  } else {
13
                  } else {
14
                      int ch = op.getData();
14
                      int ch = op.getData();
15
                      if (dx > 0) {
15
                      if (dx > 0) {
16
                          if (offset >= con.limit || ch !=  target .charAt(  offset ) )
16
                          if (offset >= con.limit || ch !=  target .setIndex(  offset ) )
17
                              return -1;
17
                              return -1;
18
                          offset ++;
18
                          offset ++;
19
                      } else {
19
                      } else {
20
                          int o1 = offset-1;
20
                          int o1 = offset-1;
21
                          if (o1 >= con.limit || o1 < 0 || ch !=  target .charAt(  o1 ) )
21
                          if (o1 >= con.limit || o1 < 0 || ch !=  target .setIndex(  o1 ) )
22
                              return -1;
22
                              return -1;
23
                          offset = o1;
23
                          offset = o1;
24
                      }
24
                      }
25
                  }
25
                  }
Summary
Number of common nesting structure subtrees2
Number of refactorable cases0
Number of non-refactorable cases2
Time elapsed for finding largest common nesting structure subtrees (ms)3.5
Clones locationClones are declared in the same class
Number of node comparisons69
  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)51.8
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    10
    int ch = op.getData();
    19
    int ch = op.getData();
    11
    if (dx > 0)
    20
    if (dx > 0)
    12
    if (offset >= con.limit || !matchIgnoreCase(ch, target.charAt(offset)))
    12
    if (offset >= con.limit || !matchIgnoreCase(ch, target.charAt(offset)))
    21
    if (offset >= con.limit || ch != target.setIndex(offset))
    Differences
    Expression1Expression2Difference
    !matchIgnoreCase(ch,target.charAt(offset))ch != target.setIndex(offset)INFIX_RIGHT_OPERAND_MISMATCH
    Preondition Violations
    Expression !matchIgnoreCase(ch,target.charAt(offset)) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression ch != target.setIndex(offset) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    21
    if (offset >= con.limit || ch != target.setIndex(offset))
    13
    return -1;
    22
    return -1;
    14
    offset++;
    23
    offset++;
    else
    else
    15
    int o1 = offset - 1;
    24
    int o1 = offset - 1;
    16
    if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target.charAt(o1)))
    16
    if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target.charAt(o1)))
    25
    if (o1 >= con.limit || o1 < 0 || ch != target.setIndex(o1))
    Differences
    Expression1Expression2Difference
    !matchIgnoreCase(ch,target.charAt(o1))ch != target.setIndex(o1)INFIX_RIGHT_OPERAND_MISMATCH
    Preondition Violations
    Expression !matchIgnoreCase(ch,target.charAt(o1)) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression ch != target.setIndex(o1) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    25
    if (o1 >= con.limit || o1 < 0 || ch != target.setIndex(o1))
    17
    return -1;
    26
    return -1;
    18
    offset = o1;
    27
    offset = o1;
    Precondition Violations (4)
    Row Violation
    1Expression !matchIgnoreCase(ch,target.charAt(offset)) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2Expression ch != target.setIndex(offset) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    3Expression !matchIgnoreCase(ch,target.charAt(o1)) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    4Expression ch != target.setIndex(o1) cannot be parameterized, because it has dependencies to/from statements that will be extracted
  2. {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)54.8
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    19
    int ch = op.getData();
    10
    int ch = op.getData();
    20
    if (dx > 0)
    11
    if (dx > 0)
    21
    if (offset >= con.limit || ch != target.charAt(offset))
    21
    if (offset >= con.limit || ch != target.charAt(offset))
    12
    if (offset >= con.limit || !matchIgnoreCase(ch, target.setIndex(offset)))
    Differences
    Expression1Expression2Difference
    ch != target.charAt(offset)!matchIgnoreCase(ch,target.setIndex(offset))INFIX_RIGHT_OPERAND_MISMATCH
    Preondition Violations
    Expression ch != target.charAt(offset) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression !matchIgnoreCase(ch,target.setIndex(offset)) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    12
    if (offset >= con.limit || !matchIgnoreCase(ch, target.setIndex(offset)))
    22
    return -1;
    13
    return -1;
    23
    offset++;
    14
    offset++;
    else
    else
    24
    int o1 = offset - 1;
    15
    int o1 = offset - 1;
    25
    if (o1 >= con.limit || o1 < 0 || ch != target.charAt(o1))
    25
    if (o1 >= con.limit || o1 < 0 || ch != target.charAt(o1))
    16
    if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target.setIndex(o1)))
    Differences
    Expression1Expression2Difference
    ch != target.charAt(o1)!matchIgnoreCase(ch,target.setIndex(o1))INFIX_RIGHT_OPERAND_MISMATCH
    Preondition Violations
    Expression ch != target.charAt(o1) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    Expression !matchIgnoreCase(ch,target.setIndex(o1)) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    16
    if (o1 >= con.limit || o1 < 0 || !matchIgnoreCase(ch, target.setIndex(o1)))
    26
    return -1;
    17
    return -1;
    27
    offset = o1;
    18
    offset = o1;
    Precondition Violations (4)
    Row Violation
    1Expression ch != target.charAt(offset) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    2Expression !matchIgnoreCase(ch,target.setIndex(offset)) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    3Expression ch != target.charAt(o1) cannot be parameterized, because it has dependencies to/from statements that will be extracted
    4Expression !matchIgnoreCase(ch,target.setIndex(o1)) cannot be parameterized, because it has dependencies to/from statements that will be extracted