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.
mapRTAVars :: (a -> b) -> RTAlias a ty -> RTAlias b tyliquidhaskell-boot Language.Haskell.Liquid.Types.Types No documentation available.
mapLogT :: (m a -> n b) -> LogT m a -> LogT n blog-base Log.Monad Transform the computation inside a LogT.
mapping :: forall (k :: Type -> Type -> Type) a b . Category k => (a -> b) -> Machine (k a) bmachines Data.Machine.Process Apply a function to all values coming from the input This can be constructed from a plan with
mapping :: Category k => (a -> b) -> Machine (k a) b mapping f = repeatedly $ await >>= yield . f
Examples:>>> runT $ mapping (*2) <~ source [1..3] [2,4,6]
-
Syntax sugar for defining maps Haskell's canonical list of tuples syntax for defining maps is not very convenient and also has ambiguous semantics. This package leverages do notation to create a lighter syntax that makes semantics explicit and also allows the option of fail-fast handling of duplicate keys.
mapK :: (k1 -> k2) -> MapSyntaxM k1 v a -> MapSyntax k2 vmap-syntax Data.Map.Syntax Maps a function over all the keys.
mapV :: (v1 -> v2) -> MapSyntaxM k v1 a -> MapSyntax k v2map-syntax Data.Map.Syntax Maps a function over all the values.
-
mfsolve Math.MFSolve map an expression using the given substitution.
mapSimple :: (Floating m, Floating n) => (n -> m) -> (v -> u) -> SimpleExpr v n -> SimpleExpr u mmfsolve Math.MFSolve map a simple expression using the given substitution.
mapM :: MonadParallel m => (a -> m b) -> [a] -> m [b]monad-parallel Control.Monad.Parallel Like mapM, but applying the function to the individual list items in parallel.
mapM_ :: MonadParallel m => (a -> m b) -> [a] -> m ()monad-parallel Control.Monad.Parallel Like mapM_, but applying the function to the individual list items in parallel.