Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

  1. for :: (Contiguous arr1, Contiguous arr2, Element arr1 a, Element arr2 b, Applicative f) => arr1 a -> (a -> f b) -> f (arr2 b)

    contiguous Data.Primitive.Contiguous

    for is traverse with its arguments flipped. For a version that ignores the results see for_.

  2. for :: forall (m :: Type -> Type) r x . Monad m => ByteStream m r -> (ByteString -> ByteStream m x) -> ByteStream m r

    streaming-bytestring Streaming.ByteString

    for xs f applies f to each chunk in the stream, and concatenates the resulting streams. Generalised in 0.2.4 to match streaming: the callback's (ignored) return value can be of any type.

  3. for :: forall t a f (es :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) (c :: (Type -> Type) -> Constraint) . (Free c ff, f ~ Eff ff es, For t :> es) => t (f a) -> f (t a)

    data-effects Data.Effect.Concurrent.Parallel

    Executes in parallel the actions stored within a Traversable container t.

  4. for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)

    cabal-install-solver Distribution.Solver.Compat.Prelude

    for is traverse with its arguments flipped. For a version that ignores the results see for_.

  5. for :: Monad m => Int -> Int -> (Int -> m ()) -> m ()

    dense-linear-algebra Statistics.Matrix

    Simple for loop. Counts from start to end-1.

  6. for :: Monad m => Int -> Int -> (Int -> m ()) -> m ()

    dense-linear-algebra Statistics.Matrix.Function

    Simple for loop. Counts from start to end-1.

  7. for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)

    incipit-base Incipit.Base

    for is traverse with its arguments flipped. For a version that ignores the results see for_.

  8. for :: forall t s e (m :: Type -> Type) a . (HasTime t s, Monoid e) => t -> Wire s e m a a

    netwire Control.Wire.Interval

    For the given time period.

    • Depends: now for the given time period.
    • Inhibits: after the given time period.

  9. for :: Functor m => m a -> (a -> b) -> m b

    Agda Agda.Utils.Functor

    The true pure for loop. for is a misnomer, it should be forA.

  10. for :: [a] -> (a -> b) -> [b]

    BNFC BNFC.Utils

    Non-monadic forM.

Page 3 of many | Previous | Next