for (int i = 0; i < entryData.length; ++i) { BasicEList<Entry<K, V>> eList = entryData[i]; if (eList != null) { @SuppressWarnings("unchecked") Entry<K, V> [] entries = (Entry<K, V> [])eList.data; int size = eList.size; for (int j = 0; j < size; ++j) { Entry<K, V> entry = entries[j]; if (value == entry.getValue()) { return true; } } } }
for (int i = 0; i < oldEntryData.length; ++i) { BasicEList<Entry<K, V>> eList = oldEntryData[i]; if (eList != null) { @SuppressWarnings("unchecked") Entry<K, V> [] entries = (Entry<K, V> [])eList.data; int size = eList.size; for (int j = 0; j < size; ++j) { Entry<K, V> entry = entries[j]; didRemove(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: boolean containsValue(Object) Method name: void didClear(BasicEList>[])
Number of AST nodes: 9 Number of AST nodes: 8
1
for (int i = 0; i < entryData.length; ++i)
1
for (int i = 0; i < oldEntryData.length; ++i)
2
        {
2
      
3
  
3
{
4
        BasicEList<Entry<K, V>> eList = entryData[i];
4
        BasicEList<Entry<K, V>> eList = oldEntryData[i];
5
          if (eList != null)
5
        if (eList != null)
6
          {
6
        
7
  
7
{
8
          @SuppressWarnings("unchecked") Entry<K, V> [] entries = (Entry<K, V> [])eList.data;
8
          @SuppressWarnings("unchecked") Entry<K, V> [] entries = (Entry<K, V> [])eList.data;
9
            int size = eList.size;
9
          int size = eList.size;
10
            for (int j = 0; j < size; ++j)
10
          for (int j = 0; j < size; ++j)
11
            {
11
          
12
  
12
{
13
            Entry<K, V> entry = entries[j];
13
            Entry<K, V> entry = entries[j];
14
              if (value == entry.getValue())
14
            
15
              {
16
                return true;
17
    
15
didRemove(entry);
18
          }
16
          }
19
            }
17
        }
20
          }
21
        }
18
      }
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 declared in the same class
Number of node comparisons1