Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. (<&&>) :: Selective f => f Bool -> f Bool -> f Bool

   rebase	Rebase.Prelude

   A lifted version of lazy Boolean AND.

2. (<&>) :: Functor f => f a -> (a -> b) -> f b

   rebase	Rebase.Prelude

   Flipped version of <$>.

   (<&>) = flip fmap
   

   Examples

   Apply (+1) to a list, a Just and a Right:

   >>> Just 2 <&> (+1)
   Just 3
   

   >>> [1,2,3] <&> (+1)
   [2,3,4]
   

   >>> Right 3 <&> (+1)
   Right 4
   

3. (<&>) :: Functor f => f a -> (a -> b) -> f b

   turtle	Turtle

   Flipped version of <$>.

   (<&>) = flip fmap
   

   Examples

   Apply (+1) to a list, a Just and a Right:

   >>> Just 2 <&> (+1)
   Just 3
   

   >>> [1,2,3] <&> (+1)
   [2,3,4]
   

   >>> Right 3 <&> (+1)
   Right 4
   

4. (.&&.) :: Monad m => m ExitCode -> m ExitCode -> m ExitCode

   turtle	Turtle.Prelude

   Analogous to && in Bash Runs the second command only if the first one returns ExitSuccess

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

   base-prelude	BasePrelude

   Flipped version of <$>.

   (<&>) = flip fmap
   

   Examples

   Apply (+1) to a list, a Just and a Right:

   >>> Just 2 <&> (+1)
   Just 3
   

   >>> [1,2,3] <&> (+1)
   [2,3,4]
   

   >>> Right 3 <&> (+1)
   Right 4
   

6. (.&.) :: Bits a => a -> a -> a

   base-prelude	BasePrelude.Operators

   Bitwise "and"

7. (<&>) :: Functor f => f a -> (a -> b) -> f b

   base-prelude	BasePrelude.Operators

   Flipped version of <$>.

   (<&>) = flip fmap
   

   Examples

   Apply (+1) to a list, a Just and a Right:

   >>> Just 2 <&> (+1)
   Just 3
   

   >>> [1,2,3] <&> (+1)
   [2,3,4]
   

   >>> Right 3 <&> (+1)
   Right 4
   

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

   hledger	Hledger.Cli.Script

   Flipped version of <$>.

   (<&>) = flip fmap
   

   Examples

   Apply (+1) to a list, a Just and a Right:

   >>> Just 2 <&> (+1)
   Just 3
   

   >>> [1,2,3] <&> (+1)
   [2,3,4]
   

   >>> Right 3 <&> (+1)
   Right 4
   

9. (:&:) :: forall t (ts1 :: [Type]) . !t -> !HVect ts1 -> HVect (t ': ts1)

   hvect	Data.HVect

   No documentation available.

10. ($$&) :: forall c1 c2 (c3 :: Type -> Type -> (Type -> Type) -> Type -> Type) m x r . (CCatable c1 c2 c3, CRunnable c3, RunConstraints c3 m) => c1 () x m () -> c2 x Void m r -> 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 suddenly reap the benefit of concurrency, if your conduits were spending time waiting on each other. The underlying monad must always be an instance of 'MonadBaseControl IO'. If at least one of the two conduits is a CFConduit, it must additionally be a in instance of MonadResource.

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

    It can be combined with $=& and $=. This creates two threads; the first thread produces the list and the second thread does the map and the consume:

    >>> CL.sourceList [1,2,3] $$& mapC (*2) $= CL.consume
    [2,4,6]
    

    This creates three threads. The three conduits all run in their own threads:

    >>> CL.sourceList [1,2,3] $$& mapC (*2) $=& CL.consume
    [2,4,6]
    

    >>> CL.sourceList [1,2,3] $$& (mapC (*2) $= mapC (+1)) $=& CL.consume
    [3,5,7]
    

Page 35 of many | Previous | Next