Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapWithKey :: MonoidNull v2 => (k -> v1 -> v2) -> MonoidMap k v1 -> MonoidMap k v2

   monoidmap-internal	Data.MonoidMap.Internal

   Applies a key-dependent function to all non-null values of a MonoidMap. Satisfies the following properties for all functions f:

   (nonNullKey k m) ==> (get k (mapWithKey f m) == f k (get k m))
   (   nullKey k m) ==> (get k (mapWithKey f m) == mempty       )
   

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

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

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

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

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

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

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

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

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

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

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

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

   No documentation available.

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

   multiset	Data.IntMultiSet

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

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

   multiset	Data.IntMultiSet

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

10. 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
    

Page 251 of many | Previous | Next