registry

data structure for assembling components

Version on this page:	0.1.3.1
LTS Haskell 24.28:	0.6.3.3
Stackage Nightly 2026-01-19:	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.3.1@sha256:45dc2a6f0abfe96bdb206b3d49ce55aec01d8afcf5df0b843a92d86a90f359f5,5106

Module documentation for 0.1.3.1

Data
- Data.Registry

Depends on 12 packages(full list with versions):

base, containers, exceptions, hashable, 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.