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

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

Data.Tree.NTree.Zipper.TypeDefs

Contents

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

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 Source # 

Methods

fmap :: (a -> b) -> NTCrumb a -> NTCrumb b #

(<$) :: a -> NTCrumb b -> NTCrumb a #

Show a => Show (NTCrumb a) Source # 

Methods

showsPrec :: Int -> NTCrumb a -> ShowS #

show :: NTCrumb a -> String #

showList :: [NTCrumb a] -> ShowS #

toNTZipper :: NTree a -> NTZipper a Source #

Conversion of a rose tree into a navigatable rose tree

fromNTZipper :: NTZipper a -> NTree a Source #

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

up1 :: NTree a -> NTCrumb a -> NTree a Source #

Orphan instances