MurmurHash
An object designed to generate well-distributed non-cryptographic hashes. It is designed to hash a collection of integers; along with the integers to hash, it generates two magic streams of integers to increase the distribution of repetitive input sequences. Thus, three methods need to be called at each step (to start and to incorporate a new integer) to update the values. Only one method needs to be called to finalize the hash.
Attributes
- Source
- MurmurHash.scala
- Graph
-
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
MurmurHash.type
Members list
Value members
Concrete methods
Compute a high-quality hash of an array
Incorporates a new value into an existing hash.
Incorporates a new value into an existing hash.
Value parameters
- hash
-
the prior hash value
- magicA
-
a magic integer from the stream
- magicB
-
a magic integer from a different stream
- value
-
the new value to incorporate
Attributes
- Returns
-
the updated hash value
- Source
- MurmurHash.scala
Once all hashes have been incorporated, this performs a final mixing
Once all hashes have been incorporated, this performs a final mixing
Attributes
- Source
- MurmurHash.scala
Given a magic integer from the first stream, compute the next
Given a magic integer from the second stream, compute the next
Begin a new hash with a seed value.
The initial magic integers in the first stream.
The initial magic integer in the second stream.
Compute a high-quality hash of a string
Compute a hash that is symmetric in its arguments--that is, where the order of appearance of elements does not matter. This is useful for hashing sets, for example.
Compute a hash that is symmetric in its arguments--that is, where the order of appearance of elements does not matter. This is useful for hashing sets, for example.
Attributes
- Source
- MurmurHash.scala