Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

5. 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)

6. 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)

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

8. mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b

   mtl-prelude	MTLPrelude

   Map the inner computation using the given function.

   • runRWST (mapRWST f m) r s = f (runRWST m
     r s)

9. mapReader :: (a -> b) -> Reader r a -> Reader r b

   mtl-prelude	MTLPrelude

   Transform the value returned by a Reader.

   • runReader (mapReader f m) = f .
     runReader m

10. mapReaderT :: (m a -> n b) -> ReaderT r m a -> ReaderT r n b

    mtl-prelude	MTLPrelude

    Transform the computation inside a ReaderT.

    • runReaderT (mapReaderT f m) = f .
      runReaderT m

Page 310 of many | Previous | Next