Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. module Data.IntMap.Monoidal

   This module provides a IntMap variant which uses the value's Monoid instance to accumulate conflicting entries when merging Maps. While some functions mirroring those of IntMap are provided here for convenience, more specialized needs will likely want to use either the Newtype or Wrapped instances to manipulate the underlying Map.

2. newtype MonoidalIntMap a

   monoidal-containers	Data.IntMap.Monoidal

   An IntMap with monoidal accumulation

3. MonoidalIntMap :: IntMap a -> MonoidalIntMap a

   monoidal-containers	Data.IntMap.Monoidal

   No documentation available.

4. getMonoidalIntMap :: MonoidalIntMap a -> IntMap a

   monoidal-containers	Data.IntMap.Monoidal

   No documentation available.

5. newtype MonoidalIntMap a

   monoidal-containers	Data.IntMap.Monoidal.Strict

   An IntMap with monoidal accumulation

6. MonoidalIntMap :: IntMap a -> MonoidalIntMap a

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

7. getMonoidalIntMap :: MonoidalIntMap a -> IntMap a

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

8. module Data.Map.Monoidal

   This module provides a Map variant which uses the value's Monoid instance to accumulate conflicting entries when merging Maps. While some functions mirroring those of Map are provided here for convenience, more specialized needs will likely want to use either the Newtype or Wrapped instances to manipulate the underlying Map.

9. newtype MonoidalMap k a

   monoidal-containers	Data.Map.Monoidal

   A Map with monoidal accumulation

10. MonoidalMap :: Map k a -> MonoidalMap k a

    monoidal-containers	Data.Map.Monoidal

    No documentation available.

Page 1317 of many | Previous | Next