registry

data structure for assembling components

Version on this page:	0.1.2.3
LTS Haskell 23.25:	0.6.3.2
Stackage Nightly 2025-06-18:	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.2.3@sha256:160d395b7ce2e6aece3aebaeb5a7d5352e291a02c50bbb15a202c2c7b92e3e90,4725

Module documentation for 0.1.2.3

Data
- Data.Registry

Depends on 11 packages(full list with versions):

base, containers, exceptions, hashable, mtl, protolude, resourcet, semigroupoids, semigroups, 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.