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. sequenceOf :: LensLike (WrappedMonad m) s t (m b) b -> s -> m t

    lens Control.Lens.Combinators

    Sequence the (monadic) effects targeted by a Lens in a container from left to right. 

    >>> sequenceOf each ([1,2],[3,4],[5,6])
[(1,3,5),(1,3,6),(1,4,5),(1,4,6),(2,3,5),(2,3,6),(2,4,5),(2,4,6)]

    sequence ≡ sequenceOf traverse
sequenceOf l ≡ mapMOf l id
sequenceOf l ≡ unwrapMonad . l WrapMonad

    sequenceOf :: Monad m => Iso s t (m b) b       -> s -> m t
sequenceOf :: Monad m => Lens s t (m b) b      -> s -> m t
sequenceOf :: Monad m => Traversal s t (m b) b -> s -> m t

  2. sequenceOf_ :: Monad m => Getting (Sequenced a m) s (m a) -> s -> m ()

    lens Control.Lens.Combinators

    Evaluate each monadic action referenced by a Fold on the structure from left to right, and ignore the results. 

    >>> sequenceOf_ both (putStrLn "hello",putStrLn "world")
hello
world

    sequence_ ≡ sequenceOf_ folded

    sequenceOf_ :: Monad m => Getter s (m a)     -> s -> m ()
sequenceOf_ :: Monad m => Fold s (m a)       -> s -> m ()
sequenceOf_ :: Monad m => Lens' s (m a)      -> s -> m ()
sequenceOf_ :: Monad m => Iso' s (m a)       -> s -> m ()
sequenceOf_ :: Monad m => Traversal' s (m a) -> s -> m ()
sequenceOf_ :: Monad m => Prism' s (m a)     -> s -> m ()

  3. sequence1Of_ :: Functor f => Getting (TraversedF a f) s (f a) -> s -> f ()

    lens Control.Lens.Fold

    See sequenceAOf_ and traverse1Of_. 

    sequence1Of_ :: Apply f => Fold1 s (f a) -> s -> f ()

  4. sequenceAOf_ :: Functor f => Getting (Traversed a f) s (f a) -> s -> f ()

    lens Control.Lens.Fold

    Evaluate each action in observed by a Fold on a structure from left to right, ignoring the results. 

    sequenceA_ ≡ sequenceAOf_ folded

    >>> sequenceAOf_ both (putStrLn "hello",putStrLn "world")
hello
world

    sequenceAOf_ :: Functor f     => Getter s (f a)     -> s -> f ()
sequenceAOf_ :: Applicative f => Fold s (f a)       -> s -> f ()
sequenceAOf_ :: Functor f     => Lens' s (f a)      -> s -> f ()
sequenceAOf_ :: Functor f     => Iso' s (f a)       -> s -> f ()
sequenceAOf_ :: Applicative f => Traversal' s (f a) -> s -> f ()
sequenceAOf_ :: Applicative f => Prism' s (f a)     -> s -> f ()

  5. sequenceOf_ :: Monad m => Getting (Sequenced a m) s (m a) -> s -> m ()

    lens Control.Lens.Fold

    Evaluate each monadic action referenced by a Fold on the structure from left to right, and ignore the results. 

    >>> sequenceOf_ both (putStrLn "hello",putStrLn "world")
hello
world

    sequence_ ≡ sequenceOf_ folded

    sequenceOf_ :: Monad m => Getter s (m a)     -> s -> m ()
sequenceOf_ :: Monad m => Fold s (m a)       -> s -> m ()
sequenceOf_ :: Monad m => Lens' s (m a)      -> s -> m ()
sequenceOf_ :: Monad m => Iso' s (m a)       -> s -> m ()
sequenceOf_ :: Monad m => Traversal' s (m a) -> s -> m ()
sequenceOf_ :: Monad m => Prism' s (m a)     -> s -> m ()

  6. sequenceAOf :: LensLike f s t (f b) b -> s -> f t

    lens Control.Lens.Traversal

    Evaluate each action in the structure from left to right, and collect the results. 

    >>> sequenceAOf both ([1,2],[3,4])
[(1,3),(1,4),(2,3),(2,4)]

    sequenceA ≡ sequenceAOf traverse ≡ traverse id
sequenceAOf l ≡ traverseOf l id ≡ l id

    sequenceAOf :: Functor f => Iso s t (f b) b       -> s -> f t
sequenceAOf :: Functor f => Lens s t (f b) b      -> s -> f t
sequenceAOf :: Applicative f => Traversal s t (f b) b -> s -> f t

  7. sequenceBy :: Traversable t => (forall x . () => x -> f x) -> (forall x y . () => f (x -> y) -> f x -> f y) -> t (f a) -> f (t a)

    lens Control.Lens.Traversal

    Sequence a container using its Traversable instance using explicitly provided Applicative operations. This is like sequence where the Applicative instance can be manually specified.

  8. sequenceByOf :: Traversal s t (f b) b -> (forall x . () => x -> f x) -> (forall x y . () => f (x -> y) -> f x -> f y) -> s -> f t

    lens Control.Lens.Traversal

    Sequence a container using a specified Applicative. This is like traverseBy where the Traversable instance can be specified by any Traversal 

    sequenceByOf traverse ≡ sequenceBy

  9. sequenceOf :: LensLike (WrappedMonad m) s t (m b) b -> s -> m t

    lens Control.Lens.Traversal

    Sequence the (monadic) effects targeted by a Lens in a container from left to right. 

    >>> sequenceOf each ([1,2],[3,4],[5,6])
[(1,3,5),(1,3,6),(1,4,5),(1,4,6),(2,3,5),(2,3,6),(2,4,5),(2,4,6)]

    sequence ≡ sequenceOf traverse
sequenceOf l ≡ mapMOf l id
sequenceOf l ≡ unwrapMonad . l WrapMonad

    sequenceOf :: Monad m => Iso s t (m b) b       -> s -> m t
sequenceOf :: Monad m => Lens s t (m b) b      -> s -> m t
sequenceOf :: Monad m => Traversal s t (m b) b -> s -> m t

  10. 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)

    conduit Data.Conduit

    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

Page 23 of many | Previous | Next