if (duplicateCount != count) { internalEObjects.move(duplicateCount, count); } indices[duplicateCount] = i; ++count; ++duplicateCount; existingValues[j] = null; continue LOOP;
if (duplicateCount != count) { featureMap.move(duplicateCount, count); } indices[duplicateCount] = i; ++count; ++duplicateCount; existingValues[j] = null; continue LOOP;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/resource/impl/BinaryResourceImpl.java File path: /emf-2.4.1/src/org/eclipse/emf/ecore/resource/impl/BinaryResourceImpl.java
Method name: void loadEObjects(InternalEList) Method name: void loadFeatureMap(FeatureMap.Internal)
Number of AST nodes: 7 Number of AST nodes: 7
1
if (duplicateCount != count)
1
if (duplicateCount != count)
2
              {
2
              {
3
                internalEObjects.move(duplicateCount, count);
3
                featureMap.move(duplicateCount, count);
4
              }
4
              }
5
              indices[duplicateCount] = i;
5
              indices[duplicateCount] = i;
6
              ++count;
6
              ++count;
7
              ++duplicateCount;
7
              ++duplicateCount;
8
              existingValues[j] = null;
8
              existingValues[j] = null;
9
              continue LOOP;
9
              continue LOOP;
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.1
Clones locationClones are declared in the same class
Number of node comparisons34
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements5
    Number of unmapped statements in the first code fragment2
    Number of unmapped statements in the second code fragment2
    Time elapsed for statement mapping (ms)1.5
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    18
    if (duplicateCount != count)
    17
    if (duplicateCount != count)
                                                                                        
    18
    featureMap.move(duplicateCount, count);
    Preondition Violations
    Unmatched statement featureMap.move(duplicateCount,count); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    18
    featureMap.move(duplicateCount, count);
    19
    internalEObjects.move(duplicateCount, count);
    19
    internalEObjects.move(duplicateCount, count);
    Preondition Violations
    Unmatched statement internalEObjects.move(duplicateCount,count); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                                                                                    
    20
    indices[duplicateCount] = i;
    19
    indices[duplicateCount] = i;
    21
    ++count;
    20
    ++count;
    22
    ++duplicateCount;
    21
    ++duplicateCount;
                                                          
    22
    existingValues[j] = null;
    23
    existingValues[j] = null;
                                                          
    24
    continue LOOP;
    24
    continue LOOP;
    23
    continue LOOP;
    Preondition Violations
    Statement continue LOOP; without innermost loop
    Statement continue LOOP; without innermost loop
    23
    continue LOOP;
    Precondition Violations (5)
    Row Violation
    1Unmatched statement featureMap.move(duplicateCount,count); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    2Unmatched statement internalEObjects.move(duplicateCount,count); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
    3Statement continue LOOP; without innermost loop
    4Statement continue LOOP; without innermost loop
    5Clone fragment #1 returns variables duplicateCount, indices , while Clone fragment #2 returns variables duplicateCount, indices