Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

  1. sequence_ :: (Monad m, Vector v (m a)) => v (m a) -> m ()

    rebase Rebase.Data.Vector.Generic

    No documentation available.

  2. sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()

    rebase Rebase.Prelude

    Evaluate each action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequenceA. sequenceA_ is just like sequence_, but generalised to Applicative actions.

    Examples

    Basic usage: 
    >>> sequenceA_ [print "Hello", print "world", print "!"]
"Hello"
"world"
"!"

  3. sequence_ :: Monad m => T (m a) -> m ()

    synthesizer-core Synthesizer.State.Signal

    No documentation available.

  4. sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()

    base-prelude BasePrelude

    Evaluate each action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequenceA. sequenceA_ is just like sequence_, but generalised to Applicative actions.

    Examples

    Basic usage: 
    >>> sequenceA_ [print "Hello", print "world", print "!"]
"Hello"
"world"
"!"

  5. sequenceToFasta :: Sequence -> ByteString

    elynx-seq ELynx.Sequence.Export.Fasta

    Convert a Sequence to Fasta format.

  6. sequencesToFasta :: [Sequence] -> ByteString

    elynx-seq ELynx.Sequence.Export.Fasta

    Convert a list Sequences to Fasta format. A newline is added between any two Sequences.

  7. sequenceA :: (Vector v a, Vector v (f a), Applicative f) => v (f a) -> f (v a)

    fixed-vector Data.Vector.Fixed

    Deprecated: Use sequence instead

  8. sequence_ :: (Vector v (f a), Applicative f) => v (f a) -> f ()

    fixed-vector Data.Vector.Fixed

    Evaluate every action in the vector from left to right and ignore result

  9. sequence_ :: forall (n :: PeanoNum) f a . (ArityPeano n, Applicative f) => ContVec n (f a) -> f ()

    fixed-vector Data.Vector.Fixed.Cont

    Evaluate every action in the vector from left to right and ignore result.

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

    mixed-types-num Numeric.MixedTypes.PreludeHiding

    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

Page 37 of many | Previous | Next