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 :: (ListLike full item, Applicative m, ListLike fullinp (m item)) => fullinp -> m full

    ListLike Data.ListLike

    Evaluate each action in the sequence and collect the results

  2. sequence :: (ListLike full item, Applicative m, ListLike fullinp (m item)) => fullinp -> m full

    ListLike Data.ListLike.Base

    Evaluate each action in the sequence and collect the results

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

    basic-prelude BasicPrelude

    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

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

    classy-prelude ClassyPrelude

    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 :: (Traversable t, Monad m) => t (m a) -> m (t a)

    ghc-lib-parser GHC.Prelude.Basic

    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

  6. sequence :: Functor f => f (T a) -> T (f a)

    sample-frame Sound.Frame.Stereo

    No documentation available.

  7. sequence :: (Contiguous arr1, Contiguous arr2, Element arr1 (f a), Element arr2 a, Applicative f) => arr1 (f a) -> f (arr2 a)

    contiguous Data.Primitive.Contiguous

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

  8. sequence :: Decoder a -> Decoder (Seq a)

    dhall Dhall.Marshal.Decode

    Decode a Seq. 

    >>> input (sequence natural) "[1, 2, 3]"
fromList [1,2,3]

  9. sequence :: (Mappable collection, Applicative m, Monad m) => collection (m a) -> m (collection a)

    foundation Foundation.Collection

    Evaluate each actions of the given collections, from left to right, and collect the results. For a version that ignores the results, see sequence_

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

    matrices Data.Matrix

    No documentation available.

Page 9 of many | Previous | Next