Safe Haskell | None |
---|---|
Language | Haskell2010 |
A wrapper around HashMap
from the unordered-containers package,
with the aim of fixing the strictness of the type class operations,
to obtain a fully strict (observationally) data structure.
Documentation
Eq2 HashMap Source # | |
Show2 HashMap Source # | |
Hashable2 HashMap Source # | |
Functor (HashMap k) Source # | |
Foldable (HashMap k) Source # | |
Traversable (HashMap k) Source # | |
Eq k => Eq1 (HashMap k) Source # | |
(Eq k, Hashable k, Read k) => Read1 (HashMap k) Source # | |
Show k => Show1 (HashMap k) Source # | |
Hashable k => Hashable1 (HashMap k) Source # | |
(StrictType * seen k, StrictType * seen v) => StrictType * seen (HashMap k v) Source # | |
(Eq k, Hashable k) => IsList (HashMap k v) Source # | |
(Eq a, Eq k) => Eq (HashMap k a) Source # | |
(Hashable k, Eq k, Data a, Data k) => Data (HashMap k a) Source # | |
(Eq k, Hashable k, Read k, Read a) => Read (HashMap k a) Source # | |
(Show a, Show k) => Show (HashMap k a) Source # | |
(Hashable k, Eq k) => Semigroup (HashMap k a) Source # | |
(Hashable k, Eq k) => Monoid (HashMap k a) Source # | |
(NFData a, NFData k) => NFData (HashMap k a) Source # | |
(Hashable a, Hashable k) => Hashable (HashMap k a) Source # | |
type Item (HashMap k v) Source # | |
alter :: (Hashable k2, Eq k2) => (Maybe a2 -> Maybe a2) -> k2 -> HashMap k2 a2 -> HashMap k2 a2 Source #
differenceWith :: (Hashable k3, Eq k3) => (a3 -> w -> Maybe a3) -> HashMap k3 a3 -> HashMap k3 w -> HashMap k3 a3 Source #
foldl' :: (HashMap k2 a2 -> v -> HashMap k2 a2) -> HashMap k2 a2 -> HashMap k v -> HashMap k2 a2 Source #
foldlWithKey' :: (HashMap k2 a2 -> k -> v -> HashMap k2 a2) -> HashMap k2 a2 -> HashMap k v -> HashMap k2 a2 Source #
foldr :: (v -> HashMap k2 a2 -> HashMap k2 a2) -> HashMap k2 a2 -> HashMap k v -> HashMap k2 a2 Source #
foldrWithKey :: (k -> v -> HashMap k2 a2 -> HashMap k2 a2) -> HashMap k2 a2 -> HashMap k v -> HashMap k2 a2 Source #
insertWith :: (Hashable k2, Eq k2) => (a2 -> a2 -> a2) -> k2 -> a2 -> HashMap k2 a2 -> HashMap k2 a2 Source #
intersectionWith :: (Hashable k3, Eq k3) => (v1 -> v2 -> a3) -> HashMap k3 v1 -> HashMap k3 v2 -> HashMap k3 a3 Source #
intersectionWithKey :: (Hashable k3, Eq k3) => (k3 -> v1 -> v2 -> a3) -> HashMap k3 v1 -> HashMap k3 v2 -> HashMap k3 a3 Source #
mapWithKey :: (k2 -> v1 -> a2) -> HashMap k2 v1 -> HashMap k2 a2 Source #
traverseWithKey :: Applicative f => (k -> v1 -> f a) -> HashMap k v1 -> f (HashMap k a) Source #
unionWith :: (Hashable k3, Eq k3) => (a3 -> a3 -> a3) -> HashMap k3 a3 -> HashMap k3 a3 -> HashMap k3 a3 Source #