int hash = 5;
hash = 53 * hash + (int) (this.address ^ (this.address >>> 32));
return hash;
int hash = 5;
hash = 53 * hash + (int) (this.address ^ (this.address >>> 32));
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/jffi/BoundedNativeMemoryIO.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 = 53 * hash + (int) (this.address ^ (this.address >>> 32));↵
|
3 | return hash; | | 3 | return hash;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 1 |
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)); |
3 | return hash; | | 3 | return hash; |
Precondition Violations (0)
Row |
Violation |