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. mapWriter :: ((a, w) -> (b, w')) -> Writer w a -> Writer w' b

   monadology	Control.Monad.Ology.Specific.WriterT

   Map both the return value and output of a computation using the given function.

   • runWriter (mapWriter f m) = f (runWriter
     m)

2. mapWriterT :: (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n b

   monadology	Control.Monad.Ology.Specific.WriterT

   Map both the return value and output of a computation using the given function.

   • runWriterT (mapWriterT f m) = f
     (runWriterT m)

3. mapFst :: (a -> c) -> (a, b) -> (c, b)

   monoid-transformer	Data.Monoid.State

   No documentation available.

4. mapGroups :: (Collection c2, Monoid (c2 v2), Ord k2) => (Group k1 (c1 v1) -> Group k2 (c2 v2)) -> Multimap c1 k1 v1 -> Multimap c2 k2 v2

   more-containers	Data.Multimap

   Maps over the multimap's groups. This method can be used to convert between specific multimaps, for example:

   let m1 = fromList [('a', 1), ('a', 1)] :: ListMultimap Char Int
   let m2 = mapGroups (fmap Set.fromList) m1 :: SetMultimap Char Int
   

5. mapCounts :: Ord v => (Int -> Int) -> Multiset v -> Multiset v

   more-containers	Data.Multiset

   Maps on the multiset's counts. Groups with resulting non-positive counts will be removed from the final multiset.

6. mapGroups :: Ord v => (Group v -> Group v) -> Multiset v -> Multiset v

   more-containers	Data.Multiset

   Maps on the multiset's groups. Groups with resulting non-positive counts will be removed from the final multiset.

7. mapCont :: (r -> r) -> Cont r a -> Cont r a

   mtl-prelude	MTLPrelude

   Apply a function to transform the result of a continuation-passing computation.

   • runCont (mapCont f m) = f . runCont
     m

8. mapExcept :: (Either e a -> Either e' b) -> Except e a -> Except e' b

   mtl-prelude	MTLPrelude

   Map the unwrapped computation using the given function.

   • runExcept (mapExcept f m) = f (runExcept
     m)

9. mapExceptT :: (m (Either e a) -> n (Either e' b)) -> ExceptT e m a -> ExceptT e' n b

   mtl-prelude	MTLPrelude

   Map the unwrapped computation using the given function.

   • runExceptT (mapExceptT f m) = f
     (runExceptT m)

10. mapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b

    mtl-prelude	MTLPrelude

    Map the return value, final state and output of a computation using the given function.

    • runRWS (mapRWS f m) r s = f (runRWS m r
      s)

Page 309 of many | Previous | Next