<html> <head> <link rel="stylesheet" href="style.css" type="text/css"> <link rel="Start" href="index.html"> <link rel="previous" href="Arith.html"> <link rel="next" href="Goals.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 modules" rel=Appendix href="index_modules.html"> <link title="Index of module types" rel=Appendix href="index_module_types.html"> <link title="Domain" rel="Chapter" href="Domain.html"> <link title="SetDomain" rel="Chapter" href="SetDomain.html"> <link title="Stak" rel="Chapter" href="Stak.html"> <link title="Data" rel="Chapter" href="Data.html"> <link title="Cstr" rel="Chapter" href="Cstr.html"> <link title="Var" rel="Chapter" href="Var.html"> <link title="Invariant" rel="Chapter" href="Invariant.html"> <link title="Reify" rel="Chapter" href="Reify.html"> <link title="Arith" rel="Chapter" href="Arith.html"> <link title="Conjunto" rel="Chapter" href="Conjunto.html"> <link title="Goals" rel="Chapter" href="Goals.html"> <link title="FdArray" rel="Chapter" href="FdArray.html"> <link title="Gcc" rel="Chapter" href="Gcc.html"> <link title="Alldiff" rel="Chapter" href="Alldiff.html"> <link title="Sorting" rel="Chapter" href="Sorting.html"> <link title="Interval" rel="Chapter" href="Interval.html"><title>Conjunto</title> </head> <body> <div class="navbar"><a href="Arith.html">Previous</a> <a href="index.html">Up</a> <a href="Goals.html">Next</a> </div> <center><h1>Module <a href="type_Conjunto.html">Conjunto</a></h1></center> <br> <pre><span class="keyword">module</span> Conjunto: <code class="code">sig</code> <a href="Conjunto.html">..</a> <code class="code">end</code></pre>Constraints on Finite Sets<br> <hr width="100%"> <pre><span class="keyword">val</span> <a name="VALsubset"></a>subset : <code class="type">Var.SetFd.t -> Var.SetFd.t -> <a href="Cstr.html#TYPEt">Cstr.t</a></code></pre><div class="info"> <code class="code">subset v1 v2</code> ensures that <code class="code">v1</code> is a subset of <code class="code">v2</code>. Not reifiable.<br> </div> <pre><span class="keyword">val</span> <a name="VALcardinal"></a>cardinal : <code class="type">Var.SetFd.t -> Var.Fd.t</code></pre><div class="info"> <code class="code">cardinal v</code> returns the cardinal (an integer variable) of the set <code class="code">v</code>. Not reifiable.<br> </div> <pre><span class="keyword">val</span> <a name="VALsmallest"></a>smallest : <code class="type">Var.SetFd.t -> Var.Fd.t</code></pre><div class="info"> <code class="code">smallest v</code> returns the smallest element (an integer variable) of <code class="code">v</code>.<br> </div> <pre><span class="keyword">val</span> <a name="VALunion"></a>union : <code class="type">Var.SetFd.t -> Var.SetFd.t -> Var.SetFd.t</code></pre><pre><span class="keyword">val</span> <a name="VALinter"></a>inter : <code class="type">Var.SetFd.t -> Var.SetFd.t -> Var.SetFd.t</code></pre><div class="info"> Operations on sets.<br> </div> <pre><span class="keyword">val</span> <a name="VALall_disjoint"></a>all_disjoint : <code class="type">Var.SetFd.t array -> <a href="Cstr.html#TYPEt">Cstr.t</a></code></pre><div class="info"> <code class="code">all_disjoint vars</code> ensures that all the set variables of array <code class="code">vars</code> are pairwise disjoint. Not reifiable.<br> </div> <pre><span class="keyword">val</span> <a name="VALdisjoint"></a>disjoint : <code class="type">Var.SetFd.t -> Var.SetFd.t -> <a href="Cstr.html#TYPEt">Cstr.t</a></code></pre><div class="info"> <code class="code">disjoint v1 v2</code> defined by <code class="code">all_disjoint [|v1; v2|]</code>. Not reifiable.<br> </div> <pre><span class="keyword">val</span> <a name="VALinside"></a>inside : <code class="type">int -> Var.SetFd.t -> unit</code></pre><pre><span class="keyword">val</span> <a name="VALoutside"></a>outside : <code class="type">int -> Var.SetFd.t -> unit</code></pre><div class="info"> Basic refinements for labeling.<br> </div> <pre><span class="keyword">val</span> <a name="VALmem"></a>mem : <code class="type">Var.Fd.t -> Var.SetFd.t -> <a href="Cstr.html#TYPEt">Cstr.t</a></code></pre><div class="info"> <code class="code">mem x v</code> states that <code class="code">x</code> belongs to <code class="code">v</code>.<br> </div> <pre><span class="keyword">val</span> <a name="VALinf_min"></a>inf_min : <code class="type">Var.SetFd.t -> Var.SetFd.t -> <a href="Cstr.html#TYPEt">Cstr.t</a></code></pre><div class="info"> <code class="code">inf_min v1 v2</code> ensures that the minimal element of <code class="code">v1</code> is less than or equal to the minimal element of <code class="code">v2</code>. The empty set is smaller than any other set. Useful to break permutation symmetries for a set of set variables. Not reifiable.<br> </div> <pre><span class="keyword">val</span> <a name="VALorder"></a>order : <code class="type">Var.SetFd.t -> Var.SetFd.t -> <a href="Cstr.html#TYPEt">Cstr.t</a></code></pre><div class="info"> <code class="code">order v1 v2</code> ensures that <code class="code">v1</code> is less than or equal to <code class="code">v2</code> according to <code class="code">Domain.compare</code> . Caution: <code class="code">order</code> builds the cardinal variables of <code class="code">v1</code> and <code class="code">v2</code>; if they are already available, please use <code class="code">order_with_card</code>. Not reifiable.<br> </div> <pre><span class="keyword">val</span> <a name="VALorder_with_card"></a>order_with_card : <code class="type">Var.SetFd.t -> Var.Fd.t -> Var.SetFd.t -> Var.Fd.t -> <a href="Cstr.html#TYPEt">Cstr.t</a></code></pre><div class="info"> <code class="code">order_with_card v1 card1 v2 card2</code> is equivalent to <code class="code">order</code> but the cardinals of the variables must be provided too. Useful to sort a set of variables.<br> </div> <pre><span class="keyword">val</span> <a name="VALmember"></a>member : <code class="type">Var.SetFd.t -> <a href="SetDomain.html#TYPEelt">SetDomain.elt</a> list -> <a href="Cstr.html#TYPEt">Cstr.t</a></code></pre><div class="info"> <code class="code">member v l</code> ensures that <code class="code">v</code> will have a value in <code class="code">l</code>. Not reifiable.<br> </div> <pre><span class="keyword">val</span> <a name="VALsum_weight"></a>sum_weight : <code class="type">Var.SetFd.t -> (int * int) list -> Var.Fd.t</code></pre><div class="info"> <code class="code">sum_weight v weights</code> returns an integer variable equal to the sum of the weights associated with the value in <code class="code">v</code>. <code class="code">weights</code> must be a list of pairs <code class="code">value, weight)</code> that associates a unique weight to each value possibly in <code class="code">v</code>. All the weights must be positive integers.<br> </div> </body></html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
5ee7712a65135f0dd95d1c92938a0193
>
files
>
189
