Case.Hashable.Cuckoo

A library that can be used as a case ... of constuction analogue for the Hashable keys. For the large lists is expected to be more time efficient than CaseBi.Arr.getBFst' analogue. If you plan to use it together with the former one, please, use qualified import to avoid names ambiguity.

Documentation

getBFstL' :: (Eq k, Hashable k) => v -> [(k, v)] -> k -> v

lookup2 :: (Eq k, Hashable k) => [(k, v)] -> k -> ST s (Maybe v)

lookup2Sized :: (Eq k, Hashable k) => Int -> [(k, v)] -> k -> ST s (Maybe v)

lookupL :: (Eq k, Hashable k, Traversable t) => [(k, v)] -> t k -> ST s (t (Maybe v))

lookupLSized :: (Eq k, Hashable k, Traversable t) => Int -> [(k, v)] -> t k -> ST s (t (Maybe v))

getBFstLL' :: (Eq k, Hashable k) => b -> [(k, b)] -> [k] -> [b]

getBFstLArr' :: (Hashable k, Ix i, Eq k) => b -> [(k, b)] -> Array i k -> Array i b

getBFstLSized' :: (Eq k, Hashable k) => Int -> v -> [(k, v)] -> k -> v

getBFstLLSized' :: (Eq k, Hashable k) => Int -> b -> [(k, b)] -> [k] -> [b]

getBFstLArrSized' :: (Hashable k, Ix i, Eq k) => Int -> b -> [(k, b)] -> Array i k -> Array i b