for (int i = 0, size = delegateSize(); i < size; ++i) { Entry entry = delegateGet(i); if (validator.isValid(entry.getEStructuralFeature())) { if (entry.getValue() == null) { result = count; } ++count; } }
for (int i = 0, size = delegateSize(); i < size; ++i) { Entry entry = delegateGet(i); if (validator.isValid(entry.getEStructuralFeature())) { if (entry.equals(object)) { result = count; } ++count; } }
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/DelegatingFeatureMap.java File path: /emf-2.4.1/src/org/eclipse/emf/ecore/util/DelegatingFeatureMap.java
Method name: int lastIndexOf(EStructuralFeature, Object, boolean) Method name: int lastIndexOf(EStructuralFeature, Object, boolean)
Number of AST nodes: 6 Number of AST nodes: 6
1
for (int i = 0, size = delegateSize(); i < size; ++i)
1
for (int i = 0, size = delegateSize(); i < size; ++i)
2
      {
2
      {
3
        Entry entry = delegateGet(i);
3
        Entry entry = delegateGet(i);
4
        if (validator.isValid(entry.getEStructuralFeature()))
4
        if (validator.isValid(entry.getEStructuralFeature()))
5
        {
5
        {
6
          if (entry.getValue() == null)
6
          if (entry.equals(object))
7
          {
7
          {
8
            result = count;
8
            result = count;
9
          }
9
          }
10
          ++count;
10
          ++count;
11
        }
11
        }
12
      }
12
      }
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 the same method
Number of node comparisons1