Copyright	(c) The University of Glasgow 2001-2010
License	BSD-style (see the file libraries/base/LICENSE)
Maintainer	libraries@haskell.org
Stability	experimental
Portability	portable
Safe Haskell	None
Language	Haskell2010

Control.Parallel.Strategies

Contents

The strategy type
Application of strategies
Composition of strategies
Basic strategies
Injection of sequential strategies
Strategies for traversable data types
Strategies for lists
- Strategies for lazy lists
Strategies for tuples
Strategic function application
For Strategy programmers
API History
Backwards compatibility
For API completeness

Description

Parallel Evaluation Strategies, or Strategies for short, provide ways to express parallel computations. Strategies have the following key features:

Strategies express deterministic parallelism: the result of the program is unaffected by evaluating in parallel. The parallel tasks evaluated by a Strategy may have no side effects. For non-deterministic parallel programming, see Control.Concurrent.
Strategies let you separate the description of the parallelism from the logic of your program, enabling modular parallelism. The basic idea is to build a lazy data structure representing the computation, and then write a Strategy that describes how to traverse the data structure and evaluate components of it sequentially or in parallel.
Strategies are compositional: larger strategies can be built by gluing together smaller ones.
Monad and Applicative instances are provided, for quickly building strategies that involve traversing structures in a regular way.

For API history and changes in this release, see Control.Parallel.Strategies.

Synopsis

The strategy type

type Strategy a = a -> Eval a #

A Strategy is a function that embodies a parallel evaluation strategy. The function traverses (parts of) its argument, evaluating subexpressions in parallel or in sequence.

A Strategy may do an arbitrary amount of evaluation of its argument, but should not return a value different from the one it was passed.

Parallel computations may be discarded by the runtime system if the program no longer requires their result, which is why a Strategy function returns a new value equivalent to the old value. The intention is that the program applies the Strategy to a structure, and then uses the returned value, discarding the old value. This idiom is expressed by the using function.

Application of strategies

using :: a -> Strategy a -> a infixl 0 #

Evaluate a value using the given Strategy.

x `using` s = runEval (s x)

withStrategy :: Strategy a -> a -> a #

evaluate a value using the given Strategy. This is simply using with the arguments reversed.

Composition of strategies

dot :: Strategy a -> Strategy a -> Strategy a infixr 9 #

Compose two strategies sequentially. This is the analogue to function composition on strategies.

strat2 `dot` strat1 == strat2 . withStrategy strat1

Basic strategies

r0 :: Strategy a #

r0 performs *no* evaluation.

r0 == evalSeq Control.Seq.r0

rseq :: Strategy a #

rseq evaluates its argument to weak head normal form.

rseq == evalSeq Control.Seq.rseq

rdeepseq :: NFData a => Strategy a #

rdeepseq fully evaluates its argument.

rdeepseq == evalSeq Control.Seq.rdeepseq

rpar :: Strategy a #

rpar sparks its argument (for evaluation in parallel).

rparWith :: Strategy a -> Strategy a #

instead of saying rpar dot strat, you can say rparWith strat. Compared to rpar, rparWith

does not exit the Eval monad
does not have a built-in rseq, so for example `rparWith r0` behaves as you might expect (it is a strategy that creates a spark that does no evaluation).

Injection of sequential strategies

evalSeq :: SeqStrategy a -> Strategy a #

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.

type SeqStrategy a = Strategy a #

A name for Control.Seq.Strategy, for documentation only.

Strategies for traversable data types

evalTraversable :: Traversable t => Strategy a -> Strategy (t a) #

Evaluate the elements of a traversable data structure according to the given strategy.

parTraversable :: Traversable t => Strategy a -> Strategy (t a) #

Like evalTraversable but evaluates all elements in parallel.

Strategies for lists

evalList :: Strategy a -> Strategy [a] #

Evaluate each element of a list according to the given strategy. Equivalent to evalTraversable at the list type.

parList :: Strategy a -> Strategy [a] #

Evaluate each element of a list in parallel according to given strategy. Equivalent to parTraversable at the list type.

evalListN :: Int -> Strategy a -> Strategy [a] #

Evaluate the first n elements of a list according to the given strategy.

parListN :: Int -> Strategy a -> Strategy [a] #

Like evalListN but evaluates the first n elements in parallel.

evalListNth :: Int -> Strategy a -> Strategy [a] #

