Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. (=$&) :: forall c1 c2 c3 i x (m :: Type -> Type) o r . CCatable c1 c2 c3 => c1 i x m () -> c2 x o m r -> c3 i o m r

   stm-conduit	Data.Conduit.Async

   An alias for =$=& by analogy with =$= and =$.

2. (=$=&) :: forall c1 c2 c3 i x (m :: Type -> Type) o r . CCatable c1 c2 c3 => c1 i x m () -> c2 x o m r -> c3 i o m r

   stm-conduit	Data.Conduit.Async

   An operator form of buffer'. In general you should be able to replace any use of =$= with =$=& and $$ either with $$& or =$= and runCConduit and suddenly reap the benefit of concurrency, if your conduits were spending time waiting on each other.

   >>> runCConduit $ CL.sourceList [1,2,3] =$=& CL.consume
   [1,2,3]
   

3. (:$$:) :: ErrorMessage -> ErrorMessage -> ErrorMessage

   type-errors	Type.Errors

   Stack two pieces of error message on top of each other.

4. (<$) :: Functor f => a -> f b -> f a

   LambdaHack	Game.LambdaHack.Core.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
   

5. (<$) :: Functor f => a -> f b -> f a

   LambdaHack	Game.LambdaHack.Core.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
   

6. (<$!>) :: Monad m => (a -> b) -> m a -> m b

   LambdaHack	Game.LambdaHack.Core.Prelude

   Strict version of <$>.

7. (<$$>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b)

   LambdaHack	Game.LambdaHack.Core.Prelude

   No documentation available.

8. (<$>) :: Functor f => (a -> b) -> f a -> f b

   LambdaHack	Game.LambdaHack.Core.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)
   

9. (<$) :: (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.

10. (<$>) :: (Traversable f, Backprop a, Backprop b, Reifies s W) => (BVar s a -> BVar s b) -> BVar s (f a) -> BVar s (f b)

    backprop	Prelude.Backprop

    Alias for fmap.

Page 64 of many | Previous | Next