# scala.util.hashing

package scala.util.hashing

## Type members

### Classlikes

@implicitNotFound(msg = "No implicit Hashing defined for ${T}.")

`Hashing`

is a trait whose instances each represent a strategy for hashing
instances of a type.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). Even
so, test the generated hashes in between Scala versions, even for point
releases, as fast, non-cryptographic hashing algorithms evolve rapidly.

- See also
- Source
- (source)