<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Data.Tree</title><link href="ocean.css" rel="stylesheet" type="text/css" title="Ocean" /><script src="haddock-util.js" type="text/javascript"></script><script type="text/javascript">//<![CDATA[
window.onload = function () {pageLoad();setSynopsis("mini_Data-Tree.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="index.html">Contents</a></li><li><a href="doc-index.html">Index</a></li></ul><p class="caption">containers-0.4.2.1: Assorted concrete container types</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Portability</th><td>portable</td></tr><tr><th>Stability</th><td>experimental</td></tr><tr><th>Maintainer</th><td>libraries@haskell.org</td></tr><tr><th>Safe Haskell</th><td>Safe</td></tr></table><p class="caption">Data.Tree</p></div><div id="table-of-contents"><p class="caption">Contents</p><ul><li><a href="#g:1">Two-dimensional drawing
</a></li><li><a href="#g:2">Extraction
</a></li><li><a href="#g:3">Building trees
</a></li></ul></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Multi-way trees (<em>aka</em> rose trees) and forests.
</p></div></div><div id="synopsis"><p id="control.syn" class="caption expander" onclick="toggleSection('syn')">Synopsis</p><ul id="section.syn" class="hide" onclick="toggleSection('syn')"><li class="src short"><span class="keyword">data</span> <a href="#t:Tree">Tree</a> a = <a href="#v:Node">Node</a> {<ul class="subs"><li><a href="#v:rootLabel">rootLabel</a> :: a</li><li><a href="#v:subForest">subForest</a> :: <a href="Data-Tree.html#t:Forest">Forest</a> a</li></ul>}</li><li class="src short"><span class="keyword">type</span> <a href="#t:Forest">Forest</a> a = [<a href="Data-Tree.html#t:Tree">Tree</a> a]</li><li class="src short"><a href="#v:drawTree">drawTree</a> :: <a href="Data-Tree.html#t:Tree">Tree</a> <a href="../base-4.5.1.0/Data-String.html#t:String">String</a> -> <a href="../base-4.5.1.0/Data-String.html#t:String">String</a></li><li class="src short"><a href="#v:drawForest">drawForest</a> :: <a href="Data-Tree.html#t:Forest">Forest</a> <a href="../base-4.5.1.0/Data-String.html#t:String">String</a> -> <a href="../base-4.5.1.0/Data-String.html#t:String">String</a></li><li class="src short"><a href="#v:flatten">flatten</a> :: <a href="Data-Tree.html#t:Tree">Tree</a> a -> [a]</li><li class="src short"><a href="#v:levels">levels</a> :: <a href="Data-Tree.html#t:Tree">Tree</a> a -> [[a]]</li><li class="src short"><a href="#v:unfoldTree">unfoldTree</a> :: (b -> (a, [b])) -> b -> <a href="Data-Tree.html#t:Tree">Tree</a> a</li><li class="src short"><a href="#v:unfoldForest">unfoldForest</a> :: (b -> (a, [b])) -> [b] -> <a href="Data-Tree.html#t:Forest">Forest</a> a</li><li class="src short"><a href="#v:unfoldTreeM">unfoldTreeM</a> :: <a href="../base-4.5.1.0/Control-Monad.html#t:Monad">Monad</a> m => (b -> m (a, [b])) -> b -> m (<a href="Data-Tree.html#t:Tree">Tree</a> a)</li><li class="src short"><a href="#v:unfoldForestM">unfoldForestM</a> :: <a href="../base-4.5.1.0/Control-Monad.html#t:Monad">Monad</a> m => (b -> m (a, [b])) -> [b] -> m (<a href="Data-Tree.html#t:Forest">Forest</a> a)</li><li class="src short"><a href="#v:unfoldTreeM_BF">unfoldTreeM_BF</a> :: <a href="../base-4.5.1.0/Control-Monad.html#t:Monad">Monad</a> m => (b -> m (a, [b])) -> b -> m (<a href="Data-Tree.html#t:Tree">Tree</a> a)</li><li class="src short"><a href="#v:unfoldForestM_BF">unfoldForestM_BF</a> :: <a href="../base-4.5.1.0/Control-Monad.html#t:Monad">Monad</a> m => (b -> m (a, [b])) -> [b] -> m (<a href="Data-Tree.html#t:Forest">Forest</a> a)</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><span class="keyword">data</span> <a name="t:Tree" class="def">Tree</a> a </p><div class="doc"><p>Multi-way trees, also known as <em>rose trees</em>.
</p></div><div class="subs constructors"><p class="caption">Constructors</p><table><tr><td class="src"><a name="v:Node" class="def">Node</a></td><td class="doc empty"> </td></tr><tr><td colspan="2"><div class="subs fields"><p class="caption">Fields</p><dl><dt class="src"><a name="v:rootLabel" class="def">rootLabel</a> :: a</dt><dd class="doc"><p>label value
</p></dd><dt class="src"><a name="v:subForest" class="def">subForest</a> :: <a href="Data-Tree.html#t:Forest">Forest</a> a</dt><dd class="doc"><p>zero or more child trees
</p></dd></dl><div class="clear"></div></div></td></tr></table></div><div class="subs instances"><p id="control.i:Tree" class="caption collapser" onclick="toggleSection('i:Tree')">Instances</p><div id="section.i:Tree" class="show"><table><tr><td class="src"><a href="../base-4.5.1.0/Control-Monad.html#t:Monad">Monad</a> <a href="Data-Tree.html#t:Tree">Tree</a></td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../base-4.5.1.0/Control-Monad.html#t:Functor">Functor</a> <a href="Data-Tree.html#t:Tree">Tree</a></td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../base-4.5.1.0/Data-Typeable-Internal.html#t:Typeable1">Typeable1</a> <a href="Data-Tree.html#t:Tree">Tree</a></td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../base-4.5.1.0/Control-Applicative.html#t:Applicative">Applicative</a> <a href="Data-Tree.html#t:Tree">Tree</a></td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../base-4.5.1.0/Data-Foldable.html#t:Foldable">Foldable</a> <a href="Data-Tree.html#t:Tree">Tree</a></td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../base-4.5.1.0/Data-Traversable.html#t:Traversable">Traversable</a> <a href="Data-Tree.html#t:Tree">Tree</a></td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../base-4.5.1.0/Data-Eq.html#t:Eq">Eq</a> a => <a href="../base-4.5.1.0/Data-Eq.html#t:Eq">Eq</a> (<a href="Data-Tree.html#t:Tree">Tree</a> a)</td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../base-4.5.1.0/Data-Data.html#t:Data">Data</a> a => <a href="../base-4.5.1.0/Data-Data.html#t:Data">Data</a> (<a href="Data-Tree.html#t:Tree">Tree</a> a)</td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../base-4.5.1.0/Text-Read.html#t:Read">Read</a> a => <a href="../base-4.5.1.0/Text-Read.html#t:Read">Read</a> (<a href="Data-Tree.html#t:Tree">Tree</a> a)</td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../base-4.5.1.0/Text-Show.html#t:Show">Show</a> a => <a href="../base-4.5.1.0/Text-Show.html#t:Show">Show</a> (<a href="Data-Tree.html#t:Tree">Tree</a> a)</td><td class="doc empty"> </td></tr><tr><td class="src"><a href="../deepseq-1.3.0.0/Control-DeepSeq.html#t:NFData">NFData</a> a => <a href="../deepseq-1.3.0.0/Control-DeepSeq.html#t:NFData">NFData</a> (<a href="Data-Tree.html#t:Tree">Tree</a> a)</td><td class="doc empty"> </td></tr></table></div></div></div><div class="top"><p class="src"><span class="keyword">type</span> <a name="t:Forest" class="def">Forest</a> a = [<a href="Data-Tree.html#t:Tree">Tree</a> a]</p></div><h1 id="g:1">Two-dimensional drawing
</h1><div class="top"><p class="src"><a name="v:drawTree" class="def">drawTree</a> :: <a href="Data-Tree.html#t:Tree">Tree</a> <a href="../base-4.5.1.0/Data-String.html#t:String">String</a> -> <a href="../base-4.5.1.0/Data-String.html#t:String">String</a></p><div class="doc"><p>Neat 2-dimensional drawing of a tree.
</p></div></div><div class="top"><p class="src"><a name="v:drawForest" class="def">drawForest</a> :: <a href="Data-Tree.html#t:Forest">Forest</a> <a href="../base-4.5.1.0/Data-String.html#t:String">String</a> -> <a href="../base-4.5.1.0/Data-String.html#t:String">String</a></p><div class="doc"><p>Neat 2-dimensional drawing of a forest.
</p></div></div><h1 id="g:2">Extraction
</h1><div class="top"><p class="src"><a name="v:flatten" class="def">flatten</a> :: <a href="Data-Tree.html#t:Tree">Tree</a> a -> [a]</p><div class="doc"><p>The elements of a tree in pre-order.
</p></div></div><div class="top"><p class="src"><a name="v:levels" class="def">levels</a> :: <a href="Data-Tree.html#t:Tree">Tree</a> a -> [[a]]</p><div class="doc"><p>Lists of nodes at each level of the tree.
</p></div></div><h1 id="g:3">Building trees
</h1><div class="top"><p class="src"><a name="v:unfoldTree" class="def">unfoldTree</a> :: (b -> (a, [b])) -> b -> <a href="Data-Tree.html#t:Tree">Tree</a> a</p><div class="doc"><p>Build a tree from a seed value
</p></div></div><div class="top"><p class="src"><a name="v:unfoldForest" class="def">unfoldForest</a> :: (b -> (a, [b])) -> [b] -> <a href="Data-Tree.html#t:Forest">Forest</a> a</p><div class="doc"><p>Build a forest from a list of seed values
</p></div></div><div class="top"><p class="src"><a name="v:unfoldTreeM" class="def">unfoldTreeM</a> :: <a href="../base-4.5.1.0/Control-Monad.html#t:Monad">Monad</a> m => (b -> m (a, [b])) -> b -> m (<a href="Data-Tree.html#t:Tree">Tree</a> a)</p><div class="doc"><p>Monadic tree builder, in depth-first order
</p></div></div><div class="top"><p class="src"><a name="v:unfoldForestM" class="def">unfoldForestM</a> :: <a href="../base-4.5.1.0/Control-Monad.html#t:Monad">Monad</a> m => (b -> m (a, [b])) -> [b] -> m (<a href="Data-Tree.html#t:Forest">Forest</a> a)</p><div class="doc"><p>Monadic forest builder, in depth-first order
</p></div></div><div class="top"><p class="src"><a name="v:unfoldTreeM_BF" class="def">unfoldTreeM_BF</a> :: <a href="../base-4.5.1.0/Control-Monad.html#t:Monad">Monad</a> m => (b -> m (a, [b])) -> b -> m (<a href="Data-Tree.html#t:Tree">Tree</a> a)</p><div class="doc"><p>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>.
</p></div></div><div class="top"><p class="src"><a name="v:unfoldForestM_BF" class="def">unfoldForestM_BF</a> :: <a href="../base-4.5.1.0/Control-Monad.html#t:Monad">Monad</a> m => (b -> m (a, [b])) -> [b] -> m (<a href="Data-Tree.html#t:Forest">Forest</a> a)</p><div class="doc"><p>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>.
</p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.11.0</p></div></body></html>
distrib
>
Mageia
>
5
>
i586
>
media
>
core-release
>
by-pkgid
>
6e204a966e8c42d976f99a1700ce5f20
>
files
>
2595
