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 :: forall m (n :: Nat) a . Monad m => Vector n (m a) -> m (Vector n a)

    vector-sized Data.Vector.Sized

    Evaluate each action and collect the results.

  2. sequence :: forall m a (n :: Nat) . (Monad m, Storable a, Storable (m a)) => Vector n (m a) -> m (Vector n a)

    vector-sized Data.Vector.Storable.Sized

    Evaluate each action and collect the results.

  3. sequence :: forall m a (n :: Nat) . (Monad m, Unbox a, Unbox (m a)) => Vector n (m a) -> m (Vector n a)

    vector-sized Data.Vector.Unboxed.Sized

    Evaluate each action and collect the results.

  4. sequence :: forall m (n :: Nat) a . Monad m => ListN n (m a) -> m (ListN n a)

    basement Basement.Sized.List

    Evaluate each monadic action in the list sequentially, and collect the results.

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

    ghc-internal GHC.Internal.Base

    Evaluate each action in the sequence from left to right, and collect the results.

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

    ghc-internal GHC.Internal.Control.Monad

    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
    

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

    ghc-internal GHC.Internal.Data.Traversable

    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
    

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

    numeric-prelude NumericPrelude

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

    numeric-prelude NumericPrelude.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
    

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

    numhask NumHask.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
    

Page 8 of many | Previous | Next