hxt-8.3.1: A collection of tools for processing XML with Haskell.Source codeContentsIndex
Data.Tree.Class
Portabilityportable
Stabilityexperimental
MaintainerUwe Schmidt (uwe\@fh-wedel.de)
Description
Interface definition for trees
Synopsis
class Tree t where
mkTree :: a -> [t a] -> t a
mkLeaf :: a -> t a
isLeaf :: t a -> Bool
isInner :: t a -> Bool
getNode :: t a -> a
getChildren :: t a -> [t a]
changeNode :: (a -> a) -> t a -> t a
changeChildren :: ([t a] -> [t a]) -> t a -> t a
setNode :: a -> t a -> t a
setChildren :: [t a] -> t a -> t a
foldTree :: (a -> [b] -> b) -> t a -> b
nodesTree :: t a -> [a]
depthTree :: t a -> Int
cardTree :: t a -> Int
formatTree :: (a -> String) -> t a -> String
Documentation
class Tree t whereSource
The interface for trees
Methods
mkTree :: a -> [t a] -> t aSource
tree construction: a new tree is constructed by a node attribute and a list of children
mkLeaf :: a -> t aSource

leaf construction: leafs don't have any children

definition: mkLeaf n = mkTree n []

isLeaf :: t a -> BoolSource
leaf test: list of children empty?
isInner :: t a -> BoolSource
innner node test: not . isLeaf
getNode :: t a -> aSource
select node attribute
getChildren :: t a -> [t a]Source
select children
changeNode :: (a -> a) -> t a -> t aSource
edit node attribute
changeChildren :: ([t a] -> [t a]) -> t a -> t aSource
edit children
setNode :: a -> t a -> t aSource
substitute node: setNode n = changeNode (const n)
setChildren :: [t a] -> t a -> t aSource
substitute children: setChildren cl = changeChildren (const cl)
foldTree :: (a -> [b] -> b) -> t a -> bSource
fold for trees
nodesTree :: t a -> [a]Source
all nodes of a tree
depthTree :: t a -> IntSource
depth of a tree
cardTree :: t a -> IntSource
number of nodes in a tree
formatTree :: (a -> String) -> t a -> StringSource

format tree for readable trace output

a graphical representation of the tree in text format

show/hide Instances
Produced by Haddock version 2.4.2