Hoogle Search

Within LTS Haskell 24.19 (ghc-9.10.3)

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

Exact lookup

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

   diagrams-lib	Diagrams.Prelude

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

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

   diagrams-lib	Diagrams.Prelude

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

   sequenceByOf traverse ≡ sequenceBy
   

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

   diagrams-lib	Diagrams.Prelude

   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
   

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

   diagrams-lib	Diagrams.Prelude

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

5. sequenceToList :: Sequence a -> [a]

   math-functions	Numeric.Series

   Convert series to infinite list

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

   Cabal-syntax	Distribution.Compat.Prelude

   No documentation available.

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

   Cabal-syntax	Distribution.Compat.Prelude

   No documentation available.

8. sequenceL :: (Crosswalk t, Align f) => t (f a) -> f (t a)

   semialign	Data.Crosswalk

   No documentation available.

9. sequence_NP :: forall (xs :: [Type]) f . (SListI xs, Applicative f) => NP f xs -> f (NP I xs)

   sop-core	Data.SOP.NP

   Specialization of hsequence. Example:

   >>> sequence_NP (Just 1 :* Just 2 :* Nil)
   Just (I 1 :* I 2 :* Nil)
   

10. sequence_POP :: forall (xss :: [[Type]]) f . (All (SListI :: [Type] -> Constraint) xss, Applicative f) => POP f xss -> f (POP I xss)

    sop-core	Data.SOP.NP

    Specialization of hsequence. Example:

    >>> sequence_POP (POP ((Just 1 :* Nil) :* (Just 2 :* Just 3 :* Nil) :* Nil))
    Just (POP ((I 1 :* Nil) :* (I 2 :* I 3 :* Nil) :* Nil))
    

Page 31 of many | Previous | Next