Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapAccumLWithKey :: (s -> k -> v1 -> (s, v2)) -> s -> Map k v1 -> (s, Map k v2)

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

2. mapAccumR :: (s -> v1 -> (s, v2)) -> s -> Map k v1 -> (s, Map k v2)

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

3. mapAccumRWithKey :: (s -> k -> v1 -> (s, v2)) -> s -> Map k v1 -> (s, Map k v2)

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

4. mapWithKey :: (k -> v1 -> v2) -> Map k v1 -> Map k v2

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

5. mapContM :: (a -> (b -> m c) -> m c) -> [a] -> ([b] -> m c) -> m c

   mtl-misc-yj	Control.Monad.Cont.MiscYj

   No documentation available.

6. mapEither :: (Key -> Either Key Key) -> IntMultiSet -> (IntMultiSet, IntMultiSet)

   multiset	Data.IntMultiSet

   O(n). Map and separate the Left and Right results.

7. mapMaybe :: (Key -> Maybe Key) -> IntMultiSet -> IntMultiSet

   multiset	Data.IntMultiSet

   O(n). Map and collect the Just results.

8. mapMonotonic :: (Key -> Key) -> IntMultiSet -> IntMultiSet

   multiset	Data.IntMultiSet

   O(n). mapMonotonic f s == map f s, but works only when f is strictly monotonic. The precondition is not checked. Semi-formally, we have:

   and [x < y ==> f x < f y | x <- ls, y <- ls]
   ==> mapMonotonic f s == map f s
   where ls = toList s
   

9. mapEither :: (Ord b, Ord c) => (a -> Either b c) -> MultiSet a -> (MultiSet b, MultiSet c)

   multiset	Data.MultiSet

   O(n). Map and separate the Left and Right results.

10. mapMaybe :: Ord b => (a -> Maybe b) -> MultiSet a -> MultiSet b

    multiset	Data.MultiSet

    O(n). Map and collect the Just results.

Page 253 of many | Previous | Next