fmap

base Prelude Control.Monad Control.Monad.Instances Data.Functor GHC.Base, hedgehog Hedgehog.Internal.Prelude, semigroupoids Data.Functor.Apply Data.Functor.Bind Semigroupoids.Do, base-compat Control.Monad.Compat Data.Functor.Compat Prelude.Compat, comonad Control.Comonad, protolude Protolude.Functor, relude Relude.Functor.Reexport, base-prelude BasePrelude, classy-prelude ClassyPrelude, Cabal-syntax Distribution.Compat.Prelude, universum Universum.Functor.Reexport, ihaskell IHaskellPrelude, basement Basement.Compat.Base Basement.Imports, numhask NumHask.Prelude, base-compat-batteries Control.Monad.Compat, github GitHub.Internal.Prelude, foundation Foundation, ghc-lib-parser GHC.Prelude.Basic, dimensional Numeric.Units.Dimensional.Prelude, ghc-internal GHC.Internal.Base GHC.Internal.Control.Monad GHC.Internal.Data.Functor, haxl Haxl.Prelude, rebase Rebase.Prelude, quaalude Essentials, hledger Hledger.Cli.Script, mixed-types-num Numeric.MixedTypes.PreludeHiding, xmonad-contrib XMonad.Config.Prime, constrained-categories Control.Category.Hask, copilot-language Copilot.Language.Prelude, massiv-test Test.Massiv.Utils, incipit-base Incipit.Base, opt-env-conf OptEnvConf.Parser, LambdaHack Game.LambdaHack.Core.Prelude Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, can-i-haz Control.Monad.Except.CoHas Control.Monad.Reader.Has, vcr Imports, verset Verset, distribution-opensuse OpenSuse.Prelude OpenSuse.Prelude, hledger-web Hledger.Web.Import, termonad Termonad.Prelude
fmap is used to apply a function of type (a -> b) to a value of type f a, where f is a functor, to produce a value of type f b. Note that for any type constructor with more than one parameter (e.g., Either), only the last type parameter can be modified with fmap (e.g., b in `Either a b`). Some type constructors with two parameters or more have a Bifunctor instance that allows both the last and the penultimate parameters to be mapped over.

Examples

Convert from a Maybe Int to a Maybe String using show:
>>> fmap show Nothing
Nothing

>>> fmap show (Just 3)
Just "3"
Convert from an Either Int Int to an Either Int String using show:
>>> fmap show (Left 17)
Left 17

>>> fmap show (Right 17)
Right "17"
Double each element of a list:
>>> fmap (*2) [1,2,3]
[2,4,6]
Apply even to the second element of a pair:
>>> fmap even (2,2)
(2,True)
It may seem surprising that the function is only applied to the last element of the tuple compared to the list example above which applies it to every element in the list. To understand, remember that tuples are type constructors with multiple type parameters: a tuple of 3 elements (a,b,c) can also be written (,,) a b c and its Functor instance is defined for Functor ((,,) a b) (i.e., only the third parameter is free to be mapped over with fmap). It explains why fmap can be used with tuples containing values of different types as in the following example:
>>> fmap even ("hello", 1.0, 4)
("hello",1.0,True)
Using ApplicativeDo: 'fmap f as' can be understood as the do expression
do a <- as
pure (f a)
with an inferred Functor constraint.
Alphabetical synonym for <$>
Lifted fmap. Lifts backpropagatable functions to be backpropagatable functions on Traversable Functors.
fmap, but taking explicit add and zero.
fmap, but with Num constraints instead of Backprop constraints.
This module contains useful functions to work with Functor type class.
Synonym of Map to avoid name clashes.
This module contains useful functions to work with Functor type class.
This function may be used as a value for fmap in a Functor instance, provided that traverse is defined. (Using fmapDefault with a Traversable instance defined only by sequenceA will result in infinite recursion.)
fmapDefault f ≡ runIdentity . traverse (Identity . f)
fmap specialized to Either, given a name symmetric to fmapL
fmap specialized to ExceptT, given a name symmetric to fmapLT
Map a function over the Left value of an Either
Map a function over the Left value of an ExceptT