for (int i = 0; i < size; ++i) { Entry entry = entries[i]; if (validator.isValid(entry.getEStructuralFeature())) { if (entry.getValue() == null) { result = count; } ++count; } }
for (int i = 0; i < size; ++i) { Entry entry = entries[i]; if (validator.isValid(entry.getEStructuralFeature())) { if (entry.getValue() == null) { match = entry; break; } ++count; } }
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/BasicFeatureMap.java File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/BasicFeatureMap.java
Method name: int lastIndexOf(EStructuralFeature, Object, boolean) Method name: NotificationChain basicRemove(EStructuralFeature, Object, NotificationChain)
Number of AST nodes: 6 Number of AST nodes: 7
1
for (int i = 0; i < size; ++i)
1
for (int i = 0; i < size; ++i)
2
      {
2
      {
3
        Entry entry = entries[i];
3
        Entry entry = entries[i];
4
        if (validator.isValid(entry.getEStructuralFeature()))
4
        if (validator.isValid(entry.getEStructuralFeature()))
5
        {
5
        {
6
          if (entry.getValue() == null)
6
          if (entry.getValue() == null)
7
          {
7
          {
8
            result = count
8
            match = entry;
9
;
9
            break;
10
          }
10
          }
11
          ++count;
11
          ++count;
12
        }
12
        }
13
      }
13
      }
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)1.7
Clones locationClones are declared in the same class
Number of node comparisons51
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements5
    Number of unmapped statements in the first code fragment1
    Number of unmapped statements in the second code fragment2
    Time elapsed for statement mapping (ms)0.7
    Clone typeType 3
    Mapped Statements
    ID Statement ID Statement
    28
    for (int i = 0; i < size; ++i)
    21
    for (int i = 0; i < size; ++i)
    29
    Entry entry = entries[i];
    22
    Entry entry = entries[i];
    30
    if (validator.isValid(entry.getEStructuralFeature()))
    23
    if (validator.isValid(entry.getEStructuralFeature()))
    31
    if (entry.getValue() == null)
    24
    if (entry.getValue() == null)
                                    
    25
    match = entry;
    Preondition Violations
    Unmatched statement match=entry; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    25
    match = entry;
                        
    26
    break;
    Preondition Violations
    Unmatched break;
    26
    break;
    32
    result = count;
    32
    result = count;
    Preondition Violations
    Unmatched statement result=count; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                      
    33
    ++count;
    27
    ++count;
    Precondition Violations (4)
    Row Violation
    1Unmatched statement match=entry; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    2Unmatched break;
    3Unmatched statement result=count; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    4Clone fragment #1 returns variables count , while Clone fragment #2 returns variables entry, count