Packages

o

scala.util.hashing

MurmurHash3

object MurmurHash3 extends MurmurHash3

An implementation of Austin Appleby's MurmurHash 3 algorithm (MurmurHash3_x86_32). This object contains methods that hash values of various types as well as means to construct Hashing objects.

This algorithm is designed to generate well-distributed non-cryptographic hashes. It is designed to hash data in 32 bit chunks (ints).

The mix method needs to be called at each step to update the intermediate hash value. For the last chunk to incorporate into the hash mixLast may be used instead, which is slightly faster. Finally finalizeHash needs to be called to compute the final hash value.

This is based on the earlier MurmurHash3 code by Rex Kerr, but the MurmurHash3 algorithm was since changed by its creator Austin Appleby to remedy some weaknesses and improve performance. This represents the latest and supposedly final version of the algorithm (revision 136).

Source
MurmurHash3.scala
See also

https://github.com/aappleby/smhasher

Linear Supertypes
MurmurHash3, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MurmurHash3
  2. MurmurHash3
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class ArrayHashing[T] extends Hashing[Array[T]]

Value Members

  1. def arrayHash[T](a: Array[T]): Int
  2. final def arrayHash[T](a: Array[T], seed: Int): Int

    Compute the hash of an array.

    Compute the hash of an array.

    Definition Classes
    MurmurHash3
  3. def arrayHashing[T]: ArrayHashing[T]
  4. final val arraySeed: Int(1007110753)
  5. def bytesHash(data: Array[Byte]): Int
  6. final def bytesHash(data: Array[Byte], seed: Int): Int

    Compute the hash of a byte array.

    Compute the hash of a byte array. Faster than arrayHash, because it hashes 4 bytes at once.

    Definition Classes
    MurmurHash3
  7. def bytesHashing: Hashing[Array[Byte]]
  8. final def finalizeHash(hash: Int, length: Int): Int

    Finalize a hash to incorporate the length and make sure all bits avalanche.

    Finalize a hash to incorporate the length and make sure all bits avalanche.

    Definition Classes
    MurmurHash3
  9. final def listHash(xs: collection.immutable.List[_], seed: Int): Int
    Definition Classes
    MurmurHash3
  10. def mapHash(xs: Map[_, _]): Int
  11. final val mapSeed: Int
  12. final def mix(hash: Int, data: Int): Int

    Mix in a block of data into an intermediate hash value.

    Mix in a block of data into an intermediate hash value.

    Definition Classes
    MurmurHash3
  13. final def mixLast(hash: Int, data: Int): Int

    May optionally be used as the last mixing step.

    May optionally be used as the last mixing step. Is a little bit faster than mix, as it does no further mixing of the resulting hash. For the last element this is not necessary as the hash is thoroughly mixed during finalization anyway.

    Definition Classes
    MurmurHash3
  14. def orderedHash(xs: TraversableOnce[Any]): Int
  15. final def orderedHash(xs: TraversableOnce[Any], seed: Int): Int

    Compute a hash that depends on the order of its arguments.

    Compute a hash that depends on the order of its arguments.

    Definition Classes
    MurmurHash3
  16. def orderedHashing: Hashing[TraversableOnce[Any]]
  17. def productHash(x: Product): Int
  18. final def productHash(x: Product, seed: Int): Int

    Compute the hash of a product

    Compute the hash of a product

    Definition Classes
    MurmurHash3
  19. def productHashing: Hashing[Product]
  20. final val productSeed: Int(-889275714)
  21. def seqHash(xs: collection.Seq[_]): Int

    To offer some potential for optimization.

  22. final val seqSeed: Int
  23. def setHash(xs: Set[_]): Int
  24. final val setSeed: Int
  25. def stringHash(x: String): Int
  26. final def stringHash(str: String, seed: Int): Int

    Compute the hash of a string

    Compute the hash of a string

    Definition Classes
    MurmurHash3
  27. def stringHashing: Hashing[String]
  28. final val stringSeed: Int(-137723950)
  29. final val symmetricSeed: Int(-1248659538)
  30. final val traversableSeed: Int(-415593707)
  31. def unorderedHash(xs: TraversableOnce[Any]): Int
  32. final def unorderedHash(xs: TraversableOnce[Any], seed: Int): Int

    Compute a hash that is symmetric in its arguments - that is a hash where the order of appearance of elements does not matter.

    Compute a hash that is symmetric in its arguments - that is a hash where the order of appearance of elements does not matter. This is useful for hashing sets, for example.

    Definition Classes
    MurmurHash3
  33. def unorderedHashing: Hashing[TraversableOnce[Any]]