GHC.Generics-based rnf implementation
This provides a generic rnf implementation for one type at a time. If the type of the value genericRnf is asked to reduce to NF contains values of other types, those types have to provide NFData instances. This also means that recursive types can only be used with genericRnf if a NFData instance has been defined as well (see examples below).
The typical usage for genericRnf is for reducing boilerplate code when defining NFData instances for ordinary algebraic datatypes. See the code below for some simple usage examples:
{-# LANGUAGE DeriveGeneric #-}
import Control.DeepSeq
import Control.DeepSeq.Generics (genericRnf)
import GHC.Generics
-- simple record
data Foo = Foo AccountId Name Address
deriving Generic
type Address = [String]
type Name = String
newtype AccountId = AccountId Int
instance NFData AccountId
instance NFData Foo where rnf = genericRnf
-- recursive list-like type
data N = Z | S N deriving Generic
instance NFData N where rnf = genericRnf
-- parametric & recursive type
data Bar a = Bar0 | Bar1 a | Bar2 (Bar a)
deriving Generic
instance NFData a => NFData (Bar a) where rnf = genericRnfNOTE: The GNFData type-class showing up in the type-signature is
used internally and not exported.