Safe Haskell | Safe-Infered |
---|
Pure immutable hash whose lookup is O(1) on the average, but O(N) in the worst case.
- data StaticHash k v
- fromList :: (Eq k, Ord k, Hashable k) => [(k, v)] -> StaticHash k v
- fromList' :: (Eq k, Ord k, Hashable k) => Int -> [(k, v)] -> StaticHash k v
- lookup :: (Eq k, Ord k, Hashable k) => k -> StaticHash k v -> Maybe v
Documentation
fromList :: (Eq k, Ord k, Hashable k) => [(k, v)] -> StaticHash k vSource
Creating StaticHash
from a list. A prime around the length of
the list x 2 is chosen for the size of array. This may prevent
collisions.
fromList' :: (Eq k, Ord k, Hashable k) => Int -> [(k, v)] -> StaticHash k vSource
Creating StaticHash
from a list and its size.
lookup :: (Eq k, Ord k, Hashable k) => k -> StaticHash k v -> Maybe vSource
Looking up StaticHash
.