SettingsHash functions
Bitstate hashing
Bitstate hashing is a hashing method invented in 1968 by Morris.
Bitstate hashing is a hashing method invented in 1968 by Morris.
CityHash
CityHash is a family of non-cryptographic hash functions, designed for fast hashing of strings.
CityHash is a family of non-cryptographic hash functions, designed for fast hashing of strings.
Cyclic redundancy check
A cyclic redundancy check is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.
A cyclic redundancy check is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.
Fowler-Noll-Vo hash function
Fowler–Noll–Vo is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Phong Vo.
Fowler–Noll–Vo is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Phong Vo.
Fowler-Noll–Vo hash function
Fowler–Noll–Vo is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Phong Vo.
Fowler–Noll–Vo is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Phong Vo.
Fowler–Noll–Vo hash function
Fowler–Noll–Vo is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Phong Vo.
Fowler–Noll–Vo is a non-cryptographic hash function created by Glenn Fowler, Landon Curt Noll, and Phong Vo.
Hash filter
A hash filter creates a hash sum from data, typically e-mail, and compares the sum against other previously defined sums.
A hash filter creates a hash sum from data, typically e-mail, and compares the sum against other previously defined sums.
Hash function
A hash function is any algorithm or subroutine that maps large data sets of variable length, called keys, to smaller data sets of a fixed length.
A hash function is any algorithm or subroutine that maps large data sets of variable length, called keys, to smaller data sets of a fixed length.
Identicon
An Identicon is a visual representation of a hash value, usually of the IP address, serving to identify a user of a computer system; compare avatars.
An Identicon is a visual representation of a hash value, usually of the IP address, serving to identify a user of a computer system; compare avatars.
Java hashCode()
In the Java programming language, every class must provide a hashCode() method which digests the data stored in an instance of the class into a single hash value (a 32-bit signed integer).
In the Java programming language, every class must provide a hashCode() method which digests the data stored in an instance of the class into a single hash value (a 32-bit signed integer).
Jenkins hash function
The Jenkins hash functions are a collection of (non-cryptographic) hash functions for multi-byte keys designed by Bob Jenkins.
The Jenkins hash functions are a collection of (non-cryptographic) hash functions for multi-byte keys designed by Bob Jenkins.
MinHash
In computer science, MinHash is a technique for quickly estimating how similar two sets are.
In computer science, MinHash is a technique for quickly estimating how similar two sets are.
Morton number (number theory)
In mathematical number theory and computer science, a Morton number is a single integer value constructed by interleaving the bits or digits of one or more source numbers.
In mathematical number theory and computer science, a Morton number is a single integer value constructed by interleaving the bits or digits of one or more source numbers.
MurmurHash
MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup.
MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup.
Pearson hashing
Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers.
Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers.
Perfect hash function
A perfect hash function for a set S is a hash function that maps distinct elements in S to distinct integers, with no collisions.
A perfect hash function for a set S is a hash function that maps distinct elements in S to distinct integers, with no collisions.
Rolling hash
A rolling hash is a hash function where the input is hashed in a window that moves through the input.
A rolling hash is a hash function where the input is hashed in a window that moves through the input.
Zobrist hashing
Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures ) is a hash function construction used in computer programs that play abstract board games, such as chess and ...
Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures ) is a hash function construction used in computer programs that play abstract board games, such as chess and ...