Reify a recursive data structure into an explicit graph.

Version on this page:0.6@rev:1
LTS Haskell 22.22:0.6.3@rev:3
Stackage Nightly 2024-05-23:0.6.3@rev:3
Latest on Hackage:0.6.3@rev:3

See all snapshots data-reify appears in

BSD-3-Clause licensed by Andy Gill
Maintained by Andy Gill
This version can be pinned in stack with:data-reify-0.6@sha256:60185d3fdb87fe62f297eb4473d58a7ccf93d1b6ee790a8b2faed79e1ac833c1,3358

Module documentation for 0.6

  • Data
    • Data.Reify
      • Data.Reify.Graph
Depends on 2 packages(full list with versions):
Used by 1 package in lts-0.7(full list with versions):

'data-reify' provided the ability to turn recursive structures into explicit graphs. Many (implicitly or explicitly) recursive data structure can be given this ability, via a type class instance. This gives an alternative to using Ref for observable sharing.

Observable sharing in general is unsafe, so we use the IO monad to bound this effect, but can be used safely even with unsafePerformIO if some simple conditions are met. Typically this package will be used to tie the knot with DSL's that depend of observable sharing, like Lava.

Providing an instance for MuRef is the mechanism for allowing a structure to be reified into a graph, and several examples of this are provided.

History: Version 0.1 used unsafe pointer compares. Version 0.2 of 'data-reify' used StableNames, and was much faster. Version 0.3 provided two versions of MuRef, the mono-typed version, for trees of a single type, and the dynamic-typed version, for trees of different types. Version 0.4 used Int as a synonym for Unique rather than Data.Unique for node ids, by popular demand. Version 0.5 merged the mono-typed and dynamic version again, by using DynStableName, an unphantomized version of StableName.

© 2009 Andy Gill; BSD3 license.