for (int i = 0; i < size; ++i) { Object o1 = data[i]; Object o2 = objects.next(); if (o1 == null ? o2 != null : !o1.equals(o2)) { return false; } }
for (int i = 0; i < size; ++i) { Entry entry = entries[i]; if (validator.isValid(entry.getEStructuralFeature()) && entry.getValue() == null) { return false; } }
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/common/util/BasicEList.java File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/BasicFeatureMap.java
Method name: boolean equals(Object) Method name: boolean contains(EStructuralFeature, Object, boolean)
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
        Object o1 = data[i];
3
        
4
        Object o2 = objects.next();
5
        if (o1 == null ? o2 != null : !o1.equals(o2)
4
Entry entry = entries[i];
6
)
5
        if (validator.isValid(entry.getEStructuralFeature()) && entry.getValue() == null)
7
        {
6
        {
8
          return false;
7
          return false;
9
        }
8
        }
10
      }
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.0
Clones locationClones are in different classes having the same super class
Number of node comparisons1