red-black-record: Extensible records and variants indexed by a type-level Red-Black tree.
A library that provides extensible records and variants, both indexed by a type-level red-black tree that maps Symbol keys to value types of any kind.
The keys correspond to fields names in records, and to branch names in variants.
At the term level, value types come wrapped in a type
constructor of kind
q -> Type, where
q is the kind of
The records and variants can be converted to and from
regular Haskell datatypes; also to and from the unlabelled
n-ary products and sums of the
[Skip to Readme]
|Versions [faq]||18.104.22.168, 22.214.171.124, 126.96.36.199, 188.8.131.52, 184.108.40.206, 220.127.116.11, 18.104.22.168, 22.214.171.124, 126.96.36.199, 188.8.131.52, 184.108.40.206, 220.127.116.11, 18.104.22.168, 22.214.171.124, 126.96.36.199, 188.8.131.52, 184.108.40.206, 220.127.116.11, 18.104.22.168, 22.214.171.124|
|Dependencies||base (>=126.96.36.199 && <5), red-black-record, sop-core (>=0.4.0.0 && <0.6) [details]|
|Source repo||head: git clone https://github.com/danidiaz/red-black-record.git|
|Uploaded||by DanielDiazCarrete at 2020-05-30T15:49:30Z|
|Downloads||5224 total (26 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user [build log]
Last success reported on 2020-05-30 [all 1 reports]
For package maintainers and hackage trustees