scala.util

# hashing

#### package hashing

Source
  package.scala

Linear Supertypes
AnyRef, Any
Content Hierarchy Learn more about scaladoc diagrams
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. hashing
2. AnyRef
3. Any

1. Hide All
2. Show all

Visibility

1. Public
2. All

### Type Members

1. #### final class ByteswapHashing[T] extends Hashing[T]

   A fast multiplicative hash by Phil Bagwell.

2. #### trait Hashing[T] extends Serializable

   `Hashing` is a trait whose instances each represent a strategy for hashing instances of a type.

   `Hashing` is a trait whose instances each represent a strategy for hashing instances of a type.

   `Hashing`'s companion object defines a default hashing strategy for all objects - it calls their `##` method.

   Note: when using a custom `Hashing`, make sure to use it with the `Equiv` such that if any two objects are equal, then their hash codes must be equal.

   Annotations
     @implicitNotFound( msg = ... )
   Since

     2.10

### Value Members

1. #### object ByteswapHashing extends Serializable

2. #### object Hashing extends Serializable

3. #### object MurmurHash3 extends MurmurHash3

   An implementation of Austin Appleby's MurmurHash 3 algorithm (MurmurHash3_x86_32).

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

   See also

     http://code.google.com/p/smhasher

4. #### def byteswap32(v: Int): Int

   Fast multiplicative hash with a nice distribution.

5. #### def byteswap64(v: Long): Long

   Fast multiplicative hash with a nice distribution for 64-bit values.

### Inherited from AnyRef

### Inherited from Any

### Ungrouped