int hashCode = 1;
for (EGenericType eGenericType : getEGenericExceptions())
{
Object object = unwrap(eGenericType);
hashCode = 31 * hashCode + (object == null ? 0 : object.hashCode());
}
return hashCode;
int hashCode = 1;
for (EGenericType eGenericType : getEGenericSuperTypes())
{
Object object = unwrap(eGenericType);
hashCode = 31 * hashCode + (object == null ? 0 : object.hashCode());
}
return hashCode;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/impl/EOperationImpl.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/impl/EClassImpl.java
|
Method name: int delegateHashCode()
|
|
Method name: int delegateHashCode()
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | int hashCode = 1;↵ | | 1 | int hashCode = 1;↵
|
2 | for (EGenericType eGenericType : getEGenericExceptions())↵ | | 2 | for (EGenericType eGenericType : getEGenericSuperTypes())↵
|
3 | {↵ | | 3 | {↵
|
4 | Object object = unwrap(eGenericType);↵ | | 4 | Object object = unwrap(eGenericType);↵
|
5 | hashCode = 31 * hashCode + (object == null ? 0 : object.hashCode());↵ | | 5 | hashCode = 31 * hashCode + (object == null ? 0 : object.hashCode());↵
|
6 | }↵ | | 6 | }↵
|
7 | return hashCode; | | 7 | return hashCode;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 1 |