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 :: Monad m => Fold m a (m b) -> Fold m a b

    streamly-core Streamly.Internal.Data.Fold

    Deprecated: Use "rmapM id" instead

  2. sequence :: forall (m :: Type -> Type) a b c . Monad m => Stream m (Parser a m b) -> Fold m b c -> Parser a m c

    streamly-core Streamly.Internal.Data.Parser

    sequence f p collects sequential parses of parsers in a serial stream p using the fold f. Fails if the input ends or any of the parsers fail. Pre-release

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

    streamly-core Streamly.Internal.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

  4. sequence :: Monad m => StreamK m (m a) -> StreamK m a

    streamly-core Streamly.Internal.Data.StreamK

    No documentation available.

  5. sequence :: (C event, RealFrac q, Storable y, C q y, C q, C v) => ChunkSize -> T v q -> Channel -> Instrument s Time v q (T y) -> Filter event s Time q (Signal s v q (T y))

    synthesizer-midi Synthesizer.MIDI.Dimensional

    No documentation available.

  6. sequence :: (C event, Monoid signal, C y) => Channel -> Instrument y signal -> FilterSequence event signal

    synthesizer-midi Synthesizer.MIDI.Generic

    No documentation available.

  7. sequence :: (C event, Storable yv, C yv, C y) => ChunkSize -> Channel -> Instrument y yv -> Filter event (T yv)

    synthesizer-midi Synthesizer.MIDI.Storable

    No documentation available.

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

    clash-prelude Clash.HaskellPrelude

    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

  9. sequence :: forall (m :: Type -> Type) (n :: Type -> Type) s a . (Monad m, AlternativeFail n, Monoid s, Eq a, Show a) => [Format m n s a] -> Format m n s [a]

    construct Construct

    Sequence a list of formats into a list format.

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

    control-monad-free Control.Monad.Free

    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

Page 12 of many | Previous | Next