for (int i = 0; i < size; ++i) { Entry entry = entries[i]; if (validator.isValid(entry.getEStructuralFeature())) { return setUnique(i, FeatureMapUtil.isFeatureMap(feature) ? (Entry)object : createEntry(feature, object)); } } return feature.getDefaultValue();
for (int i = 0; i < size; ++i) { EAnnotation eAnnotation = eAnnotationArray[i]; if (source.equals(eAnnotation.getSource())) { return eAnnotation; } }
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/impl/EModelElementImpl.java
Method name: Object setUnique(EStructuralFeature, int, Object) Method name: EAnnotation getEAnnotation(String)
Number of AST nodes: 5 Number of AST nodes: 4
1
for (int i = 0; i < size; ++i)
1
for (int i = 0; i < size; ++i)
2
      {
2
      
3
        Entry entry = entries[i];
4
        if (validator.isValid(entry.getEStructuralFeature()))
5
        {
6
          return setUnique(i, FeatureMapUtil.isFeatureMap(feature) ? (Entry)object : createEntry(feature, object));
7
        }
8
      }
9
      return feature.getDefaultValue();
3
      {
4
              EAnnotation eAnnotation = eAnnotationArray[i];
5
              if (source.equals(eAnnotation.getSource()))
6
              {
7
                return eAnnotation;
8
              }
9
            }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.2
Clones locationClones are in different classes
Number of node comparisons1