Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Strict.Map.Internal

Contents

Orphan instances

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