Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Strict.HashMap.Internal

Contents

Orphan instances

FunctorWithIndex k (HashMap k) Source #
Instance details Methods imap :: (k -> a -> b) -> HashMap k a -> HashMap k b #
FoldableWithIndex k (HashMap k) Source #
Instance details Methods ifoldMap :: Monoid m => (k -> a -> m) -> HashMap k a -> m # ifoldMap' :: Monoid m => (k -> a -> m) -> HashMap k a -> m # ifoldr :: (k -> a -> b -> b) -> b -> HashMap k a -> b # ifoldl :: (k -> b -> a -> b) -> b -> HashMap k a -> b # ifoldr' :: (k -> a -> b -> b) -> b -> HashMap k a -> b # ifoldl' :: (k -> b -> a -> b) -> b -> HashMap k a -> b #
TraversableWithIndex k (HashMap k) Source #
Instance details Methods itraverse :: Applicative f => (k -> a -> f b) -> HashMap k a -> f (HashMap k b) #
(Hashable k, Eq k, Binary k, Binary v) => Binary (HashMap k v) Source #
Instance details Methods put :: HashMap k v -> Put # get :: Get (HashMap k v) # putList :: [HashMap k v] -> Put #
(Eq k, Hashable k) => Strict (HashMap k v) (HashMap k v) Source #
Instance details Methods toStrict :: HashMap0 k v -> HashMap k v # toLazy :: HashMap k v -> HashMap0 k v #