Safe Haskell	None
Language	Haskell2010

Debug.Hoed.CompTree

Contents

Orphan instances

Synopsis

type CompTree = Graph Vertex ()
data Vertex
- = RootVertex
- | Vertex {
  - vertexStmt :: CompStmt
  - vertexJmt :: Judgement
  }
mkCompTree :: [CompStmt] -> Dependencies -> CompTree
isRootVertex :: Vertex -> Bool
vertexUID :: Vertex -> UID
vertexRes :: Vertex -> String
replaceVertex :: CompTree -> Vertex -> CompTree
getJudgement :: Vertex -> Judgement
setJudgement :: Vertex -> Judgement -> Vertex
isRight :: Vertex -> Bool
isWrong :: Vertex -> Bool
isUnassessed :: Vertex -> Bool
isAssisted :: Vertex -> Bool
isInconclusive :: Vertex -> Bool
isPassing :: Vertex -> Bool
leafs :: CompTree -> [Vertex]
data ConstantValue
- = ConstantValue {
  - valStmt :: !UID
  - valLoc :: !Location
  - valMin :: !UID
  - valMax :: !UID
  }
- | CVRoot
unjudgedCharacterCount :: CompTree -> Int
data TraceInfo = TraceInfo {
- computations :: !SpanZipper
- dependencies :: !Dependencies
}
traceInfo :: Verbosity -> Trace -> IO TraceInfo
data Graph vertex arc = Graph {
- root :: vertex
- vertices :: [vertex]
- arcs :: [Arc vertex arc]
}

Documentation

type CompTree = Graph Vertex () #

The forest of computation trees. Also see the Libgraph library.

data Vertex #

Constructors

RootVertex
Vertex
Fields vertexStmt :: CompStmt vertexJmt :: Judgement

Instances

Eq Vertex #
Instance details Defined in Debug.Hoed.CompTree Methods (==) :: Vertex -> Vertex -> Bool # (/=) :: Vertex -> Vertex -> Bool #
Ord Vertex #
Instance details Defined in Debug.Hoed.CompTree Methods compare :: Vertex -> Vertex -> Ordering # (<) :: Vertex -> Vertex -> Bool # (<=) :: Vertex -> Vertex -> Bool # (>) :: Vertex -> Vertex -> Bool # (>=) :: Vertex -> Vertex -> Bool # max :: Vertex -> Vertex -> Vertex # min :: Vertex -> Vertex -> Vertex #
Show Vertex #
Instance details Defined in Debug.Hoed.CompTree Methods showsPrec :: Int -> Vertex -> ShowS # show :: Vertex -> String # showList :: [Vertex] -> ShowS #
Generic Vertex #
Instance details Defined in Debug.Hoed.CompTree Associated Types type Rep Vertex :: * -> * # Methods from :: Vertex -> Rep Vertex x # to :: Rep Vertex x -> Vertex #
Serialize Vertex #
Instance details Defined in Debug.Hoed.Serialize Methods put :: Putter Vertex # get :: Get Vertex #
NFData Vertex #
Instance details Defined in Debug.Hoed.CompTree Methods rnf :: Vertex -> () #
Hashable Vertex #
Instance details Defined in Debug.Hoed.CompTree Methods hashWithSalt :: Int -> Vertex -> Int # hash :: Vertex -> Int #
type Rep Vertex #
Instance details Defined in Debug.Hoed.CompTree type Rep Vertex = D1 (MetaData "Vertex" "Debug.Hoed.CompTree" "Hoed-0.5.1-Ds6BWeW7Ove9R4dNQkZmNi" False) (C1 (MetaCons "RootVertex" PrefixI False) (U1 :: * -> ) :+: C1 (MetaCons "Vertex" PrefixI True) (S1 (MetaSel (Just "vertexStmt") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 CompStmt) :: S1 (MetaSel (Just "vertexJmt") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Judgement)))

mkCompTree :: [CompStmt] -> Dependencies -> CompTree #

isRootVertex :: Vertex -> Bool #

vertexUID :: Vertex -> UID #

vertexRes :: Vertex -> String #

replaceVertex :: CompTree -> Vertex -> CompTree #

getJudgement :: Vertex -> Judgement #

setJudgement :: Vertex -> Judgement -> Vertex #

isRight :: Vertex -> Bool #

isWrong :: Vertex -> Bool #

isUnassessed :: Vertex -> Bool #

isAssisted :: Vertex -> Bool #

isInconclusive :: Vertex -> Bool #

isPassing :: Vertex -> Bool #

leafs :: CompTree -> [Vertex] #

data ConstantValue #

Constructors

ConstantValue
Fields valStmt :: !UID valLoc :: !Location valMin :: !UID valMax :: !UID
CVRoot

Instances

Eq ConstantValue #
Instance details Defined in Debug.Hoed.CompTree Methods (==) :: ConstantValue -> ConstantValue -> Bool # (/=) :: ConstantValue -> ConstantValue -> Bool #
Show ConstantValue #
Instance details Defined in Debug.Hoed.CompTree Methods showsPrec :: Int -> ConstantValue -> ShowS # show :: ConstantValue -> String # showList :: [ConstantValue] -> ShowS #

unjudgedCharacterCount :: CompTree -> Int #

Approximates the complexity of a computation tree by summing the length of the unjudged computation statements (i.e not Right or Wrong) in the tree.

data TraceInfo #

Constructors

TraceInfo
Fields computations :: !SpanZipper dependencies :: !Dependencies

Instances

Show TraceInfo #
Instance details Defined in Debug.Hoed.CompTree Methods showsPrec :: Int -> TraceInfo -> ShowS # show :: TraceInfo -> String # showList :: [TraceInfo] -> ShowS #

traceInfo :: Verbosity -> Trace -> IO TraceInfo #

data Graph vertex arc #

Constructors

Graph
Fields root :: vertex vertices :: [vertex] arcs :: [Arc vertex arc]

Instances

Generic (Graph vertex arc)
Instance details Defined in Data.Graph.Libgraph.Core Associated Types type Rep (Graph vertex arc) :: * -> * # Methods from :: Graph vertex arc -> Rep (Graph vertex arc) x # to :: Rep (Graph vertex arc) x -> Graph vertex arc #
(Serialize a, Serialize b) => Serialize (Graph a b) #
Instance details Defined in Debug.Hoed.Serialize Methods put :: Putter (Graph a b) # get :: Get (Graph a b) #
type Rep (Graph vertex arc)
Instance details Defined in Data.Graph.Libgraph.Core type Rep (Graph vertex arc) = D1 (MetaData "Graph" "Data.Graph.Libgraph.Core" "libgraph-1.14-IjYxzy2QWeQJJ5hFS641UW" False) (C1 (MetaCons "Graph" PrefixI True) (S1 (MetaSel (Just "root") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 vertex) :: (S1 (MetaSel (Just "vertices") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [vertex]) :: S1 (MetaSel (Just "arcs") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Arc vertex arc]))))

Orphan instances

NFData AssistedMessage #
Instance details Methods rnf :: AssistedMessage -> () #
NFData Judgement #
Instance details Methods rnf :: Judgement -> () #
(NFData a, NFData b) => NFData (Arc a b) #
Instance details Methods rnf :: Arc a b -> () #