Safe Haskell | None |
---|---|
Language | Haskell2010 |
Example of Dot graph construction for the NumHask class heirarchy.
Synopsis
- data Class
- = Magma
- | Unital
- | Associative
- | Commutative
- | Invertible
- | Idempotent
- | Absorbing
- | Group
- | AbelianGroup
- | Additive
- | Subtractive
- | Multiplicative
- | Divisive
- | Distributive
- | Semiring
- | Ring
- | IntegralDomain
- | Field
- | ExpField
- | QuotientField
- | UpperBoundedField
- | LowerBoundedField
- | TrigField
- | AdditiveAction
- | SubtractiveAction
- | MultiplicativeAction
- | DivisiveAction
- | Module
- | JoinSemiLattice
- | MeetSemiLattice
- | Lattice
- | BoundedJoinSemiLattice
- | BoundedMeetSemiLattice
- | BoundedLattice
- | Integral
- | Ratio
- | Signed
- | Norm
- | Basis
- | Direction
- | Epsilon
- data Family
- data Dependency = Dependency {}
- dependencies :: [Dependency]
- classesNH :: [Class]
- classesModule :: [(Class, Text)]
- dependenciesNH :: [Dependency] -> [Dependency]
- graphNHG :: Graph Class
- dotGraphNH :: Directed -> Graph
- dotGraphNH' :: Directed -> Graph
- toLink :: ID -> Text
- writeNHChart :: IO ()
Documentation
>>>
import DotParse
>>>
:set -XOverloadedStrings
data Dependency Source #
Instances
Eq Dependency Source # | |
Defined in DotParse.Examples.NumHask (==) :: Dependency -> Dependency -> Bool # (/=) :: Dependency -> Dependency -> Bool # | |
Ord Dependency Source # | |
Defined in DotParse.Examples.NumHask compare :: Dependency -> Dependency -> Ordering # (<) :: Dependency -> Dependency -> Bool # (<=) :: Dependency -> Dependency -> Bool # (>) :: Dependency -> Dependency -> Bool # (>=) :: Dependency -> Dependency -> Bool # max :: Dependency -> Dependency -> Dependency # min :: Dependency -> Dependency -> Dependency # | |
Show Dependency Source # | |
Defined in DotParse.Examples.NumHask showsPrec :: Int -> Dependency -> ShowS # show :: Dependency -> String # showList :: [Dependency] -> ShowS # |
dependencies :: [Dependency] Source #
classesModule :: [(Class, Text)] Source #
dependenciesNH :: [Dependency] -> [Dependency] Source #
dotGraphNH :: Directed -> Graph Source #
NumHask statements in a dot Graph with box shapes for the nodes.
dotGraphNH' :: Directed -> Graph Source #
dotGraphNH
after being positionally processed via processGraph
Convert a node ID to a label for chart-svg charts
Doing this directly in dot doesn't quite work because the engines get the width of the link wrong.
writeNHChart :: IO () Source #
A chart-svg chart with label links
writeChartSvg "other/nh.svg" (graphToChart toLink (dotGraphNH' Directed))