flexible-defaults: Generate default function implementations for complex type classes.
Template Haskell code to implement default implementations for type-class functions based on which functions are already implemented. Currently extremely crude but still fairly effective.
When defining a type class with many functions, each of which can be implemented based on arbitrary subsets of the others, the standard default-implementation concept breaks down quite badly. This library provides a system by which more complex rules can be described for choosing default implementations based on which ones the user supplies. These implementations can additionally be given "suitability scores", so that when multiple possible choices could be made, the library can choose the "best" one.
|Versions [faq]||0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.1.0, 0.0.1.1, 0.0.1.2, 0.0.2|
|Dependencies||base (>=3 && <5), containers, semigroups (==0.18.*), template-haskell, th-extras, transformers [details]|
|Author||James Cook <firstname.lastname@example.org>|
|Maintainer||Peter Simons <email@example.com>|
|Category||Code Generation, Template Haskell|
|Source repo||head: git clone https://github.com/peti/flexible-defaults.git|
|Uploaded||by PeterSimons at Mon Jun 25 14:20:16 UTC 2018|
|Distributions||Debian:0.0.2, LTSHaskell:0.0.2, NixOS:0.0.2, Stackage:0.0.2|
|Downloads||7436 total (150 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2018-06-25 [all 1 reports]
For package maintainers and hackage trustees