for (int i = 0; i < size; ++i) { Entry entry = entries[i]; if (validator.isValid(entry.getEStructuralFeature())) { Object value = entry.getValue(); result.add(resolve ? resolveProxy(feature, i, result.size(), value) : value); } }
for (int i = 0; i < size; ++i) { EAnnotation eAnnotation = eAnnotationArray[i]; if (eAnnotation.getSource() == null) { 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[] toArray(EStructuralFeature, boolean) 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];
3
              EAnnotation eAnnotation = eAnnotationArray[i];
4
        if (validator.isValid(entry.getEStructuralFeature()))
4
          
5
        {
6
          Object value = entry.getValue();
7
          result.add(resolve ? resolveProxy(feature, i, result.size(), value) : value);
5
    if (eAnnotation.getSource() == null)
6
              {
7
                return eAnnotation;
8
        }
8
              }
9
      }
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.1
Clones locationClones are in different classes
Number of node comparisons1