registry: data structure for assembling components

[ control, library, mit ] [ Propose Tags ]

This library provides a Registry which is a data structure containing a list of functions and values representing dependencies in a directed acyclic graph. A make function can then be used to create a value of a specific type out of the registry. You can start with the README for a full description of the library.

Versions [faq] 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4, 0.1.0.5, 0.1.1.0, 0.1.1.1, 0.1.1.2, 0.1.2.0, 0.1.2.2, 0.1.2.3, 0.1.2.4, 0.1.2.5, 0.1.2.6
Dependencies base (>=4.7 && <5), exceptions (<0.11), mtl (<3), protolude (<0.3), resourcet (<1.3), text (<2), transformers-base (<0.5) [details]
License MIT
Author
Maintainer etorreborre@yahoo.com
Category Control
Source repo head: git clone https://github.com/etorreborre/registry
Uploaded by etorreborre at Mon Dec 17 08:36:09 UTC 2018
Distributions LTSHaskell:0.1.2.6, NixOS:0.1.2.6, Stackage:0.1.2.6
Downloads 678 total (251 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2018-12-17 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees