Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
data ShowRejectsOpt Source #
Instances
Eq ShowRejectsOpt Source # | |
Defined in Language.REST.RESTDot (==) :: ShowRejectsOpt -> ShowRejectsOpt -> Bool # (/=) :: ShowRejectsOpt -> ShowRejectsOpt -> Bool # |
data PrettyPrinter rule term ord Source #
PrettyPrinter | |
|
rejNodeID :: (Hashable rule, Hashable term, Hashable a) => GraphType -> Path rule term a -> term -> String Source #
rejectedNodes :: forall rule term a. (Hashable rule, Hashable term, Hashable a) => GraphType -> PrettyPrinter rule term a -> Path rule term a -> Set Node Source #
getNodeID :: (Hashable rule, Hashable term, Hashable a) => GraphType -> Path rule term a -> String Source #
endNode :: (Hashable rule, Hashable term, Hashable a) => GraphType -> PrettyPrinter rule term a -> Path rule term a -> Node Source #
toEdges :: forall rule term a. (Hashable rule, Hashable term, Hashable a) => GraphType -> PrettyPrinter rule term a -> Path rule term a -> Set Edge Source #
toNodes :: (Hashable rule, Hashable term, Hashable a) => GraphType -> PrettyPrinter rule term a -> Path rule term a -> Set Node Source #