This method is used to compare the receiver object (this)
with the argument object (arg0) for equivalence
This method is used to compare the receiver object (this)
with the argument object (arg0) for equivalence.
The default implementations of this method is an equivalence relation:
x of type Any,
x.equals(x) should return true.x and y of type
Any, x.equals(y) should return true if and only
if y.equals(x) returns true.x, y, and z of type AnyRef
if x.equals(y) returns true and
y.equals(z) returns
true, then x.equals(z) should return true.
If you override this method, you should verify that
your implementation remains an equivalence relation.
Additionally, when overriding this method it is often necessary to
override hashCode to ensure that objects that are
"equal" (o1.equals(o2) returns true)
hash to the same Int
(o1.hashCode.equals(o2.hashCode)).
the object to compare against this object for equality.
true if the receiver object is equivalent to the argument; false otherwise.
Hash a variable-length key into a 32-bit value
Hash a variable-length key into a 32-bit value. Every bit of the key affects every bit of the return value. Every 1-bit and 2-bit delta achieves avalanche. The best hash table sizes are powers of 2.
Byte array that we are hashing on.
Initial value of the hash if we are continuing from a previous run. 0 if none.
Hash value for the buffer.
Returns a hash code value for the object
Returns a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash
codes (o1.hashCode.equals(o2.hashCode)) yet not be
equal (o1.equals(o2) returns false). A
degenerate implementation could always return 0.
However, it is required that if two objects are equal
(o1.equals(o2) returns true) that they
have identical hash codes
(o1.hashCode.equals(o2.hashCode)). Therefore, when
overriding this method, be sure to verify that the behavior is
consistent with the equals method.
Hash a sequence of anything into a 32-bit value
Hash a sequence of anything into a 32-bit value. Descendants of AnyVal are broken down into individual bytes and mixed with some vigor, and this is summed with the hashCodes provided by the descendants of AnyRef.
Returns a string representation of the object
Returns a string representation of the object.
The default representation is platform dependent.
Original algorithm due to Bob Jenkins. http://burtleburtle.net/bob/c/lookup3.c Scala version partially adapted from java version by Gray Watson. http://256.com/sources/jenkins_hash_java/JenkinsHash.java
This is based on the 1996 version, not the 2006 version, and could most likely stand some improvement; the collision rate is negligible in my tests, but performance merits investigation.