registry

data structure for assembling components

Version on this page:	0.1.4.2
LTS Haskell 24.28:	0.6.3.3
Stackage Nightly 2026-01-17:	0.6.3.3
Latest on Hackage:	0.6.3.3

See all snapshots registry appears in

MIT licensed

Maintained by [email protected]

This version can be pinned in stack with:registry-0.1.4.2@sha256:27e00e78b892b5a8bff775eb93a7eb47adf92d92375f17153728a0f3ffa89643,5229

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