 | hxt-7.4: A collection of tools for processing XML with Haskell. | Source code | Contents | Index |
| Data.Tree.NTree.TypeDefs |
|
Version : $Id: TypeDefs.hs,v 1.6 20050902 17:09:39 hxml Exp $
Interface definition for trees
n-ary tree structure (rose trees)
| module Data.Tree.Class |
| data NTree a = NTree a (NTrees a) |
| type NTrees a = [NTree a] |
| formatNTreeF :: (node -> String) -> (String -> String) -> (String -> String) -> NTree node -> String -> String |
| 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 | ||
| ||
 Instances | ||
| type NTrees a = [NTree a] | Source |
| formatNTreeF :: (node -> String) -> (String -> String) -> (String -> String) -> NTree node -> String -> String | Source |