for (int i = 0; i < size; ++i) { Entry entry = entries[i]; if (validator.isValid(entry.getEStructuralFeature())) { if (entry.equals(object)) { match = entry; break; } ++count; } }
for (int i = 0; i < size; ++i) { Entry entry = entries[i]; if (validator.isValid(entry.getEStructuralFeature())) { if (entry.getValue() == null) { return result; } ++result; } }
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/util/BasicFeatureMap.java
Method name: NotificationChain basicRemove(EStructuralFeature, Object, NotificationChain) Method name: int indexOf(EStructuralFeature, Object, boolean)
Number of AST nodes: 7 Number of AST nodes: 6
1
for (int i = 0; i < size; ++i)
1
for (int i = 0; i < size; ++i)
2
      {
2
      {
3
        Entry entry = entries[i];
3
        Entry entry = entries[i];
4
        if (validator.isValid(entry.getEStructuralFeature()))
4
        if (validator.isValid(entry.getEStructuralFeature()))
5
        {
5
        {
6
          if (entry.equals(object))
6
          if (entry.getValue() == null)
7
          {
7
          {
8
            match = entry;
8
            
9
            break;
9
return result;
10
          }
10
          }
11
          ++count;
11
          ++result;
12
        }
12
        }
13
      }
13
      }
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 declared in the same class
Number of node comparisons1