The flexible-defaults package
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||0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.1.0, 0.0.1.1, 0.0.1.2|
|Dependencies||base (>=3 && <5), containers, template-haskell, th-extras, transformers [details]|
|Author||James Cook <firstname.lastname@example.org>|
|Maintainer||James Cook <email@example.com>|
|Category||Code Generation, Template Haskell|
|Source repository||head: git clone https://github.com/mokus0/flexible-defaults.git|
|Uploaded||Mon May 30 03:23:43 UTC 2016 by JamesCook|
|Distributions||Debian:0.0.1.1, LTSHaskell:0.0.1.2, NixOS:0.0.1.2, Stackage:0.0.1.2, Tumbleweed:0.0.1.2|
|Downloads||4821 total (22 in the last 30 days)|
|Status||Docs available [build log]
Last success reported on 2016-05-30 [all 1 reports]
For package maintainers and hackage trustees