Hoogle Search
Within LTS Haskell 24.45 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
MonoidalMap :: Map k a -> MonoidalMap k amonoidal-containers Data.Map.Monoidal.Strict No documentation available.
foldMapWithKey :: forall k a m . Monoid m => (k -> a -> m) -> MonoidalMap k a -> mmonoidal-containers Data.Map.Monoidal.Strict No documentation available.
getMonoidalMap :: MonoidalMap k a -> Map k amonoidal-containers Data.Map.Monoidal.Strict No documentation available.
isProperSubmapOf :: (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Boolmonoidal-containers Data.Map.Monoidal.Strict No documentation available.
isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Boolmonoidal-containers Data.Map.Monoidal.Strict No documentation available.
isSubmapOf :: (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Boolmonoidal-containers Data.Map.Monoidal.Strict No documentation available.
isSubmapOfBy :: Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Boolmonoidal-containers Data.Map.Monoidal.Strict No documentation available.
-
A multimap. This is a simple implementation of a multimap, based on Data.Map.
- v1.1 ! had its arguments flipped. Fixed. Also added fromMap.
- v1.2 Added Data.SetMap, renamed Multimap to Data.MultiMap. Fixed the type of delete. Derive instances for Data and Typeable.
- v1.2.1 Fixed typos in the documentation.
-
A very simple MultiMap, based on Map from the containers package.
-
multimap Data.MultiMap A MultiMap with keys k and values v. A key can have multiple values (but not zero). The same value can be added multiple times (thus no constraints are ever imposed on v). Internally this is simply a Map k [v]. See toMap for accessing the underlying Map.