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.
-
sop-core Data.SOP.NP Specialization of hsequence. Example:
>>> sequence_POP (POP ((Just 1 :* Nil) :* (Just 2 :* Just 3 :* Nil) :* Nil)) Just (POP ((I 1 :* Nil) :* (I 2 :* I 3 :* Nil) :* Nil))
sequence_NS :: forall (xs :: [Type]) f . (SListI xs, Applicative f) => NS f xs -> f (NS I xs)sop-core Data.SOP.NS Specialization of hsequence.
-
sop-core Data.SOP.NS Specialization of hsequence.
sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)relude Relude.Foldable.Reexport 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 ()relude Relude.Foldable.Reexport 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 ()relude Relude.Foldable.Reexport 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_ :: (Foldable t, Monad m) => t (m a) -> m ()base-compat-batteries Control.Monad.Compat 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.
-
vector-sized Data.Vector.Generic.Sized Evaluate each action and discard the results.
sequence_ :: forall m (n :: Nat) a . Monad m => Vector n (m a) -> m ()vector-sized Data.Vector.Sized Evaluate each action and discard the results.
sequence_ :: forall m a (n :: Nat) . (Monad m, Storable (m a)) => Vector n (m a) -> m ()vector-sized Data.Vector.Storable.Sized Evaluate each action and discard the results.