<$ is:exact

(<$) :: Functor f => a -> f b -> f a
base Prelude Control.Monad Control.Applicative Control.Monad.Instances Data.Functor GHC.Base, hedgehog Hedgehog.Internal.Prelude, semigroupoids Data.Functor.Apply Data.Functor.Bind, base-compat Control.Monad.Compat Data.Functor.Compat Prelude.Compat, comonad Control.Comonad, protolude Protolude.Functor, relude Relude.Functor.Reexport, diagrams-lib Diagrams.Prelude, rio RIO.Prelude, graphviz Data.GraphViz.Parsing, Cabal-syntax Distribution.Compat.Prelude, ihaskell IHaskellPrelude, numhask NumHask.Prelude, base-compat-batteries Control.Monad.Compat, ghc-lib-parser GHC.Prelude.Basic, Agda Agda.Utils.Monad, ghc-internal GHC.Internal.Base GHC.Internal.Control.Monad GHC.Internal.Data.Functor, dimensional Numeric.Units.Dimensional.Prelude, rebase Rebase.Prelude, threepenny-gui Graphics.UI.Threepenny.Core, configuration-tools Configuration.Utils.CommandLine, mixed-types-num Numeric.MixedTypes.PreludeHiding, xmonad-contrib XMonad.Config.Prime, 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, verset Verset
Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

Examples

Perform a computation with Maybe and replace the result with a constant value if it is Just: 
>>> 'a' <$ Just 2
Just 'a'

>>> 'a' <$ Nothing
Nothing
(<$) :: Functor f => a -> f b -> f a
ghc GHC.Prelude.Basic
(<$) :: Functor f => a -> f b -> f a
base-prelude BasePrelude BasePrelude.Operators, classy-prelude ClassyPrelude, basic-prelude CorePrelude, basement Basement.Compat.Base Basement.Imports, foundation Foundation, quaalude Essentials, constrained-categories Control.Category.Hask, appar Text.Appar.ByteString Text.Appar.LazyByteString Text.Appar.String, can-i-haz Control.Monad.Except.CoHas Control.Monad.Reader.Has, distribution-opensuse OpenSuse.Prelude OpenSuse.Prelude, frisby Text.Parsers.Frisby
Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.
(<$) :: Functor f => a -> f b -> f a
numeric-prelude NumericPrelude NumericPrelude.Base, clash-prelude Clash.HaskellPrelude, yesod-paginator Yesod.Paginator.Prelude
Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version. Using ApplicativeDo: 'a <$ bs' can be understood as the do expression 
do bs
pure a
with an inferred Functor constraint.
type family (arg :: a) <$ (arg1 :: f b) :: f a
singletons-base Control.Applicative.Singletons
(<$) :: (Contiguous arr1, Contiguous arr2, Element arr1 b, Element arr2 a) => a -> arr1 b -> arr2 a
contiguous Data.Primitive.Contiguous
Replace all locations in the input with the same value. Equivalent to Data.Functor.<$.
(<$) :: (Traversable f, Backprop b, Backprop (f a), Reifies s W) => BVar s b -> BVar s (f a) -> BVar s (f b)
backprop Prelude.Backprop
Alias for fmapConst.
(<$) :: (Functor f, Foldable f, Num b, Num (f a), Reifies s W) => BVar s b -> BVar s (f a) -> BVar s (f b)
backprop Prelude.Backprop.Num
Alias for fmapConst.
(<$) :: (Eq a, Show a, Functor m, AlternativeFail n) => a -> Format m n s () -> Format m n s a
construct Construct
Same as the usual <$ except a Format is no Functor.