Evaluate the nth element of a list (if there is such) according to the given strategy. This nth is 0-based. For example, [1, 2, 3, 4, 5] using evalListNth 4 rseq will eval 5, not 4. The spine of the list up to the nth element is evaluated as a side effect.

parListNth :: Int -> Strategy a -> Strategy [a] #

Like evalListN but evaluates the nth element in parallel.

evalListSplitAt :: Int -> Strategy [a] -> Strategy [a] -> Strategy [a] #

evaListSplitAt n stratPref stratSuff evaluates the prefix (of length n) of a list according to stratPref and its the suffix according to stratSuff.

parListSplitAt :: Int -> Strategy [a] -> Strategy [a] -> Strategy [a] #

Like evalListSplitAt but evaluates both sublists in parallel.

parListChunk :: Int -> Strategy a -> Strategy [a] #

Divides a list into chunks, and applies the strategy evalList strat to each chunk in parallel.

It is expected that this function will be replaced by a more generic clustering infrastructure in the future.

If the chunk size is 1 or less, parListChunk is equivalent to parList

parMap :: Strategy b -> (a -> b) -> [a] -> [b] #

A combination of parList and map, encapsulating a common pattern:

parMap strat f = withStrategy (parList strat) . map f

Strategies for lazy lists

evalBuffer :: Int -> Strategy a -> Strategy [a] #

evalBuffer is a rolling buffer strategy combinator for (lazy) lists.

evalBuffer is not as compositional as the type suggests. In fact, it evaluates list elements at least to weak head normal form, disregarding a strategy argument r0.

evalBuffer n r0 == evalBuffer n rseq

parBuffer :: Int -> Strategy a -> Strategy [a] #

Like evalBuffer but evaluates the list elements in parallel when pushing them into the buffer.

Strategies for tuples

Evaluate the components of a tuple according to the given strategies.

evalTuple2 :: Strategy a -> Strategy b -> Strategy (a, b) #

evalTuple3 :: Strategy a -> Strategy b -> Strategy c -> Strategy (a, b, c) #

evalTuple4 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy (a, b, c, d) #

evalTuple5 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy (a, b, c, d, e) #

evalTuple6 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy (a, b, c, d, e, f) #

evalTuple7 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy g -> Strategy (a, b, c, d, e, f, g) #

evalTuple8 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy g -> Strategy h -> Strategy (a, b, c, d, e, f, g, h) #

evalTuple9 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy g -> Strategy h -> Strategy i -> Strategy (a, b, c, d, e, f, g, h, i) #

Evaluate the components of a tuple in parallel according to the given strategies.

parTuple2 :: Strategy a -> Strategy b -> Strategy (a, b) #

parTuple3 :: Strategy a -> Strategy b -> Strategy c -> Strategy (a, b, c) #

parTuple4 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy (a, b, c, d) #

parTuple5 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy (a, b, c, d, e) #

parTuple6 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy (a, b, c, d, e, f) #

parTuple7 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy g -> Strategy (a, b, c, d, e, f, g) #

parTuple8 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy g -> Strategy h -> Strategy (a, b, c, d, e, f, g, h) #

parTuple9 :: Strategy a -> Strategy b -> Strategy c -> Strategy d -> Strategy e -> Strategy f -> Strategy g -> Strategy h -> Strategy i -> Strategy (a, b, c, d, e, f, g, h, i) #

Strategic function application

($|) :: (a -> b) -> Strategy a -> a -> b #

Sequential function application. The argument is evaluated using the given strategy before it is given to the function.

($||) :: (a -> b) -> Strategy a -> a -> b #

Parallel function application. The argument is evaluated using the given strategy, in parallel with the function application.

(.|) :: (b -> c) -> Strategy b -> (a -> b) -> a -> c #

Sequential function composition. The result of the second function is evaluated using the given strategy, and then given to the first function.

(.||) :: (b -> c) -> Strategy b -> (a -> b) -> a -> c #

Parallel function composition. The result of the second function is evaluated using the given strategy, in parallel with the application of the first function.

(-|) :: (a -> b) -> Strategy b -> (b -> c) -> a -> c #

Sequential inverse function composition, for those who read their programs from left to right. The result of the first function is evaluated using the given strategy, and then given to the second function.

(-||) :: (a -> b) -> Strategy b -> (b -> c) -> a -> c #

Parallel inverse function composition, for those who read their programs from left to right. The result of the first function is evaluated using the given strategy, in parallel with the application of the second function.

For Strategy programmers

data Eval a #

