Sophie: haskell-hxt-8.3.2-1mdv2010.1 x86

haskell-hxt-8.3.2-1mdv2010.1.x86_64.rpm

<!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-util.js" TYPE="text/javascript"
></SCRIPT
><SCRIPT TYPE="text/javascript"
>window.onload = function () {setSynopsis("mini_Data-NavTree.html")};</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-8.3.2: A collection of tools for processing XML with Haskell.</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 -&gt; <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 -&gt; <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 -&gt; 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 -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</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%3AleftNT"
>leftNT</A
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</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%3ArightNT"
>rightNT</A
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</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%3AupNT"
>upNT</A
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</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%3ApreorderNT"
>preorderNT</A
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; [<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 -&gt; [<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 -&gt; [<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
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m c) -&gt; (a -&gt; m b) -&gt; a -&gt; m c</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AmaybePlus"
>maybePlus</A
> ::  (a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> a) -&gt; a -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AmaybeStar"
>maybeStar</A
> ::  (a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> a) -&gt; a -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
>module <A HREF="Data-Tree-NTree-TypeDefs.html"
>Data.Tree.NTree.TypeDefs</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:NavTree"
><A NAME="t%3ANavTree"
></A
></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:NT"
><A NAME="v%3ANT"
></A
></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 HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Eq.html#t%3AEq"
>Eq</A
> (<A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a)</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="/usr/share/doc/ghc/libraries/base/Data-Ord.html#t%3AOrd"
>Ord</A
> a =&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Ord.html#t%3AOrd"
>Ord</A
> (<A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a)</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="/usr/share/doc/ghc/libraries/base/Text-Show.html#t%3AShow"
>Show</A
> a =&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Text-Show.html#t%3AShow"
>Show</A
> (<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:ntree"
><A NAME="v%3Antree"
></A
></A
><B
>ntree</B
> ::  <A HREF="Data-Tree-NTree-TypeDefs.html#t%3ANTree"
>NTree</A
> a -&gt; <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:subtreeNT"
><A NAME="v%3AsubtreeNT"
></A
></A
><B
>subtreeNT</B
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; <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:dataNT"
><A NAME="v%3AdataNT"
></A
></A
><B
>dataNT</B
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; 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:downNT"
><A NAME="v%3AdownNT"
></A
></A
><B
>downNT</B
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</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:leftNT"
><A NAME="v%3AleftNT"
></A
></A
><B
>leftNT</B
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</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:rightNT"
><A NAME="v%3ArightNT"
></A
></A
><B
>rightNT</B
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</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:upNT"
><A NAME="v%3AupNT"
></A
></A
><B
>upNT</B
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</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:preorderNT"
><A NAME="v%3ApreorderNT"
></A
></A
><B
>preorderNT</B
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; [<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:revPreorderNT"
><A NAME="v%3ArevPreorderNT"
></A
></A
><B
>revPreorderNT</B
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; [<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:getChildrenNT"
><A NAME="v%3AgetChildrenNT"
></A
></A
><B
>getChildrenNT</B
> ::  <A HREF="Data-NavTree.html#t%3ANavTree"
>NavTree</A
> a -&gt; [<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:o'"
><A NAME="v%3Ao%27"
></A
></A
><B
>o'</B
> :: <A HREF="/usr/share/doc/ghc/libraries/base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m c) -&gt; (a -&gt; m b) -&gt; a -&gt; 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:maybePlus"
><A NAME="v%3AmaybePlus"
></A
></A
><B
>maybePlus</B
> ::  (a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> a) -&gt; a -&gt; [a]</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:maybeStar"
><A NAME="v%3AmaybeStar"
></A
></A
><B
>maybeStar</B
> ::  (a -&gt; <A HREF="/usr/share/doc/ghc/libraries/base/Data-Maybe.html#t%3AMaybe"
>Maybe</A
> a) -&gt; a -&gt; [a]</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
>module <A HREF="Data-Tree-NTree-TypeDefs.html"
>Data.Tree.NTree.TypeDefs</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 2.5.0</TD
></TR
></TABLE
></BODY
></HTML
>