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
Instances13Functor, Foldable, Traversable, Tree, NavigatableTreeModify, NavigatableTreeToTree, …
Functor NTreeDefined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsNTree implements class Functor
Foldable NTreeDefined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsNTree implements class Foldable
Traversable NTreeDefined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsNTree implements class Taversable
Tree NTreeDefined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsImplementation of Data.Tree.Class interface for rose trees
Eq a => Eq (NTree a)Defined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsOrd a => Ord (NTree a)Defined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsRead a => Read (NTree a)Defined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsShow a => Show (NTree a)Defined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsNFData a => NFData (NTree a)Defined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsBinary a => Binary (NTree a)Defined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefsWNFData a => WNFData (NTree a)Defined in hxt-9.3.1.22 · Data.Tree.NTree.TypeDefs