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.

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

    numeric-prelude NumericPrelude

    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.

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

    numeric-prelude NumericPrelude.Base

    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.

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

    numhask NumHask.Prelude

    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

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

    numhask NumHask.Prelude

    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"
"!"

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

    numhask NumHask.Prelude

    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.

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

    numhask NumHask.Prelude

    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.

  7. sequenceDMapWithAdjust :: forall (k :: Type -> Type) t m . (GCompare k, Adjustable t m) => DMap k m -> Event t (PatchDMap k m) -> m (DMap k Identity, Event t (PatchDMap k Identity))

    reflex Reflex.Adjustable.Class

    Traverse a DMap of Adjustable actions, running each of them. The provided Event of patches to the DMap can add, remove, or update values.

  8. sequenceDMapWithAdjustWithMove :: forall (k :: Type -> Type) t m . (GCompare k, Adjustable t m) => DMap k m -> Event t (PatchDMapWithMove k m) -> m (DMap k Identity, Event t (PatchDMapWithMove k Identity))

    reflex Reflex.Adjustable.Class

    Traverses a DMap of Adjustable actions, running each of them. The provided Event of patches to the DMap can add, remove, update, move, or swap values.

  9. sequenceDMapWithAdjustEventWriterTWith :: forall t m p p' w k v v' . (Reflex t, MonadHold t m, Semigroup w, Patch (p' (Some k) (Event t w)), PatchTarget (p' (Some k) (Event t w)) ~ Map (Some k) (Event t w), GCompare k, Patch (p' (Some k) w), PatchTarget (p' (Some k) w) ~ Map (Some k) w) => ((forall a . () => k a -> v a -> m (Compose ((,) (Event t w)) v' a)) -> DMap k v -> Event t (p k v) -> EventWriterT t w m (DMap k (Compose ((,) (Event t w)) v'), Event t (p k (Compose ((,) (Event t w)) v')))) -> ((forall a . () => Compose ((,) (Event t w)) v' a -> v' a) -> p k (Compose ((,) (Event t w)) v') -> p k v') -> ((forall a . () => Compose ((,) (Event t w)) v' a -> Event t w) -> p k (Compose ((,) (Event t w)) v') -> p' (Some k) (Event t w)) -> (Incremental t (p' (Some k) (Event t w)) -> Event t (PatchTarget (p' (Some k) w))) -> (Event t (p' (Some k) (Event t w)) -> Event t (p' (Some k) w)) -> (forall a . () => k a -> v a -> EventWriterT t w m (v' a)) -> DMap k v -> Event t (p k v) -> EventWriterT t w m (DMap k v', Event t (p k v'))

    reflex Reflex.EventWriter.Base

    Like runWithReplaceEventWriterTWith, but for sequenceDMapWithAdjust.

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

    ListLike Data.ListLike

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

Page 34 of many | Previous | Next