Eval is a Monad that makes it easier to define parallel strategies. It is a strict identity monad: that is, in

m >>= f

m is evaluated before the result is passed to f.

instance Monad Eval where
  return  = Done
  m >>= k = case m of
              Done x -> k x

If you wanted to construct a Strategy for a pair that sparked the first component in parallel and then evaluated the second component, you could write

myStrat :: Strategy (a,b)
myStrat (a,b) = do { a' <- rpar a; b' <- rseq b; return (a',b') }

Alternatively, you could write this more compactly using the Applicative style as

myStrat (a,b) = (,) <$> rpar a <*> rseq b

Instances

Monad Eval #
Methods (>>=) :: Eval a -> (a -> Eval b) -> Eval b # (>>) :: Eval a -> Eval b -> Eval b # return :: a -> Eval a # fail :: String -> Eval a #
Functor Eval #
Methods fmap :: (a -> b) -> Eval a -> Eval b # (<$) :: a -> Eval b -> Eval a #
Applicative Eval #
Methods pure :: a -> Eval a # (<>) :: Eval (a -> b) -> Eval a -> Eval b # (>) :: Eval a -> Eval b -> Eval b # (<*) :: Eval a -> Eval b -> Eval a #

runEval :: Eval a -> a #

Pull the result out of the monad.

API History

The strategies library has a long history. What follows is a summary of how the current design evolved, and is mostly of interest to those who are familiar with an older version, or need to adapt old code to use the newer API.

Version 1.x

The original Strategies design is described in Algorithm + Strategy = Parallelism http://www.macs.hw.ac.uk/~dsg/gph/papers/html/Strategies/strategies.html and the code was written by Phil Trinder, Hans-Wolfgang Loidl, Kevin Hammond et al.

Version 2.x

Later, during work on the shared-memory implementation of parallelism in GHC, we discovered that the original formulation of Strategies had some problems, in particular it lead to space leaks and difficulties expressing speculative parallelism. Details are in the paper Runtime Support for Multicore Haskell http://community.haskell.org/~simonmar/papers/multicore-ghc.pdf.

This module has been rewritten in version 2. The main change is to the 'Strategy a' type synonym, which was previously a -> Done and is now a -> Eval a. This change helps to fix the space leak described in "Runtime Support for Multicore Haskell". The problem is that the runtime will currently retain the memory referenced by all sparks, until they are evaluated. Hence, we must arrange to evaluate all the sparks eventually, just in case they aren't evaluated in parallel, so that they don't cause a space leak. This is why we must return a "new" value after applying a Strategy, so that the application can evaluate each spark created by the Strategy.

The simple rule is this: you must use the result of applying a Strategy if the strategy creates parallel sparks, and you should probably discard the the original value. If you don't do this, currently it may result in a space leak. In the future (GHC 6.14), it will probably result in lost parallelism instead, as we plan to change GHC so that unreferenced sparks are discarded rather than retained (we can't make this change until most code is switched over to this new version of Strategies, because code using the old verison of Strategies would be broken by the change in policy).

The other changes in version 2.x are:

Strategies can now be defined using a convenient Monad/Applicative type, Eval. e.g. parList s = traverse (Par . (`using` s))
parList has been generalised to parTraverse, which works on any Traversable type, and similarly seqList has been generalised to seqTraverse
parList and parBuffer have versions specialised to rwhnf, and there are transformation rules that automatically translate e.g. parList rwnhf into a call to the optimised version.
NFData has been moved to Control.DeepSeq in the deepseq package. Note that since the Strategy type changed, rnf is no longer a Strategy: use rdeepseq instead.

Version 2.1 moved NFData into a separate package, deepseq.

Version 2.2 changed the type of Strategy to a -> Eval a, and re-introduced the r0 strategy which was missing in version 2.1.

Version 2.3 simplified the Eval type, so that Eval is now just the strict identity monad. This change and various other improvements and refactorings are thanks to Patrick Maier who noticed that Eval didn't satisfy the monad laws, and that a simpler version would fix that problem.

(version 2.3 was not released on Hackage).

Version 3 introduced a major overhaul of the API, to match what is presented in the paper

Seq no More: Better Strategies for Parallel Haskell http://community.haskell.org/~simonmar/papers/strategies.pdf

The major differences in the API are:

The addition of Sequential strategies (Control.Seq) as a composable means for specifying sequential evaluation.
Changes to the naming scheme: rwhnf renamed to rseq, seqList renamed to evalList, seqPair renamed to evalTuple2,

