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.
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.
mapSame :: Eq a => (a -> b) -> Map k (Delta a) -> Map k bpatience 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.
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.
-
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 mapChordToString :: C pitch => [Pitch] -> [pitch] -> [pitch]reactive-midyim Reactive.Banana.MIDI.Guitar No documentation available.
mapAdjacent :: MonadMoment m => (a -> a -> b) -> a -> Event a -> m (Event b)reactive-midyim Reactive.Banana.MIDI.Utility No documentation available.
mapMaybe :: (a -> Maybe b) -> Event a -> Event breactive-midyim Reactive.Banana.MIDI.Utility No documentation available.
-
recover-rtti Debug.RecoverRTTI No documentation available.
mapSome :: (forall (x :: k) . () => f x -> g x) -> Some f -> Some grecover-rtti Debug.RecoverRTTI No documentation available.
mapFrom :: (Generator c, Reducer e m, Monoid m) => (Elem c -> e) -> c -> m -> mreducers Data.Generator No documentation available.