Dvda.Algorithm.Reify

This file is a modified version from Andy Gill's data-reify package It is modified to use Data.HashTable.IO, which gives a speed improvement at the expense of portability. This also gives me a more convenient sandbox to investigate other performance tweaks, though it is unclear if I have made anything any faster.

Documentation

data ReifyGraph e

Constructors

ReifyGraph [(Node, e Node)]

newtype Node

Constructors

Node Int

Instances

Eq Node

Ord Node

Show Node

reifyGraph :: forall t a. Traversable t => t (Expr a) -> IO (ReifyGraph (GExpr a), t Node)