registry

data structure for assembling components

Version on this page:	0.1.7.0
LTS Haskell 23.24:	0.6.3.2
Stackage Nightly 2025-05-28:	0.6.3.2
Latest on Hackage:	0.6.3.2

See all snapshots registry appears in

MIT licensed

Maintained by [email protected]

This version can be pinned in stack with:registry-0.1.7.0@sha256:baa9a8896bde506d6fa56390d0d3292a17601313fa56e23f37148aea57b8da2d,5536

Depends on 13 packages(full list with versions):

base, containers, exceptions, hashable, mmorph, mtl, protolude, resourcet, semigroupoids, semigroups, template-haskell, text, transformers-base

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.

registry

Module documentation for 0.1.7.0