int hash = 5; hash = 53 * hash + (int) (this.address ^ (this.address >>> 32)); return hash;
int hash = 5; hash = 23 * hash + nativeType.hashCode(); return hash;
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/ext/ffi/jffi/NativeMemoryIO.java File path: /jruby-1.4.0/src/org/jruby/ext/ffi/Type.java
Method name: int hashCode() Method name: int hashCode()
Number of AST nodes: 3 Number of AST nodes: 3
1
int hash = 5;
1
int hash = 5;
2
        hash = 53 * hash + (int) (this.address ^ (this.address >>> 32));
2
            hash = 23 * hash + 
3
nativeType.hashCode();
3
        return hash;
4
            return hash;
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones locationClones are in different classes
Number of node comparisons9
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements3
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)0.0
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    int hash = 5;
    1
    int hash = 5;
    2
    hash = 53 * hash + (int)(this.address ^ (this.address >>> 32));
    2
    hash = 53 * hash + (int)(this.address ^ (this.address >>> 32));
    2
    hash = 23 * hash + nativeType.hashCode();
    Differences
    Expression1Expression2Difference
    5323LITERAL_VALUE_MISMATCH
    (int)(this.address ^ (this.address >>> 32))nativeType.hashCode()TYPE_COMPATIBLE_REPLACEMENT
    2
    hash = 23 * hash + nativeType.hashCode();
    3
    return hash;
    3
    return hash;
    Precondition Violations (0)
    Row Violation