public int getHash() { if (hash == -1) { Object theKey = getKey(); hash = (theKey == null ? 0 : theKey.hashCode()); } return hash; } /** * <!-- begin-user-doc --> * <!-- end-user-doc --> * @generated */ public void setHash(int hash) { this.hash = hash;
public int getHash() { if (hash == -1) { Object theKey = getKey(); hash = (theKey == null ? 0 : theKey.hashCode()); } return hash; } public void setHash(int hash) { this.hash = hash;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/ecore/change/impl/EObjectToChangesMapEntryImpl.java File path: /emf-2.4.1/src/org/eclipse/emf/ecore/impl/DynamicEObjectImpl.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public int getHash()
1
public int getHash()
2
  {
2
  
3
  {
3
    if (hash == -1)
4
      if (hash == -1)
4
    {
5
      {
5
      Object theKey = getKey();
6
        Object theKey = getKey();
6
      hash = (theKey == null ? 0 : theKey.hashCode());
7
        hash = (theKey == null ? 0 : theKey.hashCode());
7
    }
8
    
9
  }
8
    return hash;
10
      return hash;
9
  }
11
    }
10
  /**
12
  
11
   * <!-- begin-user-doc -->
12
   * <!-- end-user-doc -->
13
   * @generated
14
   */
15
  public void setHash(int hash)
13
  public void setHash(int hash)
16
  {
14
  
15
  {
17
    this.hash = hash;
16
      this.hash = hash;
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 location
Number of node comparisons0