A wrapper library for barbies to generate strippable HKDs. It transforms the following declaration
declareBareB [d|
data Foo = Foo
{ foo :: Int
, bar :: String
} |]
into:
data Foo sw h = Foo
{ foo :: Wear sw h Int,
, bar :: Wear sw h String
} deriving Generic
instance BareB Foo
instance FieldNamesB (Foo Covered) where
bfieldNames = Foo (Const "foo") (Const "bar")
instance ProductB (Foo Covered) where
bprod (Foo xfoo xbar) (Foo yfoo ybar)
= Foo (Pair xfoo yfoo) (Pair xbar ybar)
instance FunctorB (Foo Covered) where ...
instance TraversableB (Foo Covered) where ...
instance ConstraintsB (Foo Covered)
instance ProductBC (Foo Covered)
GHC sometimes takes very long time to compile code with generically derived instances, and it often fails to inline functions properly too. This package generates most instance methods by TH, reducing large amount of compilation time of the declarations and use sites.
Unlike higgledy which relies on
in-memory representation using GHC.Generic
, you don't have to worry about the performance, and you can benefit from various language features
(e.g. -Wmissing-fields, RecordWildCards
etc) even in higher-kinded form.