int size = delegateSize(); Object[] result = new Object[size]; int index = 0; for (EGenericType eGenericType : getEGenericSuperTypes()) { result[index++] = unwrap(eGenericType); } return result;
int size = delegateSize(); Object[] result = new Object[size]; int index = 0; for (EGenericType eGenericType : getEGenericExceptions()) { result[index++] = unwrap(eGenericType); } return result;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/impl/EClassImpl.java File path: /emf-2.4.1/src/org/eclipse/emf/ecore/impl/EOperationImpl.java
Method name: Object[] delegateToArray() Method name: Object[] delegateToArray()
Number of AST nodes: 6 Number of AST nodes: 6
1
int size = delegateSize();
1
int size = delegateSize();
2
            Object[] result = new Object[size];
2
            Object[] result = new Object[size];
3
            
3
            
4
            int index = 0;
4
            int index = 0;
5
            for (EGenericType eGenericType : getEGenericSuperTypes())
5
            for (EGenericType eGenericType : getEGenericExceptions())
6
            {
6
            {
7
              result[index++] = unwrap(eGenericType);
7
              result[index++] = unwrap(eGenericType);
8
            }
8
            }
9
            return result;
9
            return result;
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