Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)ghc-lib-parser GHC.Prelude.Basic 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
sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()ghc-lib-parser GHC.Prelude.Basic 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.
sequence_ :: (Contiguous arr, Element arr (f a), Applicative f) => arr (f a) -> f ()contiguous Data.Primitive.Contiguous Evaluate each action in the structure from left to right and ignore the results. For a version that doesn't ignore the results see sequence.
sequenceA :: (Mappable collection, Applicative f) => collection (f a) -> f (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 sequenceA_
sequence_ :: Monad m => Matrix (m a) -> m ()matrices Data.Matrix No documentation available.
sequence_ :: forall (v :: Type -> Type) m a . (Vector v (m a), Monad m) => Matrix v (m a) -> m ()matrices Data.Matrix.Generic No documentation available.
sequenceScheduling :: (Monad m, MonadSchedule m) => NonEmpty (m a) -> m (NonEmpty a)monad-schedule Control.Monad.Schedule.Class Uses scheduleAndFinish to execute all actions concurrently, then orders them again. Thus it behaves semantically like sequence, but leverages concurrency.
sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()prelude-compat Prelude2010 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.