Hoogle Search
Within LTS Haskell 24.50 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
evalSeq :: SeqStrategy a -> Strategy aparallel Control.Parallel.Strategies Inject a sequential strategy (ie. coerce a sequential strategy to a general strategy). Thanks to evalSeq, the type Control.Seq.Strategy a is a subtype of Strategy a.
rdeepseq :: NFData a => Strategy aparallel Control.Parallel.Strategies rdeepseq fully evaluates its argument.
rdeepseq == evalSeq Control.Seq.rdeepseq
-
parallel Control.Parallel.Strategies rseq evaluates its argument to weak head normal form.
rseq == evalSeq Control.Seq.rseq
seqList :: Strategy a -> Strategy [a]parallel Control.Parallel.Strategies Deprecated: renamed to evalList
seqPair :: Strategy a -> Strategy b -> Strategy (a, b)parallel Control.Parallel.Strategies Deprecated: renamed to evalTuple2
seqTraverse :: Traversable t => Strategy a -> Strategy (t a)parallel Control.Parallel.Strategies Deprecated: renamed to evalTraversable
seqTriple :: Strategy a -> Strategy b -> Strategy c -> Strategy (a, b, c)parallel Control.Parallel.Strategies Deprecated: renamed to evalTuple3
-
Sequential strategies provide ways to compositionally specify the degree of evaluation of a data type between the extremes of no evaluation and full evaluation. Sequential strategies may be viewed as complimentary to the parallel ones (see module Control.Parallel.Strategies).
rdeepseq :: NFData a => Strategy aparallel Control.Seq rdeepseq fully evaluates its argument. Relies on class NFData from module Control.DeepSeq.
-
parallel Control.Seq rseq evaluates its argument to weak head normal form.