collection = getDuplicates(collection); for (int i = size; --i >= 0; ) { if (collection.contains(data[i])) { doRemove(i); result = true; } }
collection = getDuplicates(collection); for (int i = delegateSize(); --i >=0; ) { if (collection.contains(delegateGet(i))) { doRemove(i); result = true; } }
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/common/notify/impl/NotifyingListImpl.java File path: /emf-2.4.1/src/org/eclipse/emf/common/notify/impl/DelegatingNotifyingListImpl.java
Method name: boolean removeAll(Collection) Method name: boolean removeAll(Collection)
Number of AST nodes: 5 Number of AST nodes: 5
1
collection = getDuplicates(collection);
1
collection = getDuplicates(collection);
2
      for (int i = size; --i >= 0; )
2
      for (int i = delegateSize(); --i >=0; )
3
      {
3
      {
4
        if (collection.contains(data[i]))
4
        if (collection.contains(delegateGet(i)))
5
        {
5
        {
6
          doRemove(i);
6
          doRemove(i);
7
          result = true;
7
          result = true;
8
        }
8
        }
9
      }
9
      }
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.2
Clones locationClones are in different classes having the same super class
Number of node comparisons1