Data.MonoidMap.Internal.RecoveredMap

Description

An ordinary left-biased map similar to Map, implemented in terms of MonoidMap.

Documentation

data Map k v Source #

Instances details

Functor (Map k) Source #
Instance details Defined in Data.MonoidMap.Internal.RecoveredMap Methods fmap :: (a -> b) -> Map k a -> Map k b # (<$) :: a -> Map k b -> Map k a #
Ord k => Monoid (Map k v) Source #
Instance details Defined in Data.MonoidMap.Internal.RecoveredMap Methods mempty :: Map k v # mappend :: Map k v -> Map k v -> Map k v # mconcat :: [Map k v] -> Map k v #
Ord k => Semigroup (Map k v) Source #
Instance details Defined in Data.MonoidMap.Internal.RecoveredMap Methods (<>) :: Map k v -> Map k v -> Map k v # sconcat :: NonEmpty (Map k v) -> Map k v # stimes :: Integral b => b -> Map k v -> Map k v #
(Show k, Show v) => Show (Map k v) Source #
Instance details Defined in Data.MonoidMap.Internal.RecoveredMap Methods showsPrec :: Int -> Map k v -> ShowS # show :: Map k v -> String # showList :: [Map k v] -> ShowS #
(NFData k, NFData v) => NFData (Map k v) Source #
Instance details Defined in Data.MonoidMap.Internal.RecoveredMap Methods rnf :: Map k v -> () #
(Eq k, Eq v) => Eq (Map k v) Source #
Instance details Defined in Data.MonoidMap.Internal.RecoveredMap Methods (==) :: Map k v -> Map k v -> Bool # (/=) :: Map k v -> Map k v -> Bool #

singleton :: Ord k => k -> v -> Map k v Source #

fromList :: Ord k => [(k, v)] -> Map k v Source #

toList :: Map k v -> [(k, v)] Source #

delete :: Ord k => k -> Map k v -> Map k v Source #

insert :: Ord k => k -> v -> Map k v -> Map k v Source #

lookup :: Ord k => k -> Map k v -> Maybe v Source #

member :: Ord k => k -> Map k v -> Bool Source #

map :: (v1 -> v2) -> Map k v1 -> Map k v2 Source #

mapWithKey :: (k -> v1 -> v2) -> Map k v1 -> Map k v2 Source #

mapAccumL :: (s -> v1 -> (s, v2)) -> s -> Map k v1 -> (s, Map k v2) Source #

mapAccumLWithKey :: (s -> k -> v1 -> (s, v2)) -> s -> Map k v1 -> (s, Map k v2) Source #

mapAccumR :: (s -> v1 -> (s, v2)) -> s -> Map k v1 -> (s, Map k v2) Source #

mapAccumRWithKey :: (s -> k -> v1 -> (s, v2)) -> s -> Map k v1 -> (s, Map k v2) Source #