hxt-9.3.1.18: 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

Instances
Functor NTZipper Source # 
Instance details

Defined in Data.Tree.NTree.Zipper.TypeDefs

Methods

fmap :: (a -> b) -> NTZipper a -> NTZipper b

(<$) :: a -> NTZipper b -> NTZipper a

Tree NTZipper Source # 
Instance details

Defined in Data.Tree.NTree.Zipper.TypeDefs

Methods

mkTree :: a -> [NTZipper a] -> NTZipper a Source #

mkLeaf :: a -> NTZipper a Source #

isLeaf :: NTZipper a -> Bool Source #

isInner :: NTZipper a -> Bool Source #

getNode :: NTZipper a -> a Source #

getChildren :: NTZipper a -> [NTZipper a] Source #

changeNode :: (a -> a) -> NTZipper a -> NTZipper a Source #

changeChildren :: ([NTZipper a] -> [NTZipper a]) -> NTZipper a -> NTZipper a Source #

setNode :: a -> NTZipper a -> NTZipper a Source #

setChildren :: [NTZipper a] -> NTZipper a -> NTZipper a Source #

foldTree :: (a -> [b] -> b) -> NTZipper a -> b Source #

nodesTree :: NTZipper a -> [a] Source #

depthTree :: NTZipper a -> Int Source #

cardTree :: NTZipper a -> Int Source #

formatTree :: (a -> String) -> NTZipper a -> String Source #

NavigatableTree NTZipper Source # 
Instance details

Defined in Data.Tree.NTree.Zipper.TypeDefs

Methods

mvUp :: NTZipper a -> Maybe (NTZipper a) Source #

mvDown :: NTZipper a -> Maybe (NTZipper a) Source #

mvLeft :: NTZipper a -> Maybe (NTZipper a) Source #

mvRight :: NTZipper a -> Maybe (NTZipper a) Source #

NavigatableTreeModify NTZipper NTree Source # 
Instance details

Defined in Data.Tree.NTree.Zipper.TypeDefs

NavigatableTreeToTree NTZipper NTree Source # 
Instance details

Defined in Data.Tree.NTree.Zipper.TypeDefs

Show a => Show (NTZipper a) Source # 
Instance details

Defined in Data.Tree.NTree.Zipper.TypeDefs

Methods

showsPrec :: Int -> NTZipper a -> ShowS

show :: NTZipper a -> String

showList :: [NTZipper a] -> ShowS

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 # 
Instance details

Defined in Data.Tree.NTree.Zipper.TypeDefs

Methods

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

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

Show a => Show (NTCrumb a) Source # 
Instance details

Defined in Data.Tree.NTree.Zipper.TypeDefs

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

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

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

toTheRight :: NTZipper a -> Maybe (NTZipper a) Source #

toTheLeft :: NTZipper a -> Maybe (NTZipper a) Source #

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

addToTheRight :: NTree a -> NTZipper a -> Maybe (NTZipper a) Source #

isTop :: NTZipper a -> Bool Source #

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

Orphan instances