-is:module seq

seq :: a -> b -> b

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.

seq :: MonadGen m => Range Int -> m a -> m (Seq a)

hedgehog Hedgehog.Gen Hedgehog.Internal.Gen

Generates a seq using a Range to determine the length.

seq :: a -> b -> b

ghc GHC.Prelude.Basic

seq :: Functor m => Pipe a a m r

pipes Pipes.Prelude

Evaluate all values flowing downstream to WHNF

seq :: forall (r :: RuntimeRep) a (b :: TYPE r) . a -> b -> b

rio RIO.Prelude, numeric-prelude NumericPrelude NumericPrelude.Base, clash-prelude Clash.HaskellPrelude, yesod-paginator Yesod.Paginator.Prelude

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.

seq :: a -> b -> b

basic-prelude CorePrelude

The value of seq a b is bottom if a is bottom, and otherwise equal to b. 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.

seq :: () => a -> b -> b

prelude-compat Prelude2010

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.

seq :: PlaySeq -> [UWORD]

med-module Sound.MED.Raw.PlaySeq

seq :: IndexList -> !Int64

relational-schemas Database.Relational.Schema.SQLite3.IndexList

data Seq a