Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. isSubmapOf :: (Ord k, Eq a) => MonoidalMap k a -> MonoidalMap k a -> Bool

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

2. isSubmapOfBy :: Ord k => (a -> b -> Bool) -> MonoidalMap k a -> MonoidalMap k b -> Bool

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

3. package multimap

   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.

4. module Data.MultiMap

   A very simple MultiMap, based on Map from the containers package.

5. data MultiMap k v

   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.

6. fromMap :: Map k [a] -> MultiMap k a

   multimap	Data.MultiMap

   Turns a map of lists into a multimap.

7. toMap :: MultiMap k a -> Map k [a]

   multimap	Data.MultiMap

   O(1). Return the map of lists.

8. toMapOfSets :: Ord a => MultiMap k a -> Map k (Set a)

   multimap	Data.MultiMap

   /O(k*m*log m) where k is the number of keys and m the maximum number of elements associated with a single key/

9. module Data.SetMap

   No documentation available.

10. data SetMap k v

    multimap	Data.SetMap

    A SetMap with keys k and values v.

Page 953 of many | Previous | Next