Hoogle Search
Within LTS Haskell 24.10 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
functor-combinators Data.Functor.Combinator Infix alias for biget
-- Return the length of either the list, or the Map, depending on which -- one s in the + length !$! length :: ([] :+: Map Int) Char -> Int -- Return the length of both the list and the map, added together Sum . length !$! Sum . length :: Day [] (Map Int) Char -> Sum Int
-
functor-combinators Data.HBifunctor.Associative Infix alias for biget
-- Return the length of either the list, or the Map, depending on which -- one s in the + length !$! length :: ([] :+: Map Int) Char -> Int -- Return the length of both the list and the map, added together Sum . length !$! Sum . length :: Day [] (Map Int) Char -> Sum Int
(
:<$>: ) :: (b -> a) -> f b -> Post a (f :: Type -> Type) bfunctor-combinators Data.HFunctor.Route No documentation available.
(
:>$<: ) :: (a -> b) -> f b -> Pre a (f :: Type -> Type) bfunctor-combinators Data.HFunctor.Route No documentation available.
(
<$> ) :: Functor f => (a -> b) -> f a -> f bihaskell IHaskellPrelude 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)
pattern (
:$$: ) :: () => ErrorMessage -> ErrorMessage -> ErrorMessageincipit-base Incipit.Base Stack two pieces of error message on top of each other.
(
<$ ) :: Functor f => a -> f b -> f aincipit-base Incipit.Base 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 bincipit-base Incipit.Base Strict version of <$>.
(
<$> ) :: Functor f => (a -> b) -> f a -> f bincipit-base Incipit.Base 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)
(
>$ ) :: Contravariant f => b -> f b -> f aincipit-base Incipit.Base Replace all locations in the output with the same value. The default definition is contramap . const, but this may be overridden with a more efficient version.