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

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

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

  3. 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.Combinators

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

    sequenceByOf traverse ≡ sequenceBy

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

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

  6. type AnEquality (s :: k) (t :: k1) (a :: k) (b :: k2) = Identical a Proxy b a Proxy b -> Identical a Proxy b s Proxy t

    lens Control.Lens.Equality

    When you see this as an argument to a function, it expects an Equality.

  7. type AnEquality' (s :: k) (a :: k) = AnEquality s s a a

    lens Control.Lens.Equality

    A Simple AnEquality.

  8. mapEq :: forall k1 k2 (s :: k1) (t :: k2) (a :: k1) (b :: k2) f . AnEquality s t a b -> f s -> f a

    lens Control.Lens.Equality

    We can use Equality to do substitution into anything.

  9. data Sequenced a (m :: Type -> Type)

    lens Control.Lens.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 =>"?

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

Page 150 of many | Previous | Next