vacuum-2.1.0.0: Graph representation of the GHC heap

Portabilitynon-portable (GHC only)
Stabilityexperimental
Maintainermad.one@gmail.com
Safe HaskellNone

GHC.Vacuum.Pretty

Description

 

Synopsis

Documentation

data ShowHNode Source

Constructors

ShowHNode 

Fields

showHNode :: Int -> HNode -> String
 
externHNode :: Int -> String
 

data Draw e v m a Source

To assist in "rendering" the graph to some source.

Constructors

Draw 

Fields

mkV :: Int -> a -> m v
 
mkE :: v -> v -> m e
 
succs :: a -> [Int]
 

newtype G e v Source

Constructors

G 

Fields

unG :: IntMap (v, IntMap e)
 

Instances

(Eq e, Eq v) => Eq (G e v) 
(Eq (G e v), Ord e, Ord v) => Ord (G e v) 
(Read e, Read v) => Read (G e v) 
(Show e, Show v) => Show (G e v) 

draw :: Monad m => Draw e v m a -> IntMap a -> m (G e v)Source

printDraw :: Draw (Int, Int) Int IO HNodeSource

An example Draw

split :: (a -> [Int]) -> IntMap a -> IntMap ([Int], [Int])Source

Build a map to (preds,succs)