primitive-containers-0.3.1: containers backed by arrays
Data.Map.Subset.Strict.Unlifted
data Map k v Source #
Defined in Data.Map.Subset.Strict.Internal
Methods
(==) :: Map k v -> Map k v -> Bool #
(/=) :: Map k v -> Map k v -> Bool #
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 #
showsPrec :: Int -> Map k v -> ShowS #
show :: Map k v -> String #
showList :: [Map k v] -> ShowS #
(<>) :: 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 #
mempty :: Map k v #
mappend :: Map k v -> Map k v -> Map k v #
mconcat :: [Map k v] -> Map k v #
singleton :: (PrimUnlifted k, Monoid v, Eq v) => Set k -> v -> Map k v Source #
lookup :: (Ord k, PrimUnlifted k) => Set k -> Map k v -> Maybe v Source #
toList :: PrimUnlifted k => Map k v -> [(Set k, v)] Source #
fromList :: (Ord k, PrimUnlifted k, Eq v, Semigroup v) => [(Set k, v)] -> Map k v Source #