registry

data structure for assembling components

Version on this page:	0.1.4.0
LTS Haskell 20.26:	0.3.3.4
Stackage Nightly 2022-11-17:	0.3.3.4
Latest on Hackage:	0.6.1.0

See all snapshots registry appears in

MIT licensed

Maintained by [email protected]

This version can be pinned in stack with:registry-0.1.4.0@sha256:c193b64d66d24a49a035e81ae796cca05442ac4bdc5792f21a8b92562e3b377f,5229

Module documentation for 0.1.4.0

Data
- Data.Registry
  - Data.Registry.Dot
  - Data.Registry.Internal
    - Data.Registry.Internal.Cache
    - Data.Registry.Internal.Dot
    - Data.Registry.Internal.Dynamic
    - Data.Registry.Internal.Make
    - Data.Registry.Internal.Reflection
    - Data.Registry.Internal.Registry
    - Data.Registry.Internal.Stack
    - Data.Registry.Internal.Statistics
    - Data.Registry.Internal.Types
  - Data.Registry.Lift
  - Data.Registry.Make
  - Data.Registry.RIO
  - Data.Registry.Registry
  - Data.Registry.Solver
  - Data.Registry.State
  - Data.Registry.Statistics
  - Data.Registry.TH
  - Data.Registry.Warmup

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.