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

Portabilityportable
Stabilitystable
MaintainerUwe Schmidt (uwe\@fh-wedel.de)
Safe HaskellSafe-Inferred

Data.Tree.NTree.Zipper.TypeDefs

Description

Implementation of navigateble trees for rose trees. The implementation is done with zippers. A description and introductory tutorial about zippers can be found in http://learnyouahaskell.com/zippers

Synopsis

Documentation

data NTZipper a Source

Zipper for rose trees

A zipper consist of the current tree and the branches on the way back to the root

Constructors

NTZ 

Fields

ntree :: NTree a
 
context :: NTBreadCrumbs a
 

type NTBreadCrumbs a = [NTCrumb a]Source

The list of unzipped nodes from a current tree back to the root

data NTCrumb a Source

One unzipped step consists of the left siblings, the node info and the right siblings

Constructors

NTC (NTrees a) a (NTrees a) 

Instances

Functor NTCrumb 
Show a => Show (NTCrumb a) 

toNTZipper :: NTree a -> NTZipper aSource

Conversion of a rose tree into a navigatable rose tree

fromNTZipper :: NTZipper a -> NTree aSource

Conversion of a navigatable rose tree into an ordinary rose tree.

The context, the parts for moving up to the root are just removed from the tree. So when transforming a navigatable tree by moving around and by changing some nodes, one has to navigate back to the root, else that parts are removed from the result

up :: NTZipper a -> Maybe (NTZipper a)Source

down :: NTZipper a -> Maybe (NTZipper a)Source

addToTheLeft :: NTree a -> NTZipper a -> Maybe (NTZipper a)Source

isTop :: NTZipper a -> BoolSource

up1 :: NTree a -> NTCrumb a -> NTree aSource