Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

  1. sequence_ :: (Monad m, FoldableLL full (m item)) => full -> m ()

    ListLike Data.ListLike

    Evaluate each action, ignoring the results. Same as mapM_ id.

  2. sequence_ :: (Monad m, FoldableLL full (m item)) => full -> m ()

    ListLike Data.ListLike.Base

    Evaluate each action, ignoring the results. Same as mapM_ id.

  3. sequence_ :: (Monad m, FoldableLL full (m item)) => full -> m ()

    ListLike Data.ListLike.FoldableLL

    Evaluate each action, ignoring the results. Same as mapM_ id.

  4. sequence_ :: (Monad m, FoldableLL full (m item)) => full -> m ()

    ListLike Data.ListLike.Utils

    Evaluate each action, ignoring the results. Same as mapM_ id.

  5. sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)

    basic-prelude BasicPrelude

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

    Examples

    Basic usage: For the first two examples we show sequenceA fully evaluating a a structure and collecting the results. 
    >>> sequenceA [Just 1, Just 2, Just 3]
Just [1,2,3]

    >>> sequenceA [Right 1, Right 2, Right 3]
Right [1,2,3]
    The next two example show Nothing and Just will short circuit the resulting structure if present in the input. For more context, check the Traversable instances for Either and Maybe. 
    >>> sequenceA [Just 1, Just 2, Just 3, Nothing]
Nothing

    >>> sequenceA [Right 1, Right 2, Right 3, Left 4]
Left 4

  6. sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()

    basic-prelude BasicPrelude

    Evaluate each action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequenceA. sequenceA_ is just like sequence_, but generalised to Applicative actions.

    Examples

    Basic usage: 
    >>> sequenceA_ [print "Hello", print "world", print "!"]
"Hello"
"world"
"!"

  7. sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()

    basic-prelude BasicPrelude

    Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequence. sequence_ is just like sequenceA_, but specialised to monadic actions.

  8. sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)

    classy-prelude ClassyPrelude

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

    Examples

    Basic usage: For the first two examples we show sequenceA fully evaluating a a structure and collecting the results. 
    >>> sequenceA [Just 1, Just 2, Just 3]
Just [1,2,3]

    >>> sequenceA [Right 1, Right 2, Right 3]
Right [1,2,3]
    The next two example show Nothing and Just will short circuit the resulting structure if present in the input. For more context, check the Traversable instances for Either and Maybe. 
    >>> sequenceA [Just 1, Just 2, Just 3, Nothing]
Nothing

    >>> sequenceA [Right 1, Right 2, Right 3, Left 4]
Left 4

  9. sequenceGrdDags :: [GrdDag] -> GrdDag

    ghc-lib-parser GHC.HsToCore.Pmc.Types

    Sequentially compose a list of GrdDags.

  10. sequencePmGrds :: [PmGrd] -> GrdDag

    ghc-lib-parser GHC.HsToCore.Pmc.Types

    Sequentially compose a list of PmGrds into a GrdDag.

Page 35 of many | Previous | Next