scala.util.hashing

Members list

Concise view

Type members

Classlikes

final class ByteswapHashing[T] extends Hashing[T]

A fast multiplicative hash by Phil Bagwell.

A fast multiplicative hash by Phil Bagwell.

Attributes

Companion:
object
Source:
ByteswapHashing.scala
Graph
Supertypes
trait Hashing[T]
class Object
trait Matchable
class Any

Attributes

Companion:
class
Source:
ByteswapHashing.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
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.

Attributes

Companion:
object
Source:
Hashing.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class Default[T]
class ArrayHashing[T]
object Hashing

Attributes

Companion:
trait
Source:
Hashing.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Hashing.type

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). Even so, test the generated hashes in between Scala versions, even for point releases, as fast, non-cryptographic hashing algorithms evolve rapidly.

Attributes

See also:
Source:
MurmurHash3.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Value members

Concrete methods

def byteswap32(v: Int): Int

Fast multiplicative hash with a nice distribution.

Fast multiplicative hash with a nice distribution.

Attributes

Source:
package.scala

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

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

Attributes

Source:
package.scala