hxt-9.3.1.15: A collection of tools for processing XML with Haskell.

CopyrightCopyright (C) 2005-2010 Uwe Schmidt
LicenseMIT
MaintainerUwe Schmidt (uwe\@fh-wedel.de)
Stabilitystable
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell98

Data.Tree.NTree.TypeDefs

Description

Interface definition for trees

n-ary tree structure (rose trees)

Synopsis

Documentation

data NTree a Source

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

Foldable NTree

NTree implements class Foldable

Traversable NTree

NTree implements class Taversable

Tree NTree

Implementation of Data.Tree.Class interface for rose trees

NavigatableTreeModify NTZipper NTree 
NavigatableTreeToTree NTZipper NTree 
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) 
WNFData a => WNFData (NTree a) 
Typeable (* -> *) NTree 

type NTrees a = [NTree a] Source

shortcut for a sequence of n-ary trees