text: <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
  <html>
  <head>
  <link rel="stylesheet" href="style.css" type="text/css">
  <meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type">
  <link rel="Start" href="index.html">
  <link rel="previous" href="Scanf.html">
  <link rel="next" href="Sort.html">
  <link rel="Up" 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 class attributes" rel=Appendix href="index_attributes.html">
  <link title="Index of class methods" rel=Appendix href="index_methods.html">
  <link title="Index of classes" rel=Appendix href="index_classes.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="Arg" rel="Chapter" href="Arg.html">
  <link title="Arg_helper" rel="Chapter" href="Arg_helper.html">
  <link title="Arith_status" rel="Chapter" href="Arith_status.html">
  <link title="Array" rel="Chapter" href="Array.html">
  <link title="ArrayLabels" rel="Chapter" href="ArrayLabels.html">
  <link title="Ast_helper" rel="Chapter" href="Ast_helper.html">
  <link title="Ast_invariants" rel="Chapter" href="Ast_invariants.html">
  <link title="Ast_iterator" rel="Chapter" href="Ast_iterator.html">
  <link title="Ast_mapper" rel="Chapter" href="Ast_mapper.html">
  <link title="Asttypes" rel="Chapter" href="Asttypes.html">
  <link title="Attr_helper" rel="Chapter" href="Attr_helper.html">
  <link title="Big_int" rel="Chapter" href="Big_int.html">
  <link title="Bigarray" rel="Chapter" href="Bigarray.html">
  <link title="Buffer" rel="Chapter" href="Buffer.html">
  <link title="Builtin_attributes" rel="Chapter" href="Builtin_attributes.html">
  <link title="Bytes" rel="Chapter" href="Bytes.html">
  <link title="BytesLabels" rel="Chapter" href="BytesLabels.html">
  <link title="Callback" rel="Chapter" href="Callback.html">
  <link title="CamlinternalFormat" rel="Chapter" href="CamlinternalFormat.html">
  <link title="CamlinternalFormatBasics" rel="Chapter" href="CamlinternalFormatBasics.html">
  <link title="CamlinternalLazy" rel="Chapter" href="CamlinternalLazy.html">
  <link title="CamlinternalMod" rel="Chapter" href="CamlinternalMod.html">
  <link title="CamlinternalOO" rel="Chapter" href="CamlinternalOO.html">
  <link title="Ccomp" rel="Chapter" href="Ccomp.html">
  <link title="Char" rel="Chapter" href="Char.html">
  <link title="Clflags" rel="Chapter" href="Clflags.html">
  <link title="Complex" rel="Chapter" href="Complex.html">
  <link title="Condition" rel="Chapter" href="Condition.html">
  <link title="Config" rel="Chapter" href="Config.html">
  <link title="Consistbl" rel="Chapter" href="Consistbl.html">
  <link title="Digest" rel="Chapter" href="Digest.html">
  <link title="Docstrings" rel="Chapter" href="Docstrings.html">
  <link title="Dynlink" rel="Chapter" href="Dynlink.html">
  <link title="Ephemeron" rel="Chapter" href="Ephemeron.html">
  <link title="Event" rel="Chapter" href="Event.html">
  <link title="Filename" rel="Chapter" href="Filename.html">
  <link title="Format" rel="Chapter" href="Format.html">
  <link title="Gc" rel="Chapter" href="Gc.html">
  <link title="Genlex" rel="Chapter" href="Genlex.html">
  <link title="Graphics" rel="Chapter" href="Graphics.html">
  <link title="GraphicsX11" rel="Chapter" href="GraphicsX11.html">
  <link title="Hashtbl" rel="Chapter" href="Hashtbl.html">
  <link title="Identifiable" rel="Chapter" href="Identifiable.html">
  <link title="Int32" rel="Chapter" href="Int32.html">
  <link title="Int64" rel="Chapter" href="Int64.html">
  <link title="Lazy" rel="Chapter" href="Lazy.html">
  <link title="Lexer" rel="Chapter" href="Lexer.html">
  <link title="Lexing" rel="Chapter" href="Lexing.html">
  <link title="List" rel="Chapter" href="List.html">
  <link title="ListLabels" rel="Chapter" href="ListLabels.html">
  <link title="Location" rel="Chapter" href="Location.html">
  <link title="Longident" rel="Chapter" href="Longident.html">
  <link title="Map" rel="Chapter" href="Map.html">
  <link title="Marshal" rel="Chapter" href="Marshal.html">
  <link title="Misc" rel="Chapter" href="Misc.html">
  <link title="MoreLabels" rel="Chapter" href="MoreLabels.html">
  <link title="Mutex" rel="Chapter" href="Mutex.html">
  <link title="Nativeint" rel="Chapter" href="Nativeint.html">
  <link title="Num" rel="Chapter" href="Num.html">
  <link title="Numbers" rel="Chapter" href="Numbers.html">
  <link title="Obj" rel="Chapter" href="Obj.html">
  <link title="Oo" rel="Chapter" href="Oo.html">
  <link title="Parse" rel="Chapter" href="Parse.html">
  <link title="Parser" rel="Chapter" href="Parser.html">
  <link title="Parsetree" rel="Chapter" href="Parsetree.html">
  <link title="Parsing" rel="Chapter" href="Parsing.html">
  <link title="Pervasives" rel="Chapter" href="Pervasives.html">
  <link title="Pprintast" rel="Chapter" href="Pprintast.html">
  <link title="Printast" rel="Chapter" href="Printast.html">
  <link title="Printexc" rel="Chapter" href="Printexc.html">
  <link title="Printf" rel="Chapter" href="Printf.html">
  <link title="Queue" rel="Chapter" href="Queue.html">
  <link title="Random" rel="Chapter" href="Random.html">
  <link title="Ratio" rel="Chapter" href="Ratio.html">
  <link title="Scanf" rel="Chapter" href="Scanf.html">
  <link title="Set" rel="Chapter" href="Set.html">
  <link title="Sort" rel="Chapter" href="Sort.html">
  <link title="Stack" rel="Chapter" href="Stack.html">
  <link title="StdLabels" rel="Chapter" href="StdLabels.html">
  <link title="Str" rel="Chapter" href="Str.html">
  <link title="Stream" rel="Chapter" href="Stream.html">
  <link title="String" rel="Chapter" href="String.html">
  <link title="StringLabels" rel="Chapter" href="StringLabels.html">
  <link title="Strongly_connected_components" rel="Chapter" href="Strongly_connected_components.html">
  <link title="Syntaxerr" rel="Chapter" href="Syntaxerr.html">
  <link title="Sys" rel="Chapter" href="Sys.html">
  <link title="Tbl" rel="Chapter" href="Tbl.html">
  <link title="Terminfo" rel="Chapter" href="Terminfo.html">
  <link title="Thread" rel="Chapter" href="Thread.html">
  <link title="ThreadUnix" rel="Chapter" href="ThreadUnix.html">
  <link title="Timings" rel="Chapter" href="Timings.html">
  <link title="Uchar" rel="Chapter" href="Uchar.html">
  <link title="Unix" rel="Chapter" href="Unix.html">
  <link title="UnixLabels" rel="Chapter" href="UnixLabels.html">
  <link title="Warnings" rel="Chapter" href="Warnings.html">
  <link title="Weak" rel="Chapter" href="Weak.html"><title>Set</title>
  </head>
  <body>
  <div class="navbar"><a class="pre" href="Scanf.html" title="Scanf">Previous</a>
  &nbsp;<a class="up" href="index.html" title="Index">Up</a>
  &nbsp;<a class="post" href="Sort.html" title="Sort">Next</a>
  </div>
  <h1>Module <a href="type_Set.html">Set</a></h1>
  
  <pre><span class="keyword">module</span> Set: <code class="code"><span class="keyword">sig</span></code> <a href="Set.html">..</a> <code class="code"><span class="keyword">end</span></code></pre><div class="info module top">
  Sets over ordered types.
  <p>
  
     This module implements the set data structure, given a total ordering
     function over the set elements. All operations over sets
     are purely applicative (no side-effects).
     The implementation uses balanced binary trees, and is therefore
     reasonably efficient: insertion and membership take time
     logarithmic in the size of the set, for instance.
  <p>
  
     The <code class="code"><span class="constructor">Make</span></code> functor constructs implementations for any type, given a
     <code class="code">compare</code> function.
     For instance:
     <pre class="codepre"><code class="code">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">module</span>&nbsp;<span class="constructor">IntPairs</span>&nbsp;=
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">struct</span>
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">type</span>&nbsp;t&nbsp;=&nbsp;int&nbsp;*&nbsp;int
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">let</span>&nbsp;compare&nbsp;(x0,y0)&nbsp;(x1,y1)&nbsp;=
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">match</span>&nbsp;<span class="constructor">Pervasives</span>.compare&nbsp;x0&nbsp;x1&nbsp;<span class="keyword">with</span>
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;0&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;<span class="constructor">Pervasives</span>.compare&nbsp;y0&nbsp;y1
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keywordsign">|</span>&nbsp;c&nbsp;<span class="keywordsign">-&gt;</span>&nbsp;c
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">end</span>
  
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">module</span>&nbsp;<span class="constructor">PairsSet</span>&nbsp;=&nbsp;<span class="constructor">Set</span>.<span class="constructor">Make</span>(<span class="constructor">IntPairs</span>)
  
  &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<span class="keyword">let</span>&nbsp;m&nbsp;=&nbsp;<span class="constructor">PairsSet</span>.(empty&nbsp;|&gt;&nbsp;add&nbsp;(2,3)&nbsp;|&gt;&nbsp;add&nbsp;(5,7)&nbsp;|&gt;&nbsp;add&nbsp;(11,13))
  &nbsp;&nbsp;&nbsp;</code></pre>
  <p>
  
     This creates a new module <code class="code"><span class="constructor">PairsSet</span></code>, with a new type <code class="code"><span class="constructor">PairsSet</span>.t</code>
     of sets of <code class="code">int * int</code>.<br>
  </div>
  <hr width="100%">
  
  <pre><span class="keyword">module type</span> <a href="Set.OrderedType.html">OrderedType</a> = <code class="code"><span class="keyword">sig</span></code> <a href="Set.OrderedType.html">..</a> <code class="code"><span class="keyword">end</span></code></pre><div class="info">
  Input signature of the functor <a href="Set.Make.html"><code class="code"><span class="constructor">Set</span>.<span class="constructor">Make</span></code></a>.
  </div>
  
  <pre><span class="keyword">module type</span> <a href="Set.S.html">S</a> = <code class="code"><span class="keyword">sig</span></code> <a href="Set.S.html">..</a> <code class="code"><span class="keyword">end</span></code></pre><div class="info">
  Output signature of the functor <a href="Set.Make.html"><code class="code"><span class="constructor">Set</span>.<span class="constructor">Make</span></code></a>.
  </div>
  
  <pre><span class="keyword">module</span> <a href="Set.Make.html">Make</a>: <div class="sig_block"><code class="code"><span class="keyword">functor</span> (</code><code class="code"><span class="constructor">Ord</span></code><code class="code"> : </code><code class="type"><a href="Set.OrderedType.html">OrderedType</a></code><code class="code">) <span class="keywordsign">-&gt;</span> </code><code class="type"><a href="Set.S.html">S</a></code><code class="type">  with type elt = Ord.t</code></div></pre><div class="info">
  Functor building an implementation of the set structure
     given a totally ordered type.
  </div>
  </body></html>