The naming scheme is now as follows:

Basic polymorphic strategies (of type Strategy a) are called r.... Examples: r0, rseq, rpar, rdeepseq.
A strategy combinator for a particular type constructor or constructor class T is called evalT..., parT... or seqT....
The seqT... combinators (residing in module Control.Seq) yield sequential strategies. Thus, seqT... combinators cannot spark, nor can the sequential strategies to which they may be applied. Examples: seqTuple2, seqListN, seqFoldable.
The evalT... combinators do not spark themselves, yet they may be applied to strategies that do spark. (They may also be applied to non-sparking strategies; however, in that case the corresponding seqT... combinator might be a better choice.) Examples: evalTuple2, evalListN, evalTraversable.
The parT... combinators, which are derived from their evalT... counterparts, do spark. They may be applied to all strategies, whether sparking or not. Examples: parTuple2, parListN, parTraversable.
An exception to the type driven naming scheme are evalBuffer and parBuffer, which are not named after their type constructor (lists) but after their function (rolling buffer of fixed size).

Backwards compatibility

These functions and types are all deprecated, and will be removed in a future release. In all cases they have been either renamed or replaced with equivalent functionality.

type Done = () #

Deprecated: The Strategy type is now a -> Eval a, not a -> Done

DEPRECCATED: replaced by the Eval monad

demanding :: a -> Done -> a #

Deprecated: Use pseq or $| instead

DEPRECATED: Use pseq or $| instead

sparking :: a -> Done -> a #

Deprecated: Use par or $|| instead

DEPRECATED: Use par or $|| instead

(>|) :: Done -> Done -> Done #

Deprecated: Use pseq or $| instead

DEPRECATED: Use pseq or $| instead

(>||) :: Done -> Done -> Done #

Deprecated: Use par or $|| instead

DEPRECATED: Use par or $|| instead

rwhnf :: Strategy a #

Deprecated: renamed to rseq

DEPRECATED: renamed to rseq

unEval :: Eval a -> a #

Deprecated: renamed to runEval

DEPRECATED: renamed to runEval

seqTraverse :: Traversable t => Strategy a -> Strategy (t a) #

Deprecated: renamed to evalTraversable

DEPRECATED: renamed to evalTraversable

parTraverse :: Traversable t => Strategy a -> Strategy (t a) #

Deprecated: renamed to parTraversable

DEPRECATED: renamed to parTraversable

seqList :: Strategy a -> Strategy [a] #

Deprecated: renamed to evalList

DEPRECATED: renamed to evalList

seqPair :: Strategy a -> Strategy b -> Strategy (a, b) #

Deprecated: renamed to evalTuple2

DEPRECATED: renamed to evalTuple2

parPair :: Strategy a -> Strategy b -> Strategy (a, b) #

Deprecated: renamed to parTuple2

DEPRECATED: renamed to parTuple2

seqTriple :: Strategy a -> Strategy b -> Strategy c -> Strategy (a, b, c) #

Deprecated: renamed to evalTuple3

DEPRECATED: renamed to evalTuple3

parTriple :: Strategy a -> Strategy b -> Strategy c -> Strategy (a, b, c) #

Deprecated: renamed to parTuple3

DEPRECATED: renamed to parTuple3

For API completeness

so users of rdeepseq aren't required to import Control.DeepSeq:

class NFData a #

A class of types that can be fully evaluated.

Since: 1.1.0.0

Instances

