Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)

    LambdaHack Game.LambdaHack.Core.Prelude

    Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see sequence_.

    Examples

    Basic usage: The first two examples are instances where the input and and output of sequence are isomorphic. 
    >>> sequence $ Right [1,2,3,4]
[Right 1,Right 2,Right 3,Right 4]

    >>> sequence $ [Right 1,Right 2,Right 3,Right 4]
Right [1,2,3,4]
    The following examples demonstrate short circuit behavior for sequence. 
    >>> sequence $ Left [1,2,3,4]
Left [1,2,3,4]

    >>> sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4]
Left 0

  2. sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)

    LambdaHack Game.LambdaHack.Core.Prelude

    Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see sequence_.

    Examples

    Basic usage: The first two examples are instances where the input and and output of sequence are isomorphic. 
    >>> sequence $ Right [1,2,3,4]
[Right 1,Right 2,Right 3,Right 4]

    >>> sequence $ [Right 1,Right 2,Right 3,Right 4]
Right [1,2,3,4]
    The following examples demonstrate short circuit behavior for sequence. 
    >>> sequence $ Left [1,2,3,4]
Left [1,2,3,4]

    >>> sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4]
Left 0

  3. sequence :: TxIn -> !Word32

    haskoin-core Haskoin.Transaction.Common

    lock-time using sequence numbers (BIP-68)

  4. sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)

    incipit-base Incipit.Base

    Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see sequence_.

    Examples

    Basic usage: The first two examples are instances where the input and and output of sequence are isomorphic. 
    >>> sequence $ Right [1,2,3,4]
[Right 1,Right 2,Right 3,Right 4]

    >>> sequence $ [Right 1,Right 2,Right 3,Right 4]
Right [1,2,3,4]
    The following examples demonstrate short circuit behavior for sequence. 
    >>> sequence $ Left [1,2,3,4]
Left [1,2,3,4]

    >>> sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4]
Left 0

  5. sequence :: MonadParallel m => [m a] -> m [a]

    monad-parallel Control.Monad.Parallel

    Like sequence, but executing the actions in parallel.

  6. sequence :: MonadMoment m => s -> Event (State s a) -> m (Event a, Behavior s)

    reactive-midyim Reactive.Banana.MIDI.Utility

    No documentation available.

  7. sequence :: forall f (r :: Row Type) . (Applicative f, FreeForall r) => Rec (Map f r) -> f (Rec r)

    row-types Data.Row.Records

    Applicative sequencing over a record.

  8. sequence :: forall f (r :: Row Type) . (FreeForall r, Functor f) => Var (Map f r) -> f (Var r)

    row-types Data.Row.Variants

    Applicative sequencing over a variant

  9. sequence :: Monad m => Fold m a (m b) -> Fold m a b

    streamly-core Streamly.Data.Fold

    Deprecated: Use "rmapM id" instead

  10. sequence :: Monad m => Stream m (m a) -> Stream m a

    streamly-core Streamly.Data.Stream 

    >>> sequence = Stream.mapM id
    Replace the elements of a stream of monadic actions with the outputs of those actions. 
    >>> s = Stream.fromList [putStr "a", putStr "b", putStrLn "c"]

>>> Stream.fold Fold.drain $ Stream.sequence s
abc

Page 11 of many | Previous | Next