Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
sequence_ :: (Monad m, FoldableLL full (m item)) => full -> m ()ListLike Data.ListLike.Base Evaluate each action, ignoring the results. Same as mapM_ id.
sequence_ :: (Monad m, FoldableLL full (m item)) => full -> m ()ListLike Data.ListLike.FoldableLL Evaluate each action, ignoring the results. Same as mapM_ id.
sequence_ :: (Monad m, FoldableLL full (m item)) => full -> m ()ListLike Data.ListLike.Utils Evaluate each action, ignoring the results. Same as mapM_ id.
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
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" "!"
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.
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
sequenceGrdDags :: [GrdDag] -> GrdDagghc-lib-parser GHC.HsToCore.Pmc.Types Sequentially compose a list of GrdDags.
sequencePmGrds :: [PmGrd] -> GrdDagghc-lib-parser GHC.HsToCore.Pmc.Types sequenceQ :: Monad m => forall a . () => [m a] -> m [a]ghc-lib-parser GHC.Internal.TH.Syntax This function is only used in Quote when desugaring brackets. This is not necessary for the user, who can use the ordinary return and (>>=) operations.