Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

Exact lookup

1. mapMultiWriterT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiWriterT w m a -> MultiWriterT w m' a'

   multistate	Control.Monad.Trans.MultiWriter.Strict

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

2. mapWire :: (Monad m', Monad m) => (forall a1 . () => m' a1 -> m a1) -> Wire s e m' a b -> Wire s e m a b

   netwire	Control.Wire.Core

   Apply the given monad morphism to the wire's underlying monad.

3. mapNew :: (a -> b) -> Map k (Delta a) -> Map k b

   patience	Patience.Map

   Map over all New values, returning a map of just the transformed values. This can be more efficient than calling toNew and then Data.Map's map.

4. mapNew' :: (a -> a) -> Map k (Delta a) -> Map k (Delta a)

   patience	Patience.Map

   Map over all the New values, preserving the remaining values in the map.

5. mapOld :: (a -> b) -> Map k (Delta a) -> Map k b

   patience	Patience.Map

   Map over all Old values, returning a map of just the transformed values. This can be more efficient than calling toOld and then Data.Map's map.

6. mapOld' :: (a -> a) -> Map k (Delta a) -> Map k (Delta a)

   patience	Patience.Map

   Map over all the Old values, preserving the remaining values in the map.

7. mapSame :: Eq a => (a -> b) -> Map k (Delta a) -> Map k b

   patience	Patience.Map

   Map over all Same values, returning a map of just the transformed values. This can be more efficient than calling toSame and then Data.Map's map.

8. mapSame' :: Eq a => (a -> a) -> Map k (Delta a) -> Map k (Delta a)

   patience	Patience.Map

   Map over all the Same values, preserving the remaining values in the map.

9. maps :: forall (m :: Type -> Type) g f x . (Monad m, Functor g) => (forall r . () => f r -> g r) -> FreeT f m x -> FreeT g m x

   pipes-group	Pipes.Group

   Transform each individual functor layer of a FreeT You can think of this as:

   maps
   :: (forall r . Producer a m r -> Producer b m r)
   -> FreeT (Producer a m) m x -> FreeT (Producer b m) m x
   

   This is just a synonym for transFreeT

10. mapChordToString :: C pitch => [Pitch] -> [pitch] -> [pitch]

    reactive-midyim	Reactive.Banana.MIDI.Guitar

    No documentation available.

Page 297 of many | Previous | Next