Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. data Multimap (c :: Type -> Type) k v

   more-containers	Data.Multimap

   A map where the same key can be present multiple times.

2. type SeqMultimap = Multimap Seq

   more-containers	Data.Multimap

   A multimap with Seq values. See Data.Multimap.Seq for operations specific to this type.

3. type SetMultimap = Multimap Set

   more-containers	Data.Multimap

   A multimap with Set values. This multimap implementation will automatically deduplicate values per key. For example:

   let mm = fromList [('a', 1), ('a', 1)] :: SetMultimap Char Int
   size mm == 1 -- True
   

   See Data.Multimap.Set for operations specific to this type.

4. fromMap :: Collection c => Map k (c v) -> Multimap c k v

   more-containers	Data.Multimap

   O(m * C) Transforms a map of collections into a multimap.

5. toMap :: Multimap c k v -> Map k (c v)

   more-containers	Data.Multimap

   O(1) Converts a multimap into a map of collections.

6. type ListMultimap = Multimap []

   more-containers	Data.Multimap.List

   A multimap with list values. Note that lists do not support efficient appends or sizing, so several multimap operations will have higher complexity than for other collections. If performance is a concern, consider using a SeqMultimap instead. See Data.Multimap.List for operations specific to this type.

7. type SeqMultimap = Multimap Seq

   more-containers	Data.Multimap.Seq

   A multimap with Seq values. See Data.Multimap.Seq for operations specific to this type.

8. type SetMultimap = Multimap Set

   more-containers	Data.Multimap.Set

   A multimap with Set values. This multimap implementation will automatically deduplicate values per key. For example:

   let mm = fromList [('a', 1), ('a', 1)] :: SetMultimap Char Int
   size mm == 1 -- True
   

   See Data.Multimap.Set for operations specific to this type.

9. fromCountMap :: Ord v => Map v Int -> Multiset v

   more-containers	Data.Multiset

   O(m * log m) Builds a multiset from a map. Negative counts are ignored.

10. toCountMap :: Multiset v -> Map v Int

    more-containers	Data.Multiset

    O(1) Converts the multiset to a map of (positive) counts.

Page 1196 of many | Previous | Next