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.
-
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.
seqArray :: Strategy a -> Strategy (Array i a)parallel Control.Seq Evaluate the elements of an array according to the given strategy. Evaluation of the array bounds may be triggered as a side effect.
seqArrayBounds :: Strategy i -> Strategy (Array i a)parallel Control.Seq Evaluate the bounds of an array according to the given strategy.
seqFoldable :: Foldable t => Strategy a -> Strategy (t a)parallel Control.Seq Evaluate the elements of a foldable data structure according to the given strategy.
seqList :: Strategy a -> Strategy [a]parallel Control.Seq Evaluate each element of a list according to the given strategy. This function is a specialisation of seqFoldable to lists.
seqListN :: Int -> Strategy a -> Strategy [a]parallel Control.Seq Evaluate the first n elements of a list according to the given strategy.
seqListNth :: Int -> Strategy a -> Strategy [a]parallel Control.Seq Evaluate the nth element of a list (if there is such) according to the given strategy. The spine of the list up to the nth element is evaluated as a side effect.
seqMap :: Strategy k -> Strategy v -> Strategy (Map k v)parallel Control.Seq Evaluate the keys and values of a map according to the given strategies.