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

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

   reactive-midyim	Reactive.Banana.MIDI.Guitar

   No documentation available.

3. mapAdjacent :: MonadMoment m => (a -> a -> b) -> a -> Event a -> m (Event b)

   reactive-midyim	Reactive.Banana.MIDI.Utility

   No documentation available.

4. mapMaybe :: (a -> Maybe b) -> Event a -> Event b

   reactive-midyim	Reactive.Banana.MIDI.Utility

   No documentation available.

5. mapClassifier :: Applicative m => (forall a . () => o a -> m (o' a)) -> forall a . () => Classifier_ o a -> m (Classifier_ o' a)

   recover-rtti	Debug.RecoverRTTI

   No documentation available.

6. mapSome :: (forall (x :: k) . () => f x -> g x) -> Some f -> Some g

   recover-rtti	Debug.RecoverRTTI

   No documentation available.

7. mapFrom :: (Generator c, Reducer e m, Monoid m) => (Elem c -> e) -> c -> m -> m

   reducers	Data.Generator

   No documentation available.

8. mapReduce :: (Generator c, Reducer e m, Monoid m) => (Elem c -> e) -> c -> m

   reducers	Data.Generator

   No documentation available.

9. mapReduceWith :: (Generator c, Reducer e m, Monoid m) => (m -> n) -> (Elem c -> e) -> c -> n

   reducers	Data.Generator

   No documentation available.

10. mapTo :: (Generator c, Reducer e m, Monoid m) => (Elem c -> e) -> m -> c -> m

    reducers	Data.Generator

    No documentation available.

Page 297 of many | Previous | Next