Tree package:hxt

hxt Control.Arrow.ArrowTree Data.Tree.Class

The interface for trees

treeRepOfXmlDoc :: ArrowList a => a XmlTree XmlTree

convert a document into a text representation in tree form. Useful for debugging and trace output. see also : haskellRepOfXmlDoc, numberLinesInXmlDoc

module Control.Arrow.ArrowNavigatableTree

hxt

List arrows for navigatable trees Trees that implement the Data.Tree.NavigatableTree.Class interface, can be processed with these arrows.

class (ArrowList a) => ArrowNavigatableTree a

hxt Control.Arrow.ArrowNavigatableTree

The interface for navigatable tree arrows all functions have default implementations

changeThisTree :: (ArrowList a, ArrowIf a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t) => a (t b) (t b) -> a (nt b) (nt b)

hxt Control.Arrow.ArrowNavigatableTree

Change the current subtree of a navigatable tree. The arrow for computing the changes should be deterministic. If it fails nothing is changed.

substThisTree :: (ArrowList a, ArrowIf a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t) => t b -> a (nt b) (nt b)

hxt Control.Arrow.ArrowNavigatableTree

Substitute the current subtree of a navigatable tree by a given tree

module Control.Arrow.ArrowTree

hxt

List arrows for tree processing. Trees that implement the Data.Tree.Class interface, can be processed with these arrows.

class (ArrowPlus a, ArrowIf a) => ArrowTree a

hxt Control.Arrow.ArrowTree

The interface for tree arrows all functions have default implementations

insertTreeTemplate :: (ArrowTree a, Tree t) => a (t b) (t b) -> [IfThen (a (t b) c) (a (t b) (t b))] -> a (t b) (t b)

hxt Control.Arrow.ArrowTree

an arrow for inserting a whole subtree with some holes in it (a template) into a document. The holes can be filled with contents from the input. Example

insertTreeTemplateTest :: ArrowXml a => a b XmlTree
insertTreeTemplateTest
= doc
>>>
insertTreeTemplate template pattern
where
doc                                                                -- the input data
= constA "<x><y>The Title</y><z>The content</z></x>"
>>> xread
template                                                           -- the output template with 2 holes: xxx and yyy
= constA "<html><head><title>xxx</title></head><body><h1>yyy</h1></body></html>"
>>> xread
pattern
= [ hasText (== "xxx")                                          -- fill the xxx hole with the input contents from element "x/y"
:-> ( getChildren >>> hasName "y" >>> deep isText )

, hasText (== "yyy")                                          -- fill the yyy hole with the input contents from element "x/z"
:-> ( getChildren >>> hasName "z" >>> getChildren )
]

computes the XML tree for the following document

"<html><head><title>The Title</title></head><body><h1>The content</h1></body></html>"

mkTree :: (ArrowTree a, Tree t) => b -> [t b] -> a c (t b)

hxt Control.Arrow.ArrowTree

construct an inner node

module Control.Arrow.NTreeEdit

hxt

arrows for efficient editing of rose trees

editNTreeA :: [IfThen (LA (NTree b) c) (LA (NTree b) (NTree b))] -> LA (NTree b) (NTree b)

hxt Control.Arrow.NTreeEdit

Edit parts of a rose tree The subtrees to be modified are selected by the first part of the IfThen pairs The modification by the second part

fmapNTreeA :: (b -> Maybe b) -> LA (NTree b) (NTree b)

hxt Control.Arrow.NTreeEdit

cardTree :: Tree t => t a -> Int

hxt Data.Tree.Class

number of nodes in a tree

depthTree :: Tree t => t a -> Int

hxt Data.Tree.Class

depth of a tree

foldTree :: Tree t => (a -> [b] -> b) -> t a -> b

hxt Data.Tree.Class

fold for trees

formatNTree' :: Tree t => (a -> String) -> (String -> String) -> (String -> String) -> t a -> String -> String

hxt Data.Tree.Class

convert a tree into a pseudo graphical string representation

formatTree :: Tree t => (a -> String) -> t a -> String

hxt Data.Tree.Class

format tree for readable trace output a graphical representation of the tree in text format

mkTree :: Tree t => a -> [t a] -> t a

hxt Data.Tree.Class

tree construction: a new tree is constructed by a node attribute and a list of children

nodesTree :: Tree t => t a -> [a]

hxt Data.Tree.Class

all nodes of a tree

editNTreeBottomUp :: (NTree a -> Maybe [NTree a]) -> NTree a -> [NTree a]

hxt Data.Tree.NTree.Edit

editNTreeBottomUp is a space optimized tree edit function The nodes in a tree are visited bottom up. An edit function is applied to all nodes. A Nothing result of the editing function indicates no changes. This is used to share the input tree within the resulting tree. The following law holds:

editNTreeBottomUp (const Nothing) t == [t]

In this case the resulting tree does not only represent the same value but it is the same machine value (relative to some evaluations of closures during the tree walk With a simple fold like editing function the whole tree would be reconstructed in memory

mapNTree' :: (a -> Maybe a) -> NTree a -> NTree a

hxt Data.Tree.NTree.Edit

A space optimized map for NTrees Subtrees, that are not changed are reused in the resulting tree See also: editNTreeBottomUp

data NTree a

hxt Data.Tree.NTree.TypeDefs

n-ary ordered tree (rose trees) a tree consists of a node and a possible empty list of children. If the list of children is empty, the node is a leaf, else it's an inner node. NTree implements Eq, Ord, Show and Read

NTree :: a -> NTrees a -> NTree a

hxt Data.Tree.NTree.TypeDefs

type NTrees a = [NTree a]

hxt Data.Tree.NTree.TypeDefs

shortcut for a sequence of n-ary trees