Safe Haskell	None
Language	Haskell2010

Data.Map.Subset.Strict.Lifted

Documentation

data Map k v Source #

Instances

(Eq k, Eq v) => Eq (Map k v) Source #
Instance details Defined in Data.Map.Subset.Strict.Internal Methods (==) :: Map k v -> Map k v -> Bool # (/=) :: Map k v -> Map k v -> Bool #
(Ord k, Ord v) => Ord (Map k v) Source #
Instance details Defined in Data.Map.Subset.Strict.Internal Methods compare :: Map k v -> Map k v -> Ordering # (<) :: Map k v -> Map k v -> Bool # (<=) :: Map k v -> Map k v -> Bool # (>) :: Map k v -> Map k v -> Bool # (>=) :: Map k v -> Map k v -> Bool # max :: Map k v -> Map k v -> Map k v # min :: Map k v -> Map k v -> Map k v #
(Show k, Show v) => Show (Map k v) Source #
Instance details Defined in Data.Map.Subset.Strict.Internal Methods showsPrec :: Int -> Map k v -> ShowS # show :: Map k v -> String # showList :: [Map k v] -> ShowS #
(Semigroup v, Eq v, Ord k) => Semigroup (Map k v) Source #
Instance details Defined in Data.Map.Subset.Strict.Internal 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 #
(Semigroup v, Eq v, Ord k) => Monoid (Map k v) Source #
Instance details Defined in Data.Map.Subset.Strict.Internal Methods mempty :: Map k v # mappend :: Map k v -> Map k v -> Map k v # mconcat :: [Map k v] -> Map k v #

singleton :: Eq v => Set k -> v -> Map k v Source #

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

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

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