Sophie

Sophie

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

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 values</title>
</head>
<body>
<center><h1>Index of values</h1></center>
<table>
<tr><td align="left"><br>A</td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALabs">abs</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALabs">abs</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#VALabs">abs</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALabs">abs</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALabs">abs</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALabs">abs</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALabs_big_int">abs_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALabs_ratio">abs_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALadd">add</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALadd">add</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">add x t</code> Return the set <code class="code">t</code> with the element <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALadd">add</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALadd">add</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALadd">add</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#VALadd">add</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALadd">add</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALadd">add</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALadd">add</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALadd_big_int">add_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALadd_big_int_ratio">add_big_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALadd_int_big_int">add_int_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALadd_int_ratio">add_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALadd_ratio">add_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALappend">append</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">append t1 t2</code> Appends the list <code class="code">t2</code> onto the back of list <code class="code">t1</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALappend">append</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALappend">append</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">append t1 t2</code> Appends all of the elements in queue <code class="code">t2</code> onto
      the back of <code class="code">t1</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALappend">append</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">append t1 t2</code> Append the list <code class="code">t2</code> onto the back of <code class="code">t1</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALappend">append</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">append t1 t2</code> Appends the list <code class="code">t2</code> onto the back of list <code class="code">t1</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALappend">append</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">append t1 t2</code>  Append the list <code class="code">t2</code> onto the end of list
	<code class="code">t1</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALapprox_big_int">approx_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALapprox_ratio_exp">approx_ratio_exp</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALapprox_ratio_fix">approx_ratio_fix</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALarg">arg</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALassoc">assoc</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALassq">assq</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALat_back">at_back</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">at_front t</code> Retruns true if there are no elements to the
	right of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALat_back">at_back</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">at_end curs</code> Returns true if there are no elements to the
	right of <code class="code">curs</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALat_beg">at_beg</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Returns true if the iterator is at the beginning of the
	collection as governed by the current traversal strategy.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALat_end">at_end</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Returns true if the iterator has reached the end of the
	collection as governed by the current traversal strategy.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALat_front">at_front</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">at_front t</code> Retruns true if there are no elements to the left
	of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALat_front">at_front</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">at_front curs</code> Returns true if there are no elements to the
	left of <code class="code">curs</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALat_left">at_left</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALat_left">at_left</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Returns true if the cursor is at the left most element in the
	current subtree.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALat_right">at_right</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALat_right">at_right</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Returns true if the cursor is at the right most element in the
	current subtree.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALat_top">at_top</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALat_top">at_top</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Returns true if the cursor is at the top of the tree.
