Sophie: ghc-0:6.10.4-1mdv2010.0 i586

ghc-6.10.4-1mdv2010.0.i586.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.Tree</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-Tree.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"
>containers-0.2.0.1: Assorted concrete container types</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.Tree</FONT
></TD
><TD ALIGN="right"
><TABLE CLASS="narrow" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="infohead"
>Portability</TD
><TD CLASS="infoval"
>portable</TD
></TR
><TR
><TD CLASS="infohead"
>Stability</TD
><TD CLASS="infoval"
>experimental</TD
></TR
><TR
><TD CLASS="infohead"
>Maintainer</TD
><TD CLASS="infoval"
>libraries@haskell.org</TD
></TR
></TABLE
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="section4"
><B
>Contents</B
></TD
></TR
><TR
><TD
><DL
><DT
><A HREF="#1"
>Two-dimensional drawing
</A
></DT
><DT
><A HREF="#2"
>Extraction
</A
></DT
><DT
><A HREF="#3"
>Building trees
</A
></DT
></DL
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
>Description</TD
></TR
><TR
><TD CLASS="doc"
>Multi-way trees (<EM
>aka</EM
> rose trees) and forests.
</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%3ATree"
>Tree</A
> a = <A HREF="#v%3ANode"
>Node</A
> {<TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="recfield"
><A HREF="#v%3ArootLabel"
>rootLabel</A
> :: a</TD
></TR
><TR
><TD CLASS="recfield"
><A HREF="#v%3AsubForest"
>subForest</A
> :: <A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> a</TD
></TR
></TABLE
>}</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>type</SPAN
> <A HREF="#t%3AForest"
>Forest</A
> a = [<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AdrawTree"
>drawTree</A
> :: <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> <A HREF="../base/Data-Char.html#t%3AString"
>String</A
> -&gt; <A HREF="../base/Data-Char.html#t%3AString"
>String</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AdrawForest"
>drawForest</A
> :: <A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> <A HREF="../base/Data-Char.html#t%3AString"
>String</A
> -&gt; <A HREF="../base/Data-Char.html#t%3AString"
>String</A
></TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Aflatten"
>flatten</A
> ::  <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a -&gt; [a]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3Alevels"
>levels</A
> ::  <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a -&gt; [[a]]</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AunfoldTree"
>unfoldTree</A
> ::  (b -&gt; (a, [b])) -&gt; b -&gt; <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AunfoldForest"
>unfoldForest</A
> ::  (b -&gt; (a, [b])) -&gt; [b] -&gt; <A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> a</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AunfoldTreeM"
>unfoldTreeM</A
> :: <A HREF="../base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m (a, [b])) -&gt; b -&gt; m (<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AunfoldForestM"
>unfoldForestM</A
> :: <A HREF="../base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m (a, [b])) -&gt; [b] -&gt; m (<A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> a)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AunfoldTreeM_BF"
>unfoldTreeM_BF</A
> :: <A HREF="../base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m (a, [b])) -&gt; b -&gt; m (<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a)</TD
></TR
><TR
><TD CLASS="s8"
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="#v%3AunfoldForestM_BF"
>unfoldForestM_BF</A
> :: <A HREF="../base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m (a, [b])) -&gt; [b] -&gt; m (<A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> 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:Tree"
><A NAME="t%3ATree"
></A
></A
><B
>Tree</B
> a </TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0"
><TR
><TD CLASS="ndoc"
>Multi-way trees, also known as <EM
>rose trees</EM
>.
</TD
></TR
><TR
><TD CLASS="section4"
>Constructors</TD
></TR
><TR
><TD CLASS="body"
><TABLE CLASS="vanilla" CELLSPACING="5" CELLPADDING="0"
><TR
><TD CLASS="arg"
><A NAME="v:Node"
><A NAME="v%3ANode"
></A
></A
><B
>Node</B
></TD
><TD CLASS="rdoc"
></TD
></TR
><TR
><TD CLASS="body" COLSPAN="2"
><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0"
><TR
><TD CLASS="arg"
><A NAME="v:rootLabel"
><A NAME="v%3ArootLabel"
></A
></A
><B
>rootLabel</B
> :: a</TD
><TD CLASS="rdoc"
>label value
</TD
></TR
><TR
><TD CLASS="arg"
><A NAME="v:subForest"
><A NAME="v%3AsubForest"
></A
></A
><B
>subForest</B
> :: <A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> a</TD
><TD CLASS="rdoc"
>zero or more child trees
</TD
></TR
></TABLE
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="section4"
><IMG SRC="minus.gif" CLASS="coll" ONCLICK="toggle(this,'i:Tree')" ALT="show/hide"
> Instances</TD
></TR
><TR
><TD CLASS="body"
><DIV ID="i:Tree" STYLE="display:block;"
><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0"
><TR
><TD CLASS="decl"
><A HREF="../base/Control-Monad.html#t%3AMonad"
>Monad</A
> <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Control-Monad.html#t%3AFunctor"
>Functor</A
> <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Typeable.html#t%3ATypeable1"
>Typeable1</A
> <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Traversable.html#t%3ATraversable"
>Traversable</A
> <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Foldable.html#t%3AFoldable"
>Foldable</A
> <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Control-Applicative.html#t%3AApplicative"
>Applicative</A
> <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
></TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Eq.html#t%3AEq"
>Eq</A
> a =&gt; <A HREF="../base/Data-Eq.html#t%3AEq"
>Eq</A
> (<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a)</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Data-Data.html#t%3AData"
>Data</A
> a =&gt; <A HREF="../base/Data-Data.html#t%3AData"
>Data</A
> (<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a)</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Text-Read.html#t%3ARead"
>Read</A
> a =&gt; <A HREF="../base/Text-Read.html#t%3ARead"
>Read</A
> (<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a)</TD
></TR
><TR
><TD CLASS="decl"
><A HREF="../base/Text-Show.html#t%3AShow"
>Show</A
> a =&gt; <A HREF="../base/Text-Show.html#t%3AShow"
>Show</A
> (<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a)</TD
></TR
></TABLE
></DIV
></TD
></TR
></TABLE
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><SPAN CLASS="keyword"
>type</SPAN
> <A NAME="t:Forest"
><A NAME="t%3AForest"
></A
></A
><B
>Forest</B
> a = [<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a]</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="1"
><A NAME="1"
>Two-dimensional drawing
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:drawTree"
><A NAME="v%3AdrawTree"
></A
></A
><B
>drawTree</B
> :: <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> <A HREF="../base/Data-Char.html#t%3AString"
>String</A
> -&gt; <A HREF="../base/Data-Char.html#t%3AString"
>String</A
></TD
></TR
><TR
><TD CLASS="doc"
>Neat 2-dimensional drawing of a tree.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:drawForest"
><A NAME="v%3AdrawForest"
></A
></A
><B
>drawForest</B
> :: <A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> <A HREF="../base/Data-Char.html#t%3AString"
>String</A
> -&gt; <A HREF="../base/Data-Char.html#t%3AString"
>String</A
></TD
></TR
><TR
><TD CLASS="doc"
>Neat 2-dimensional drawing of a forest.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="2"
><A NAME="2"
>Extraction
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:flatten"
><A NAME="v%3Aflatten"
></A
></A
><B
>flatten</B
> ::  <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a -&gt; [a]</TD
></TR
><TR
><TD CLASS="doc"
>The elements of a tree in pre-order.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:levels"
><A NAME="v%3Alevels"
></A
></A
><B
>levels</B
> ::  <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a -&gt; [[a]]</TD
></TR
><TR
><TD CLASS="doc"
>Lists of nodes at each level of the tree.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="section1"
><A NAME="3"
><A NAME="3"
>Building trees
</A
></A
></TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unfoldTree"
><A NAME="v%3AunfoldTree"
></A
></A
><B
>unfoldTree</B
> ::  (b -&gt; (a, [b])) -&gt; b -&gt; <A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a</TD
></TR
><TR
><TD CLASS="doc"
>Build a tree from a seed value
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unfoldForest"
><A NAME="v%3AunfoldForest"
></A
></A
><B
>unfoldForest</B
> ::  (b -&gt; (a, [b])) -&gt; [b] -&gt; <A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> a</TD
></TR
><TR
><TD CLASS="doc"
>Build a forest from a list of seed values
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unfoldTreeM"
><A NAME="v%3AunfoldTreeM"
></A
></A
><B
>unfoldTreeM</B
> :: <A HREF="../base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m (a, [b])) -&gt; b -&gt; m (<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a)</TD
></TR
><TR
><TD CLASS="doc"
>Monadic tree builder, in depth-first order
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unfoldForestM"
><A NAME="v%3AunfoldForestM"
></A
></A
><B
>unfoldForestM</B
> :: <A HREF="../base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m (a, [b])) -&gt; [b] -&gt; m (<A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> a)</TD
></TR
><TR
><TD CLASS="doc"
>Monadic forest builder, in depth-first order
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unfoldTreeM_BF"
><A NAME="v%3AunfoldTreeM_BF"
></A
></A
><B
>unfoldTreeM_BF</B
> :: <A HREF="../base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m (a, [b])) -&gt; b -&gt; m (<A HREF="Data-Tree.html#t%3ATree"
>Tree</A
> a)</TD
></TR
><TR
><TD CLASS="doc"
>Monadic tree builder, in breadth-first order,
 using an algorithm adapted from
 <EM
>Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design</EM
>,
 by Chris Okasaki, <EM
>ICFP'00</EM
>.
</TD
></TR
><TR
><TD CLASS="s15"
></TD
></TR
><TR
><TD CLASS="decl"
><A NAME="v:unfoldForestM_BF"
><A NAME="v%3AunfoldForestM_BF"
></A
></A
><B
>unfoldForestM_BF</B
> :: <A HREF="../base/Control-Monad.html#t%3AMonad"
>Monad</A
> m =&gt; (b -&gt; m (a, [b])) -&gt; [b] -&gt; m (<A HREF="Data-Tree.html#t%3AForest"
>Forest</A
> a)</TD
></TR
><TR
><TD CLASS="doc"
>Monadic forest builder, in breadth-first order,
 using an algorithm adapted from
 <EM
>Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design</EM
>,
 by Chris Okasaki, <EM
>ICFP'00</EM
>.
</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.4.2</TD
></TR
></TABLE
></BODY
></HTML
>