38 namespace Gecode {
namespace Int {
48 if ((x.min() > y.max()) || (x.max() < y.min()))
return RT_FALSE;
56 while (rx() && ry()) {
57 if (rx.max() < ry.
min()) {
59 }
else if (ry.
max() < rx.min()) {
78 if ((n > x.max()) || (n < x.min()))
return RT_FALSE;
86 while (n > rx.
max()) ++rx;
108 if ((x.min() > y.max()) || (x.max() < y.min()))
return RT_TRUE;
116 while (rx() && ry()) {
117 if (rx.max() < ry.
min()) {
119 }
else if (ry.
max() < rx.min()) {
138 if ((n > x.max()) || (n < x.min()))
return RT_TRUE;
146 while (n > rx.
max()) ++rx;
175 if (x.max() <= y.min())
return RT_TRUE;
176 if (x.min() > y.max())
return RT_FALSE;
191 if (x.max() < y.min())
return RT_TRUE;
192 if (x.min() >= y.max())
return RT_FALSE;
207 if (x.max() < y.min())
return RT_FALSE;
208 if (x.min() >= y.max())
return RT_TRUE;
223 if (x.max() <= y.min())
return RT_FALSE;
224 if (x.min() > y.max())
return RT_TRUE;
Relation may hold or not.
RelTest rtest_gr(View x, int n)
Test whether view x is greater than integer n.
Range iterator for integer views.
RelTest rtest_gq(View x, int n)
Test whether view x is greater or equal than integer n.
int min(void) const
Return smallest value of range.
int n
Number of negative literals for node type.
RelTest
Result of testing relation.
RelTest rtest_nq_dom(View x, View y)
Test whether views x and y are different (use full domain information)
RelTest rtest_eq_dom(View x, View y)
Test whether views x and y are equal (use full domain information)
RelTest rtest_eq_dom_check(View x, View y)
RelTest rtest_nq_bnd(View x, View y)
Test whether views x and y are different (use bounds information)
RelTest rtest_le(View x, int n)
Test whether view x is less than integer n.
Node * x
Pointer to corresponding Boolean expression node.
RelTest rtest_eq_bnd(View x, View y)
Test whether views x and y are equal (use bounds information)
int max(void) const
Return largest value of range.
Gecode toplevel namespace
RelTest rtest_nq_dom_check(View x, View y)
RelTest rtest_lq(View x, int n)
Test whether view x is less or equal than integer n.