</div>
</td></tr>
<tr><td align="left"><br>B</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALbase_power_big_int">base_power_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.OracleSet.Benchmark.html#VALbenchmark">benchmark</a> [<a href="Reins.OracleSet.Benchmark.html">Reins.OracleSet.Benchmark</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALbig_int_of_int">big_int_of_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALbig_int_of_nat">big_int_of_nat</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALbig_int_of_ratio">big_int_of_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALbig_int_of_string">big_int_of_string</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALbits_of_float">bits_of_float</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALbits_of_float">bits_of_float</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALblit">blit</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td align="left"><br>C</td></tr>
<tr><td><a href="Reins.Types.String.html#VALcapitalize">capitalize</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALcardinal">cardinal</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALcardinal">cardinal</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Returns the number of elements in the set.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALcautious_normalize_ratio">cautious_normalize_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALcautious_normalize_ratio_when_printing">cautious_normalize_ratio_when_printing</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALceiling_ratio">ceiling_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALchoose">choose</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Choose an arbitrary element from the set.
</div>
</td></tr>
<tr><td><a href="Reins.DugADT.S.html#VALclassify">classify</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Dug.html#VALclear">clear</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.OracleSet.Extractor.html#VALclear_profile">clear_profile</a> [<a href="Reins.OracleSet.Extractor.html">Reins.OracleSet.Extractor</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugADT.S.html#VALcoerce_gen">coerce_gen</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugADT.S.html#VALcoerce_mut">coerce_mut</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugADT.S.html#VALcoerce_obs">coerce_obs</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALcombine">combine</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoMapSig.html#VALcompare">compare</a> [<a href="Reins.Maps.MonoMapSig.html">Reins.Maps.MonoMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoKeyMapSig.html#VALcompare">compare</a> [<a href="Reins.Maps.MonoKeyMapSig.html">Reins.Maps.MonoKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.PolyMapSig.html#VALcompare">compare</a> [<a href="Reins.Maps.PolyMapSig.html">Reins.Maps.PolyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALcompare">compare</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">compare f t1 t2</code> Compares the lists <code class="code">t1</code> and <code class="code">t2</code> using <code class="code">f</code> to
      compare individual elements.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALcompare">compare</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">compare f t1 t2</code> Compares the lists <code class="code">t1</code> and <code class="code">t2</code> using <code class="code">f</code> to
      compare individual elements.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALcompare">compare</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">compare f t1 t2</code> Compares the queues <code class="code">t1</code> and <code class="code">t2</code> using <code class="code">f</code> to
      compare individual elements.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALcompare">compare</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">compare f t1 t2</code> Compares the lists <code class="code">t1</code> and <code class="code">t2</code> using <code class="code">f</code>
	to compare individual elements.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALcompare">compare</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">compare f t1 t2</code> Compares the lists <code class="code">t1</code> and <code class="code">t2</code> using <code class="code">f</code> to
      compare individual elements.
</div>
</td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALcompare">compare</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">compare t1 t2</code> Compares the sets <code class="code">t1</code> and <code class="code">t2</code> and returns
	<code class="code">0</code> if they are equal.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALcompare">compare</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">compare f t1 t2</code> Compares the lists <code class="code">t1</code> and <code class="code">t2</code> using <code class="code">f</code>
	to compare individual elements.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALcompare">compare</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Option.html#VALcompare">compare</a> [<a href="Reins.Types.Option.html">Reins.Types.Option</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALcompare">compare</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALcompare">compare</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#VALcompare">compare</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALcompare">compare</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALcompare">compare</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Char.html#VALcompare">compare</a> [<a href="Reins.Types.Char.html">Reins.Types.Char</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Bool.html#VALcompare">compare</a> [<a href="Reins.Types.Bool.html">Reins.Types.Bool</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Float.html#VALcompare">compare</a> [<a href="Reins.Types.Float.html">Reins.Types.Float</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALcompare">compare</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.ArbitraryComparable.html#VALcompare">compare</a> [<a href="Reins.Types.Mono.ArbitraryComparable.html">Reins.Types.Mono.ArbitraryComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Comparable.html#VALcompare">compare</a> [<a href="Reins.Types.Mono.Comparable.html">Reins.Types.Mono.Comparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Comparable3Tuple.html#VALcompare">compare</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#VALcompare">compare</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#VALcompare">compare</a> [<a href="Reins.Types.Mono.ComposeGenComparable.html">Reins.Types.Mono.ComposeGenComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.ComposeComparable.html#VALcompare">compare</a> [<a href="Reins.Types.Mono.ComposeComparable.html">Reins.Types.Mono.ComposeComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.ArbitraryComparable.html#VALcompare">compare</a> [<a href="Reins.Types.Poly.ArbitraryComparable.html">Reins.Types.Poly.ArbitraryComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Comparable.html#VALcompare">compare</a> [<a href="Reins.Types.Poly.Comparable.html">Reins.Types.Poly.Comparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Close.html#VALcompare">compare</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#VALcompare">compare</a> [<a href="Reins.Types.Poly.ComposeGenComparable.html">Reins.Types.Poly.ComposeGenComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.ComposeComparable.html#VALcompare">compare</a> [<a href="Reins.Types.Poly.ComposeComparable.html">Reins.Types.Poly.ComposeComparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALcompare_big_int">compare_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALcompare_big_int_ratio">compare_big_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoMapSig.html#VALcompare_keys">compare_keys</a> [<a href="Reins.Maps.MonoMapSig.html">Reins.Maps.MonoMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoKeyMapSig.html#VALcompare_keys">compare_keys</a> [<a href="Reins.Maps.MonoKeyMapSig.html">Reins.Maps.MonoKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.PolyMapSig.html#VALcompare_keys">compare_keys</a> [<a href="Reins.Maps.PolyMapSig.html">Reins.Maps.PolyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALcompare_ratio">compare_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALconcat">concat</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALconcat">concat</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALconj">conj</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALcons">cons</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">cons x t</code> Adds the element <code class="code">x</code> to the front of the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALcons">cons</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">cons x t</code> Adds <code class="code">x</code> onto the front of the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALcons">cons</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">cons x t</code> Adds <code class="code">x</code> to the front of queue <code class="code">t</code> so that a
      subsequent call to <code class="code">hd</code> returns <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALcons">cons</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">cons x t</code> Adds <code class="code">x</code> as the first element to the right of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALcons">cons</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">cons x t</code> Adds <code class="code">x</code> onto the front of the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALcons">cons</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">cons x t</code> Add the element <code class="code">x</code> to the front of list <code class="code">t</code>
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALcons_back">cons_back</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">cons_back x t</code> Adds <code class="code">x</code> to the back of queue <code class="code">t</code> so that a
      subsequent call to <code class="code">hd_back</code> returns <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.String.html#VALcontains">contains</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALcontains_from">contains_from</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALcopy">copy</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Dug.html#VALcreate">create</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALcreate">create</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
<code class="code">create dir trav col</code> Create an iterator for the collection
	<code class="code">col</code> using the direction and traversal given.
</div>
</td></tr>
<tr><td><a href="Reins.Types.String.html#VALcreate">create</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALcreate_normalized_ratio">create_normalized_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugADT.S.html#VALcreate_op">create_op</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALcreate_ratio">create_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td align="left"><br>D</td></tr>
<tr><td><a href="Reins.Heaps.Heap_.html#VALdelete_min">delete_min</a> [<a href="Reins.Heaps.Heap_.html">Reins.Heaps.Heap_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALdenominator_ratio">denominator_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALdequeue">dequeue</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">dequeue x t</code> is an alias for <a href="Reins.DoubleQueue.html#VALhd"><code class="code">Reins.DoubleQueue.hd</code></a> <code class="code">x t</code>, removing
      the first element from the front of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Quickcheck.Law.html#VALdesc">desc</a> [<a href="Reins.Quickcheck.Law.html">Reins.Quickcheck.Law</a>]</td>
<td><div class="info">
Description of the test.
</div>
</td></tr>
<tr><td><a href="Reins.Quickcheck.Check.html#VALdesc">desc</a> [<a href="Reins.Quickcheck.Check.html">Reins.Quickcheck.Check</a>]</td>
<td><div class="info">
A copy of the test description supplied by the Law
	    module
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALdiff">diff</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALdiff">diff</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">diff t1 t2</code> Returns a set containing only the elements
	contained in <code class="code">t1</code> and not <code class="code">t2</code>
</div>
</td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALdiv">div</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALdiv">div</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALdiv">div</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#VALdiv">div</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALdiv">div</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALdiv">div</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALdiv">div</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALdiv_big_int">div_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALdiv_big_int_ratio">div_big_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALdiv_int_ratio">div_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALdiv_ratio">div_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALdiv_ratio_big_int">div_ratio_big_int</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALdiv_ratio_int">div_ratio_int</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td align="left"><br>E</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALempty">empty</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALempty">empty</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
The empty list
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALempty">empty</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
The empty list.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALempty">empty</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
The empty queue
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALempty">empty</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
The empty list
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALempty">empty</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
The empty list
</div>
</td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALempty">empty</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
The empty set
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALempty">empty</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
The empty list
</div>
</td></tr>
<tr><td><a href="Reins.Heaps.Heap_.html#VALempty">empty</a> [<a href="Reins.Heaps.Heap_.html">Reins.Heaps.Heap_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALenqueue">enqueue</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">enqueue x t</code> is an alias for <a href="Reins.DoubleQueue.html#VALcons_back"><code class="code">Reins.DoubleQueue.cons_back</code></a> <code class="code">x t</code>,
      adding <code class="code">x</code> to the back of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALeq_big_int">eq_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALeq_big_int_ratio">eq_big_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALeq_ratio">eq_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALequal">equal</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">equal t1 t2</code> Returns true if <code class="code">t1</code> and <code class="code">t2</code> contain the same
	elements.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Option.html#VALequal">equal</a> [<a href="Reins.Types.Option.html">Reins.Types.Option</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALequal">equal</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALequal">equal</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALequal">equal</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALequal">equal</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#VALequal">equal</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALequal">equal</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALequal">equal</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Char.html#VALequal">equal</a> [<a href="Reins.Types.Char.html">Reins.Types.Char</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Bool.html#VALequal">equal</a> [<a href="Reins.Types.Bool.html">Reins.Types.Bool</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Float.html#VALequal">equal</a> [<a href="Reins.Types.Float.html">Reins.Types.Float</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALequal">equal</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Equatable.html#VALequal">equal</a> [<a href="Reins.Types.Mono.Equatable.html">Reins.Types.Mono.Equatable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Equatable.html#VALequal">equal</a> [<a href="Reins.Types.Poly.Equatable.html">Reins.Types.Poly.Equatable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALescaped">escaped</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALexists">exists</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALexists2">exists2</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALexp">exp</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td align="left"><br>F</td></tr>
<tr><td><a href="Reins.SList.html#VALfast_sort">fast_sort</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALfill">fill</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALfilter">filter</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALfind">find</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALfind">find</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALfind_all">find_all</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Heaps.Heap_.html#VALfind_min">find_min</a> [<a href="Reins.Heaps.Heap_.html">Reins.Heaps.Heap_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALflatten">flatten</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">flatten t</code> Appends all of the elements of <code class="code">t</code> into a new list.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALflatten">flatten</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALflatten">flatten</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">flatten l</code> Appends all of the elements of <code class="code">l</code> into a new queue.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALflatten">flatten</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">flatten l</code> Appends all of the elements of <code class="code">l</code> into a new list.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALflatten">flatten</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">flatten l</code> Appends all of the elements of <code class="code">l</code> into a new list.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALflatten">flatten</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
Flatten a list of lists into a single list
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALflip">flip</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Reverse the direction of the iterator.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALfloat_of_big_int">float_of_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALfloat_of_bits">float_of_bits</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALfloat_of_bits">float_of_bits</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALfloat_of_ratio">float_of_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALfloat_of_rational_string">float_of_rational_string</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALfloor_ratio">floor_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALfold">fold</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALfold">fold</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">fold f acc t</code> Accumulates the result <code class="code">acc</code> by applying <code class="code">f acc
      x</code> for each element <code class="code">x</code> in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALfold">fold</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">fold f acc l</code> Equivalent to <code class="code">fold_left f acc l</code>
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALfold">fold</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">fold f acc t</code> Accumulates the result <code class="code">acc</code> by applying <code class="code">f acc
      x</code> for each element <code class="code">x</code> in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALfold">fold</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">fold f acc t</code> Accumulates the result <code class="code">acc</code> by applying <code class="code">f acc
	x</code> for each element <code class="code">x</code> in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALfold">fold</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">fold f acc t</code> Accumulates the result <code class="code">acc</code> by applying <code class="code">f acc
      x</code> for each element <code class="code">x</code> in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALfold">fold</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">fold f acc t</code> Accumulates the result <code class="code">acc</code> by applying <code class="code">f acc
	x</code> for each element <code class="code">x</code> in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALfold">fold</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">fold f acc t</code> Accumulates the result <code class="code">acc</code> by applying <code class="code">f acc
	x</code> for each element <code class="code">x</code> in <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALfold">fold</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
<code class="code">fold f acc t</code> Accumulates the result <code class="code">acc</code> by applying <code class="code">f acc
	x</code> for each element <code class="code">x</code> in the collection that satisfies the
	traversal strategy.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALfold_left">fold_left</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALfold_left2">fold_left2</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALfold_right">fold_right</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALfold_right2">fold_right2</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALfor_all">for_all</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALfor_all2">for_all2</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALformat">format</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALformat">format</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALformat">format</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Dug.html#VALfresh_id">fresh_id</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALfrom_cursor">from_cursor</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALfrom_cursor">from_cursor</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Return the tree pointed to by the cursor.
</div>
</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALfrom_cursor">from_cursor</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">from_cursor curs</code> Return the list that is pointed to by
	<code class="code">curs</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALfrom_cursor">from_cursor</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
<code class="code">from_cursor dir trav curs</code> Create an iterator for the
	collection starting at the cursor <code class="code">curs</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALfrom_list">from_list</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">from_list l</code> Convert the standard list l into a SkewBinaryList.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALfrom_list">from_list</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">from_list t</code> Included for compatibility with the common ListSig
      signature.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALfrom_list">from_list</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">from_list l</code> Convert the standard list l into a DoubleQueue.t.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALfrom_list">from_list</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">from_list l</code> Convert the standard list <code class="code">l</code> into a <code class="code">DList.t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALfrom_list">from_list</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">from_list l</code> Convert the standard list l into a CatenableList.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALfrom_list">from_list</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
Create a list from a builtin list type
</div>
</td></tr>
<tr><td align="left"><br>G</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALgcd_big_int">gcd_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALge_big_int">ge_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALge_big_int_ratio">ge_big_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALge_ratio">ge_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.GenMapSig.html#VALgen">gen</a> [<a href="Reins.Maps.GenMapSig.html">Reins.Maps.GenMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALgen">gen</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">gen f ?size rs</code> Generates a random list whose length is bounded
      by <code class="code">size</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALgen">gen</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">gen f ?size rs</code> Generates a random list whose length is bounded
      by <code class="code">size</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALgen">gen</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">gen f ?size rs</code> Generates a random queue whose length is
      bounded by <code class="code">size</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALgen">gen</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">gen f ?size rs</code> Generates a random list whose length is bounded
	by <code class="code">size</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALgen">gen</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">gen f ?size rs</code> Generates a random list whose length is bounded
      by <code class="code">size</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Sets.GenSetSig.html#VALgen">gen</a> [<a href="Reins.Sets.GenSetSig.html">Reins.Sets.GenSetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALgen">gen</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">gen f ?size rs</code> Generates a random list whose length is bounded
	by <code class="code">size</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Heaps.GenHeapSig.html#VALgen">gen</a> [<a href="Reins.Heaps.GenHeapSig.html">Reins.Heaps.GenHeapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Option.html#VALgen">gen</a> [<a href="Reins.Types.Option.html">Reins.Types.Option</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALgen">gen</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALgen">gen</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALgen">gen</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALgen">gen</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#VALgen">gen</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALgen">gen</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALgen">gen</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Char.html#VALgen">gen</a> [<a href="Reins.Types.Char.html">Reins.Types.Char</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Bool.html#VALgen">gen</a> [<a href="Reins.Types.Bool.html">Reins.Types.Bool</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Float.html#VALgen">gen</a> [<a href="Reins.Types.Float.html">Reins.Types.Float</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALgen">gen</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Arbitrary.html#VALgen">gen</a> [<a href="Reins.Types.Mono.Arbitrary.html">Reins.Types.Mono.Arbitrary</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Gen3Tuple.html#VALgen">gen</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#VALgen">gen</a> [<a href="Reins.Types.Mono.GenPair.html">Reins.Types.Mono.GenPair</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.ComposeGenComparable.html#VALgen">gen</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#VALgen">gen</a> [<a href="Reins.Types.Mono.ComposeGen.html">Reins.Types.Mono.ComposeGen</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Arbitrary.html#VALgen">gen</a> [<a href="Reins.Types.Poly.Arbitrary.html">Reins.Types.Poly.Arbitrary</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.ComposeGenComparable.html#VALgen">gen</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#VALgen">gen</a> [<a href="Reins.Types.Poly.ComposeGen.html">Reins.Types.Poly.ComposeGen</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.GenKeyMapSig.html#VALgen1">gen1</a> [<a href="Reins.Maps.GenKeyMapSig.html">Reins.Maps.GenKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALgen1">gen1</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">gen1 f ?size rs</code> Generates a random set whose size is bounded
	by <code class="code">size</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.MonoMapSig.html#VALgen2">gen2</a> [<a href="Reins.Maps.MonoMapSig.html">Reins.Maps.MonoMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoKeyMapSig.html#VALgen2">gen2</a> [<a href="Reins.Maps.MonoKeyMapSig.html">Reins.Maps.MonoKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.PolyMapSig.html#VALgen2">gen2</a> [<a href="Reins.Maps.PolyMapSig.html">Reins.Maps.PolyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugGenerator.Make.html#VALgenerate">generate</a> [<a href="Reins.DugGenerator.Make.html">Reins.DugGenerator.Make</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugExtractor.html#VALgenerate">generate</a> [<a href="Reins.DugExtractor.html">Reins.DugExtractor</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALget">get</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.OracleSet.Extractor.html#VALget_dug">get_dug</a> [<a href="Reins.OracleSet.Extractor.html">Reins.OracleSet.Extractor</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALget_value">get_value</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALget_value">get_value</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Extracts the value from the current node.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALget_value">get_value</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Similar to <a href="Reins.Iterator.S.html#VALvalue"><code class="code">Reins.Iterator.S.value</code></a> except it throws the exception <code class="code">Failure
	"get_value"</code> if the iterator has reached the end of the
	collection .
</div>
</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALgoto_back">goto_back</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">goto_back curs</code> Moves the cursor to the back of the list.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALgoto_beg">goto_beg</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Advance the iterator to the beginning of the collection as
	governed by the traversal strategy
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALgoto_end">goto_end</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Advance the iterator to the end of the collection as governed
	by the traversal strategy
</div>
</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALgoto_front">goto_front</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">goto_front curs</code>  Moves the cursor to the front of the
	list.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALgt_big_int">gt_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALgt_big_int_ratio">gt_big_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALgt_ratio">gt_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td align="left"><br>H</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALhas_next">has_next</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Returns true if there is another element in the traversal
	after the current element.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALhas_prev">has_prev</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Returns true if there is another element that occurs before
	the current element.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALhas_value">has_value</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALhas_value">has_value</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Returns true if the cursor points to a node that contains a
	value.
</div>
</td></tr>
<tr><td><a href="Reins.Types.String.html#VALhash">hash</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALhash">hash</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALhash">hash</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALhash">hash</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#VALhash">hash</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALhash">hash</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALhash">hash</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Char.html#VALhash">hash</a> [<a href="Reins.Types.Char.html">Reins.Types.Char</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Bool.html#VALhash">hash</a> [<a href="Reins.Types.Bool.html">Reins.Types.Bool</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Float.html#VALhash">hash</a> [<a href="Reins.Types.Float.html">Reins.Types.Float</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALhash">hash</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Hashable.html#VALhash">hash</a> [<a href="Reins.Types.Mono.Hashable.html">Reins.Types.Mono.Hashable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Hashable.html#VALhash">hash</a> [<a href="Reins.Types.Poly.Hashable.html">Reins.Types.Poly.Hashable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALhd">hd</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">hd t</code> Returns the element at the front of the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALhd">hd</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALhd">hd</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">hd q</code> Return the element at the front of the queue.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALhd">hd</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">hd t</code> Returns the element to the immediate right of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALhd">hd</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">hd t</code> Return the element at the front of the list.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALhd">hd</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">hd t</code> Return the first element at the front of the list.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALhd_back">hd_back</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">hd_back q</code> Return the element at the back of the queue.
</div>
</td></tr>
<tr><td align="left"><br>I</td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALi">i</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALindex">index</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALindex_from">index_from</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Heaps.Heap_.html#VALinsert">insert</a> [<a href="Reins.Heaps.Heap_.html">Reins.Heaps.Heap_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALint_of_big_int">int_of_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALint_of_ratio">int_of_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALinteger_ratio">integer_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALinter">inter</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALinter">inter</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">inter t1 t2</code> Returns a set containing only the elements
	contained in both <code class="code">t1</code> and <code class="code">t2</code>
</div>
</td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALinv">inv</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALinverse_ratio">inverse_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALis_empty">is_empty</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALis_empty">is_empty</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
Returns tree if the list is emtpy.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALis_empty">is_empty</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
Returns true if the list is empty
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALis_empty">is_empty</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
Returns true is the queue is empty
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALis_empty">is_empty</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
Returns true if the list is empty.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALis_empty">is_empty</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
returns true if the list is empty
</div>
</td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALis_empty">is_empty</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Returns true if the set is empty
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALis_empty">is_empty</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
Returns true if the list is empty
</div>
</td></tr>
<tr><td><a href="Reins.Heaps.Heap_.html#VALis_empty">is_empty</a> [<a href="Reins.Heaps.Heap_.html">Reins.Heaps.Heap_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Dug.html#VALis_generator">is_generator</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALis_int_big_int">is_int_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALis_integer_ratio">is_integer_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Dug.html#VALis_mutator">is_mutator</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALis_normalized_ratio">is_normalized_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Dug.html#VALis_observer">is_observer</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALiter">iter</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALiter">iter</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">iter f t</code> Iterates over each element in the list <code class="code">t</code> in order
      and applies <code class="code">f</code> to that element.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALiter">iter</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALiter">iter</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">iter f t</code> Iterates over each element in the queue <code class="code">t</code> in order
      and applies <code class="code">f</code> to that element.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALiter">iter</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">iter f t</code> Iterates over each element in the list <code class="code">t</code> and
	applies <code class="code">f</code> to that element.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALiter">iter</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">iter f t</code> Iterates over each element in the list <code class="code">t</code> in order
      and applies <code class="code">f</code> to that element.
</div>
</td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALiter">iter</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">iter f t</code> Apply <code class="code">f</code> to each element in list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALiter">iter</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">iter f t</code> Apply <code class="code">f</code> to each element in list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALiter">iter</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
<code class="code">iter f t</code> Apply <code class="code">f</code> to each element in the collection that
	satisfies the traversal strategy.
</div>
</td></tr>
<tr><td><a href="Reins.Types.String.html#VALiter">iter</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALiter2">iter2</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td align="left"><br>L</td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALlast">last</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">last t</code> Returns the element at the back of the list.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALlast">last</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">last t</code> Returns the element at the back of the list.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALlast">last</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">last q</code> is an alias for <code class="code">hd_back q</code>
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALlast">last</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">last t</code> Returns the last element the right of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALlast">last</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">last t</code> Returns the element at the back of the list.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALlast">last</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">last t</code> Returns the element at the back of the list.
</div>
</td></tr>
<tr><td><a href="Reins.Quickcheck.Law.html#VALlaw">law</a> [<a href="Reins.Quickcheck.Law.html">Reins.Quickcheck.Law</a>]</td>
<td><div class="info">
The function that implements the law.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALle_big_int">le_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALle_big_int_ratio">le_big_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALle_ratio">le_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALlength">length</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">length t</code> returns the lenth of the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALlength">length</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALlength">length</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">length t</code> Returns the number of elements in the queue <code class="code">t</code>
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALlength">length</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">length t</code> Returns the length of the entire list.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALlength">length</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">length t</code> Returns the length of the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALlength">length</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
Returns the length of the list
</div>
</td></tr>
<tr><td><a href="Reins.Types.String.html#VALlength">length</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALlist">list</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">list curs</code> Returns all of the elements to the right of <code class="code">curs</code>
	as a <code class="code">'a list_</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALlog">log</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALlogand">logand</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALlogand">logand</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALlogand">logand</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALlogand">logand</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALlogand">logand</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALlognot">lognot</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALlognot">lognot</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALlognot">lognot</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALlognot">lognot</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALlognot">lognot</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALlogor">logor</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALlogor">logor</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALlogor">logor</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALlogor">logor</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALlogor">logor</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALlogxor">logxor</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALlogxor">logxor</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALlogxor">logxor</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALlogxor">logxor</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALlogxor">logxor</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALlookup">lookup</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">lookup i t</code> Returns the element at position <code class="code">i</code> (O-indexed) in
      the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.String.html#VALlowercase">lowercase</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALlt_big_int">lt_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALlt_big_int_ratio">lt_big_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALlt_ratio">lt_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td align="left"><br>M</td></tr>
<tr><td><a href="Reins.Types.String.html#VALmake">make</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmap">map</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALmap">map</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">map f t</code> Creates a new list by applying <code class="code">f</code> to each element of
      <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALmap">map</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALmap">map</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">map f t</code> Creates a new queue by applying <code class="code">f</code> to each element of
      <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALmap">map</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">map f t</code> Creates a new list by applying <code class="code">f</code> to each element
	of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALmap">map</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">map f t</code> Creates a new list by applying <code class="code">f</code> to each element of
      <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALmap">map</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">map f t</code> Creates a new list by applying <code class="code">f</code> to each element
	of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALmap2">map2</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmapi">mapi</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALmax_big_int">max_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALmax_elt">max_elt</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Return the largest element in the set.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALmax_int">max_int</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALmax_int">max_int</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALmax_int">max_int</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmax_key">max_key</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmax_keyval">max_keyval</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALmax_ratio">max_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Quickcheck.Config.html#VALmax_trivial_percentage">max_trivial_percentage</a> [<a href="Reins.Quickcheck.Config.html">Reins.Quickcheck.Config</a>]</td>
<td><div class="info">
This value determines how many inputs are allowed to be
	classified as trivial before giving up and classifying the law
	as failed.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmem">mem</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALmem">mem</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALmem">mem</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">mem x t</code> Returns true if <code class="code">x</code> is contained in the set <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALmem_assoc">mem_assoc</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALmem_assq">mem_assq</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALmemq">memq</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALmerge">merge</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Heaps.Heap_.html#VALmerge">merge</a> [<a href="Reins.Heaps.Heap_.html">Reins.Heaps.Heap_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALmin_big_int">min_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALmin_elt">min_elt</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Return the smallest element in the set.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALmin_int">min_int</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALmin_int">min_int</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALmin_int">min_int</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmin_key">min_key</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmin_keyval">min_keyval</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALmin_ratio">min_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALminus_big_int">minus_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALminus_one">minus_one</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALminus_one">minus_one</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#VALminus_one">minus_one</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALminus_one">minus_one</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALminus_one">minus_one</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALminus_one">minus_one</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALminus_ratio">minus_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALmod_big_int">mod_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmove_down_left">move_down_left</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALmove_down_left">move_down_left</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Move the cursor down the tree to the left child.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmove_down_right">move_down_right</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALmove_down_right">move_down_right</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Move the cursor down the tree to the right child.
</div>
</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALmove_next">move_next</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">move_left curs</code> Moves the cursor one element to the left.
</div>
</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALmove_prev">move_prev</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">move_right curs</code> Moves the cursor one element to the right.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALmove_up">move_up</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALmove_up">move_up</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Move the cursor up the tree from a sibling to a parent.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALmul">mul</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALmul">mul</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALmul">mul</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#VALmul">mul</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALmul">mul</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALmul">mul</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALmul">mul</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALmult_big_int">mult_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALmult_big_int_ratio">mult_big_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALmult_int_big_int">mult_int_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALmult_int_ratio">mult_int_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALmult_ratio">mult_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugExtractor.html#VALmutate">mutate</a> [<a href="Reins.DugExtractor.html">Reins.DugExtractor</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugExtractor.html#VALmutate2">mutate2</a> [<a href="Reins.DugExtractor.html">Reins.DugExtractor</a>]</td>
<td></td></tr>
<tr><td align="left"><br>N</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALnat_of_big_int">nat_of_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALnat_of_ratio">nat_of_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALneg">neg</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALneg">neg</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALneg">neg</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#VALneg">neg</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALneg">neg</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALneg">neg</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALneg">neg</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALnext">next</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">next t</code> Advance <code class="code">t</code> to the next element in the list.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALnext">next</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Advances the iterator to the next element in the collection.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALnext_length">next_length</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">next_length t</code> Returns the number of elements to the right of
	<code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALnorm">norm</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALnorm2">norm2</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALnormalize_ratio">normalize_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALnth">nth</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALnull_denominator">null_denominator</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALnum_digits_big_int">num_digits_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Quickcheck.Config.html#VALnum_iterations">num_iterations</a> [<a href="Reins.Quickcheck.Config.html">Reins.Quickcheck.Config</a>]</td>
<td><div class="info">
This value determines how many inputs will be passed to the
	<a href="Reins.Quickcheck.Law.html#VALlaw"><code class="code">Reins.Quickcheck.Law.law</code></a> function.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALnumerator_ratio">numerator_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td align="left"><br>O</td></tr>
<tr><td><a href="Reins.DugExtractor.html#VALobserve">observe</a> [<a href="Reins.DugExtractor.html">Reins.DugExtractor</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugExtractor.html#VALobserve2">observe2</a> [<a href="Reins.DugExtractor.html">Reins.DugExtractor</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALof_float">of_float</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALof_float">of_float</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#VALof_float">of_float</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALof_float">of_float</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALof_float">of_float</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALof_float">of_float</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALof_int">of_int</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALof_int">of_int</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#VALof_int">of_int</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALof_int">of_int</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALof_int">of_int</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALof_int">of_int</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALof_int32">of_int32</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALof_int32">of_int32</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALof_nativeint">of_nativeint</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALof_result">of_result</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALof_result">of_result</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Returns the result part of a <code class="code">result_</code> value.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALof_string">of_string</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALof_string">of_string</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#VALof_string">of_string</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALof_string">of_string</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALof_string">of_string</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALof_string">of_string</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALone">one</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALone">one</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALone">one</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#VALone">one</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALone">one</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALone">one</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALone">one</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugADT.S.html#VALop_dependencies">op_dependencies</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugADT.S.html#VALop_to_string">op_to_string</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td></td></tr>
<tr><td align="left"><br>P</td></tr>
<tr><td><a href="Reins.SList.html#VALpartition">partition</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALpolar">polar</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALpop">pop</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">pop t</code> Equivalent to <code class="code">(hd t), (tl t)</code> but is more efficient.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALpop">pop</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">pop t</code> equivalent to <code class="code">(hd t), (tl t)</code> but is more efficient.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALpop">pop</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">pop t</code> Equivalent to <code class="code">(hd t), (tl t)</code> but is more efficient.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALpop">pop</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">pop t</code> Equivalent to <code class="code">(hd t), (tl t)</code> but is slightly more
	efficient.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALpop">pop</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">pop t</code> Equivalent to <code class="code">(hd t), (tl t)</code> but is more efficient.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALpop">pop</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
Returns both the first element of the list and the remaining
	tail of the list.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALpop_back">pop_back</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">pop_back t</code> Equivalent to <code class="code">(hd_back t), (tl_back t)</code> but is
      more efficient.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALpow">pow</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALpower_big_int_positive_big_int">power_big_int_positive_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALpower_big_int_positive_int">power_big_int_positive_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALpower_int_positive_big_int">power_int_positive_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALpower_int_positive_int">power_int_positive_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALpower_ratio_positive_big_int">power_ratio_positive_big_int</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALpower_ratio_positive_int">power_ratio_positive_int</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALpred">pred</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALpred">pred</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#VALpred">pred</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALpred">pred</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALpred">pred</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALpred">pred</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALpred_big_int">pred_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALprev">prev</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">prev t</code> Advance <code class="code">t</code> to the previous element in the list.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALprev">prev</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Advances the iterator to the previous element in the
	collection.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALprev_cons">prev_cons</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">prev_cons x t</code> Adds <code class="code">x</code> as the first element to the left of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALprev_hd">prev_hd</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">prev_hd t</code> Returns the element to the left of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALprev_length">prev_length</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">prev_length t</code> Returns the number of elements in front of
	<code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALprev_pop">prev_pop</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">prev_pop t</code> Equivalent to <code class="code">(prev_hd t), (prev_tl t)</code> but is
	slightly more efficient.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALprev_snoc">prev_snoc</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">snoc x t</code> Adds <code class="code">x</code> as the last element to the left of t <code class="code">t</code>
	(i.e., the first element in the entire list).
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALprev_tl">prev_tl</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">prev_tl t</code> Return the list with the first element to the left
	of <code class="code">t</code> removed.
</div>
</td></tr>
<tr><td><a href="Reins.DugProfile.Make.html#VALprofile">profile</a> [<a href="Reins.DugProfile.Make.html">Reins.DugProfile.Make</a>]</td>
<td></td></tr>
<tr><td align="left"><br>Q</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALquomod_big_int">quomod_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td align="left"><br>R</td></tr>
<tr><td><a href="Reins.DugProfile.Make.html#VALrandom_op">random_op</a> [<a href="Reins.DugProfile.Make.html">Reins.DugProfile.Make</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALratio_of_big_int">ratio_of_big_int</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALratio_of_int">ratio_of_int</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALratio_of_nat">ratio_of_nat</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALratio_of_string">ratio_of_string</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALrcontains_from">rcontains_from</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALrem">rem</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALrem">rem</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#VALrem">rem</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALrem">rem</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALrem">rem</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALrem">rem</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALremove">remove</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALremove">remove</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">remove x t</code> Return the set <code class="code">t</code> with the element <code class="code">x</code> removed.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALremove_assoc">remove_assoc</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALremove_assq">remove_assq</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALreplace_list">replace_list</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">replace_list l curs</code> Replaces the list of elements to the
	right of <code class="code">curs</code> with <code class="code">l</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALreport_sign_ratio">report_sign_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALrev">rev</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">rev t</code> Reverse the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALrev">rev</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALrev">rev</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">rev t</code> Reverses the order of the queue <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALrev">rev</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">rev t</code> Reverse the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALrev">rev</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">rev t</code> Returns the list <code class="code">t</code> in reversed order.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALrev">rev</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
Reverse the list
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALrev_append">rev_append</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALrev_map">rev_map</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">rev_map f t</code> Creates a new list by applying <code class="code">f</code> to each element
      of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALrev_map">rev_map</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALrev_map">rev_map</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">rev_map f t</code> Creates a new queue by applying <code class="code">f</code> to each element
      of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALrev_map">rev_map</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">rev_map f t</code> Creates a new list by applying <code class="code">f</code> to each
	element of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALrev_map">rev_map</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">rev_map f t</code> Creates a new list by applying <code class="code">f</code> to each element
      of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALrev_map">rev_map</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">rev_map f t</code> Creates a new list by applying <code class="code">f</code> to each
	element of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALrev_map2">rev_map2</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALrindex">rindex</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALrindex_from">rindex_from</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALround_futur_last_digit">round_futur_last_digit</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALround_ratio">round_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td align="left"><br>S</td></tr>
<tr><td><a href="Reins.Types.String.html#VALset">set</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALshift_left">shift_left</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALshift_left">shift_left</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALshift_left">shift_left</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALshift_left">shift_left</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALshift_left">shift_left</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALshift_right">shift_right</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALshift_right">shift_right</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALshift_right">shift_right</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALshift_right">shift_right</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALshift_right">shift_right</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALshift_right_logical">shift_right_logical</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALshift_right_logical">shift_right_logical</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALshift_right_logical">shift_right_logical</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALshift_right_logical">shift_right_logical</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALshift_right_logical">shift_right_logical</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALsign_big_int">sign_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALsign_ratio">sign_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALsingleton">singleton</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALsingleton">singleton</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">singleton x</code> Return the set consisting of only the element
	<code class="code">x</code>
</div>
</td></tr>
<tr><td><a href="Reins.Heaps.Heap_.html#VALsingleton">singleton</a> [<a href="Reins.Heaps.Heap_.html">Reins.Heaps.Heap_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Dug.html#VALsize">size</a> [<a href="Reins.Dug.html">Reins.Dug</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALsize">size</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Quickcheck.Config.html#VALsize_arg">size_arg</a> [<a href="Reins.Quickcheck.Config.html">Reins.Quickcheck.Config</a>]</td>
<td><div class="info">
This value is passed as the option size paramter to the
	function <a href="Reins.Types.Mono.Arbitrary.html#VALgen"><code class="code">Reins.Types.Mono.Arbitrary.gen</code></a> when generating input
	for a law.
</div>
</td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALsnoc">snoc</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">snoc x t</code> Adds the element <code class="code">x</code> to the back of the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALsnoc">snoc</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">snoc x t</code> Adds the element <code class="code">x</code> to the back of the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALsnoc">snoc</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">snoc x t</code> is an alias for <a href="Reins.DoubleQueue.html#VALcons_back"><code class="code">Reins.DoubleQueue.cons_back</code></a> <code class="code">x t</code>,
      adding <code class="code">x</code> to the back of <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALsnoc">snoc</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">snoc x t</code> Adds <code class="code">x</code> as the last element to the right of <code class="code">t</code>
	(i.e., the last element in the entire list).
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALsnoc">snoc</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">snoc t x</code> Adds <code class="code">x</code> onto the back of the list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALsnoc">snoc</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">snoc x t</code> Add the element <code class="code">x</code> to the end of list <code class="code">t</code>
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALsort">sort</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALsplice">splice</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">splice t1 t2</code> Splices the elements of <code class="code">t1</code> into <code class="code">t2</code>.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALsplit">split</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALsqrt">sqrt</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALsqrt_big_int">sqrt_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALsquare_big_int">square_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALsquare_ratio">square_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SList.html#VALstable_sort">stable_sort</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALstring_of_big_int">string_of_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALstring_of_ratio">string_of_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugADT.S.html#VALstrip">strip</a> [<a href="Reins.DugADT.S.html">Reins.DugADT.S</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALsub">sub</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALsub">sub</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALsub">sub</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALsub">sub</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#VALsub">sub</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALsub">sub</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALsub">sub</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALsub">sub</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALsub_big_int">sub_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Ratio.html#VALsub_ratio">sub_ratio</a> [<a href="Reins.Types.Ratio.html">Reins.Types.Ratio</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALsucc">succ</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALsucc">succ</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#VALsucc">succ</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALsucc">succ</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALsucc">succ</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALsucc">succ</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALsucc_big_int">succ_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALsys_big_int_of_string">sys_big_int_of_string</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td align="left"><br>T</td></tr>
<tr><td><a href="Reins.Quickcheck.Check.html#VALtest">test</a> [<a href="Reins.Quickcheck.Check.html">Reins.Quickcheck.Check</a>]</td>
<td><div class="info">
The function which executes the series random tests on law
	    <code class="code">L</code>
</div>
</td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALtl">tl</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">tl t</code> Returns the list <code class="code">t</code> with the first element removed.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALtl">tl</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALtl">tl</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">tl t</code> Return the queue <code class="code">t</code> with the element at the front of the
      queue removed.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALtl">tl</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">tl t</code> Return the list with the first element to the right of
	<code class="code">t</code> removed.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALtl">tl</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">tl t</code> Return the tail of the list (the list with the first element
      removed).
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALtl">tl</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">tl t</code> Return the list with the first element removed.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALtl_back">tl_back</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">tl t</code> Return the queue <code class="code">t</code> with the element at the back of the
      queue removed.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALto_cursor">to_cursor</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALto_cursor">to_cursor</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Create a cursor from a tree.
</div>
</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALto_cursor">to_cursor</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
<code class="code">to_cursor t</code> Create a cursor that points to the beginning of
	list <code class="code">t</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALto_float">to_float</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALto_float">to_float</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#VALto_float">to_float</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALto_float">to_float</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALto_float">to_float</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALto_float">to_float</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALto_int">to_int</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALto_int">to_int</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#VALto_int">to_int</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALto_int">to_int</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALto_int">to_int</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALto_int">to_int</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Nativeint.html#VALto_int32">to_int32</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALto_int32">to_int32</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALto_list">to_list</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">to_list t</code> Convert the SkewBinaryList <code class="code">t</code> into a standard list.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALto_list">to_list</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">to_list t</code>  Included for compatibility with the common ListSig
      signature.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALto_list">to_list</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">to_list t</code> Convert the DoubleQueue <code class="code">t</code> into a standard list.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALto_list">to_list</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">to_list t</code> Convert the DList <code class="code">t</code> into a standard list.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALto_list">to_list</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">to_list t</code> Convert the CatenableList <code class="code">t</code> into a standard list.
</div>
</td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALto_list">to_list</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
Convert the list into a builtin list type
</div>
</td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALto_nativeint">to_nativeint</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.DugProfile.Make.html#VALto_string">to_string</a> [<a href="Reins.DugProfile.Make.html">Reins.DugProfile.Make</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoMapSig.html#VALto_string">to_string</a> [<a href="Reins.Maps.MonoMapSig.html">Reins.Maps.MonoMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.MonoKeyMapSig.html#VALto_string">to_string</a> [<a href="Reins.Maps.MonoKeyMapSig.html">Reins.Maps.MonoKeyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.PolyMapSig.html#VALto_string">to_string</a> [<a href="Reins.Maps.PolyMapSig.html">Reins.Maps.PolyMapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALto_string">to_string</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">to_string to_s t</code> Convert the list <code class="code">t</code> into a string using
      <code class="code">to_s</code> to individually convert each element into a string.
</div>
</td></tr>
<tr><td><a href="Reins.SList.html#VALto_string">to_string</a> [<a href="Reins.SList.html">Reins.SList</a>]</td>
<td><div class="info">
<code class="code">to_string to_s t</code> Convert the list <code class="code">t</code> into a string using
      <code class="code">to_s</code> to individually convert each element into a string.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleQueue.html#VALto_string">to_string</a> [<a href="Reins.DoubleQueue.html">Reins.DoubleQueue</a>]</td>
<td><div class="info">
<code class="code">to_string to_s t</code> Convert the queue <code class="code">t</code> into a string using
      <code class="code">to_s</code> to individually convert each element into a string.
</div>
</td></tr>
<tr><td><a href="Reins.DoubleList.Make.html#VALto_string">to_string</a> [<a href="Reins.DoubleList.Make.html">Reins.DoubleList.Make</a>]</td>
<td><div class="info">
<code class="code">to_string to_s t</code> Convert the list <code class="code">t</code> into a string using
	<code class="code">to_s</code> to individually convert each element into a string.
</div>
</td></tr>
<tr><td><a href="Reins.CatenableList.html#VALto_string">to_string</a> [<a href="Reins.CatenableList.html">Reins.CatenableList</a>]</td>
<td><div class="info">
<code class="code">to_string to_s t</code> Convert the list <code class="code">t</code> into a string using
      <code class="code">to_s</code> to individually convert each element into a string.
</div>
</td></tr>
<tr><td><a href="Reins.Sets.PolySetSig.html#VALto_string">to_string</a> [<a href="Reins.Sets.PolySetSig.html">Reins.Sets.PolySetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.MonoSetSig.html#VALto_string">to_string</a> [<a href="Reins.Sets.MonoSetSig.html">Reins.Sets.MonoSetSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Lists.ListSig.html#VALto_string">to_string</a> [<a href="Reins.Lists.ListSig.html">Reins.Lists.ListSig</a>]</td>
<td><div class="info">
<code class="code">to_string to_s t</code> Convert the list <code class="code">t</code> into a string using
	<code class="code">to_s</code> to individually convert each element into a string.
</div>
</td></tr>
<tr><td><a href="Reins.Heaps.PolyHeapSig.html#VALto_string">to_string</a> [<a href="Reins.Heaps.PolyHeapSig.html">Reins.Heaps.PolyHeapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Heaps.MonoHeapSig.html#VALto_string">to_string</a> [<a href="Reins.Heaps.MonoHeapSig.html">Reins.Heaps.MonoHeapSig</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALto_string">to_string</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Option.html#VALto_string">to_string</a> [<a href="Reins.Types.Option.html">Reins.Types.Option</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALto_string">to_string</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALto_string">to_string</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#VALto_string">to_string</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALto_string">to_string</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALto_string">to_string</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Char.html#VALto_string">to_string</a> [<a href="Reins.Types.Char.html">Reins.Types.Char</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Bool.html#VALto_string">to_string</a> [<a href="Reins.Types.Bool.html">Reins.Types.Bool</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Float.html#VALto_string">to_string</a> [<a href="Reins.Types.Float.html">Reins.Types.Float</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALto_string">to_string</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Arbitrary.html#VALto_string">to_string</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#VALto_string">to_string</a> [<a href="Reins.Types.Mono.Comparable.html">Reins.Types.Mono.Comparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Mono.Gen3Tuple.html#VALto_string">to_string</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#VALto_string">to_string</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#VALto_string">to_string</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#VALto_string">to_string</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#VALto_string">to_string</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#VALto_string">to_string</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#VALto_string">to_string</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#VALto_string">to_string</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#VALto_string">to_string</a> [<a href="Reins.Types.Poly.Comparable.html">Reins.Types.Poly.Comparable</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Poly.Close.html#VALto_string">to_string</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#VALto_string">to_string</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#VALto_string">to_string</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#VALto_string">to_string</a> [<a href="Reins.Types.Poly.ComposeComparable.html">Reins.Types.Poly.ComposeComparable</a>]</td>
<td></td></tr>
<tr><td align="left"><br>U</td></tr>
<tr><td><a href="Reins.Types.String.html#VALuncapitalize">uncapitalize</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALunion">union</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALunion">union</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
<code class="code">union t1 t2</code> Returns a set containing all of the elements in
	<code class="code">t1</code> and <code class="code">t2</code>
</div>
</td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALunit_big_int">unit_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALunsafe_blit">unsafe_blit</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALunsafe_fill">unsafe_fill</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALunsafe_get">unsafe_get</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.String.html#VALunsafe_set">unsafe_set</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.SkewBinaryList.html#VALupdate">update</a> [<a href="Reins.SkewBinaryList.html">Reins.SkewBinaryList</a>]</td>
<td><div class="info">
<code class="code">update i v t</code> Returns a new list where the element in position
      <code class="code">i</code> (0-indexed) has been replaced by <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Types.String.html#VALuppercase">uppercase</a> [<a href="Reins.Types.String.html">Reins.Types.String</a>]</td>
<td></td></tr>
<tr><td align="left"><br>V</td></tr>
<tr><td><a href="Reins.ListCursor.S.html#VALvalue">value</a> [<a href="Reins.ListCursor.S.html">Reins.ListCursor.S</a>]</td>
<td><div class="info">
If the cursor currently points to an element <code class="code">x</code>, return that
	element as <code class="code">Some x</code>, otherwise return <code class="code">None</code>.
</div>
</td></tr>
<tr><td><a href="Reins.Iterator.S.html#VALvalue">value</a> [<a href="Reins.Iterator.S.html">Reins.Iterator.S</a>]</td>
<td><div class="info">
Return the element currently pointed to by the iterator.
</div>
</td></tr>
<tr><td><a href="Reins.Version.html#VALversion">version</a> [<a href="Reins.Version.html">Reins.Version</a>]</td>
<td><div class="info">
Current version of the Reins library
</div>
</td></tr>
<tr><td align="left"><br>W</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALwell_formed">well_formed</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALwell_formed">well_formed</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
A predicate to test if the set is well-formed.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALwent_left">went_left</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALwent_left">went_left</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Returns true if the cursor points to an element that is the
	left sibling of its parent.
</div>
</td></tr>
<tr><td><a href="Reins.Maps.Map_.html#VALwent_right">went_right</a> [<a href="Reins.Maps.Map_.html">Reins.Maps.Map_</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Sets.Set_.html#VALwent_right">went_right</a> [<a href="Reins.Sets.Set_.html">Reins.Sets.Set_</a>]</td>
<td><div class="info">
Returns true if the cursor points to an element that is the
	right sibling of its parent.
</div>
</td></tr>
<tr><td align="left"><br>Z</td></tr>
<tr><td><a href="Reins.Types.Integral.html#VALzero">zero</a> [<a href="Reins.Types.Integral.html">Reins.Types.Integral</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Complex.html#VALzero">zero</a> [<a href="Reins.Types.Complex.html">Reins.Types.Complex</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALzero">zero</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#VALzero">zero</a> [<a href="Reins.Types.Nativeint.html">Reins.Types.Nativeint</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int64.html#VALzero">zero</a> [<a href="Reins.Types.Int64.html">Reins.Types.Int64</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int32.html#VALzero">zero</a> [<a href="Reins.Types.Int32.html">Reins.Types.Int32</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Int.html#VALzero">zero</a> [<a href="Reins.Types.Int.html">Reins.Types.Int</a>]</td>
<td></td></tr>
<tr><td><a href="Reins.Types.Big_int.html#VALzero_big_int">zero_big_int</a> [<a href="Reins.Types.Big_int.html">Reins.Types.Big_int</a>]</td>
<td></td></tr>
</table><br>
</body>
</html>

Perl :: Catalyst :: PostgreSQL :: RPM Valid HTML 4.01 Transitional