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 algortihm (revision 136).

Source
  MurmurHash3.scala
See also

  http://code.google.com/p/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

Learn more about member selection
Visibility

1. Public
2. All

### Type Members

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

### Value Members

1. #### final def !=(arg0: AnyRef): Boolean

   Definition Classes
     AnyRef

2. #### final def !=(arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Definition Classes
     Any

3. #### final def ##(): Int

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

   Equivalent to `x.hashCode` except for boxed numeric types and `null`. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any

4. #### final def ==(arg0: AnyRef): Boolean

   Definition Classes
     AnyRef

5. #### final def ==(arg0: Any): Boolean

   Test two objects for equality.

   Test two objects for equality. The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

   returns

     `true` if the receiver object is equivalent to the argument; `false` otherwise.

   Definition Classes
     Any

6. #### def arrayHash[T](a: Array[T]): Int

7. #### 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

8. #### def arrayHashing[T]: ArrayHashing[T]

9. #### final val arraySeed: Int(1007110753)

10. #### final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type `T0`.

    Cast the receiver object to be of type `T0`.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression `1.asInstanceOf[String]` will throw a `ClassCastException` at runtime, while the expression `List(1).asInstanceOf[List[String]]` will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown
      ClassCastException

      if the receiver object is not an instance of the erasure of type `T0`.

11. #### def bytesHash(data: Array[Byte]): Int

12. #### 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

13. #### def bytesHashing: Hashing[Array[Byte]]

14. #### def clone(): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws ( ... )
    Note

      not specified by SLS as a member of AnyRef

15. #### final def eq(arg0: AnyRef): Boolean

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    The `eq` method implements an equivalence relation on non-null instances of `AnyRef`, and has three additional properties:

    - It is consistent: for any non-null instances `x` and `y` of type `AnyRef`, multiple invocations of `x.eq(y)` consistently returns `true` or consistently returns `false`.
    - For any non-null instance `x` of type `AnyRef`, `x.eq(null)` and `null.eq(x)` returns `false`.
    - `null.eq(null)` returns `true`.

    When overriding the `equals` or `hashCode` methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (`o1 eq o2`), they should be equal to each other (`o1 == o2`) and they should hash to the same value (`o1.hashCode == o2.hashCode`).

    returns

      `true` if the argument is a reference to the receiver object; `false` otherwise.

    Definition Classes
      AnyRef

16. #### def equals(arg0: Any): Boolean

    The equality method for reference types.

    The equality method for reference types. Default implementation delegates to `eq`.

    See also `equals` in scala.Any.

    returns

      `true` if the receiver object is equivalent to the argument; `false` otherwise.

    Definition Classes
      AnyRef → Any

17. #### def finalize(): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the `finalize` method is invoked, as well as the interaction between `finalize` and non-local returns and exceptions, are all platform dependent.

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws ( classOf[java.lang.Throwable] )
    Note

      not specified by SLS as a member of AnyRef

18. #### 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

19. #### final def getClass(): Class[_]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

      a representation that corresponds to the dynamic class of the receiver object.

    Definition Classes
      AnyRef → Any
    Note

      not specified by SLS as a member of AnyRef

20. #### def hashCode(): Int

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

      the hash code value for this object.

    Definition Classes
      AnyRef → Any

21. #### final def isInstanceOf[T0]: Boolean

    Test whether the dynamic type of the receiver object is `T0`.

    Test whether the dynamic type of the receiver object is `T0`.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression `1.isInstanceOf[String]` will return `false`, while the expression `List(1).isInstanceOf[List[String]]` will return `true`. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

      `true` if the receiver object is an instance of erasure of type `T0`; `false` otherwise.

    Definition Classes
      Any

22. #### final def listHash(xs: collection.immutable.List[_], seed: Int): Int

    Definition Classes
      MurmurHash3

23. #### def mapHash(xs: Map[_, _]): Int

24. #### final val mapSeed: Int

25. #### 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

26. #### 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

27. #### final def ne(arg0: AnyRef): Boolean

    Equivalent to `!(this eq that)`.

    Equivalent to `!(this eq that)`.

    returns

      `true` if the argument is not a reference to the receiver object; `false` otherwise.

    Definition Classes
      AnyRef

28. #### final def notify(): Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Definition Classes
      AnyRef
    Note

      not specified by SLS as a member of AnyRef

29. #### final def notifyAll(): Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    Definition Classes
      AnyRef
    Note

      not specified by SLS as a member of AnyRef

30. #### def orderedHash(xs: TraversableOnce[Any]): Int

31. #### 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

32. #### def orderedHashing: Hashing[TraversableOnce[Any]]

33. #### def productHash(x: Product): Int

34. #### final def productHash(x: Product, seed: Int): Int

    Compute the hash of a product

    Compute the hash of a product

    Definition Classes
      MurmurHash3

35. #### def productHashing: Hashing[Product]

36. #### final val productSeed: Int(-889275714)

37. #### def seqHash(xs: collection.Seq[_]): Int

    To offer some potential for optimization.

38. #### final val seqSeed: Int

39. #### def setHash(xs: Set[_]): Int

40. #### final val setSeed: Int

41. #### def stringHash(x: String): Int

42. #### final def stringHash(str: String, seed: Int): Int

    Compute the hash of a string

    Compute the hash of a string

    Definition Classes
      MurmurHash3

43. #### def stringHashing: Hashing[String]

44. #### final val stringSeed: Int(-137723950)

45. #### final val symmetricSeed: Int(-1248659538)

46. #### final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
      AnyRef

47. #### def toString(): String

    Creates a String representation of this object.

    Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

    returns

      a String representation of the object.

    Definition Classes
      AnyRef → Any

48. #### final val traversableSeed: Int(-415593707)

49. #### def unorderedHash(xs: TraversableOnce[Any]): Int

50. #### 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

51. #### def unorderedHashing: Hashing[TraversableOnce[Any]]

52. #### final def wait(): Unit

    Definition Classes
      AnyRef
    Annotations
      @throws ( ... )

53. #### final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
      AnyRef
    Annotations
      @throws ( ... )

54. #### final def wait(arg0: Long): Unit

    Definition Classes
      AnyRef
    Annotations
      @throws ( ... )

### Deprecated Value Members

1. #### final def symmetricHash[T](xs: GenTraversableOnce[T], seed: Int = symmetricSeed): Int

   def linearSeqHash(xs: scala.

   def linearSeqHash(xs: scala.collection.LinearSeq[_], seed: Int): Int = { var n = 0 var h = seed var elems = xs while (elems.nonEmpty) { h = mix(h, elems.head.##) n += 1 elems = elems.tail } finalizeHash(h, n) }

   def indexedSeqHash(xs: scala.collection.IndexedSeq[_], seed: Int): Int = { var n = 0 var h = seed val len = xs.length while (n < len) { h = mix(h, xs(n).##) n += 1 } finalizeHash(h, n) }

   Annotations
     @deprecated
   Deprecated

     (Since version 2.10.0) Use unorderedHash

2. #### final def traversableHash[T](xs: GenTraversableOnce[T], seed: Int = traversableSeed): Int

   Annotations
     @deprecated
   Deprecated

     (Since version 2.10.0) Use orderedHash

### Inherited from MurmurHash3

### Inherited from AnyRef

### Inherited from Any

### Ungrouped