| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Debug.Hoed.CompTree
- type CompTree = Graph Vertex ()
- data Vertex
- = RootVertex
- | Vertex { }
- 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
- unjudgedCharacterCount :: CompTree -> Int
- data TraceInfo = TraceInfo {
- computations :: !SpanZipper
- dependencies :: !Dependencies
- traceInfo :: Int -> Trace -> TraceInfo
- data Graph vertex arc :: * -> * -> * = Graph {}
Documentation
type CompTree = Graph Vertex () Source #
The forest of computation trees. Also see the Libgraph library.
Constructors
| RootVertex | |
| Vertex | |
Fields
| |
mkCompTree :: [CompStmt] -> Dependencies -> CompTree Source #
isRootVertex :: Vertex -> Bool Source #
getJudgement :: Vertex -> Judgement Source #
isUnassessed :: Vertex -> Bool Source #
isAssisted :: Vertex -> Bool Source #
isInconclusive :: Vertex -> Bool Source #
unjudgedCharacterCount :: CompTree -> Int Source #
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.
Constructors
| TraceInfo | |
Fields
| |