registry: data structure for assembling components
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.
[Skip to Readme]
Modules
[Index] [Quick Jump]
Downloads
- registry-0.6.3.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 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, 0.1.5.3, 0.1.5.4, 0.1.5.5, 0.1.6.0, 0.1.6.1, 0.1.6.2, 0.1.6.3, 0.1.7.0, 0.1.7.1, 0.1.8.0, 0.1.9.0, 0.1.9.1, 0.1.9.3, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.2.1.0, 0.3.0.0, 0.3.0.1, 0.3.0.2, 0.3.0.3, 0.3.0.4, 0.3.0.5, 0.3.0.6, 0.3.0.7, 0.3.0.8, 0.3.0.9, 0.3.1.0, 0.3.2.0, 0.3.2.1, 0.3.3.0, 0.3.3.1, 0.3.3.2, 0.3.3.3, 0.3.3.4, 0.4.0.0, 0.5.0.0, 0.6.0.0, 0.6.1.0, 0.6.2.0, 0.6.3.0 |
|---|---|
| Dependencies | base (>=4.14 && <5), containers (>=0.5 && <0.7), exceptions (>=0.8 && <0.11), hashable (>=1.2 && <1.5), mmorph (>=1.0 && <2), mtl (>=2.0 && <3), multimap (>=1.0 && <2), protolude (>=0.2 && <0.4), resourcet (>=1.1 && <2), semigroupoids (>=5.0 && <7), semigroups (>=0.15 && <0.30), template-haskell (>=2.13 && <3.0), text (>=1.1 && <3), transformers-base (>=0.4 && <0.5), unliftio (>=0.2 && <1) [details] |
| License | MIT |
| Author | |
| Maintainer | etorreborre@yahoo.com |
| Category | Control |
| Source repo | head: git clone https://github.com/etorreborre/registry |
| Uploaded | by etorreborre at 2024-12-19T09:41:23Z |
| Distributions | |
| Reverse Dependencies | 6 direct, 0 indirect [details] |
| Downloads | 22597 total (114 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2024-12-19 [all 1 reports] |
Readme for registry-0.6.3.0
[back to package description]Registry 
It's functions all the way down 
Presentation
This library provides a data structure, a "Registry", to control the creation of functions from other functions. You can use this technique to:
- create applications out of software components ("dependency injection")
- fine tune encoders/decoders (see the
registry-aesonand theregistry-messagepackprojects) - create composable data generators for nested datatypes (see the
registry-hedgehogand theregistry-hedgehog-aesonprojects)
You can watch a video presenting the main ideas behind the library here.
The following sections introduce in more details the problem that this library is addressing, the concepts behind the solution and various use-cases which can arise on real projects:
- what is the problem?
- the concept of a Registry and the resolution algorithm
- how does this compare to monad transformers and effects?
Tutorials
- tutorial: use a
Registryto create applications and define components - use a
Registryto compose Hedgehog generators - workshop: implement your own simplified registry and understand the basic concepts behind it
How-tos
- how to install this library?
- how to do mocking?
- how to specialize some values in some contexts?
- how to control effects occurring when creating a component (like a connection pool)?
- how to allocate resources which must be finalized?
- how to extract a dot graph from the registry in an application?
- how to interact with a library using monad transformers?
- how to remove boilerplate due to parameter passing?
- how to create a typeclass from a record of functions?
- how to read type errors?