djb2
djb2(
data,seed?):number
Defined in: hash/djb2.ts:17
Computes the djb2 hash (Daniel J. Bernstein, 1991) of data.
The original additive variant: hash = hash * 33 + byte. Extremely fast but
with weak avalanche — suitable for symbol tables and seeding, not for
adversarial input. Prefer fnv1a32 or xxhash32 when distribution
quality matters.
Complexity: O(n) in the byte length of data.
Parameters
Section titled “Parameters”Uint8Array
The bytes to hash.
number = OFFSET_BASIS_
The initial state, defaulting to the canonical basis 5381.
Returns
Section titled “Returns”number
An unsigned 32-bit digest.