for (int i = 0, size = delegateEList.size(); i < size; ++i) { Entry<K, V> entry = delegateEList.get(i); if (key == entry.getKey()) { return i; } }
for (int i = 0, size = delegateEList.size(); i < size; ++i) { Entry<K, V> entry = delegateEList.get(i); if (key.equals(entry.getKey())) { return i; } }
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/common/util/BasicEMap.java File path: /emf-2.4.1/src/org/eclipse/emf/common/util/BasicEMap.java
Method name: int indexOfKey(Object) Method name: int indexOfKey(Object)
Number of AST nodes: 4 Number of AST nodes: 4
1
for (int i = 0, size = delegateEList.size(); i < size; ++i)
1
for (int i = 0, size = delegateEList.size(); i < size; ++i)
2
      {
2
      {
3
        Entry<K, V> entry = delegateEList.get(i);
3
        Entry<K, V> entry = delegateEList.get(i);
4
        if (key == entry.getKey())
4
        if (key.equals(entry.getKey()))
5
        {
5
        {
6
          return i;
6
          return i;
7
        }
7
        }
8
      }
8
      }
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