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, 0.1.3.0, 0.1.3.1, 0.1.3.2, 0.1.3.3, 0.1.3.4, 0.1.3.5, 0.1.3.6, 0.1.4.0, 0.1.4.1, 0.1.4.2, 0.1.5.0, 0.1.5.1, 0.1.5.2
Dependencies base (>=4.7 && <5), containers (>=0.5 && <0.7), exceptions (>=0.8 && <0.11), hashable (==1.2.*), mmorph (>=1.0 && <2), mtl (>=2.0 && <3), protolude (==0.2.*), resourcet (>=1.1 && <1.3), semigroupoids (>=5.0 && <5.4), semigroups (>=0.15 && <0.20), template-haskell (>=2.13 && <3.0), text (>=1.1 && <2), transformers-base (==0.4.*) [details]
License MIT
Author
Maintainer etorreborre@yahoo.com
Category Control
Source repo head: git clone https://github.com/etorreborre/registry
Uploaded by etorreborre at Wed May 15 06:18:06 UTC 2019
Distributions LTSHaskell:0.1.5.1, NixOS:0.1.5.1, Stackage:0.1.4.2
Downloads 1880 total (443 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 2019-05-15 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees