for (int j = 0; j < size; ++j) { @SuppressWarnings("unchecked") Entry<K, V> entry = (Entry<K, V>)entries[j]; if (entry.getHash() == hash && key.equals(entry.getKey())) { return entry; } }
for (int j = 0; j < size; ++j) { @SuppressWarnings("unchecked") Entry<K, V> entry = (Entry<K, V>)entries[j]; if (entry.getKey() == key) { return entry; } }
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: Entry entryForKey(int, int, Object) Method name: Entry entryForKey(int, int, Object)
Number of AST nodes: 4 Number of AST nodes: 4
1
for (int j = 0; j < size; ++j)
1
for (int j = 0; j < size; ++j)
2
        {
2
        {
3
          @SuppressWarnings("unchecked") Entry<K, V> entry = (Entry<K, V>)entries[j];
3
          @SuppressWarnings("unchecked") Entry<K, V> entry = (Entry<K, V>)entries[j];
4
          if (entry.getHash() == hash && key.equals(entry.getKey())) 
4
          if (entry.getKey() == key) 
5
          {
5
          {
6
            return entry;
6
            return entry;
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