<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> <!--Rendered using the Haskell Html Library v0.2--> <HTML ><HEAD ><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=UTF-8" ><TITLE >Data.NavTree</TITLE ><LINK HREF="haddock.css" REL="stylesheet" TYPE="text/css" ><SCRIPT SRC="haddock.js" TYPE="text/javascript" ></SCRIPT ></HEAD ><BODY ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD CLASS="topbar" ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD ><IMG SRC="haskell_icon.gif" WIDTH="16" HEIGHT="16" ALT=" " ></TD ><TD CLASS="title" >hxt-7.1: </TD ><TD CLASS="topbut" ><A HREF="index.html" >Contents</A ></TD ><TD CLASS="topbut" ><A HREF="doc-index.html" >Index</A ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="modulebar" ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD ><FONT SIZE="6" >Data.NavTree</FONT ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="section1" >Description</TD ></TR ><TR ><TD CLASS="doc" >Navigable tree structure which allow a program to traverse up the tree as well as down. copied and modified from HXML (<A HREF="http://www.flightlab.com/~joe/hxml/" >http://www.flightlab.com/~joe/hxml/</A >) </TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="section1" >Synopsis</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="body" ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD CLASS="decl" ><SPAN CLASS="keyword" >data</SPAN > <A HREF="#t%3ANavTree" >NavTree</A > a = <A HREF="#v%3ANT" >NT</A > (<A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a) [<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a] [<A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a] [<A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a]</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3Antree" >ntree</A > :: <A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a -> <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3AsubtreeNT" >subtreeNT</A > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> <A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3AdataNT" >dataNT</A > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> a</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3AupNT" >upNT</A > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> Maybe (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3AdownNT" >downNT</A > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> Maybe (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3AleftNT" >leftNT</A > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> Maybe (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3ArightNT" >rightNT</A > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> Maybe (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3ApreorderNT" >preorderNT</A > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> [<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a]</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3ArevPreorderNT" >revPreorderNT</A > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> [<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a]</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3AgetChildrenNT" >getChildrenNT</A > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> [<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a]</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3Ao%27" >o'</A > :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3AmaybeStar" >maybeStar</A > :: (a -> Maybe a) -> a -> [a]</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" ><A HREF="#v%3AmaybePlus" >maybePlus</A > :: (a -> Maybe a) -> a -> [a]</TD ></TR ><TR ><TD CLASS="s8" ></TD ></TR ><TR ><TD CLASS="decl" >module <A HREF="Data-Tree-NTree-Filter.html" >Data.Tree.NTree.Filter</A ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="section1" >Documentation</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><SPAN CLASS="keyword" >data</SPAN > <A NAME="t%3ANavTree" ></A ><B >NavTree</B > a</TD ></TR ><TR ><TD CLASS="body" ><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" ><TR ><TD CLASS="ndoc" ><P >navigable tree with nodes of type node </P ><P >a navigable tree consists of a n-ary tree for the current fragment tree, a navigable tree for all ancestors, and two n-ary trees for the previous- and following siblings </P ></TD ></TR ><TR ><TD CLASS="section4" >Constructors</TD ></TR ><TR ><TD CLASS="body" ><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0" ><TR ><TD CLASS="arg" ><A NAME="v%3ANT" ></A ><B >NT</B > (<A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a) [<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a] [<A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a] [<A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a]</TD ><TD CLASS="rdoc" ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="section4" ><IMG SRC="minus.gif" CLASS="coll" ONCLICK="toggle(this,'i:NavTree')" ALT="show/hide" > Instances</TD ></TR ><TR ><TD CLASS="body" ><DIV ID="i:NavTree" STYLE="display:block;" ><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0" ><TR ><TD CLASS="decl" >??? a => Eq (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="decl" >??? a => Ord (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="decl" >??? a => Show (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ></TABLE ></DIV ></TD ></TR ></TABLE ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3Antree" ></A ><B >ntree</B > :: <A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a -> <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a</TD ></TR ><TR ><TD CLASS="doc" >converts a n-ary tree in a navigable tree </TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3AsubtreeNT" ></A ><B >subtreeNT</B > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> <A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree" >NTree</A > a</TD ></TR ><TR ><TD CLASS="doc" >converts a navigable tree in a n-ary tree </TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3AdataNT" ></A ><B >dataNT</B > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> a</TD ></TR ><TR ><TD CLASS="doc" >function for selecting the value of the current fragment tree </TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3AupNT" ></A ><B >upNT</B > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> Maybe (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3AdownNT" ></A ><B >downNT</B > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> Maybe (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3AleftNT" ></A ><B >leftNT</B > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> Maybe (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3ArightNT" ></A ><B >rightNT</B > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> Maybe (<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a)</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3ApreorderNT" ></A ><B >preorderNT</B > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> [<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a]</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3ArevPreorderNT" ></A ><B >revPreorderNT</B > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> [<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a]</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3AgetChildrenNT" ></A ><B >getChildrenNT</B > :: <A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a -> [<A HREF="Data-NavTree.html#t%3ANavTree" >NavTree</A > a]</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3Ao%27" ></A ><B >o'</B > :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c</TD ></TR ><TR ><TD CLASS="doc" >Kleisli composition: </TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3AmaybeStar" ></A ><B >maybeStar</B > :: (a -> Maybe a) -> a -> [a]</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" ><A NAME="v%3AmaybePlus" ></A ><B >maybePlus</B > :: (a -> Maybe a) -> a -> [a]</TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="decl" >module <A HREF="Data-Tree-NTree-Filter.html" >Data.Tree.NTree.Filter</A ></TD ></TR ><TR ><TD CLASS="s15" ></TD ></TR ><TR ><TD CLASS="botbar" >Produced by <A HREF="http://www.haskell.org/haddock/" >Haddock</A > version 0.8</TD ></TR ></TABLE ></BODY ></HTML >