NFData Bool
Methods rnf :: Bool -> () #
NFData Char
Methods rnf :: Char -> () #
NFData Double
Methods rnf :: Double -> () #
NFData Float
Methods rnf :: Float -> () #
NFData Int
Methods rnf :: Int -> () #
NFData Int8
Methods rnf :: Int8 -> () #
NFData Int16
Methods rnf :: Int16 -> () #
NFData Int32
Methods rnf :: Int32 -> () #
NFData Int64
Methods rnf :: Int64 -> () #
NFData Integer
Methods rnf :: Integer -> () #
NFData Word
Methods rnf :: Word -> () #
NFData Word8
Methods rnf :: Word8 -> () #
NFData Word16
Methods rnf :: Word16 -> () #
NFData Word32
Methods rnf :: Word32 -> () #
NFData Word64
Methods rnf :: Word64 -> () #
NFData CallStack	Since: 1.4.2.0
Methods rnf :: CallStack -> () #
NFData TypeRep	NOTE: Only defined for `base-4.8.0.0` and later Since: 1.4.0.0
Methods rnf :: TypeRep -> () #
NFData ()
Methods rnf :: () -> () #
NFData TyCon	NOTE: Only defined for `base-4.8.0.0` and later Since: 1.4.0.0
Methods rnf :: TyCon -> () #
NFData Natural	Since: 1.4.0.0
Methods rnf :: Natural -> () #
NFData Void	Defined as `rnf = absurd`. Since: 1.4.0.0
Methods rnf :: Void -> () #
NFData Version	Since: 1.3.0.0
Methods rnf :: Version -> () #
NFData Unique	Since: 1.4.0.0
Methods rnf :: Unique -> () #
NFData ThreadId	Since: 1.4.0.0
Methods rnf :: ThreadId -> () #
NFData ExitCode	Since: 1.4.2.0
Methods rnf :: ExitCode -> () #
NFData CChar	Since: 1.4.0.0
Methods rnf :: CChar -> () #
NFData CSChar	Since: 1.4.0.0
Methods rnf :: CSChar -> () #
NFData CUChar	Since: 1.4.0.0
Methods rnf :: CUChar -> () #
NFData CShort	Since: 1.4.0.0
Methods rnf :: CShort -> () #
NFData CUShort	Since: 1.4.0.0
Methods rnf :: CUShort -> () #
NFData CInt	Since: 1.4.0.0
Methods rnf :: CInt -> () #
NFData CUInt	Since: 1.4.0.0
Methods rnf :: CUInt -> () #
NFData CLong	Since: 1.4.0.0
Methods rnf :: CLong -> () #
NFData CULong	Since: 1.4.0.0
Methods rnf :: CULong -> () #
NFData CLLong	Since: 1.4.0.0
Methods rnf :: CLLong -> () #
NFData CULLong	Since: 1.4.0.0
Methods rnf :: CULLong -> () #
NFData CFloat	Since: 1.4.0.0
Methods rnf :: CFloat -> () #
NFData CDouble	Since: 1.4.0.0
Methods rnf :: CDouble -> () #
NFData CPtrdiff	Since: 1.4.0.0
Methods rnf :: CPtrdiff -> () #
NFData CSize	Since: 1.4.0.0
Methods rnf :: CSize -> () #
NFData CWchar	Since: 1.4.0.0
Methods rnf :: CWchar -> () #
NFData CSigAtomic	Since: 1.4.0.0
Methods rnf :: CSigAtomic -> () #
NFData CClock	Since: 1.4.0.0
Methods rnf :: CClock -> () #
NFData CTime	Since: 1.4.0.0
Methods rnf :: CTime -> () #
NFData CUSeconds	Since: 1.4.0.0
Methods rnf :: CUSeconds -> () #
NFData CSUSeconds	Since: 1.4.0.0
Methods rnf :: CSUSeconds -> () #
NFData CFile	Since: 1.4.0.0
Methods rnf :: CFile -> () #
NFData CFpos	Since: 1.4.0.0
Methods rnf :: CFpos -> () #
NFData CJmpBuf	Since: 1.4.0.0
Methods rnf :: CJmpBuf -> () #
NFData CIntPtr	Since: 1.4.0.0
Methods rnf :: CIntPtr -> () #
NFData CUIntPtr	Since: 1.4.0.0
Methods rnf :: CUIntPtr -> () #
NFData CIntMax	Since: 1.4.0.0
Methods rnf :: CIntMax -> () #
NFData CUIntMax	Since: 1.4.0.0
Methods rnf :: CUIntMax -> () #
NFData All	Since: 1.4.0.0
Methods rnf :: All -> () #
NFData Any	Since: 1.4.0.0
Methods rnf :: Any -> () #
NFData Fingerprint	Since: 1.4.0.0
Methods rnf :: Fingerprint -> () #
NFData SrcLoc	Since: 1.4.2.0
Methods rnf :: SrcLoc -> () #
NFData a => NFData [a]
Methods rnf :: [a] -> () #
NFData a => NFData (Maybe a)
Methods rnf :: Maybe a -> () #
NFData a => NFData (Ratio a)
Methods rnf :: Ratio a -> () #
NFData (Ptr a)	Since: 1.4.2.0
Methods rnf :: Ptr a -> () #
NFData (FunPtr a)	Since: 1.4.2.0
Methods rnf :: FunPtr a -> () #
NFData a => NFData (Identity a)	Since: 1.4.0.0
Methods rnf :: Identity a -> () #
NFData a => NFData (Min a)	Since: 1.4.2.0
Methods rnf :: Min a -> () #
NFData a => NFData (Max a)	Since: 1.4.2.0
Methods rnf :: Max a -> () #
NFData a => NFData (First a)	Since: 1.4.2.0
Methods rnf :: First a -> () #
NFData a => NFData (Last a)	Since: 1.4.2.0
Methods rnf :: Last a -> () #
NFData m => NFData (WrappedMonoid m)	Since: 1.4.2.0
Methods rnf :: WrappedMonoid m -> () #
NFData a => NFData (Option a)	Since: 1.4.2.0
Methods rnf :: Option a -> () #
NFData a => NFData (NonEmpty a)	Since: 1.4.2.0
Methods rnf :: NonEmpty a -> () #
NFData (Fixed a)	Since: 1.3.0.0
Methods rnf :: Fixed a -> () #
NFData a => NFData (Complex a)
Methods rnf :: Complex a -> () #
NFData (StableName a)	Since: 1.4.0.0
Methods rnf :: StableName a -> () #
NFData a => NFData (ZipList a)	Since: 1.4.0.0
Methods rnf :: ZipList a -> () #
NFData a => NFData (Dual a)	Since: 1.4.0.0
Methods rnf :: Dual a -> () #
NFData a => NFData (Sum a)	Since: 1.4.0.0
Methods rnf :: Sum a -> () #
NFData a => NFData (Product a)	Since: 1.4.0.0
Methods rnf :: Product a -> () #
NFData a => NFData (First a)	Since: 1.4.0.0
Methods rnf :: First a -> () #
NFData a => NFData (Last a)	Since: 1.4.0.0
Methods rnf :: Last a -> () #
NFData (IORef a)	NOTE: Only strict in the reference and not the referenced value. Since: 1.4.2.0
Methods rnf :: IORef a -> () #
NFData a => NFData (Down a)	Since: 1.4.0.0
Methods rnf :: Down a -> () #
NFData (MVar a)	NOTE: Only strict in the reference and not the referenced value. Since: 1.4.2.0
Methods rnf :: MVar a -> () #
NFData (a -> b)	This instance is for convenience and consistency with `seq`. This assumes that WHNF is equivalent to NF for functions. Since: 1.3.0.0
Methods rnf :: (a -> b) -> () #
(NFData a, NFData b) => NFData (Either a b)
Methods rnf :: Either a b -> () #
(NFData a, NFData b) => NFData (a, b)
Methods rnf :: (a, b) -> () #
(NFData a, NFData b) => NFData (Array a b)
Methods rnf :: Array a b -> () #
(NFData a, NFData b) => NFData (Arg a b)	Since: 1.4.2.0
Methods rnf :: Arg a b -> () #
NFData (Proxy k a)	Since: 1.4.0.0
Methods rnf :: Proxy k a -> () #
NFData (STRef s a)	NOTE: Only strict in the reference and not the referenced value. Since: 1.4.2.0
Methods rnf :: STRef s a -> () #
(NFData k, NFData a) => NFData (Map k a)
Methods rnf :: Map k a -> () #
(NFData a, NFData b, NFData c) => NFData (a, b, c)
Methods rnf :: (a, b, c) -> () #
NFData a => NFData (Const k a b)	Since: 1.4.0.0
Methods rnf :: Const k a b -> () #
(NFData a, NFData b, NFData c, NFData d) => NFData (a, b, c, d)
Methods rnf :: (a, b, c, d) -> () #
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5) => NFData (a1, a2, a3, a4, a5)
Methods rnf :: (a1, a2, a3, a4, a5) -> () #
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6) => NFData (a1, a2, a3, a4, a5, a6)
Methods rnf :: (a1, a2, a3, a4, a5, a6) -> () #
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7) => NFData (a1, a2, a3, a4, a5, a6, a7)
Methods rnf :: (a1, a2, a3, a4, a5, a6, a7) -> () #
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8) => NFData (a1, a2, a3, a4, a5, a6, a7, a8)
Methods rnf :: (a1, a2, a3, a4, a5, a6, a7, a8) -> () #
(NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8, NFData a9) => NFData (a1, a2, a3, a4, a5, a6, a7, a8, a9)
Methods rnf :: (a1, a2, a3, a4, a5, a6, a7, a8, a9) -> () #