Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. module Data.GenValidity.Sequence

    No documentation available.

  2. genSeqOf :: Gen v -> Gen (Seq v)

    genvalidity-containers Data.GenValidity.Sequence

    No documentation available.

  3. shrinkSeqOf :: (v -> [v]) -> Seq v -> [Seq v]

    genvalidity-containers Data.GenValidity.Sequence

    No documentation available.

  4. seq :: a -> b -> b

    ghc-internal GHC.Internal.Base

    The value of seq a b is bottom if a is bottom, and otherwise equal to b. In other words, it evaluates the first argument a to weak head normal form (WHNF). seq is usually introduced to improve performance by avoiding unneeded laziness. A note on evaluation order: the expression seq a b does not guarantee that a will be evaluated before b. The only guarantee given by seq is that the both a and b will be evaluated before seq returns a value. In particular, this means that b may be evaluated before a. If you need to guarantee a specific order of evaluation, you must use the function pseq from the "parallel" package.

  5. seq# :: a -> State# d -> (# State# d, a #)

    ghc-internal GHC.Internal.Base

    No documentation available.

  6. sequence :: Monad m => [m a] -> m [a]

    ghc-internal GHC.Internal.Base

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

  7. pseq :: a -> b -> b

    ghc-internal GHC.Internal.Conc.Sync

    No documentation available.

  8. sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)

    ghc-internal GHC.Internal.Control.Monad

    Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see sequence_.

    Examples

    Basic usage: The first two examples are instances where the input and and output of sequence are isomorphic.
    >>> sequence $ Right [1,2,3,4]
    [Right 1,Right 2,Right 3,Right 4]
    
    >>> sequence $ [Right 1,Right 2,Right 3,Right 4]
    Right [1,2,3,4]
    
    The following examples demonstrate short circuit behavior for sequence.
    >>> sequence $ Left [1,2,3,4]
    Left [1,2,3,4]
    
    >>> sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4]
    Left 0
    

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

    ghc-internal GHC.Internal.Control.Monad

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

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

    ghc-internal GHC.Internal.Data.Foldable

    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"
    "!"
    

Page 347 of many | Previous | Next