Sophie

Sophie

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

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

<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 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>Index of types</title>
</head>
<body>
<center><h1>Index of types</h1></center>
<table>
<tr><td align="left"><br>B</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#TYPEbig_int">big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td align="left"><br>C</td></tr>
<tr><td><a href="Reins.Iterator.S.html#TYPEcollection">collection</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
The type of the collection
</div>
</td></tr>
<tr><td><a href="Reins.Maps.MonoMapSig.html#TYPEcursor">cursor</a> [<a href="Reins.Maps.MonoMapSig.html">Reins.Maps.MonoMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoKeyMapSig.html#TYPEcursor">cursor</a> [<a href="Reins.Maps.MonoKeyMapSig.html">Reins.Maps.MonoKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.PolyMapSig.html#TYPEcursor">cursor</a> [<a href="Reins.Maps.PolyMapSig.html">Reins.Maps.PolyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.PolySetSig.html#TYPEcursor">cursor</a> [<a href="Reins.Sets.PolySetSig.html">Reins.Sets.PolySetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.MonoSetSig.html#TYPEcursor">cursor</a> [<a href="Reins.Sets.MonoSetSig.html">Reins.Sets.MonoSetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.ListCursor.S.html#TYPEcursor">cursor</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
The type of list cursors.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#TYPEcursor">cursor</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
The type of the cursor that points into the collection
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#TYPEcursor_">cursor_</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#TYPEcursor_">cursor_</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
The type of Set cursors.
</div>
</td></tr>
<tr><td align="left"><br>D</td></tr>
<tr><td><a href="Reins.Iterator.S.html#TYPEdirection">direction</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
A type which guides the order of the traversal.
</div>
</td></tr>
<tr><td><a href="Reins.TreeSetIterator.S.html#TYPEdirection_">direction_</a> [<a href="Reins.TreeSetIterator.S.html">Reins.TreeSetIterator.S</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.ListIterator.S.html#TYPEdirection_">direction_</a> [<a href="Reins.ListIterator.S.html">Reins.ListIterator.S</a>]</td>
<td><div class="info">
List iterators support only two directions.
</div>
</td></tr>
<tr><td align="left"><br>E</td></tr>
<tr><td><a href="Reins.Dug.html#TYPEedge">edge</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoMapSig.html#TYPEelt">elt</a> [<a href="Reins.Maps.MonoMapSig.html">Reins.Maps.MonoMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoKeyMapSig.html#TYPEelt">elt</a> [<a href="Reins.Maps.MonoKeyMapSig.html">Reins.Maps.MonoKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.PolyMapSig.html#TYPEelt">elt</a> [<a href="Reins.Maps.PolyMapSig.html">Reins.Maps.PolyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.MonoSetSig.html#TYPEelt">elt</a> [<a href="Reins.Sets.MonoSetSig.html">Reins.Sets.MonoSetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Iterator.S.html#TYPEelt">elt</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
The type of elements in the collection.
</div>
</td></tr>
<tr><td><a href="Reins.Heaps.MonoHeapSig.html#TYPEelt">elt</a> [<a href="Reins.Heaps.MonoHeapSig.html">Reins.Heaps.MonoHeapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#TYPEelt_">elt_</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#TYPEelt_">elt_</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
The type of elements in the set
</div>
</td></tr>
<tr><td><a href="Reins.Heaps.Heap_.html#TYPEelt_">elt_</a> [<a href="Reins.Heaps.Heap_.html">Reins.Heaps.Heap_</a>]</td>
<td></td></tr>
<tr><td align="left"><br>G</td></tr>
<tr><td><a href="Reins.DugADT.S.html#TYPEgenerator">generator</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td><div class="info">
functions that return a container and none of its arguments
	  are containers
</div>
</td></tr>
<tr><td align="left"><br>H</td></tr>
<tr><td><a href="Reins.Heaps.Heap_.html#TYPEheap">heap</a> [<a href="Reins.Heaps.Heap_.html">Reins.Heaps.Heap_</a>]</td>
<td></td></tr>
<tr><td align="left"><br>K</td></tr>
<tr><td><a href="Reins.Maps.MonoMapSig.html#TYPEkey">key</a> [<a href="Reins.Maps.MonoMapSig.html">Reins.Maps.MonoMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoKeyMapSig.html#TYPEkey">key</a> [<a href="Reins.Maps.MonoKeyMapSig.html">Reins.Maps.MonoKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.PolyMapSig.html#TYPEkey">key</a> [<a href="Reins.Maps.PolyMapSig.html">Reins.Maps.PolyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#TYPEkey_">key_</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Dug.html#TYPEkind">kind</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td align="left"><br>L</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#TYPElist_">list_</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
The underlying list type the cursor points to.
</div>
</td></tr>
<tr><td align="left"><br>M</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#TYPEmap">map</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugADT.S.html#TYPEmutator">mutator</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td><div class="info">
functions that return a container and at least one arg is a
	  container
</div>
</td></tr>
<tr><td align="left"><br>O</td></tr>
<tr><td><a href="Reins.DugADT.S.html#TYPEobserver">observer</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td><div class="info">
functions that do not return a container, but takes one as
	  an argument
</div>
</td></tr>
<tr><td><a href="Reins.DugADT.S.html#TYPEop">op</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td><div class="info">
One of 
</div>
</td></tr>
<tr><td><a href="Reins.TreeSetIterator.S.html#TYPEordering">ordering</a> [<a href="Reins.TreeSetIterator.S.html">Reins.TreeSetIterator.S</a>]</td>
<td></td></tr>
<tr><td align="left"><br>R</td></tr>
<tr><td><a href="Reins.Types.Ratio.html#TYPEratio">ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoMapSig.html#TYPEresult">result</a> [<a href="Reins.Maps.MonoMapSig.html">Reins.Maps.MonoMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoKeyMapSig.html#TYPEresult">result</a> [<a href="Reins.Maps.MonoKeyMapSig.html">Reins.Maps.MonoKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.PolyMapSig.html#TYPEresult">result</a> [<a href="Reins.Maps.PolyMapSig.html">Reins.Maps.PolyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.PolySetSig.html#TYPEresult">result</a> [<a href="Reins.Sets.PolySetSig.html">Reins.Sets.PolySetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.MonoSetSig.html#TYPEresult">result</a> [<a href="Reins.Sets.MonoSetSig.html">Reins.Sets.MonoSetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#TYPEresult_">result_</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#TYPEresult_">result_</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
The <code class="code">result_</code> type is used for operations that may either
	return just a result or a result a something else.
</div>
</td></tr>
<tr><td align="left"><br>S</td></tr>
<tr><td><a href="Reins.Sets.Set_.html#TYPEset">set</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
The type of sets
</div>
</td></tr>
<tr><td align="left"><br>T</td></tr>
<tr><td><a href="Reins.DugProfile.Make.html#TYPEt">t</a> [<a href="Reins.DugProfile.Make.html">Reins.DugProfile.Make</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Dug.html#TYPEt">t</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoMapSig.html#TYPEt">t</a> [<a href="Reins.Maps.MonoMapSig.html">Reins.Maps.MonoMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoKeyMapSig.html#TYPEt">t</a> [<a href="Reins.Maps.MonoKeyMapSig.html">Reins.Maps.MonoKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.PolyMapSig.html#TYPEt">t</a> [<a href="Reins.Maps.PolyMapSig.html">Reins.Maps.PolyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#TYPEt">t</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
The type of random access lists
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#TYPEt">t</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#TYPEt">t</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
The type of double ended queues.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#TYPEt">t</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
The type of doubly linked lists.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#TYPEt">t</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.PolySetSig.html#TYPEt">t</a> [<a href="Reins.Sets.PolySetSig.html">Reins.Sets.PolySetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.MonoSetSig.html#TYPEt">t</a> [<a href="Reins.Sets.MonoSetSig.html">Reins.Sets.MonoSetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#TYPEt">t</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
The type of the list
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#TYPEt">t</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
The type of iterators.
</div>
</td></tr>
<tr><td><a href="Reins.Heaps.PolyHeapSig.html#TYPEt">t</a> [<a href="Reins.Heaps.PolyHeapSig.html">Reins.Heaps.PolyHeapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Heaps.MonoHeapSig.html#TYPEt">t</a> [<a href="Reins.Heaps.MonoHeapSig.html">Reins.Heaps.MonoHeapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#TYPEt">t</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Option.html#TYPEt">t</a> [<a href="Reins.Types.Option.html">Reins.Types.Option</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#TYPEt">t</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#TYPEt">t</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#TYPEt">t</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#TYPEt">t</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#TYPEt">t</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#TYPEt">t</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Char.html#TYPEt">t</a> [<a href="Reins.Types.Char.html">Reins.Types.Char</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Bool.html#TYPEt">t</a> [<a href="Reins.Types.Bool.html">Reins.Types.Bool</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Float.html#TYPEt">t</a> [<a href="Reins.Types.Float.html">Reins.Types.Float</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#TYPEt">t</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Arbitrary.html#TYPEt">t</a> [<a href="Reins.Types.Mono.Arbitrary.html">Reins.Types.Mono.Arbitrary</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Comparable.html#TYPEt">t</a> [<a href="Reins.Types.Mono.Comparable.html">Reins.Types.Mono.Comparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Equatable.html#TYPEt">t</a> [<a href="Reins.Types.Mono.Equatable.html">Reins.Types.Mono.Equatable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Gen3Tuple.html#TYPEt">t</a> [<a href="Reins.Types.Mono.Gen3Tuple.html">Reins.Types.Mono.Gen3Tuple</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.GenPair.html#TYPEt">t</a> [<a href="Reins.Types.Mono.GenPair.html">Reins.Types.Mono.GenPair</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Comparable3Tuple.html#TYPEt">t</a> [<a href="Reins.Types.Mono.Comparable3Tuple.html">Reins.Types.Mono.Comparable3Tuple</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.ComparablePair.html#TYPEt">t</a> [<a href="Reins.Types.Mono.ComparablePair.html">Reins.Types.Mono.ComparablePair</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.ComposeGenComparable.html#TYPEt">t</a> [<a href="Reins.Types.Mono.ComposeGenComparable.html">Reins.Types.Mono.ComposeGenComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.ComposeGen.html#TYPEt">t</a> [<a href="Reins.Types.Mono.ComposeGen.html">Reins.Types.Mono.ComposeGen</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.ComposeComparable.html#TYPEt">t</a> [<a href="Reins.Types.Mono.ComposeComparable.html">Reins.Types.Mono.ComposeComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Arbitrary.html#TYPEt">t</a> [<a href="Reins.Types.Poly.Arbitrary.html">Reins.Types.Poly.Arbitrary</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Comparable.html#TYPEt">t</a> [<a href="Reins.Types.Poly.Comparable.html">Reins.Types.Poly.Comparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Equatable.html#TYPEt">t</a> [<a href="Reins.Types.Poly.Equatable.html">Reins.Types.Poly.Equatable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Close.html#TYPEt">t</a> [<a href="Reins.Types.Poly.Close.html">Reins.Types.Poly.Close</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.ComposeGenComparable.html#TYPEt">t</a> [<a href="Reins.Types.Poly.ComposeGenComparable.html">Reins.Types.Poly.ComposeGenComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.ComposeGen.html#TYPEt">t</a> [<a href="Reins.Types.Poly.ComposeGen.html">Reins.Types.Poly.ComposeGen</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.ComposeComparable.html#TYPEt">t</a> [<a href="Reins.Types.Poly.ComposeComparable.html">Reins.Types.Poly.ComposeComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Iterator.S.html#TYPEtraversal">traversal</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
This type defines the traversal strategy.
</div>
</td></tr>
<tr><td align="left"><br>W</td></tr>
<tr><td><a href="Reins.DugExtractor.html#TYPEwrap">wrap</a> [<a href="Reins.DugExtractor.html">Reins.DugExtractor</a>]</td>
<td></td></tr>
</table><br>
</body>
</html>