Data.Tree.NTree.TypeDefs

Interface definition for trees

n-ary tree structure (rose trees)

Documentation

module Data.Tree.Class

data NTree a

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

Constructors

NTree a (NTrees a)

Instances

Functor NTree

NTree implements class Functor

Typeable1 NTree

Tree NTree

Implementation of Data.Tree.Class interface for rose trees

Eq a => Eq (NTree a)

Ord a => Ord (NTree a)

Read a => Read (NTree a)

Show a => Show (NTree a)

Binary a => Binary (NTree a)

NFData a => NFData (NTree a)

XmlNode a => XmlNode (NTree a)

type NTrees a = [NTree a]

shortcut for a sequence of n-ary trees

formatNTreeF :: (node -> String) -> (String -> String) -> (String -> String) -> NTree node -> String -> String

convert a tree into a pseudo graphical string reprsentation