lsm-tree-0.1.0.0: Log-structured merge-trees
Safe HaskellSafe-Inferred
LanguageGHC2021

Data.BloomFilter.Hash

Description

Fast hashing of Haskell values. The hash used is XXH3 64bit.

Synopsis

Basic hash functionality

type Hash = Word64 Source #

A hash value is 64 bits wide.

class Hashable a where Source #

The class of types that can be converted to a hash value.

The instances are meant to be stable, the hash values can be persisted.

Methods

hashSalt64 Source #

Arguments

:: Word64

seed

-> a

value to hash

-> Word64 

Compute a 64-bit hash of a value.

Instances

Instances details
Hashable ByteArray Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

hashSalt64 :: Word64 -> ByteArray -> Word64 Source #

Hashable Word32 Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

hashSalt64 :: Word64 -> Word32 -> Word64 Source #

Hashable Word64 Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

hashSalt64 :: Word64 -> Word64 -> Word64 Source #

Hashable ByteString Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

hashSalt64 :: Word64 -> ByteString -> Word64 Source #

Hashable ByteString Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

hashSalt64 :: Word64 -> ByteString -> Word64 Source #

Hashable () Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

hashSalt64 :: Word64 -> () -> Word64 Source #

Hashable Char Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

hashSalt64 :: Word64 -> Char -> Word64 Source #

Hashable a => Hashable [a] Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

hashSalt64 :: Word64 -> [a] -> Word64 Source #

(Hashable a, Hashable b) => Hashable (a, b) Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

hashSalt64 :: Word64 -> (a, b) -> Word64 Source #

hash64 :: Hashable a => a -> Word64 Source #

Compute a 64-bit hash.

hashByteArray :: ByteArray -> Int -> Int -> Word64 -> Word64 Source #

Hash a (part of) ByteArray.

Incremental hashing

class Incremental a where Source #

The class of types that can be incrementally hashed.

Methods

update :: HashState s -> a -> ST s () Source #

Instances

Instances details
Incremental Word32 Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

update :: HashState s -> Word32 -> ST s () Source #

Incremental Word64 Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

update :: HashState s -> Word64 -> ST s () Source #

Incremental ByteString Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

update :: HashState s -> ByteString -> ST s () Source #

Incremental Char Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

update :: HashState s -> Char -> ST s () Source #

data HashState s Source #

Hash state for incremental hashing

incrementalHash :: Word64 -> (forall s. HashState s -> ST s ()) -> Word64 Source #

Calculate incrementally constructed hash.

Hashing

class Hashes h where Source #

A type class abstracting over different hashing schemes.b

Methods

makeHashes :: Hashable a => a -> h a Source #

evalHashes :: h a -> Int -> Hash Source #

Instances

Instances details
Hashes (CheapHashes :: Type -> Type) Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

makeHashes :: Hashable a => a -> CheapHashes a Source #

evalHashes :: CheapHashes a -> Int -> Hash Source #

Hashes (RealHashes :: Type -> Type) Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

makeHashes :: Hashable a => a -> RealHashes a Source #

evalHashes :: RealHashes a -> Int -> Hash Source #

newtype RealHashes a Source #

A closure of real hashing function.

Constructors

RealHashes (Word64 -> Hash) 

Instances

Instances details
Hashes (RealHashes :: Type -> Type) Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

makeHashes :: Hashable a => a -> RealHashes a Source #

evalHashes :: RealHashes a -> Int -> Hash Source #

Compute a family of hash values

data CheapHashes a Source #

A pair of hashes used for a double hashing scheme.

See evalCheapHashes.

Constructors

CheapHashes !Hash !Hash 

Instances

Instances details
Hashes (CheapHashes :: Type -> Type) Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

makeHashes :: Hashable a => a -> CheapHashes a Source #

evalHashes :: CheapHashes a -> Int -> Hash Source #

Show (CheapHashes a) Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

showsPrec :: Int -> CheapHashes a -> ShowS #

show :: CheapHashes a -> String #

showList :: [CheapHashes a] -> ShowS #

Prim (CheapHashes a) Source # 
Instance details

Defined in Data.BloomFilter.Hash

Methods

sizeOfType# :: Proxy (CheapHashes a) -> Int# Source #

sizeOf# :: CheapHashes a -> Int# Source #

alignmentOfType# :: Proxy (CheapHashes a) -> Int# Source #

alignment# :: CheapHashes a -> Int# Source #

indexByteArray# :: ByteArray# -> Int# -> CheapHashes a Source #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, CheapHashes a #) Source #

writeByteArray# :: MutableByteArray# s -> Int# -> CheapHashes a -> State# s -> State# s Source #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> CheapHashes a -> State# s -> State# s Source #

indexOffAddr# :: Addr# -> Int# -> CheapHashes a Source #

readOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, CheapHashes a #) Source #

writeOffAddr# :: Addr# -> Int# -> CheapHashes a -> State# s -> State# s Source #

setOffAddr# :: Addr# -> Int# -> Int# -> CheapHashes a -> State# s -> State# s Source #

evalCheapHashes :: CheapHashes a -> Int -> Hash Source #

Evalute CheapHashes family.

\[ g_i = h_0 + \left\lfloor h_1 / 2^i \right\rfloor \]

makeCheapHashes :: Hashable a => a -> CheapHashes a Source #

Create CheapHashes structure.

It's simply hashes the value twice using seed 0 and 1.