for (int i = 0; i < size; ++i) { Entry entry = entries[i]; if (validator.isValid(entry.getEStructuralFeature())) { result.add(entry); } }
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: T[] toArray(EStructuralFeature, T[], boolean) Method name: EAnnotation getEAnnotation(String)
Number of AST nodes: 4 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.getEStructuralFeatur
3
      {
4
              EAnnotation eAnnotation = eAnnotationArray[i];
5
e()))
5
              if (source.equals(eAnnotation.getSource()))
6
        {
6
        
7
      {
7
          result.add(entry);
8
                re
8
        }
9
turn eAnnotation;
10
              }
9
      }
11
            }
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