Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapChangeT :: (m (a, Any) -> n (b, Any)) -> ChangeT m a -> ChangeT n bAgda Agda.Utils.Update Map a ChangeT computation (monad transformer action).
mapMonotonic :: (Key -> Key) -> IntSet -> IntSetAgda Agda.Utils.VarSet The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:
and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapMonotonic f s == map f s where ls = toList s
mapValue :: forall a (b :: Bool) . Boolean a => (a -> a) -> WithDefault' a b -> WithDefault' a bAgda Agda.Utils.WithDefault Only modify non-Default values.
mapRhs :: (SentForm -> SentForm) -> Rul f -> Rul fBNFC BNFC.CF mapHead :: (a -> a) -> [a] -> [a]BNFC BNFC.Utils Apply a function to the head of a list.
mapWithinMap :: Ord k => (a -> a) -> [k] -> Map k a -> Map k aHastructure Util No documentation available.
mapPositions :: (Position -> Position) -> Fix -> FixShellCheck ShellCheck.Fixer No documentation available.
mapFilterE :: (a -> Maybe b) -> Event a -> Event bYampa FRP.Yampa Combined event mapping and filtering. Note: since Event is a Functor, see fmap for a simpler version of this function with no filtering.
mapMerge :: (a -> c) -> (b -> c) -> (a -> b -> c) -> Event a -> Event b -> Event cYampa FRP.Yampa A generic event merge-map utility that maps event occurrences, merging the results. The first three arguments are mapping functions, the third of which will only be used when both events are present. Therefore, mergeBy = mapMerge id id. Applicative-based definition: mapMerge lf rf lrf le re = (f $ le * re) | (lf $ le) | (rf $ re)
mapFilterE :: (a -> Maybe b) -> Event a -> Event bYampa FRP.Yampa.Event Combined event mapping and filtering. Note: since Event is a Functor, see fmap for a simpler version of this function with no filtering.