43 using namespace Float;
47 for (
int i =
x.size();
i--; ) {
56 using namespace Float;
60 for (
int i =
x.size();
i--; ) {
70 using namespace Float;
71 if (
a.size() !=
x.size())
76 for (
int i =
x.size();
i--; ) {
86 using namespace Float;
87 if (
a.size() !=
x.size())
92 for (
int i =
x.size();
i--; ) {
101 using namespace Float;
105 for (
int i =
x.size();
i--; ) {
123 if (home.
failed())
return;
124 t[
x.size()].a=-1.0;
t[
x.size()].x=
y;
131 using namespace Float;
135 for (
int i =
x.size();
i--; ) {
138 t[
x.size()].a=-1;
t[
x.size()].x=
y;
146 using namespace Float;
147 if (
a.size() !=
x.size())
152 for (
int i =
x.size();
i--; ) {
170 if (home.
failed())
return;
171 t[
x.size()].a=-1.0;
t[
x.size()].x=
y;
179 using namespace Float;
180 if (
a.size() !=
x.size())
185 for (
int i =
x.size();
i--; ) {
188 t[
x.size()].a=-1.0;
t[
x.size()].x=
y;
Node * x
Pointer to corresponding Boolean expression node.
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
Home class for posting propagators
bool failed(void) const
Check whether corresponding space is failed.
Exception: Arguments are of different size
Class for describing linear term .
T * alloc(long unsigned int n)
Allocate block of n objects of type T from region.
Reification specification.
Post propagator for SetVar SetOpType SetVar y
void post(Home home, Term *t, int n, FloatRelType frt, FloatVal c)
Post propagator for linear constraint over floats.
#define GECODE_POST
Check for failure in a constraint post function.
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
void linear(Home home, const FloatValArgs &a, const FloatVarArgs &x, FloatRelType frt, FloatVar y, Reify r)
Post propagator for .
double FloatNum
Floating point number base type.
FloatRelType
Relation types for floats.
@ FRT_LQ
Less or equal ( )
@ FRT_GQ
Greater or equal ( )
const FloatNum max
Largest allowed float value.
const FloatNum min
Smallest allowed float value.
void estimate(Term *t, int n, FloatVal c, FloatNum &l, FloatNum &u)
Estimate lower and upper bounds.
Gecode::IntArgs i({1, 2, 3, 4})