Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
>$$< ) :: [Expr] -> [Expr] -> [Expr]code-conjure Conjure.Expr Lists valid applications between lists of Exprs
> [notE, plus] >$$< [false, true, zero] [not False :: Bool,not True :: Bool,(0 +) :: Int -> Int]
(
<$ ) :: Functor f => a -> f b -> f aconfiguration-tools Configuration.Utils.CommandLine 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 -> b) -> f a -> f bconfiguration-tools Configuration.Utils.CommandLine An infix synonym for fmap. The name of this operator is an allusion to $. Note the similarities between their types:
($) :: (a -> b) -> a -> b (<$>) :: Functor f => (a -> b) -> f a -> f b
Whereas $ is function application, <$> is function application lifted over a Functor.Examples
Convert from a Maybe Int to a Maybe String using show:>>> show <$> Nothing Nothing
>>> show <$> Just 3 Just "3"
Convert from an Either Int Int to an Either Int String using show:>>> show <$> Left 17 Left 17
>>> show <$> Right 17 Right "17"
Double each element of a list:>>> (*2) <$> [1,2,3] [2,4,6]
Apply even to the second element of a pair:>>> even <$> (2,2) (2,True)
(
<$< ) :: Functor f => (b -> c) -> f (a -> b) -> f (a -> c)configuration-tools Configuration.Utils.Operators Applicative functional composition between a pure function and an applicative function.
(
>$> ) :: Functor f => f (a -> b) -> (b -> c) -> f (a -> c)configuration-tools Configuration.Utils.Operators Applicative functional composition between a pure function and an applicative function with its arguments flipped.
-
construct Construct (
<$ ) :: Functor f => a -> f b -> f acontrol-monad-free Control.Monad.Free 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
(
<$!> ) :: Monad m => (a -> b) -> m a -> m bcontrol-monad-free Control.Monad.Free Strict version of <$>.
(
<$ ) :: Functor f => a -> f b -> f adimensional Numeric.Units.Dimensional.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.
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 -> b) -> f a -> f bdimensional Numeric.Units.Dimensional.Prelude An infix synonym for fmap. The name of this operator is an allusion to $. Note the similarities between their types:
($) :: (a -> b) -> a -> b (<$>) :: Functor f => (a -> b) -> f a -> f b
Whereas $ is function application, <$> is function application lifted over a Functor.Examples
Convert from a Maybe Int to a Maybe String using show:>>> show <$> Nothing Nothing
>>> show <$> Just 3 Just "3"
Convert from an Either Int Int to an Either Int String using show:>>> show <$> Left 17 Left 17
>>> show <$> Right 17 Right "17"
Double each element of a list:>>> (*2) <$> [1,2,3] [2,4,6]
Apply even to the second element of a pair:>>> even <$> (2,2) (2,True)