Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. 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 ()

  2. 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 ()

  3. module Control.Lens.Internal.Deque

    This module is designed to be imported qualified.

  4. data Deque a

    lens Control.Lens.Internal.Deque

    A Banker's deque based on Chris Okasaki's "Purely Functional Data Structures"

  5. newtype Sequenced a (m :: Type -> Type)

    lens Control.Lens.Internal.Fold

    Used internally by mapM_ and the like. The argument a of the result should not be used! See 4.16 Changelog entry for the explanation of "why not Apply f =>"?

  6. Sequenced :: m a -> Sequenced a (m :: Type -> Type)

    lens Control.Lens.Internal.Fold

    No documentation available.

  7. getSequenced :: Sequenced a (m :: Type -> Type) -> m a

    lens Control.Lens.Internal.Fold

    No documentation available.

  8. bndrReq :: BndrVis

    lens Control.Lens.Internal.TH

    No documentation available.

  9. 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

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

Page 151 of many | Previous | Next