<html>
<head>
<link rel="stylesheet" href="style.css" type="text/css">
<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="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>Index of values</title>
</head>
<body>
<center><h1>Index of values</h1></center>
<table>
<tr><td align="left"><br></td></tr>
<tr><td><a href="Arith.html#VAL(%~)">(%~)</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
Division and modulo on expressions.
</div>
</td></tr>
<tr><td><a href="Goals.html#VAL(&&~)">(&&~)</a> [<a href="Goals.html">Goals</a>]</td>
<td></td></tr>
<tr><td><a href="Reify.html#VAL(&&~~)">(&&~~)</a> [<a href="Reify.html">Reify</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(**~)">(**~)</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
Exponentiation of an expression to an integer value.
</div>
</td></tr>
<tr><td><a href="Arith.html#VAL(*~)">(*~)</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
Addition, substraction, multiplication on expressions.
</div>
</td></tr>
<tr><td><a href="Arith.html#VAL(+~)">(+~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(-~)">(-~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(/~)">(/~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Reify.html#VAL(<=>~~)">(<=>~~)</a> [<a href="Reify.html">Reify</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(<=~)">(<=~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(<=~~)">(<=~~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(<>~)">(<>~)</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
Strictly less, less or equal, equal, greater or equal,
strictly greater and different constraints on expressions.
</div>
</td></tr>
<tr><td><a href="Arith.html#VAL(<>~~)">(<>~~)</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
Reified strictly less, less or equal, equal, greater or equal,
strictly greater and different.
</div>
</td></tr>
<tr><td><a href="Arith.html#VAL(<~)">(<~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(<~~)">(<~~)</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">e1 op~~ e2</code> is equivalent to <code class="code">fd2e (Reify.boolean (e1 op~ e2))</code>.
</div>
</td></tr>
<tr><td><a href="Reify.html#VAL(=>~~)">(=>~~)</a> [<a href="Reify.html">Reify</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(=~)">(=~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(=~~)">(=~~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(>=~)">(>=~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(>=~~)">(>=~~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(>~)">(>~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VAL(>~~)">(>~~)</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Goals.html#VAL(||~)">(||~)</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
Conjunction and disjunction over goals.
</div>
</td></tr>
<tr><td><a href="Reify.html#VAL(||~~)">(||~~)</a> [<a href="Reify.html">Reify</a>]</td>
<td></td></tr>
<tr><td align="left"><br>A</td></tr>
<tr><td><a href="Arith.html#VALabs">abs</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
Absolute value on expressions.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALactive_store">active_store</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
<code class="code">active_store ()</code> returns the list of all active constraints, i.e.
</div>
</td></tr>
<tr><td><a href="Data.Hashtbl.html#VALadd">add</a> [<a href="Data.Hashtbl.html">Data.Hashtbl</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.S.html#VALadd">add</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALadd">add</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">add n d</code> returns <code class="code">d</code> <code class="code">{n}</code>.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALall_disjoint">all_disjoint</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><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.
</div>
</td></tr>
<tr><td><a href="Invariant.Array.html#VALargmin">argmin</a> [<a href="Invariant.Array.html">Invariant.Array</a>]</td>
<td><div class="info">
<code class="code">argmin a c</code> returns the BIR index of the minimum BIR value of <code class="code">a</code> for
criterion <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALarray">array</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">array n inf sup</code> returns an array of <code class="code">n</code> new variables with domain
<code class="code">[inf..sup]</code>.
</div>
</td></tr>
<tr><td><a href="Goals.html#VALatomic">atomic</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">atomic ~name:"atomic" f</code> returns a goal calling function <code class="code">f</code>.
</div>
</td></tr>
<tr><td align="left"><br>B</td></tr>
<tr><td><a href="Invariant.html#VALbinary">binary</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">binary ~name:"Invariant.binary" f</code> wraps the binary function <code class="code">f</code>
into an operator on BIRs.
</div>
</td></tr>
<tr><td><a href="Reify.html#VALboolean">boolean</a> [<a href="Reify.html">Reify</a>]</td>
<td><div class="info">
<code class="code">boolean ~delay_on_negation:true c</code> returns a boolean (0..1)
variable associated to the constraint <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALboolean">boolean</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
The domain containing <code class="code">0</code> and <code class="code">1</code>.
</div>
</td></tr>
<tr><td align="left"><br>C</td></tr>
<tr><td><a href="Conjunto.html#VALcardinal">cardinal</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><div class="info">
<code class="code">cardinal v</code> returns the cardinal (an integer variable) of the set <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALcardinal">cardinal</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.S.html#VALchoose">choose</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALchoose">choose</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">choose ord d</code> returns the mininum value of <code class="code">d</code> for order <code class="code">ord</code>.
</div>
</td></tr>
<tr><td><a href="Goals.Array.html#VALchoose_index">choose_index</a> [<a href="Goals.Array.html">Goals.Array</a>]</td>
<td><div class="info">
<code class="code">choose_index order fds</code> returns the index of the best (minimun)
free (not instantiated) variable in the array <code class="code">fds</code> for the criterion
<code class="code">order</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALcompare">compare</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
Compares two variables.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALcompare">compare</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALcompare">compare</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">compare d1 d2</code> is a comparison function working first on the cardinal,
then (if <code class="code">d1</code> and <code class="code">d2</code> have the same size) on the lexicographic order
of the domains (expressed in extension).
</div>
</td></tr>
<tr><td><a href="Domain.html#VALcompare_elt">compare_elt</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">compare_elt e1 e2</code> is a comparison function on elements of domains.
</div>
</td></tr>
<tr><td><a href="Invariant.html#VALconstant">constant</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">constant ~name:"" cst</code> returns an unsetable BIR with initial
content <code class="code">cst</code>.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALconstraints_number">constraints_number</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
<code class="code">constraints_number a</code> returns the number of different constraints
attached to <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="Goals.html#VALcreate">create</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">create ~name:"create" f a</code> returns a goal calling <code class="code">f a</code>.
</div>
</td></tr>
<tr><td><a href="Invariant.html#VALcreate">create</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">create ~name:"" v</code> returns a setable BIR with initial content <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALcreate">create</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">create ?name d</code> returns a new variable with domain <code class="code">d</code>.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALcreate">create</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
<code class="code">create ?name ?nb_wakings ?fprint ?priority ?init ?check ?not update delay</code>
builds a new constraint: <code class="code">name</code> is a describing string for the constraint. Default value
is <code class="code">"anonymous"</code>., <code class="code">nb_wakings</code> is the number of calls to <code class="code">Var.delay</code> with distinct
"<code class="code">waking_id</code>" arguments within the
constraint own <code class="code">delay</code> function (see below). Default value is <code class="code">1</code>.
Beware that if <code class="code">nb_wakings</code> is greater than 1 and the optional <code class="code">init</code>
argument is not provided, <code class="code">init</code> default behaviour is to do nothing
(i.e. the <code class="code">update</code> function will not be called)., <code class="code">fprint</code> should print the constraint on an output channel taken as
its only argument. Default value is to print the <code class="code">name</code> string., <code class="code">priority</code> is either <code class="code">immediate</code>, <code class="code">normal</code> or <code class="code">later</code>. Time costly
constraints should be waken after quick ones. Default value is <code class="code">normal</code>., <code class="code">init</code> is useful to perform initialization of auxiliary data
structures needed and maintained by the <code class="code">update</code> function.
<code class="code">init ()</code> is called as soon as the constraint is posted. Default
value is to call <code class="code">(update 0)</code> if <code class="code">nb_wakings</code> is equal to 1 to
perform an initial propagation; if <code class="code">nb_wakings</code> is greater than 1,
default value is <code class="code">fun () -> ()</code>, i.e. it does nothing. Hence, an
<code class="code">init</code> argument must be provided if this is not the desired
behaviour., <code class="code">check</code> must be specified if the constraint is to be reifiable
(as well as the <code class="code">not</code> function). When the constraint is reified,
<code class="code">check ()</code> is called to verify whether the constraint is satisfied
or violated, i.e. the constraint itself or its negation is entailed
by the constraint store. It should return <code class="code">true</code> if the constraint
is satisfied, <code class="code">false</code> if it is violated and raise <code class="code">DontKnow</code> when
it is not known. <code class="code">check</code> <b>must not</b> change the domains of the
variables involved in the constraint.
Default: <code class="code">Failure</code> exception is raised., <code class="code">not</code> must be specified if the constraint is reifiable (as well
as <code class="code">check</code>). <code class="code">not ()</code> should return a constraint which is the
negation of the constraint being defined. When the constraint is
reified, it is called to post the negation of the constraint whenever
<code class="code">check ()</code> return <code class="code">false</code>, i.e. the negation is entailed by the
constraint store. Default: <code class="code">Failure</code> exception is raised., <code class="code">update</code> is a mandatory argument which propagates the constraint,
i.e. filters domains and checks consistency. This function takes an
integer as its unique parameter, according to the optional
<code class="code">waking_id</code> argument given to the <code class="code">Var.delay</code> calls featured in the
constraint own <code class="code">delay</code> function (see below). When a waking event
occurs, this function is called with the corresponding integer
"<code class="code">waking_id</code>", and must return <code class="code">true</code> when the constraint is
(partially) satisfied <em>for this event</em>, <code class="code">false</code> if further
propagations have to be performed, and raise <code class="code">Stak.Fail</code>
whenever an inconsistency is detected. The whole
constraint is solved when <code class="code">update 0</code>, ..., <code class="code">update (nb_wakings-1)</code>
have all returned <code class="code">true</code>. E.g. a global constraint on an array
of variables can be aware of which variable has triggered the
awakening by providing the integer index of the variable as its
"<code class="code">waking_id</code>" to the <code class="code">Var.delay</code> function. <code class="code">update</code> is called with
<code class="code">0</code> by default when the <code class="code">nb_wakings</code> argument has been omitted; in
this case, the constraint is solved as soon as <code class="code">update</code> returns <code class="code">true</code>., <code class="code">delay</code> schedules the awakening of the constraint <code class="code">ct</code> (which is
taken as its unique argument), i.e. the execution of its <code class="code">update</code>
function. If <code class="code">update id</code> should be called (because it may propagates)
when one of the events contained in the events
list <code class="code">es</code> occurred
on variable <code class="code">v</code>, then <code class="code">Var.delay es v ~waking_id:id ct</code> should be called
within the body of the <code class="code">delay</code> function. Beware that
<b>all the "<code class="code">waking_id</code>s" must be contiguous integers ranging from</b>
<code class="code">0</code> <b>to</b> <code class="code">nb_wakings-1</code>, otherwise the behaviour is unspecified.
<code class="code">delay</code> is a mandatory argument.
</div>
</td></tr>
<tr><td><a href="Data.Hashtbl.html#VALcreate">create</a> [<a href="Data.Hashtbl.html">Data.Hashtbl</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALcreate">create</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">create l</code> builds a new domain containing the values of <code class="code">l</code>.
</div>
</td></tr>
<tr><td><a href="Goals.html#VALcreate_rec">create_rec</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">create_rec ~name:"create_rec" f</code> returns a goal calling <code class="code">f</code>.
</div>
</td></tr>
<tr><td><a href="Interval.html#VALcstr">cstr</a> [<a href="Interval.html">Interval</a>]</td>
<td><div class="info">
<code class="code">cstr v inf sup b</code> returns a constraint ensuring that the boolean
variable <code class="code">b</code> is instantiated to <code class="code">1</code> if <code class="code">v</code> is in <code class="code">inf..sup</code> and to
<code class="code">0</code> otherwise.
</div>
</td></tr>
<tr><td><a href="Sorting.html#VALcstr">cstr</a> [<a href="Sorting.html">Sorting</a>]</td>
<td><div class="info">
<code class="code">cstr a (?perm:None) sorted</code> returns the constraint ensuring that
<code class="code">sorted</code> is the result of sorting array <code class="code">a</code> according to the
permutation <code class="code">perm</code>.
</div>
</td></tr>
<tr><td><a href="Alldiff.html#VALcstr">cstr</a> [<a href="Alldiff.html">Alldiff</a>]</td>
<td><div class="info">
<code class="code">alldiff (?algo:Lazy) vars</code> States that the variables of <code class="code">vars</code>
are different from each other.
</div>
</td></tr>
<tr><td><a href="Gcc.html#VALcstr">cstr</a> [<a href="Gcc.html">Gcc</a>]</td>
<td><div class="info">
<code class="code">cstr (?level:High) vars distribution</code> returns a constraint ensuring
that for each pair <code class="code">(c,v)</code> of cardinal variable <code class="code">c</code> and integer
value <code class="code">v</code> in the list <code class="code">distribution</code>, <code class="code">c</code> variables in the array
<code class="code">vars</code> will be instantiated to <code class="code">v</code>, i.e.
</div>
</td></tr>
<tr><td><a href="Reify.html#VALcstr">cstr</a> [<a href="Reify.html">Reify</a>]</td>
<td><div class="info">
<code class="code">cstr ~delay_on_negation:true c b</code> is equivalent to the
constraint <code class="code">boolean ?delay_on_negation c =~ b</code>.
</div>
</td></tr>
<tr><td><a href="Stak.html#VALcut">cut</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
<code class="code">cut l</code> cuts the choice points left on the stack until level <code class="code">l</code>.
</div>
</td></tr>
<tr><td align="left"><br>D</td></tr>
<tr><td><a href="Var.BASICFD.html#VALdelay">delay</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">delay event_list v ~waking_id:id c</code> suspends constraint <code class="code">c</code> on all
the events in <code class="code">event_list</code> occurring on <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Stak.html#VALdepth">depth</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
Depth of the stack, i.e.
</div>
</td></tr>
<tr><td><a href="Goals.html#VALdichotomic">dichotomic</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
Non-deterministic instantiation of a variable, by dichotomic recursive
exploration of its domain.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALdiff">diff</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALdiff">diff</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">diff d1 d2</code> returns <code class="code">d1</code> <code class="code">d2</code>, i.e.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALdifference">difference</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">difference big small</code> returns <code class="code">big</code> <code class="code">small</code>.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALdisjoint">disjoint</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><div class="info">
<code class="code">disjoint v1 v2</code> defined by <code class="code">all_disjoint [|v1; v2|]</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALdisjoint">disjoint</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">disjoint d1 d2</code> tests whether <code class="code">d1</code> and <code class="code">d2</code> are disjoint.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALdom">dom</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
<code class="code">dom a</code> returns the integer domain of an attribute.
</div>
</td></tr>
<tr><td align="left"><br>E</td></tr>
<tr><td><a href="Arith.html#VALe2fd">e2fd</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">e2fd e</code> creates and returns a new variable <code class="code">v</code> and posts the constraint
<code class="code">fd2e v =~ e</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALelements">elements</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Var.BASICFD.html#VALelt">elt</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">int n</code> returns a new variable instantiated to integer value <code class="code">n</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.html#VALelt_of_list">elt_of_list</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td><div class="info">
Creates a set from a list of integers.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALelt_value">elt_value</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">int_value v</code> returns the value of <code class="code">v</code> if it is instantiated and raises
a <code class="code">Failure</code> exception otherwise.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALempty">empty</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALempty">empty</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
The empty domain.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALequal">equal</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
Tests if two variables are equal with respect to <code class="code">compare</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALequal">equal</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VALeval">eval</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">eval e</code> returns the integer numerical value of a fully instantiated
expression <code class="code">e</code>.
</div>
</td></tr>
<tr><td><a href="Goals.List.html#VALexists">exists</a> [<a href="Goals.List.html">Goals.List</a>]</td>
<td><div class="info">
<code class="code">exists ?select g [x1;x2;...;xn]</code> is <code class="code">g x1 ||~ g x2 ||~ ... ||~ g xn</code>,
i.e.
</div>
</td></tr>
<tr><td><a href="Goals.Array.html#VALexists">exists</a> [<a href="Goals.Array.html">Goals.Array</a>]</td>
<td><div class="info">
<code class="code">exists ?select g a</code> defined by <code class="code">existsi ?select (fun _i x -> g x) a</code>,
i.e.
</div>
</td></tr>
<tr><td><a href="Goals.Array.html#VALexistsi">existsi</a> [<a href="Goals.Array.html">Goals.Array</a>]</td>
<td><div class="info">
<code class="code">existsi ?select g a</code> returns the disjunctive iteration
of the application of goal <code class="code">g</code> on the elements of array <code class="code">a</code>
and on their indices.
</div>
</td></tr>
<tr><td align="left"><br>F</td></tr>
<tr><td><a href="Goals.html#VALfail">fail</a> [<a href="Goals.html">Goals</a>]</td>
<td></td></tr>
<tr><td><a href="Stak.html#VALfail">fail</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
<code class="code">fail x</code> equivalent to <code class="code">raise (Fail x)</code>.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALfd2e">fd2e</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">fd2e v</code> returns an expression which evaluates to <code class="code">n</code> if the
variable <code class="code">v</code> is instantiated to <code class="code">n</code>.
</div>
</td></tr>
<tr><td><a href="Data.Hashtbl.html#VALfind">find</a> [<a href="Data.Hashtbl.html">Data.Hashtbl</a>]</td>
<td></td></tr>
<tr><td><a href="Data.Hashtbl.html#VALfold">fold</a> [<a href="Data.Hashtbl.html">Data.Hashtbl</a>]</td>
<td></td></tr>
<tr><td><a href="Goals.List.html#VALforall">forall</a> [<a href="Goals.List.html">Goals.List</a>]</td>
<td><div class="info">
<code class="code">forall ?select g [x1;x2;...;xn]</code> is <code class="code">g x1 &&~ g x2 &&~ ... &&~ g xn</code>,
i.e.
</div>
</td></tr>
<tr><td><a href="Goals.Array.html#VALforall">forall</a> [<a href="Goals.Array.html">Goals.Array</a>]</td>
<td><div class="info">
<code class="code">forall ?select g a</code> defined by <code class="code">foralli ?select (fun _i x -> g x) a</code>,
i.e.
</div>
</td></tr>
<tr><td><a href="Goals.Array.html#VALforalli">foralli</a> [<a href="Goals.Array.html">Goals.Array</a>]</td>
<td><div class="info">
<code class="code">foralli ?select g a</code> returns the conjunctive iteration
of the application of goal <code class="code">g</code> on the elements of array <code class="code">a</code>
and on their indices.
</div>
</td></tr>
<tr><td><a href="Goals.html#VALfordownto">fordownto</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">forto min max g</code> (resp.
</div>
</td></tr>
<tr><td><a href="Goals.html#VALforto">forto</a> [<a href="Goals.html">Goals</a>]</td>
<td></td></tr>
<tr><td><a href="Goals.html#VALfprint">fprint</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">fprint chan g</code> prints the name of goal <code class="code">g</code> on channel <code class="code">chan</code>.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALfprint">fprint</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">fprint chan e</code> prints expression <code class="code">e</code> on channel <code class="code">chan</code>.
</div>
</td></tr>
<tr><td><a href="Invariant.html#VALfprint">fprint</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">fprint c ~printer:(fun _ _ -> ()) r</code> prints BIR <code class="code">r</code> on channel <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALfprint">fprint</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">fprint chan v</code> prints variable <code class="code">v</code> on channel <code class="code">chan</code>.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALfprint">fprint</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
<code class="code">fprint chan a</code> prints attribute <code class="code">a</code> on channel <code class="code">chan</code>.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALfprint">fprint</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
<code class="code">fprint chan c</code> prints the constraint <code class="code">c</code> on channel <code class="code">chan</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.html#VALfprint">fprint</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td><div class="info">
Pretty printing of elements and domains.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALfprint">fprint</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
Pretty printing of elements and domains.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALfprint_array">fprint_array</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">fprint_array chan vs</code> prints array of variables <code class="code">vs</code> on channel <code class="code">chan</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.html#VALfprint_elt">fprint_elt</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALfprint_elt">fprint_elt</a> [<a href="Domain.html">Domain</a>]</td>
<td></td></tr>
<tr><td align="left"><br>G</td></tr>
<tr><td><a href="FdArray.html#VALget">get</a> [<a href="FdArray.html">FdArray</a>]</td>
<td><div class="info">
<code class="code">get vars index</code> returns a variable constrained to be equal to
<code class="code">vars.(index)</code>.
</div>
</td></tr>
<tr><td><a href="Invariant.Array.html#VALget">get</a> [<a href="Invariant.Array.html">Invariant.Array</a>]</td>
<td><div class="info">
<code class="code">get a i</code> returns the BIR element number <code class="code">i</code> of array <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="Invariant.html#VALget">get</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
Access to the content of a BIR.
</div>
</td></tr>
<tr><td><a href="Data.Hashtbl.html#VALget">get</a> [<a href="Data.Hashtbl.html">Data.Hashtbl</a>]</td>
<td></td></tr>
<tr><td><a href="Stak.html#VALget">get</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
Dereference.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALget_boolsum_threshold">get_boolsum_threshold</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
Returns the minimum size for boolean sums optimization.
</div>
</td></tr>
<tr><td><a href="FdArray.html#VALget_cstr">get_cstr</a> [<a href="FdArray.html">FdArray</a>]</td>
<td><div class="info">
<code class="code">get_cstr vars index v</code> returns the constraint
<code class="code">fd2e vars.(index) =~ fd2e v</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALgreatest_leq">greatest_leq</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">smallest_geq dom val</code> (resp.
</div>
</td></tr>
<tr><td align="left"><br>I</td></tr>
<tr><td><a href="Arith.html#VALi2e">i2e</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">i2e n</code> returns an expression which evaluates to <code class="code">n</code>.
</div>
</td></tr>
<tr><td><a href="Invariant.html#VALid">id</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">id r</code> returns a unique integer associated to BIR <code class="code">r</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALid">id</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">id v</code> returns a unique integer identifying the attribute associated
with <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALid">id</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
<code class="code">id a</code> returns a unique integer identifying the attribute <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALid">id</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
<code class="code">id c</code> returns a unique integer identifying the constraint <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALimmediate">immediate</a> [<a href="Cstr.html">Cstr</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.html#VALincluded">included</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td><div class="info">
<code class="code">included d1 d2</code> tests whether the domain <code class="code">d1</code> is included in <code class="code">d2</code>,
i.e.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALincluded">included</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">included d1 d2</code> tests whether domain <code class="code">d1</code> is included in domain <code class="code">d2</code>.
</div>
</td></tr>
<tr><td><a href="Goals.Conjunto.html#VALindomain">indomain</a> [<a href="Goals.Conjunto.html">Goals.Conjunto</a>]</td>
<td><div class="info">
Non-deterministic instantiation of set variables (<code class="code">refine</code> of Gervet's
Conjunto).
</div>
</td></tr>
<tr><td><a href="Goals.html#VALindomain">indomain</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
Non-deterministic instantiation of a variable, by labeling its domain
(in increasing order).
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALinf_min">inf_min</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><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>.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALinside">inside</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td></td></tr>
<tr><td><a href="Goals.html#VALinstantiate">instantiate</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">instantiate choose var</code> Non-deterministic instantiation of a variable,
by labeling its domain using the value returned by the <code class="code">choose</code> function.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALint">int</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
The largest representable domain.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALint_value">int_value</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td></td></tr>
<tr><td><a href="Conjunto.html#VALinter">inter</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><div class="info">
Operations on sets.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALinter">inter</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALintersection">intersection</a> [<a href="Domain.html">Domain</a>]</td>
<td></td></tr>
<tr><td><a href="Var.BASICFD.html#VALinterval">interval</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">interval ?name inf sup</code> returns a new variable with domain <code class="code">[inf..sup]</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.html#VALinterval">interval</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td><div class="info">
<code class="code">interval glb lub</code> builds the domain of sets greater than <code class="code">glb</code> and
smaller than <code class="code">lub</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALinterval">interval</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">interval inf sup</code> returns the domain of all integers in the closed
interval <code class="code">[inf..sup]</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALinterval_iter">interval_iter</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">interval_iter f d</code> successively applies function <code class="code">f</code> to the bounds
of all the disjoint intervals of <code class="code">d</code> in increasing order.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALis_bound">is_bound</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">is_bound v</code> returns <code class="code">true</code> if <code class="code">v</code> is instantiated and <code class="code">false</code>
otherwise.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALis_empty">is_empty</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALis_empty">is_empty</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">is_empty d</code> tests whether the domain <code class="code">d</code> is empty or not.
</div>
</td></tr>
<tr><td><a href="Interval.html#VALis_member">is_member</a> [<a href="Interval.html">Interval</a>]</td>
<td><div class="info">
<code class="code">is_member v inf sup</code> returns a boolean variable which will
be instantiated to <code class="code">1</code> if <code class="code">v</code> is in <code class="code">inf..sup</code> and to <code class="code">0</code> otherwise.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALis_solved">is_solved</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
<code class="code">is_solved c</code> returns <code class="code">true</code> if <code class="code">c</code> is satisfied and <code class="code">false</code> otherwise.
</div>
</td></tr>
<tr><td><a href="Invariant.FD.html#VALis_var">is_var</a> [<a href="Invariant.FD.html">Invariant.FD</a>]</td>
<td><div class="info">
BIR variants of <code class="code">Fd.Var</code> access functions.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALis_var">is_var</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">is_var v</code> returns <code class="code">true</code> if <code class="code">v</code> is not instantiated and <code class="code">false</code>
otherwise.
</div>
</td></tr>
<tr><td><a href="Var.FD.html#VALiter">iter</a> [<a href="Var.FD.html">Var.FD</a>]</td>
<td><div class="info">
<code class="code">iter f v</code> iterates f on each integer in the domain of <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Data.Hashtbl.html#VALiter">iter</a> [<a href="Data.Hashtbl.html">Data.Hashtbl</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.S.html#VALiter">iter</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.html#VALiter">iter</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td><div class="info">
Iteration on values of the domain.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALiter">iter</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">iter f d</code> successively applies function <code class="code">f</code> to all element of <code class="code">d</code> in
increasing order.
</div>
</td></tr>
<tr><td align="left"><br>L</td></tr>
<tr><td><a href="Goals.List.html#VALlabeling">labeling</a> [<a href="Goals.List.html">Goals.List</a>]</td>
<td><div class="info">
Standard labeling, i.e.
</div>
</td></tr>
<tr><td><a href="Goals.Array.html#VALlabeling">labeling</a> [<a href="Goals.Array.html">Goals.Array</a>]</td>
<td><div class="info">
Standard labeling, i.e.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALlargest_hole_around">largest_hole_around</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">largest_hole_around dom val</code> returns the largest hole (interval)
in <code class="code">dom</code> centred around <code class="code">val</code>.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALlater">later</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
Available priorities: immediate: as soon as possible, for quick updates;, normal: standard priority;, later: for time consuming constraints (e.g. <code class="code">Gcc.cstr</code>, <code class="code">Alldiff.cstr</code>...).
</div>
</td></tr>
<tr><td><a href="Goals.html#VALlds">lds</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">lds ~step:1 g</code> returns a goal which will iteratively search <code class="code">g</code> with
increasing limited discrepancy (see ) by
increment <code class="code">step</code>.
</div>
</td></tr>
<tr><td><a href="Stak.html#VALlevel">level</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
Returns the current level.
</div>
</td></tr>
<tr><td><a href="Stak.html#VALlevels">levels</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
Returns the current active levels.
</div>
</td></tr>
<tr><td align="left"><br>M</td></tr>
<tr><td><a href="FdArray.html#VALmax">max</a> [<a href="FdArray.html">FdArray</a>]</td>
<td><div class="info">
<code class="code">min vars</code> (resp.
</div>
</td></tr>
<tr><td><a href="Invariant.FD.html#VALmax">max</a> [<a href="Invariant.FD.html">Invariant.FD</a>]</td>
<td></td></tr>
<tr><td><a href="Var.BASICFD.html#VALmax">max</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">max v</code> returns the upper bound of <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALmax">max</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
<code class="code">min a</code> (resp.
</div>
</td></tr>
<tr><td><a href="SetDomain.html#VALmax">max</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALmax">max</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">min d</code> (resp.
</div>
</td></tr>
<tr><td><a href="FdArray.html#VALmax_cstr">max_cstr</a> [<a href="FdArray.html">FdArray</a>]</td>
<td><div class="info">
<code class="code">min_cstr vars mini</code> (resp.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALmax_elt">max_elt</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VALmax_of_expr">max_of_expr</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">min_of_expr e</code> (resp.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALmem">mem</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><div class="info">
<code class="code">mem x v</code> states that <code class="code">x</code> belongs to <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Data.Hashtbl.html#VALmem">mem</a> [<a href="Data.Hashtbl.html">Data.Hashtbl</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.S.html#VALmem">mem</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.html#VALmem">mem</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td><div class="info">
<code class="code">mem x d</code> tests whether <code class="code">x</code> belongs to the domain <code class="code">d</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALmem">mem</a> [<a href="Domain.html">Domain</a>]</td>
<td></td></tr>
<tr><td><a href="Goals.List.html#VALmember">member</a> [<a href="Goals.List.html">Goals.List</a>]</td>
<td><div class="info">
<code class="code">member v l</code> returns the disjunctive iteration of the instantiation of
the variable <code class="code">v</code> to the values in the integer list <code class="code">l</code>.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALmember">member</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><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>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALmember">member</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">member v n</code> returns <code class="code">true</code> if <code class="code">n</code> belongs to the domain of <code class="code">v</code> and
<code class="code">false</code> otherwise.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALmember">member</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
<code class="code">member a n</code> tests if <code class="code">n</code> belongs to <code class="code">dom a</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALmember">member</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">member n d</code> tests if <code class="code">n</code> belongs to <code class="code">d</code>.
</div>
</td></tr>
<tr><td><a href="FdArray.html#VALmin">min</a> [<a href="FdArray.html">FdArray</a>]</td>
<td></td></tr>
<tr><td><a href="Invariant.FD.html#VALmin">min</a> [<a href="Invariant.FD.html">Invariant.FD</a>]</td>
<td></td></tr>
<tr><td><a href="Invariant.Array.html#VALmin">min</a> [<a href="Invariant.Array.html">Invariant.Array</a>]</td>
<td><div class="info">
<code class="code">min a c</code> returns the minimum BIR value of <code class="code">a</code> for criterion <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALmin">min</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">min v</code> returns the lower bound of <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALmin">min</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.html#VALmin">min</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALmin">min</a> [<a href="Domain.html">Domain</a>]</td>
<td></td></tr>
<tr><td><a href="FdArray.html#VALmin_cstr">min_cstr</a> [<a href="FdArray.html">FdArray</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.S.html#VALmin_elt">min_elt</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Var.BASICFD.html#VALmin_max">min_max</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">min_max v</code> returns both the lower and upper bounds of <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.html#VALmin_max">min_max</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td><div class="info">
Access to glb and lub.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALmin_max">min_max</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">min_max d</code> returns both the lower and upper bound of <code class="code">d</code>.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALmin_max_of_expr">min_max_of_expr</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">min_max_of_expr e</code> is equivalent to <code class="code">(min_of_expr e, max_of_expr e)</code>.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALmin_of_expr">min_of_expr</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Goals.html#VALminimize">minimize</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">minimize ~step:1 ~mode:Continue goal cost solution</code> runs a Branch
and Bound algorithm on <code class="code">goal</code> for bound <code class="code">cost</code>, with an improvement
of at least <code class="code">step</code> between each solution found.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALminus">minus</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">minus d</code> returns the domain of opposite values of <code class="code">d</code>.
</div>
</td></tr>
<tr><td align="left"><br>N</td></tr>
<tr><td><a href="Goals.html#VALname">name</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">name g</code> returns the name of the goal <code class="code">g</code>.
</div>
</td></tr>
<tr><td><a href="Invariant.html#VALname">name</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">name r</code> returns the name (specified or generated) of BIR <code class="code">r</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALname">name</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">name v</code> returns the name of variable <code class="code">v</code> (the empty string if
it was not provided while created).
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALname">name</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
<code class="code">name c</code> returns the name of the constraint <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="Stak.html#VALnb_choice_points">nb_choice_points</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
Access to a global counter incremented at each choice point.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALnormal">normal</a> [<a href="Cstr.html">Cstr</a>]</td>
<td></td></tr>
<tr><td><a href="Reify.html#VALnot">not</a> [<a href="Reify.html">Reify</a>]</td>
<td><div class="info">
Logical reification operators on constraints, namely
and, or, implies, equivalent, exclusive or, not.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALnot">not</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
<code class="code">not c</code> returns the negation of <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="Goals.Array.html#VALnot_instantiated_fd">not_instantiated_fd</a> [<a href="Goals.Array.html">Goals.Array</a>]</td>
<td><div class="info">
<code class="code">not_instantiated_fd fds</code> returns the index of one element in <code class="code">fds</code>
which is not instantiated.
</div>
</td></tr>
<tr><td align="left"><br>O</td></tr>
<tr><td><a href="Stak.html#VALolder">older</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
<code class="code">older l1 l2</code> true if level <code class="code">l1</code> precedes <code class="code">l2</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALon_max">on_max</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
Event occuring when the lower (resp.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALon_max">on_max</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
Event occuring when the lower (resp.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALon_min">on_min</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td></td></tr>
<tr><td><a href="Var.ATTR.html#VALon_min">on_min</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td></td></tr>
<tr><td><a href="Var.BASICFD.html#VALon_refine">on_refine</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
Event occuring when a variable is changed, i.e.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALon_refine">on_refine</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
Event occuring when a variable is changed, i.e.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALon_subst">on_subst</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
Event occuring when a variable is instantiated.
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALon_subst">on_subst</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
Event occuring when a variable is instantiated.
</div>
</td></tr>
<tr><td><a href="Goals.html#VALonce">once</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">once g</code> cuts choice points left on goal <code class="code">g</code>.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALone">one</a> [<a href="Cstr.html">Cstr</a>]</td>
<td></td></tr>
<tr><td><a href="Conjunto.html#VALorder">order</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><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> .
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALorder_with_card">order_with_card</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><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.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALoutside">outside</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><div class="info">
Basic refinements for labeling.
</div>
</td></tr>
<tr><td align="left"><br>P</td></tr>
<tr><td><a href="Domain.html#VALplus">plus</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">plus d n</code> translates a domain by <code class="code">n</code>.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALpost">post</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
<code class="code">post c</code> posts the constraint <code class="code">c</code> to the constraint store.
</div>
</td></tr>
<tr><td><a href="Cstr.html#VALpriority">priority</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
<code class="code">priority c</code> returns the priority of the constraint <code class="code">c</code>.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALprod">prod</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Invariant.html#VALprod">prod</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">sum a</code> returns a BIR equal to the product of elements of <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALprod_fd">prod_fd</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">prod exps</code> (resp.
</div>
</td></tr>
<tr><td align="left"><br>R</td></tr>
<tr><td><a href="Stak.html#VALref">ref</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
Returns a reference whose modifications will be trailed during the
solving of a goal.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALrefine">refine</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">refine v d</code> reduces the domain of <code class="code">v</code> with domain <code class="code">d</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALrefine_low">refine_low</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">refine_low v inf</code> reduces the domain of <code class="code">v</code> by cutting all values
strictly less than <code class="code">inf</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALrefine_low_up">refine_low_up</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">refine_low_up v inf sup</code> reduces the domain of <code class="code">v</code> by cutting all values
strictly less than <code class="code">inf</code> and greater than <code class="code">sup</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALrefine_up">refine_up</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">refine_up v sup</code> reduces the domain of <code class="code">v</code> by cutting all values
strictly greater than <code class="code">sup</code>.
</div>
</td></tr>
<tr><td><a href="Var.FD.html#VALremove">remove</a> [<a href="Var.FD.html">Var.FD</a>]</td>
<td><div class="info">
<code class="code">remove v a</code> removes <code class="code">a</code> from the domain of <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Data.Hashtbl.html#VALremove">remove</a> [<a href="Data.Hashtbl.html">Data.Hashtbl</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.S.html#VALremove">remove</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALremove">remove</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">remove n d</code> returns <code class="code">d</code> <code class="code">{n}</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALremove_closed_inter">remove_closed_inter</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">remove_closed_inter inf sup d</code> returns
<code class="code">d</code> <code class="code">[inf..sup]</code>, i.e.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALremove_low">remove_low</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALremove_low">remove_low</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">remove_up n d</code> (resp.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALremove_low_up">remove_low_up</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">remove_low_up low up d</code> is a shortcut for
<code class="code">remove_up up (remove_low low d)</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALremove_max">remove_max</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">remove_min d</code> (resp.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALremove_min">remove_min</a> [<a href="Domain.html">Domain</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.S.html#VALremove_up">remove_up</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALremove_up">remove_up</a> [<a href="Domain.html">Domain</a>]</td>
<td></td></tr>
<tr><td><a href="Data.Hashtbl.html#VALreplace">replace</a> [<a href="Data.Hashtbl.html">Data.Hashtbl</a>]</td>
<td></td></tr>
<tr><td align="left"><br>S</td></tr>
<tr><td><a href="Arith.html#VALscalprod">scalprod</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Arith.html#VALscalprod_fd">scalprod_fd</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">scalprod coeffs exps</code> (resp.
</div>
</td></tr>
<tr><td><a href="Invariant.html#VALset">set</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
Assignment of a setable BIR.
</div>
</td></tr>
<tr><td><a href="Data.Array.html#VALset">set</a> [<a href="Data.Array.html">Data.Array</a>]</td>
<td><div class="info">
<code class="code">set t i x</code> Bactrackable assignment of <code class="code">t.(i)</code> with <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="Stak.html#VALset">set</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
Sets a backtrackable reference.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALset_boolsum_threshold">set_boolsum_threshold</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
Set the minimum size for boolean sums optimization.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALshift">shift</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">shift x d</code> returns a finite domain variable constrained to be
equal to <code class="code">x+d</code>.
</div>
</td></tr>
<tr><td><a href="Goals.html#VALsigma">sigma</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">sigma ~domain:Domain.int fgoal</code> creates the goal <code class="code">(fgoal v)</code>
where <code class="code">v</code> is a new
variable of domain <code class="code">domain</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALsingleton">singleton</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Invariant.FD.html#VALsize">size</a> [<a href="Invariant.FD.html">Invariant.FD</a>]</td>
<td></td></tr>
<tr><td><a href="Var.BASICFD.html#VALsize">size</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">size v</code> returns the number of integer values in the domain of <code class="code">v</code>
(<code class="code">1</code> if <code class="code">v</code> is instantiated).
</div>
</td></tr>
<tr><td><a href="Var.ATTR.html#VALsize">size</a> [<a href="Var.ATTR.html">Var.ATTR</a>]</td>
<td><div class="info">
<code class="code">size a</code> returns the number of integer values in the domain of <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="Stak.html#VALsize">size</a> [<a href="Stak.html">Stak</a>]</td>
<td><div class="info">
Size of the stack, i.e.
</div>
</td></tr>
<tr><td><a href="SetDomain.html#VALsize">size</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td><div class="info">
<code class="code">size d</code> returns |glb(d)|-|lub(d)|+1, i.e.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALsize">size</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">size d</code> returns the number of integers in <code class="code">d</code>.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALsmallest">smallest</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><div class="info">
<code class="code">smallest v</code> returns the smallest element (an integer variable) of <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALsmallest_geq">smallest_geq</a> [<a href="Domain.html">Domain</a>]</td>
<td></td></tr>
<tr><td><a href="Goals.html#VALsolve">solve</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">solve ~control:(fun _ -> ()) g</code> solves the goal <code class="code">g</code> and returns
a success (<code class="code">true</code>) or a
failure (<code class="code">false</code>).
</div>
</td></tr>
<tr><td><a href="Sorting.html#VALsort">sort</a> [<a href="Sorting.html">Sorting</a>]</td>
<td><div class="info">
<code class="code">sort a</code> returns an array of variables constrained to be the variables
in <code class="code">a</code> sorted in increasing order.
</div>
</td></tr>
<tr><td><a href="Sorting.html#VALsortp">sortp</a> [<a href="Sorting.html">Sorting</a>]</td>
<td><div class="info">
<code class="code">sortp a</code> same as <code class="code">sort</code> but returns a couple <code class="code">(sorted, perm)</code>
where <code class="code">sorted</code> is the array of sorted variables and <code class="code">perm</code> is an
array of variables constrained to be the permutation between <code class="code">a</code> and
<code class="code">sorted</code>, i.e.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALsprint">sprint</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">sprint d</code> returns a string representation of <code class="code">d</code>.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALsubset">subset</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><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>.
</div>
</td></tr>
<tr><td><a href="SetDomain.S.html#VALsubset">subset</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Goals.html#VALsuccess">success</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
Failure (resp.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALsum">sum</a> [<a href="Arith.html">Arith</a>]</td>
<td></td></tr>
<tr><td><a href="Invariant.html#VALsum">sum</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">sum a</code> returns a BIR equal to the sum of elements of <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="Arith.html#VALsum_fd">sum_fd</a> [<a href="Arith.html">Arith</a>]</td>
<td><div class="info">
<code class="code">sum exps</code> (resp.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALsum_weight">sum_weight</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td><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>.
</div>
</td></tr>
<tr><td align="left"><br>T</td></tr>
<tr><td><a href="Invariant.html#VALternary">ternary</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">ternary ~name:"Invariant.ternary" f</code> wraps the ternary function <code class="code">f</code>
into an operator on BIRs.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALtimes">times</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">times d k</code> expands a domain by factor <code class="code">k</code>.
</div>
</td></tr>
<tr><td align="left"><br>U</td></tr>
<tr><td><a href="Invariant.FD.html#VALunary">unary</a> [<a href="Invariant.FD.html">Invariant.FD</a>]</td>
<td><div class="info">
<code class="code">unary ~name:"Invariant.XxxFd.unary" f v</code> Wrapper of any access
function over <code class="code">fd</code> type.
</div>
</td></tr>
<tr><td><a href="Invariant.html#VALunary">unary</a> [<a href="Invariant.html">Invariant</a>]</td>
<td><div class="info">
<code class="code">unary ~name:"Invariant.unary" f</code> wraps the unary function <code class="code">f</code> into
an operator on BIRs.
</div>
</td></tr>
<tr><td><a href="Goals.html#VALunify">unify</a> [<a href="Goals.html">Goals</a>]</td>
<td><div class="info">
<code class="code">unify var x</code> instantiates variable <code class="code">var</code> to <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="Var.BASICFD.html#VALunify">unify</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">unify v n</code> instantiates variable <code class="code">v</code> with integer value <code class="code">n</code>.
</div>
</td></tr>
<tr><td><a href="Conjunto.html#VALunion">union</a> [<a href="Conjunto.html">Conjunto</a>]</td>
<td></td></tr>
<tr><td><a href="SetDomain.S.html#VALunion">union</a> [<a href="SetDomain.S.html">SetDomain.S</a>]</td>
<td></td></tr>
<tr><td><a href="Domain.html#VALunion">union</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
Intersection (resp.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALunsafe_create">unsafe_create</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">unsafe_create l</code> builds a new domain containing the values of <code class="code">l</code>.
</div>
</td></tr>
<tr><td align="left"><br>V</td></tr>
<tr><td><a href="Var.BASICFD.html#VALvalue">value</a> [<a href="Var.BASICFD.html">Var.BASICFD</a>]</td>
<td><div class="info">
<code class="code">value v</code> returns <code class="code">Val n</code> if <code class="code">v</code> is instantiated to <code class="code">n</code>, <code class="code">Unk a</code> otherwise
where <code class="code">a</code> is the attribute of <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Var.FD.html#VALvalues">values</a> [<a href="Var.FD.html">Var.FD</a>]</td>
<td><div class="info">
<code class="code">values v</code> returns the list of all integers in the domain of <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="SetDomain.html#VALvalues">values</a> [<a href="SetDomain.html">SetDomain</a>]</td>
<td><div class="info">
Returns values of a domain.
</div>
</td></tr>
<tr><td><a href="Domain.html#VALvalues">values</a> [<a href="Domain.html">Domain</a>]</td>
<td><div class="info">
<code class="code">value d</code> returns the list of values of the domain <code class="code">d</code>
</div>
</td></tr>
<tr><td align="left"><br>X</td></tr>
<tr><td><a href="Reify.html#VALxor">xor</a> [<a href="Reify.html">Reify</a>]</td>
<td></td></tr>
<tr><td align="left"><br>Z</td></tr>
<tr><td><a href="Cstr.html#VALzero">zero</a> [<a href="Cstr.html">Cstr</a>]</td>
<td><div class="info">
The constraint which succeeds (resp.
</div>
</td></tr>
</table><br>
</body>
</html>
