úÎ!ò&   (c) 2009 Andy GillBSD3Andy Gill <andygill@ku.edu>unstableghcSafe>Ò data-reify: is a basic graph structure over nodes of the higher kind eà, with a single root. There is an assumption that there is no Unique used in a node which does not have a corresponding entry is the association list. The idea with this structure is that it is trivial to convert into an Array, IntMap9, or into a Martin Erwig's Functional Graph, as required. data-reifyIf e is s Functor, and e is  -able, then we can   a .Safe EHSVXî data-reifys is a class that provided a way to reference into a specific type, and a way to map over the deferenced internals. data-reify$ takes a data structure that admits , and returns a ? that contains the dereferenced nodes, with their children as s rather than recursive values. data-reify takes a  % container 't s' of a data structure s admitting ], and returns a 't (Graph (DeRef s))' with the graph nodes resolved within the same context.?This allows for, e.g., a list of mutually recursive structures.  data-reify;A map of stable names to unique numbers. Invariant: all UniquesW that appear in the range are less than the current value in the unique name supply. data-reifyThe key-value pairs in the Û that is being built. Invariant 1: the domain of this association list is a subset of the range of the map of stable names. Invariant 2: the domain of this association list will never contain duplicate keys. data-reifyA supply of unique names. data-reify‚The unique numbers that we have encountered so far. Invariant: this set is a subset of the range of the map of stable names. data-reify$The value for which we will reify a . data-reify&The unique number for the value above.     'data-reify-0.6.3-3NIt9qJs3KHLrQq7sRqusNData.Reify.Graph Data.ReifyUniqueGraph $fShowGraphMuRefDeRefmapDeRef reifyGraph reifyGraphs$fEqDynStableName$fHashableDynStableNamebaseGHC.ShowShowData.Traversable Traversable findNodes