registry

data structure for assembling components

Version on this page:	0.2.0.3
LTS Haskell 23.23:	0.6.3.2
Stackage Nightly 2025-05-19:	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.2.0.3@sha256:684af17175d361beabb922752e0de77d1e120e96b55471e30c6e8b8a7de938aa,5569

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.2.0.3