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.

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

    classy-prelude-yesod ClassyPrelude.Yesod

    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

  2. sequenceConduits :: forall f (m :: Type -> Type) i o r . (Traversable f, Monad m) => f (ConduitT i o m r) -> ConduitT i o m (f r)

    classy-prelude-yesod ClassyPrelude.Yesod

    Provide identical input to all of the Conduits and combine their outputs into a single stream. Implemented on top of ZipConduit, see that data type for more details. Since 1.0.17

  3. sequenceSinks :: forall f (m :: Type -> Type) i r . (Traversable f, Monad m) => f (ConduitT i Void m r) -> ConduitT i Void m (f r)

    classy-prelude-yesod ClassyPrelude.Yesod

    Send incoming values to all of the Sink providing, and ultimately coalesce together all return values. Implemented on top of ZipSink, see that data type for more details. Since 1.0.13

  4. sequenceSources :: forall f (m :: Type -> Type) o . (Traversable f, Monad m) => f (ConduitT () o m ()) -> ConduitT () (f o) m ()

    classy-prelude-yesod ClassyPrelude.Yesod

    Coalesce all values yielded by all of the Sources. Implemented on top of ZipSource and as such, it exhibits the same short-circuiting behavior as ZipSource. See that data type for more details. If you want to create a source that yields *all* values from multiple sources, use sequence_. Since 1.0.13

  5. sequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m ()

    classy-prelude-yesod ClassyPrelude.Yesod

    Synonym for osequence_

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

    constrained-categories Control.Category.Constrained.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

  7. sequence_ :: forall t (k :: Type -> Type -> Type) l m a b uk ul . (Foldable t k l, Arrow k (->), Arrow l (->), uk ~ UnitObject k, ul ~ UnitObject l, uk ~ ul, Monoidal m k k, Monoidal m l l, ObjectPair k a uk, ObjectPair k (t (m a)) uk, ObjectPair k uk uk, ObjectPair k (m uk) (m uk), ObjectPair k (t (m a)) ul, ObjectPair l (m ul) (t (m a)), ObjectPair l ul (t (m a)), ObjectPair l (m uk) (t (m a)), ObjectPair l (t (m a)) ul, ObjectPair k (m uk) (m a)) => l (t (m a)) (m uk)

    constrained-categories Control.Category.Constrained.Prelude

    No documentation available.

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

    constrained-categories Control.Category.Hask

    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. sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()

    constrained-categories Control.Category.Hask

    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.

  10. sequence_ :: forall t (k :: Type -> Type -> Type) l m a b uk ul . (Foldable t k l, Arrow k (->), Arrow l (->), uk ~ UnitObject k, ul ~ UnitObject l, uk ~ ul, Monoidal m k k, Monoidal m l l, ObjectPair k a uk, ObjectPair k (t (m a)) uk, ObjectPair k uk uk, ObjectPair k (m uk) (m uk), ObjectPair k (t (m a)) ul, ObjectPair l (m ul) (t (m a)), ObjectPair l ul (t (m a)), ObjectPair l (m uk) (t (m a)), ObjectPair l (t (m a)) ul, ObjectPair k (m uk) (m a)) => l (t (m a)) (m uk)

    constrained-categories Control.Monad.Constrained

    No documentation available.

Page 47 of many | Previous | Next