primitive-containers-0.2.0

Safe HaskellNone
LanguageHaskell2010

Data.Map.Subset.Lifted

Documentation

data Map k v Source #

Instances

(Eq v, Eq k) => Eq (Map k v) Source # 

Methods

(==) :: Map k v -> Map k v -> Bool #

(/=) :: Map k v -> Map k v -> Bool #

(Ord v, Ord k) => Ord (Map k v) Source # 

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 # 

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 # 

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 # 

Methods

mempty :: Map k v #

mappend :: Map k v -> Map k v -> Map k v #

mconcat :: [Map k v] -> Map k v #

singleton :: (Monoid v, 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 #