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.
module Data.MonoidMap.Examples.
NestedMonoidMap A nested map with compound keys, implemented in terms of MonoidMap.
-
monoidmap-examples Data.MonoidMap.Examples.NestedMonoidMap No documentation available.
fromFlatMap :: (Ord k1, Ord k2, MonoidNull v) => Map (k1, k2) v -> NestedMonoidMap k1 k2 vmonoidmap-examples Data.MonoidMap.Examples.NestedMonoidMap No documentation available.
fromNestedMap :: (Ord k2, MonoidNull v) => Map k1 (Map k2 v) -> NestedMonoidMap k1 k2 vmonoidmap-examples Data.MonoidMap.Examples.NestedMonoidMap No documentation available.
-
monoidmap-examples Data.MonoidMap.Examples.NestedMonoidMap No documentation available.
-
monoidmap-examples Data.MonoidMap.Examples.NestedMonoidMap No documentation available.
toFlatMap :: (Ord k1, Ord k2, MonoidNull v) => NestedMonoidMap k1 k2 v -> Map (k1, k2) vmonoidmap-examples Data.MonoidMap.Examples.NestedMonoidMap No documentation available.
toNestedMap :: NestedMonoidMap k1 k2 v -> Map k1 (Map k2 v)monoidmap-examples Data.MonoidMap.Examples.NestedMonoidMap No documentation available.
-
This modules provides a strict multimap implementation. To avoid collision with Prelude functions, it is recommended to import this module qualified:
import qualified Data.Multiset as Mmap
All complexities below use m for the number of distinct keys and n for the total number of entries in the multimap. type
ListMultimap = Multimap []more-containers Data.Multimap 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.