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. mapM :: MonadParallel m => (a -> m b) -> [a] -> m [b]

   monad-parallel	Control.Monad.Parallel

   Like mapM, but applying the function to the individual list items in parallel.

2. mapM_ :: MonadParallel m => (a -> m b) -> [a] -> m ()

   monad-parallel	Control.Monad.Parallel

   Like mapM_, but applying the function to the individual list items in parallel.

3. mapException :: (Exception e1, Exception e2) => (e1 -> e2) -> a -> a

   monad-peel	Control.Exception.Peel

   This function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions".

4. mapG :: (InsertLeft t b, Monoid (t b)) => (a -> b) -> t a -> t b

   monoid-insertleft	Data.InsertLeft

   Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming 9 (4): 355–372, July 1999. that is available at the URL: https://www.cs.nott.ac.uk/~pszgmh/fold.pdf. Acts similarly to the map function from Prelude.

5. mapAccumL :: MonoidNull v2 => (s -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

   monoidmap-internal	Data.MonoidMap.Internal

   Threads an accumulating argument through the map in ascending order of keys. Satisfies the following property:

   mapAccumL f s m ==
   fmap fromMap (Traversable.mapAccumL f s (toMap m))
   

6. mapAccumLWithKey :: MonoidNull v2 => (s -> k -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

   monoidmap-internal	Data.MonoidMap.Internal

   Threads an accumulating argument through the map in ascending order of keys. Satisfies the following property:

   mapAccumLWithKey f s m ==
   fmap fromMap (Map.mapAccumWithKey f s (toMap m))
   

7. mapAccumR :: MonoidNull v2 => (s -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

   monoidmap-internal	Data.MonoidMap.Internal

   Threads an accumulating argument through the map in descending order of keys. Satisfies the following property:

   mapAccumR f s m ==
   fmap fromMap (Traversable.mapAccumR f s (toMap m))
   

8. mapAccumRWithKey :: MonoidNull v2 => (s -> k -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

   monoidmap-internal	Data.MonoidMap.Internal

   Threads an accumulating argument through the map in descending order of keys. Satisfies the following property:

   mapAccumRWithKey f s m ==
   fmap fromMap (Map.mapAccumRWithKey f s (toMap m))
   

9. mapKeys :: (Ord k2, MonoidNull v) => (k1 -> k2) -> MonoidMap k1 v -> MonoidMap k2 v

   monoidmap-internal	Data.MonoidMap.Internal

   Applies a function to all the keys of a MonoidMap that are associated with non-null values. If the resultant map would contain more than one value for the same key, values are combined together in ascending key order with the (<>) operator. Satisfies the following property for all possible keys k:

   get k (mapKeys f m) ==
   foldMap
   (`get` m)
   (filter ((==) k . f) (nonNullKeys m))
   

10. mapKeysWith :: (Ord k2, MonoidNull v) => (v -> v -> v) -> (k1 -> k2) -> MonoidMap k1 v -> MonoidMap k2 v

    monoidmap-internal	Data.MonoidMap.Internal

    Applies a function to all the keys of a MonoidMap that are associated with non-null values, with a combining function for values. If the resultant map would contain more than one value for the same key, values are combined together in ascending key order with the given combining function. Satisfies the following property:

    mapKeysWith c f == fromListWith c . fmap (first f) . toList
    

Page 250 of many | Previous | Next