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. foldMapWithKey :: forall a m . Monoid m => (Int -> a -> m) -> MonoidalIntMap a -> m

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

2. getMonoidalIntMap :: MonoidalIntMap a -> IntMap a

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

3. isProperSubmapOf :: Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

4. isProperSubmapOfBy :: (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

5. isSubmapOf :: Eq a => MonoidalIntMap a -> MonoidalIntMap a -> Bool

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

6. isSubmapOfBy :: (a -> b -> Bool) -> MonoidalIntMap a -> MonoidalIntMap b -> Bool

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

7. newtype MonoidalMap k a

   monoidal-containers	Data.Map.Monoidal

   A Map with monoidal accumulation

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

   monoidal-containers	Data.Map.Monoidal

   No documentation available.

9. foldMapWithKey :: forall k a m . Monoid m => (k -> a -> m) -> MonoidalMap k a -> m

   monoidal-containers	Data.Map.Monoidal

   No documentation available.

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

    monoidal-containers	Data.Map.Monoidal

    No documentation available.

Page 951 of many | Previous | Next