registry

data structure for assembling components

Version on this page:	0.1.9.0
LTS Haskell 24.1:	0.6.3.2
Stackage Nightly 2025-07-24:	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.9.0@sha256:dc4815f11a8b2f906199c4532601be7778605aa8b1fd5e1a71a4c71e44911d58,5547

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