Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > ee3d8430cc80796773ea2e1c8ad4ef5d > files > 193

ocaml-reins-devel-0.1a-10.fc15.i686.rpm

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<link rel="stylesheet" href="style.css" type="text/css">
<meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type">
<link rel="Start" href="index.html">
<link rel="Up" href="Reins.TreeSetIterator.html">
<link title="Index of types" rel=Appendix href="index_types.html">
<link title="Index of exceptions" rel=Appendix href="index_exceptions.html">
<link title="Index of values" rel=Appendix href="index_values.html">
<link title="Index of modules" rel=Appendix href="index_modules.html">
<link title="Index of module types" rel=Appendix href="index_module_types.html">
<link title="Reins" rel="Chapter" href="Reins.html"><title>Reins.TreeSetIterator.Make</title>
</head>
<body>
<div class="navbar">&nbsp;<a href="Reins.TreeSetIterator.html">Up</a>
&nbsp;</div>
<center><h1>Functor <a href="type_Reins.TreeSetIterator.Make.html">Reins.TreeSetIterator.Make</a></h1></center>
<br>
<pre><span class="keyword">module</span> Make: <div class="sig_block"><code class="code">functor (</code><code class="code">T</code><code class="code"> : </code><code class="type"><a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a></code><code class="code">) -&gt; </code><code class="type"><a href="Reins.TreeSetIterator.S.html">S</a></code><code class="type">  with type 'a elt = 'a T.elt_
      and type 'a cursor = 'a T.cursor_
      and type 'a collection = 'a T.set</code></div></pre>Create an iterator for a Set (note that this implicitly supports
    both MonoSets and PolySets).<br>
<table border="0" cellpadding="3" width="100%">
<tr>
<td align="left" valign="top" width="1%%"><b>Parameters: </b></td>
<td>
<table class="paramstable">
<tr>
<td align="center" valign="top" width="15%">
<code>T</code></td>
<td align="center" valign="top">:</td>
<td><code class="type"><a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a></code>
</table>
</td>
</tr>
</table>
<hr width="100%">
<br><code><span id="TYPEordering"><span class="keyword">type</span> <code class="type"></code>ordering</span> = </code><table class="typetable">
<tr>
<td align="left" valign="top" >
<code><span class="keyword">|</span></code></td>
<td align="left" valign="top" >
<code><span class="constructor">PreOrder</span></code></td>

</tr>
<tr>
<td align="left" valign="top" >
<code><span class="keyword">|</span></code></td>
<td align="left" valign="top" >
<code><span class="constructor">InOrder</span></code></td>

</tr>
<tr>
<td align="left" valign="top" >
<code><span class="keyword">|</span></code></td>
<td align="left" valign="top" >
<code><span class="constructor">PostOrder</span></code></td>
<td class="typefieldcomment" align="left" valign="top" ><code>(*</code></td><td class="typefieldcomment" align="left" valign="top" >A <code class="code">PreOrder</code> traversal always visits the root of the tree
	  before its children.  An <code class="code">InOrder</code> traversal visits one
	  subtree, then the root, then the other subtree (which
	  subtree is chosen by the <code class="code">direction_</code> type below).  Finally,
	  a <code class="code">PostOrder</code> traversal visits the subtrees before visiting
	  the root.</td><td class="typefieldcomment" align="left" valign="bottom" ><code>*)</code></td>
</tr></table>


<br><code><span id="TYPEdirection_"><span class="keyword">type</span> <code class="type"></code>direction_</span> = </code><table class="typetable">
<tr>
<td align="left" valign="top" >
<code><span class="keyword">|</span></code></td>
<td align="left" valign="top" >
<code><span class="constructor">Ascending</span> <span class="keyword">of</span> <code class="type"><a href="Reins.TreeSetIterator.S.html#TYPEordering">ordering</a></code></code></td>

</tr>
<tr>
<td align="left" valign="top" >
<code><span class="keyword">|</span></code></td>
<td align="left" valign="top" >
<code><span class="constructor">Descending</span> <span class="keyword">of</span> <code class="type"><a href="Reins.TreeSetIterator.S.html#TYPEordering">ordering</a></code></code></td>
<td class="typefieldcomment" align="left" valign="top" ><code>(*</code></td><td class="typefieldcomment" align="left" valign="top" >An ascending direction traversal always visits the elements in
	increasing order of the keys.  Similarly, the descending
	direction traversal visits elements in decreasing key
	order.</td><td class="typefieldcomment" align="left" valign="bottom" ><code>*)</code></td>
</tr></table>


<pre><span class="keyword">include</span> <a href="Reins.Iterator.S.html">Reins.Iterator.S</a></pre>
</body></html>