Data.Tree

newtype Tree a

A Rose, or multi-way tree, with values of type a.

Constructors

• Node { children :: Forest a, value :: a }

Instances

• (Generic a) => Generic (Tree a)
• (Generic a) => Eq (Tree a)
• (Generic a) => Show (Tree a)
• Functor Tree
• Apply Tree
• Applicative Tree
• Bind Tree
• Monad Tree
• Foldable Tree
• Traversable Tree

type Forest a = List (Tree a)

A Forest is a list of Trees.

mkTree :: forall a. a -> Forest a -> Tree a

Create a Tree from a Node value of type a and a Forest of children.

Operator alias for Data.Tree.mkTree (non-associative / precedence 5)

drawTree :: Tree String -> String

Draw a 2D String representation of a Tree String.

showTree :: forall a. Show a => Tree a -> String

Draw a 2D String representation of a Tree composed of Showable elements.

scanTree :: forall b a. (a -> b -> b) -> b -> Tree a -> Tree b

Scan a Tree, accumulating values of b there are constant across Nodes that have the same parent.

scanTreeAccum :: forall c b a. (a -> b -> Accum b c) -> b -> Tree a -> Tree c

Scan a Tree, accumulating values of b there are constant across Nodes that have the same parent, and returning a Tree of type c.

nodeValue :: forall a. Tree a -> a

nodeChildren :: forall a. Tree a -> Forest a

setNodeValue :: forall a. a -> Tree a -> Tree a

modifyNodeValue :: forall a. (a -> a) -> Tree a -> Tree a

appendChild :: forall a. Tree a -> Tree a -> Tree a

setChildren :: forall a. Forest a -> Tree a -> Tree a