Copyright | Copyright (C) 2005 Uwe Schmidt |
---|---|
License | MIT |
Maintainer | Uwe Schmidt (uwe\@fh-wedel.de) |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell98 |
Data.Tree.Class
Description
Interface definition for trees
Documentation
The interface for trees
Minimal complete definition
mkTree, getNode, getChildren, changeNode, changeChildren, foldTree
Methods
tree construction: a new tree is constructed by a node attribute and a list of children
leaf construction: leafs don't have any children
definition: mkLeaf n = mkTree n []
leaf test: list of children empty?
innner node test: not . isLeaf
select node attribute
getChildren :: t a -> [t a] #
select children
changeNode :: (a -> a) -> t a -> t a #
edit node attribute
changeChildren :: ([t a] -> [t a]) -> t a -> t a #
edit children
substitute node: setNode n = changeNode (const n)
setChildren :: [t a] -> t a -> t a #
substitute children: setChildren cl = changeChildren (const cl)
foldTree :: (a -> [b] -> b) -> t a -> b #
fold for trees
all nodes of a tree
depth of a tree
number of nodes in a tree
formatTree :: (a -> String) -> t a -> String #
format tree for readable trace output
a graphical representation of the tree in text format