Safe Haskell | None |
---|
Dvda.Algorithm.Reify
Description
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 Source
Constructors
ReifyGraph [(Node, e Node)] |
reifyGraph :: forall t a. Traversable t => t (Expr a) -> IO (ReifyGraph (GExpr a), t Node)Source