Hoogle Search

Within LTS Haskell 24.22 (ghc-9.10.3)

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

  1. ($$&) :: 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]

  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 alias for =$=& by analogy with =$= and $=.

  3. (=$&) :: 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 =$.

  4. (=$=&) :: 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]

  5. ($&) :: Applicative f => f (a -> b) -> f a -> f b

    synthesizer-dimensional Synthesizer.Dimensional.Signal

    No documentation available.

  6. type (:&) = 'Union

    bluefin-internal Bluefin.Internal 

    type (:&) :: Effects -> Effects -> Effects
    Union of effects

  7. (.&&.) :: VR -> VR -> VR

    cabal-install-solver Distribution.Solver.Modular.Version

    Intersect two version ranges.

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

    incipit-base Incipit.Base

    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. (.&&.) :: (a -> Bool) -> (a -> Bool) -> a -> Bool

    liquidhaskell-boot Language.Haskell.Liquid.Misc

    No documentation available.

  10. (=&=) :: (MonadState (Dependencies v n) m, MonadError (DepError v n) m, Eq v, Hashable v, Hashable n, RealFrac n, Floating n, Ord v) => (Expr v n, Expr v n) -> (Expr v n, Expr v n) -> m ()

    mfsolve Math.MFSolve

    Make the pairs of expressions on both sides equal. No error is signaled if the equation for one of the sides is Redundant for example in (x, 0) == (y, 0).

Page 36 of many | Previous | Next