foundation-0.0.19: Alternative prelude with batteries and no dependencies

LicenseBSD-style
MaintainerFoundation
Safe HaskellNone
LanguageHaskell2010

Foundation.Hashing

Contents

Description

 

Synopsis

Documentation

class Hashable a where Source #

Type with the ability to be hashed

Hashable doesn't have any specific rules, and it's made for raw speed. More specifically don't expect different type representing the same data to hash to the same value

hashMix (1 :: Integer) /= hashMix (1 :: Word8)

True

Minimal complete definition

hashMix

Methods

hashMix :: Hasher st => a -> st -> st Source #

Instances

Hashable Int8 Source # 

Methods

hashMix :: Hasher st => Int8 -> st -> st Source #

Hashable Int16 Source # 

Methods

hashMix :: Hasher st => Int16 -> st -> st Source #

Hashable Int32 Source # 

Methods

hashMix :: Hasher st => Int32 -> st -> st Source #

Hashable Int64 Source # 

Methods

hashMix :: Hasher st => Int64 -> st -> st Source #

Hashable Integer Source # 

Methods

hashMix :: Hasher st => Integer -> st -> st Source #

Hashable Natural Source # 

Methods

hashMix :: Hasher st => Natural -> st -> st Source #

Hashable Word8 Source # 

Methods

hashMix :: Hasher st => Word8 -> st -> st Source #

Hashable Word16 Source # 

Methods

hashMix :: Hasher st => Word16 -> st -> st Source #

Hashable Word32 Source # 

Methods

hashMix :: Hasher st => Word32 -> st -> st Source #

Hashable Word64 Source # 

Methods

hashMix :: Hasher st => Word64 -> st -> st Source #

Hashable String Source # 

Methods

hashMix :: Hasher st => String -> st -> st Source #

Hashable Word256 Source # 

Methods

hashMix :: Hasher st => Word256 -> st -> st Source #

Hashable Word128 Source # 

Methods

hashMix :: Hasher st => Word128 -> st -> st Source #

Hashable IPv6 Source # 

Methods

hashMix :: Hasher st => IPv6 -> st -> st Source #

Hashable IPv4 Source # 

Methods

hashMix :: Hasher st => IPv4 -> st -> st Source #

Hashable UUID Source # 

Methods

hashMix :: Hasher st => UUID -> st -> st Source #

Hashable a => Hashable [a] Source # 

Methods

hashMix :: Hasher st => [a] -> st -> st Source #

Hashable a => Hashable (Array a) Source # 

Methods

hashMix :: Hasher st => Array a -> st -> st Source #

PrimType a => Hashable (UArray a) Source # 

Methods

hashMix :: Hasher st => UArray a -> st -> st Source #

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

Methods

hashMix :: Hasher st => (a, b) -> st -> st Source #

(Hashable a, Hashable b) => Hashable (Tuple2 a b) Source # 

Methods

hashMix :: Hasher st => Tuple2 a b -> st -> st Source #

(Hashable a, Hashable b, Hashable c) => Hashable (a, b, c) Source # 

Methods

hashMix :: Hasher st => (a, b, c) -> st -> st Source #

(Hashable a, Hashable b, Hashable c) => Hashable (Tuple3 a b c) Source # 

Methods

hashMix :: Hasher st => Tuple3 a b c -> st -> st Source #

(Hashable a, Hashable b, Hashable c, Hashable d) => Hashable (a, b, c, d) Source # 

Methods

hashMix :: Hasher st => (a, b, c, d) -> st -> st Source #

(Hashable a, Hashable b, Hashable c, Hashable d) => Hashable (Tuple4 a b c d) Source # 

Methods

hashMix :: Hasher st => Tuple4 a b c d -> st -> st Source #

(Hashable a, Hashable b, Hashable c, Hashable d, Hashable e) => Hashable (a, b, c, d, e) Source # 

Methods

hashMix :: Hasher st => (a, b, c, d, e) -> st -> st Source #

(Hashable a, Hashable b, Hashable c, Hashable d, Hashable e, Hashable f) => Hashable (a, b, c, d, e, f) Source # 

Methods

hashMix :: Hasher st => (a, b, c, d, e, f) -> st -> st Source #

class Hasher st Source #

Incremental Hashing state. Represent an hashing algorithm

the base primitive of this class is hashMix8, append mix a Word8 in the state

The class allow to define faster mixing function that works on bigger Word size and any unboxed array of any PrimType elements

Minimal complete definition

hashNew, hashNewParam, hashMix8, hashEnd

Instances

Hasher Sip1_3 Source # 

Associated Types

type HashResult Sip1_3 :: *

type HashInitParam Sip1_3 :: *

Hasher Sip2_4 Source # 

Associated Types

type HashResult Sip2_4 :: *

type HashInitParam Sip2_4 :: *

Hasher FNV1a_64 Source # 

Associated Types

type HashResult FNV1a_64 :: *

type HashInitParam FNV1a_64 :: *

Hasher FNV1a_32 Source # 

Associated Types

type HashResult FNV1a_32 :: *

type HashInitParam FNV1a_32 :: *

Hasher FNV1_64 Source # 

Associated Types

type HashResult FNV1_64 :: *

type HashInitParam FNV1_64 :: *

Hasher FNV1_32 Source # 

Associated Types

type HashResult FNV1_32 :: *

type HashInitParam FNV1_32 :: *

Specific methods

data FNV1_32 Source #

FNV1 32 bit state

Instances

Hasher FNV1_32 Source # 

Associated Types

type HashResult FNV1_32 :: *

type HashInitParam FNV1_32 :: *

data FNV1_64 Source #

FNV1 64 bit state

Instances

Hasher FNV1_64 Source # 

Associated Types

type HashResult FNV1_64 :: *

type HashInitParam FNV1_64 :: *

data FNV1a_32 Source #

FNV1a 32 bit state

Instances

Hasher FNV1a_32 Source # 

Associated Types

type HashResult FNV1a_32 :: *

type HashInitParam FNV1a_32 :: *

data FNV1a_64 Source #

FNV1a 64 bit state

Instances

Hasher FNV1a_64 Source # 

Associated Types

type HashResult FNV1a_64 :: *

type HashInitParam FNV1a_64 :: *

data Sip1_3 Source #

Sip State 1-3 (1 compression rounds, 3 digest rounds)

Instances

Hasher Sip1_3 Source # 

Associated Types

type HashResult Sip1_3 :: *

type HashInitParam Sip1_3 :: *

data Sip2_4 Source #

Sip State 2-4 (2 compression rounds, 4 digest rounds)

Instances

Hasher Sip2_4 Source # 

Associated Types

type HashResult Sip2_4 :: *

type HashInitParam Sip2_4 :: *