43#ifdef GECODE_HAS_FLOAT_VARS
58 std::map<std::string,poster>::iterator i = r.find(ce.
id);
61 std::string(
"Constraint ")+ce.
id+
" not found", ce.
ann);
63 i->second(s, ce, ce.
ann);
69 r[
"gecode_" + id] = p;
82 void p_distinctOffset(FlatZincSpace& s,
const ConExpr& ce, AST::Node* ann) {
85 AST::Array* offs = ce.args->a[0]->getArray();
87 for (
int i=offs->a.size(); i--; ) {
88 oa[i] = offs->a[i]->getInt();
95 IntVarArgs va = s.arg2intvarargs(ce[0]);
101 if (ce[0]->isIntVar()) {
102 if (ce[1]->isIntVar()) {
103 rel(s, s.arg2IntVar(ce[0]), irt, s.arg2IntVar(ce[1]),
106 rel(s, s.arg2IntVar(ce[0]), irt, ce[1]->getInt(), s.ann2ipl(ann));
109 rel(s, s.arg2IntVar(ce[1]),
swap(irt), ce[0]->getInt(),
114 p_int_CMP(s,
IRT_EQ, ce, ann);
117 p_int_CMP(s,
IRT_NQ, ce, ann);
120 p_int_CMP(s,
IRT_GQ, ce, ann);
123 p_int_CMP(s,
IRT_GR, ce, ann);
126 p_int_CMP(s,
IRT_LQ, ce, ann);
129 p_int_CMP(s,
IRT_LE, ce, ann);
133 if (rm ==
RM_EQV && ce[2]->isBool()) {
134 if (ce[2]->getBool()) {
135 p_int_CMP(s, irt, ce, ann);
137 p_int_CMP(s,
neg(irt), ce, ann);
141 if (ce[0]->isIntVar()) {
142 if (ce[1]->isIntVar()) {
143 rel(s, s.arg2IntVar(ce[0]), irt, s.arg2IntVar(ce[1]),
144 Reify(s.arg2BoolVar(ce[2]), rm), s.ann2ipl(ann));
146 rel(s, s.arg2IntVar(ce[0]), irt, ce[1]->getInt(),
147 Reify(s.arg2BoolVar(ce[2]), rm), s.ann2ipl(ann));
150 rel(s, s.arg2IntVar(ce[1]),
swap(irt), ce[0]->getInt(),
151 Reify(s.arg2BoolVar(ce[2]), rm), s.ann2ipl(ann));
197 IntArgs ia = s.arg2intargs(ce[0]);
199 if (s.isBoolArray(ce[1],singleIntVar)) {
200 if (singleIntVar != -1) {
201 if (std::abs(ia[singleIntVar]) == 1 && ce[2]->getInt() == 0) {
202 IntVar siv = s.arg2IntVar(ce[1]->getArray()->a[singleIntVar]);
203 BoolVarArgs iv = s.arg2boolvarargs(ce[1], 0, singleIntVar);
204 IntArgs ia_tmp(ia.size()-1);
206 for (
int i=0;
i<ia.
size();
i++) {
207 if (i != singleIntVar)
208 ia_tmp[
count++] = ia[singleIntVar] == -1 ? ia[
i] : -ia[
i];
211 linear(s, ia_tmp, iv, t, siv, s.ann2ipl(ann));
213 IntVarArgs iv = s.arg2intvarargs(ce[1]);
214 linear(s, ia, iv, irt, ce[2]->getInt(), s.ann2ipl(ann));
217 BoolVarArgs iv = s.arg2boolvarargs(ce[1]);
218 linear(s, ia, iv, irt, ce[2]->getInt(), s.ann2ipl(ann));
221 IntVarArgs iv = s.arg2intvarargs(ce[1]);
222 linear(s, ia, iv, irt, ce[2]->getInt(), s.ann2ipl(ann));
227 if (rm ==
RM_EQV && ce[2]->isBool()) {
228 if (ce[2]->getBool()) {
229 p_int_lin_CMP(s, irt, ce, ann);
231 p_int_lin_CMP(s,
neg(irt), ce, ann);
235 IntArgs ia = s.arg2intargs(ce[0]);
237 if (s.isBoolArray(ce[1],singleIntVar)) {
238 if (singleIntVar != -1) {
239 if (std::abs(ia[singleIntVar]) == 1 && ce[2]->getInt() == 0) {
240 IntVar siv = s.arg2IntVar(ce[1]->getArray()->a[singleIntVar]);
241 BoolVarArgs iv = s.arg2boolvarargs(ce[1], 0, singleIntVar);
242 IntArgs ia_tmp(ia.size()-1);
244 for (
int i=0;
i<ia.
size();
i++) {
245 if (i != singleIntVar)
246 ia_tmp[
count++] = ia[singleIntVar] == -1 ? ia[
i] : -ia[
i];
249 linear(s, ia_tmp, iv, t, siv, Reify(s.arg2BoolVar(ce[3]), rm),
252 IntVarArgs iv = s.arg2intvarargs(ce[1]);
253 linear(s, ia, iv, irt, ce[2]->getInt(),
254 Reify(s.arg2BoolVar(ce[3]), rm), s.ann2ipl(ann));
257 BoolVarArgs iv = s.arg2boolvarargs(ce[1]);
258 linear(s, ia, iv, irt, ce[2]->getInt(),
259 Reify(s.arg2BoolVar(ce[3]), rm), s.ann2ipl(ann));
262 IntVarArgs iv = s.arg2intvarargs(ce[1]);
263 linear(s, ia, iv, irt, ce[2]->getInt(),
264 Reify(s.arg2BoolVar(ce[3]), rm),
269 p_int_lin_CMP(s,
IRT_EQ, ce, ann);
278 p_int_lin_CMP(s,
IRT_NQ, ce, ann);
287 p_int_lin_CMP(s,
IRT_LQ, ce, ann);
296 p_int_lin_CMP(s,
IRT_LE, ce, ann);
305 p_int_lin_CMP(s,
IRT_GQ, ce, ann);
314 p_int_lin_CMP(s,
IRT_GR, ce, ann);
325 IntArgs ia = s.arg2intargs(ce[0]);
326 BoolVarArgs iv = s.arg2boolvarargs(ce[1]);
327 if (ce[2]->isIntVar())
328 linear(s, ia, iv, irt, s.iv[ce[2]->getIntVar()], s.ann2ipl(ann));
330 linear(s, ia, iv, irt, ce[2]->getInt(), s.ann2ipl(ann));
334 if (rm ==
RM_EQV && ce[2]->isBool()) {
335 if (ce[2]->getBool()) {
336 p_bool_lin_CMP(s, irt, ce, ann);
338 p_bool_lin_CMP(s,
neg(irt), ce, ann);
342 IntArgs ia = s.arg2intargs(ce[0]);
343 BoolVarArgs iv = s.arg2boolvarargs(ce[1]);
344 if (ce[2]->isIntVar())
345 linear(s, ia, iv, irt, s.iv[ce[2]->getIntVar()],
346 Reify(s.arg2BoolVar(ce[3]), rm),
349 linear(s, ia, iv, irt, ce[2]->getInt(),
350 Reify(s.arg2BoolVar(ce[3]), rm),
354 p_bool_lin_CMP(s,
IRT_EQ, ce, ann);
365 p_bool_lin_CMP(s,
IRT_NQ, ce, ann);
376 p_bool_lin_CMP(s,
IRT_LQ, ce, ann);
388 p_bool_lin_CMP(s,
IRT_LE, ce, ann);
399 p_bool_lin_CMP(s,
IRT_GQ, ce, ann);
410 p_bool_lin_CMP(s,
IRT_GR, ce, ann);
424 if (!ce[0]->isIntVar()) {
425 rel(s, ce[0]->getInt() + s.arg2IntVar(ce[1])
426 == s.arg2IntVar(ce[2]), s.ann2ipl(ann));
427 }
else if (!ce[1]->isIntVar()) {
428 rel(s, s.arg2IntVar(ce[0]) + ce[1]->getInt()
429 == s.arg2IntVar(ce[2]), s.ann2ipl(ann));
430 }
else if (!ce[2]->isIntVar()) {
431 rel(s, s.arg2IntVar(ce[0]) + s.arg2IntVar(ce[1])
432 == ce[2]->getInt(), s.ann2ipl(ann));
434 rel(s, s.arg2IntVar(ce[0]) + s.arg2IntVar(ce[1])
435 == s.arg2IntVar(ce[2]), s.ann2ipl(ann));
440 if (!ce[0]->isIntVar()) {
441 rel(s, ce[0]->getInt() - s.arg2IntVar(ce[1])
442 == s.arg2IntVar(ce[2]), s.ann2ipl(ann));
443 }
else if (!ce[1]->isIntVar()) {
444 rel(s, s.arg2IntVar(ce[0]) - ce[1]->getInt()
445 == s.arg2IntVar(ce[2]), s.ann2ipl(ann));
446 }
else if (!ce[2]->isIntVar()) {
447 rel(s, s.arg2IntVar(ce[0]) - s.arg2IntVar(ce[1])
448 == ce[2]->getInt(), s.ann2ipl(ann));
450 rel(s, s.arg2IntVar(ce[0]) - s.arg2IntVar(ce[1])
451 == s.arg2IntVar(ce[2]), s.ann2ipl(ann));
456 IntVar x0 = s.arg2IntVar(ce[0]);
457 IntVar x1 = s.arg2IntVar(ce[1]);
458 IntVar x2 = s.arg2IntVar(ce[2]);
459 mult(s, x0, x1, x2, s.ann2ipl(ann));
462 IntVar x0 = s.arg2IntVar(ce[0]);
463 IntVar x2 = s.arg2IntVar(ce[2]);
464 pow(s, x0, ce[1]->getInt(), x2, s.ann2ipl(ann));
467 IntVar x0 = s.arg2IntVar(ce[0]);
468 IntVar x1 = s.arg2IntVar(ce[1]);
469 IntVar x2 = s.arg2IntVar(ce[2]);
470 IntVarArgs x = {x0, x1, x2};
472 div(s,x[0],x[1],x[2], s.ann2ipl(ann));
475 IntVar x0 = s.arg2IntVar(ce[0]);
476 IntVar x1 = s.arg2IntVar(ce[1]);
477 IntVar x2 = s.arg2IntVar(ce[2]);
478 IntVarArgs x = {x0, x1, x2};
480 mod(s,x[0],x[1],x[2], s.ann2ipl(ann));
484 IntVar x0 = s.arg2IntVar(ce[0]);
485 IntVar x1 = s.arg2IntVar(ce[1]);
486 IntVar x2 = s.arg2IntVar(ce[2]);
487 min(s, x0, x1, x2, s.ann2ipl(ann));
490 IntVar x0 = s.arg2IntVar(ce[0]);
491 IntVar x1 = s.arg2IntVar(ce[1]);
492 IntVar x2 = s.arg2IntVar(ce[2]);
493 max(s, x0, x1, x2, s.ann2ipl(ann));
496 IntVar x0 = s.arg2IntVar(ce[0]);
497 IntVar x1 = s.arg2IntVar(ce[1]);
498 rel(s, x0 == -x1, s.ann2ipl(ann));
504 rel(s, s.arg2BoolVar(ce[0]), irt, s.arg2BoolVar(ce[1]),
509 rel(s, s.arg2BoolVar(ce[0]), irt, s.arg2BoolVar(ce[1]),
510 Reify(s.arg2BoolVar(ce[2]), rm), s.ann2ipl(ann));
513 p_bool_CMP(s,
IRT_EQ, ce, ann);
522 p_bool_CMP(s,
IRT_NQ, ce, ann);
531 p_bool_CMP(s,
IRT_GQ, ce, ann);
540 p_bool_CMP(s,
IRT_LQ, ce, ann);
549 p_bool_CMP(s,
IRT_GR, ce, ann);
558 p_bool_CMP(s,
IRT_LE, ce, ann);
568 BoolVar b0 = s.arg2BoolVar(ce[0]); \
569 BoolVar b1 = s.arg2BoolVar(ce[1]); \
570 if (ce[2]->isBool()) { \
571 rel(s, b0, op, b1, ce[2]->getBool(), s.ann2ipl(ann)); \
573 rel(s, b0, op, b1, s.bv[ce[2]->getBoolVar()], s.ann2ipl(ann)); \
576#define BOOL_ARRAY_OP(op) \
577 BoolVarArgs bv = s.arg2boolvarargs(ce[0]); \
578 if (ce.size()==1) { \
579 rel(s, op, bv, 1, s.ann2ipl(ann)); \
580 } else if (ce[1]->isBool()) { \
581 rel(s, op, bv, ce[1]->getBool(), s.ann2ipl(ann)); \
583 rel(s, op, bv, s.bv[ce[1]->getBoolVar()], s.ann2ipl(ann)); \
586 void p_bool_or(FlatZincSpace& s,
const ConExpr& ce, AST::Node* ann) {
590 BoolVar b0 = s.arg2BoolVar(ce[0]);
591 BoolVar
b1 = s.arg2BoolVar(ce[1]);
592 BoolVar
b2 = s.arg2BoolVar(ce[2]);
593 clause(s,
BOT_OR, BoolVarArgs()<<b0<<b1, BoolVarArgs()<<b2, 1,
600 BoolVar b0 = s.arg2BoolVar(ce[0]);
601 BoolVar
b1 = s.arg2BoolVar(ce[1]);
602 BoolVar
b2 = s.arg2BoolVar(ce[2]);
613 BoolVarArgs bv = s.arg2boolvarargs(ce[0]);
614 BoolVar
b1 = s.arg2BoolVar(ce[1]);
615 for (
unsigned int i=bv.size(); i--;)
616 rel(s, b1,
BOT_IMP, bv[i], 1, s.ann2ipl(ann));
625 BoolVarArgs bv = s.arg2boolvarargs(ce[0]);
626 BoolVar
b1 = s.arg2BoolVar(ce[1]);
627 clause(s,
BOT_OR, bv, BoolVarArgs()<<b1, 1, s.ann2ipl(ann));
636 BoolVarArgs bv = s.arg2boolvarargs(ce[0]);
639 rel(s, s.arg2BoolVar(ce[1]),
BOT_IMP, tmp, 1);
643 BoolVarArgs bvp = s.arg2boolvarargs(ce[0]);
644 BoolVarArgs bvn = s.arg2boolvarargs(ce[1]);
649 BoolVarArgs bvp = s.arg2boolvarargs(ce[0]);
650 BoolVarArgs bvn = s.arg2boolvarargs(ce[1]);
651 BoolVar b0 = s.arg2BoolVar(ce[2]);
656 BoolVarArgs bvp = s.arg2boolvarargs(ce[0]);
657 BoolVarArgs bvn = s.arg2boolvarargs(ce[1]);
658 BoolVar b0 = s.arg2BoolVar(ce[2]);
665 BoolVar b0 = s.arg2BoolVar(ce[0]);
666 BoolVar
b1 = s.arg2BoolVar(ce[1]);
667 BoolVar
b2 = s.arg2BoolVar(ce[2]);
668 clause(s,
BOT_OR, BoolVarArgs()<<b0<<b1, BoolVarArgs()<<b2, 1,
670 clause(s,
BOT_OR, BoolVarArgs(), BoolVarArgs()<<b0<<b1<<b2, 1,
674 BoolVar b0 = s.arg2BoolVar(ce[0]);
675 BoolVar
b1 = s.arg2BoolVar(ce[1]);
676 if (ce[2]->isBool()) {
677 rel(s, b1,
BOT_IMP, b0, ce[2]->getBool(), s.ann2ipl(ann));
679 rel(s, b1,
BOT_IMP, b0, s.bv[ce[2]->getBoolVar()], s.ann2ipl(ann));
686 BoolVar x0 = s.arg2BoolVar(ce[0]);
687 BoolVar x1 = s.arg2BoolVar(ce[1]);
694 bool isConstant =
true;
696 for (
int i=
a->a.
size(); i--;) {
697 if (!
a->a[i]->isInt()) {
702 IntVar selector = s.arg2IntVar(ce[0]);
703 rel(s, selector > 0);
706 element(s, sia, selector, -1, s.arg2IntVar(ce[2]), s.ann2ipl(ann));
708 IntVarArgs iv = s.arg2intvarargs(ce[1]);
709 element(s, iv, selector, -1, s.arg2IntVar(ce[2]), s.ann2ipl(ann));
714 bool isConstant =
true;
716 for (
int i=
a->a.
size(); i--;) {
717 if (!
a->a[i]->isInt()) {
722 IntVar selector = s.arg2IntVar(ce[0]);
723 int offset = ce[1]->getInt();
724 rel(s, selector >= offset);
727 element(s, sia, selector, -offset, s.arg2IntVar(ce[3]), s.ann2ipl(ann));
729 IntVarArgs iv = s.arg2intvarargs(ce[2]);
730 element(s, iv, selector, -offset, s.arg2IntVar(ce[3]), s.ann2ipl(ann));
735 bool isConstant =
true;
737 for (
int i=
a->a.
size(); i--;) {
738 if (!
a->a[i]->isInt()) {
743 IntVar selector0 = s.arg2IntVar(ce[0]);
744 IntVar selector1 = s.arg2IntVar(ce[1]);
745 IntSet idxset0 = s.arg2intset(ce[3]);
746 IntSet idxset1 = s.arg2intset(ce[4]);
748 int w = idxset1.
size();
749 int s1off = idxset1.min();
750 int h = idxset0.size();
751 int s0off = idxset0.min();
755 element(s, sia, selector1, -s1off, w, selector0, -s0off, h, s.arg2IntVar(ce[5]), s.ann2ipl(ann));
757 IntVarArgs iv = s.arg2intvarargs(ce[2], 0);
758 element(s, iv, selector1, -s1off, w, selector0, -s0off, h, s.arg2IntVar(ce[5]), s.ann2ipl(ann));
763 bool isConstant =
true;
765 for (
int i=
a->a.
size(); i--;) {
766 if (!
a->a[i]->isBool()) {
771 IntVar selector = s.arg2IntVar(ce[0]);
772 rel(s, selector > 0);
775 element(s, sia, selector, s.arg2BoolVar(ce[2]), s.ann2ipl(ann));
777 BoolVarArgs iv = s.arg2boolvarargs(ce[1], 1);
778 element(s, iv, selector, s.arg2BoolVar(ce[2]), s.ann2ipl(ann));
783 bool isConstant =
true;
785 for (
int i=
a->a.
size(); i--;) {
786 if (!
a->a[i]->isBool()) {
791 IntVar selector = s.arg2IntVar(ce[0]);
792 int offset = ce[1]->getInt();
793 rel(s, selector >= offset);
796 element(s, sia, selector, -offset, s.arg2BoolVar(ce[3]), s.ann2ipl(ann));
798 BoolVarArgs iv = s.arg2boolvarargs(ce[2]);
799 element(s, iv, selector, -offset, s.arg2BoolVar(ce[3]), s.ann2ipl(ann));
804 bool isConstant =
true;
806 for (
int i=
a->a.
size(); i--;) {
807 if (!
a->a[i]->isBool()) {
812 IntVar selector0 = s.arg2IntVar(ce[0]);
813 IntVar selector1 = s.arg2IntVar(ce[1]);
814 IntSet idxset0 = s.arg2intset(ce[3]);
815 IntSet idxset1 = s.arg2intset(ce[4]);
817 int w = idxset1.
size();
818 int s1off = idxset1.min();
819 int h = idxset0.size();
820 int s0off = idxset0.min();
824 element(s, sia, selector1, -s1off, w, selector0, -s0off, h, s.arg2BoolVar(ce[5]), s.ann2ipl(ann));
826 BoolVarArgs iv = s.arg2boolvarargs(ce[2], 0);
827 element(s, iv, selector1, -s1off, w, selector0, -s0off, h, s.arg2BoolVar(ce[5]), s.ann2ipl(ann));
833 BoolVar x0 = s.arg2BoolVar(ce[0]);
834 IntVar x1 = s.arg2IntVar(ce[1]);
835 if (ce[0]->isBoolVar() && ce[1]->isIntVar()) {
836 s.aliasBool2Int(ce[1]->getIntVar(), ce[0]->getBoolVar());
838 channel(s, x0, x1, s.ann2ipl(ann));
842 IntSet
d = s.arg2intset(ce[1]);
843 if (ce[0]->isBoolVar()) {
845 Iter::Ranges::Singleton sr(0,1);
846 Iter::Ranges::Inter<IntSetRanges,Iter::Ranges::Singleton>
i(dr,sr);
848 if (d01.size() == 0) {
851 rel(s, s.arg2BoolVar(ce[0]),
IRT_GQ, d01.min());
852 rel(s, s.arg2BoolVar(ce[0]),
IRT_LQ, d01.max());
855 dom(s, s.arg2IntVar(ce[0]), d);
864 if (ce[0]->isBoolVar()) {
869 if (d01.
size() == 0) {
871 }
else if (d01.
max() == 0) {
873 }
else if (d01.
min() == 1) {
884 if (ce[0]->isBoolVar()) {
889 if (d01.
size() == 0) {
891 }
else if (d01.
max() == 0) {
893 }
else if (d01.
min() == 1) {
907 void p_abs(FlatZincSpace& s,
const ConExpr& ce, AST::Node* ann) {
908 IntVar x0 = s.arg2IntVar(ce[0]);
909 IntVar x1 = s.arg2IntVar(ce[1]);
910 abs(s, x0, x1, s.ann2ipl(ann));
913 void p_array_int_lt(FlatZincSpace& s,
const ConExpr& ce, AST::Node* ann) {
914 IntVarArgs iv0 = s.arg2intvarargs(ce[0]);
915 IntVarArgs iv1 = s.arg2intvarargs(ce[1]);
916 rel(s, iv0,
IRT_LE, iv1, s.ann2ipl(ann));
920 IntVarArgs iv0 = s.arg2intvarargs(ce[0]);
921 IntVarArgs iv1 = s.arg2intvarargs(ce[1]);
922 rel(s, iv0,
IRT_LQ, iv1, s.ann2ipl(ann));
927 BoolVarArgs bv0 = s.arg2boolvarargs(ce[0]);
928 BoolVarArgs bv1 = s.arg2boolvarargs(ce[1]);
929 rel(s, bv0,
IRT_LE, bv1, s.ann2ipl(ann));
934 BoolVarArgs bv0 = s.arg2boolvarargs(ce[0]);
935 BoolVarArgs bv1 = s.arg2boolvarargs(ce[1]);
936 rel(s, bv0,
IRT_LQ, bv1, s.ann2ipl(ann));
940 IntVarArgs iv = s.arg2intvarargs(ce[0]);
941 if (!ce[1]->isIntVar()) {
942 if (!ce[2]->isIntVar()) {
943 count(s, iv, ce[1]->getInt(),
IRT_EQ, ce[2]->getInt(),
946 count(s, iv, ce[1]->getInt(),
IRT_EQ, s.arg2IntVar(ce[2]),
949 }
else if (!ce[2]->isIntVar()) {
950 count(s, iv, s.arg2IntVar(ce[1]),
IRT_EQ, ce[2]->getInt(),
953 count(s, iv, s.arg2IntVar(ce[1]),
IRT_EQ, s.arg2IntVar(ce[2]),
959 IntVarArgs iv = s.arg2intvarargs(ce[0]);
960 IntVar x = s.arg2IntVar(ce[1]);
961 IntVar y = s.arg2IntVar(ce[2]);
962 BoolVar
b = s.arg2BoolVar(ce[3]);
968 IntVarArgs iv = s.arg2intvarargs(ce[0]);
969 IntVar x = s.arg2IntVar(ce[1]);
970 IntVar y = s.arg2IntVar(ce[2]);
971 BoolVar
b = s.arg2BoolVar(ce[3]);
979 IntVarArgs iv = s.arg2intvarargs(ce[1]);
980 count(s, iv, ce[2]->getInt(), irt, ce[0]->getInt(), s.ann2ipl(ann));
984 count_rel(
IRT_LQ, s, ce, ann);
988 count_rel(
IRT_GQ, s, ce, ann);
993 int minIdx = ce[3]->getInt();
994 IntVarArgs load = s.arg2intvarargs(ce[0]);
996 IntVarArgs bin = s.arg2intvarargs(ce[1]);
997 for (
int i=bin.size(); i--;)
998 rel(s, bin[i] >= minIdx);
1000 for (
int i=minIdx;
i--;)
1002 }
else if (minIdx < 0) {
1003 IntVarArgs bin2(bin.size());
1004 for (
int i=bin.size(); i--;)
1005 bin2[
i] =
expr(s, bin[i]-minIdx, s.ann2ipl(ann));
1009 IntArgs sizes = s.arg2intargs(ce[2]);
1011 IntVarArgs allvars = l + bin;
1013 binpacking(s, allvars.slice(0,1,l.size()), allvars.slice(l.size(),1,bin.size()),
1014 sizes, s.ann2ipl(ann));
1019 IntVarArgs iv0 = s.arg2intvarargs(ce[0]);
1020 IntArgs cover = s.arg2intargs(ce[1]);
1021 IntVarArgs iv1 = s.arg2intvarargs(ce[2]);
1024 IntSet cover_s(cover);
1025 IntSetRanges cover_r(cover_s);
1026 IntVarRanges* iv0_ri = re.alloc<IntVarRanges>(iv0.size());
1027 for (
int i=iv0.size(); i--;)
1028 iv0_ri[
i] = IntVarRanges(iv0[i]);
1029 Iter::Ranges::NaryUnion iv0_r(re,iv0_ri,iv0.size());
1030 Iter::Ranges::Diff<Iter::Ranges::NaryUnion,IntSetRanges>
1031 extra_r(iv0_r,cover_r);
1032 Iter::Ranges::ToValues<Iter::Ranges::Diff<
1033 Iter::Ranges::NaryUnion,IntSetRanges> > extra(extra_r);
1034 for (; extra(); ++extra) {
1035 cover << extra.val();
1036 iv1 << IntVar(s,0,iv0.size());
1042 IntVarArgs allvars = iv0+iv1;
1044 count(s, allvars.slice(0,1,iv0.size()),
1045 allvars.slice(iv0.size(),1,iv1.size()),
1049 count(s, iv0, iv1, cover, ipl);
1055 IntVarArgs iv0 = s.arg2intvarargs(ce[0]);
1056 IntArgs cover = s.arg2intargs(ce[1]);
1057 IntVarArgs iv1 = s.arg2intvarargs(ce[2]);
1062 IntVarArgs allvars = iv0+iv1;
1064 count(s, allvars.slice(0,1,iv0.size()),
1065 allvars.slice(iv0.size(),1,iv1.size()),
1069 count(s, iv0, iv1, cover, ipl);
1075 IntVarArgs x = s.arg2intvarargs(ce[0]);
1076 IntArgs cover = s.arg2intargs(ce[1]);
1078 IntArgs lbound = s.arg2intargs(ce[2]);
1079 IntArgs ubound = s.arg2intargs(ce[3]);
1081 for (
int i=cover.size(); i--;)
1082 y[
i] = IntSet(lbound[i],ubound[i]);
1084 IntSet cover_s(cover);
1086 IntVarRanges* xrs = re.alloc<IntVarRanges>(x.size());
1087 for (
int i=x.size(); i--;)
1089 Iter::Ranges::NaryUnion u(re, xrs, x.size());
1090 Iter::Ranges::ToValues<Iter::Ranges::NaryUnion> uv(u);
1091 for (; uv(); ++uv) {
1092 if (!cover_s.in(uv.val())) {
1094 y << IntSet(0,x.size());
1101 count(s, x, y, cover, ipl);
1107 IntVarArgs x = s.arg2intvarargs(ce[0]);
1108 IntArgs cover = s.arg2intargs(ce[1]);
1110 IntArgs lbound = s.arg2intargs(ce[2]);
1111 IntArgs ubound = s.arg2intargs(ce[3]);
1113 for (
int i=cover.size(); i--;)
1114 y[
i] = IntSet(lbound[i],ubound[i]);
1119 count(s, x, y, cover, ipl);
1123 IntVarArgs iv = s.arg2intvarargs(ce[1]);
1124 min(s, iv, s.arg2IntVar(ce[0]), s.ann2ipl(ann));
1128 IntVarArgs iv = s.arg2intvarargs(ce[1]);
1129 max(s, iv, s.arg2IntVar(ce[0]), s.ann2ipl(ann));
1133 IntVar x = s.arg2IntVar(ce[2]);
1134 IntVarArgs iv = x + s.arg2intvarargs(ce[0]);
1136 int offset = ce[1]->getInt();
1137 argmin(s, iv.slice(1), offset, x,
true, s.ann2ipl(ann));
1141 IntVar x = s.arg2IntVar(ce[2]);
1142 IntVarArgs iv = x + s.arg2intvarargs(ce[0]);
1144 int offset = ce[1]->getInt();
1145 argmax(s, iv.slice(1), offset, x,
true, s.ann2ipl(ann));
1149 BoolVarArgs bv = s.arg2boolvarargs(ce[0]);
1151 int offset = ce[1]->getInt();
1152 argmin(s, bv, offset, s.arg2IntVar(ce[2]),
true, s.ann2ipl(ann));
1156 BoolVarArgs bv = s.arg2boolvarargs(ce[0]);
1158 int offset = ce[1]->getInt();
1159 argmax(s, bv, offset, s.arg2IntVar(ce[2]),
true, s.ann2ipl(ann));
1162 void p_regular(
FlatZincSpace& s, IntVarArgs iv,
int q,
int symbols_min,
1163 int symbols_max, IntArgs d,
int q0,
AST::SetLit* finals,
1165 int symbols = symbols_max - symbols_min + 1;
1168 for (
int i=0;
i<q;
i++) {
1169 for (
int j=0; j<symbols; j++) {
1170 if (d[i*symbols+j] > 0)
1176 DFA::Transition* t = re.alloc<DFA::Transition>(noOfTrans+1);
1178 for (
int i=1;
i<=q;
i++) {
1179 for (
int j=0; j<symbols; j++) {
1180 if (d[(i-1)*symbols+j] > 0) {
1181 t[noOfTrans].i_state =
i;
1182 t[noOfTrans].symbol = symbols_min + j;
1183 t[noOfTrans].o_state =
d[(
i-1)*symbols+j];
1188 t[noOfTrans].i_state = -1;
1192 if (finals->interval) {
1193 f =
static_cast<int*
>(
heap.
ralloc(
sizeof(
int)*(finals->max-finals->min+2)));
1194 for (
int i=finals->min; i<=finals->
max; i++)
1195 f[
i-finals->min] =
i;
1196 f[finals->max-finals->min+1] = -1;
1198 f =
static_cast<int*
>(
heap.
ralloc(
sizeof(
int)*(finals->s.size()+1)));
1199 for (
int j=finals->s.size(); j--; )
1200 f[j] = finals->s[j];
1201 f[finals->s.size()] = -1;
1207 extensional(s, iv, s.getSharedDFA(dfa), s.ann2ipl(ann));
1211 p_regular(s, s.arg2intvarargs(ce[0]), ce[1]->getInt(), 1, ce[2]->getInt(),
1212 s.arg2intargs(ce[3]), ce[4]->getInt(), ce[5]->getSet(), ann);
1216 p_regular(s, s.arg2intvarargs(ce[0]), ce[1]->getInt(), ce[2]->getInt(),
1217 ce[3]->getInt(), s.arg2intargs(ce[4]), ce[5]->getInt(),
1218 ce[6]->getSet(), ann);
1224 IntVarArgs x = s.arg2intvarargs(ce[0]);
1225 int q = ce[1]->getInt(), first_symbol = ce[2]->getInt();
1226 int symbols = ce[3]->getInt(), initial = ce[5]->getInt();
1228 IntSet finals = s.arg2intset(ce[6]);
1229 if ((q <= 0) || (symbols <= 0) ||
1230 (
static_cast<long long>(q)*symbols != table.size()) ||
1231 (initial < 1) || (initial > q) ||
1232 ((finals.size() != 0) && ((finals.min() < 1) || (finals.max() > q))) ||
1235 throw FlatZinc::Error(
"Registry",
"invalid NFA dimensions or states");
1236 std::vector<DFA::Transition> transitions;
1237 for (
int state=0; state<q; state++)
1238 for (
int symbol=0; symbol<symbols; symbol++) {
1239 const IntSet& targets = table[state*symbols+symbol];
1240 if ((targets.size() != 0) && ((targets.min() < 1) || (targets.max() > q)))
1241 throw FlatZinc::Error(
"Registry",
"invalid NFA transition");
1242 for (IntSetValues target(targets); target(); ++target)
1243 transitions.push_back(DFA::Transition(state+1,first_symbol+symbol,target.val()));
1245 transitions.push_back(DFA::Transition(-1,0,0));
1246 std::vector<int> accepting;
1247 for (IntSetValues
final(finals);
final(); ++
final)
1248 accepting.push_back(
final.val());
1249 accepting.push_back(-1);
1250 DFA automaton =
DFA::nfa(initial,transitions.data(),accepting.data());
1252 extensional(s,x,s.getSharedDFA(automaton),s.ann2ipl(ann));
1257 IntVarArgs x = s.arg2intvarargs(ce[0]);
1258 IntVarArgs y = s.arg2intvarargs(ce[1]);
1259 IntVarArgs xy(x.size()+y.size());
1260 for (
int i=x.size(); i--;)
1262 for (
int i=y.size(); i--;)
1265 for (
int i=x.size(); i--;)
1267 for (
int i=y.size(); i--;)
1269 sorted(s, x, y, s.ann2ipl(ann));
1274 IntVarArgs x = s.arg2intvarargs(ce[0]);
1275 int xoff = ce[1]->getInt();
1276 IntVarArgs y = s.arg2intvarargs(ce[2]);
1277 int yoff = ce[3]->getInt();
1278 IntVarArgs xy = x + y;
1280 channel(s, xy.slice(0, 1, x.size()), xoff, xy.slice(x.size()), yoff, s.ann2ipl(ann));
1285 IntVarArgs x = s.arg2intvarargs(ce[0]);
1291 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1297 IntVarArgs x = s.arg2intvarargs(ce[0]);
1303 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1309 IntVarArgs x = s.arg2intvarargs(ce[0]);
1310 IntArgs tuples = s.arg2intargs(ce[1]);
1311 TupleSet ts = s.arg2tupleset(tuples,x.size());
1318 IntVarArgs x = s.arg2intvarargs(ce[0]);
1319 IntArgs tuples = s.arg2intargs(ce[1]);
1320 TupleSet ts = s.arg2tupleset(tuples,x.size());
1327 IntVarArgs x = s.arg2intvarargs(ce[0]);
1328 IntArgs tuples = s.arg2intargs(ce[1]);
1329 TupleSet ts = s.arg2tupleset(tuples,x.size());
1336 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1337 IntArgs tuples = s.arg2boolargs(ce[1]);
1338 TupleSet ts = s.arg2tupleset(tuples,x.size());
1345 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1346 IntArgs tuples = s.arg2boolargs(ce[1]);
1347 TupleSet ts = s.arg2tupleset(tuples,x.size());
1354 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1355 IntArgs tuples = s.arg2boolargs(ce[1]);
1356 TupleSet ts = s.arg2tupleset(tuples,x.size());
1363 IntVarArgs start = s.arg2intvarargs(ce[0]);
1364 IntArgs duration = s.arg2intargs(ce[1]);
1365 IntArgs height = s.arg2intargs(ce[2]);
1366 BoolVarArgs
opt = s.arg2boolvarargs(ce[3]);
1367 IntVar bound = s.arg2IntVar(ce[4]);
1369 cumulative(s,bound,start,duration,height,opt,s.ann2ipl(ann));
1374 IntVarArgs x = s.arg2intvarargs(ce[0]);
1375 IntSet S = s.arg2intset(ce[1]);
1376 int q = ce[2]->getInt();
1377 int l = ce[3]->getInt();
1378 int u = ce[4]->getInt();
1380 sequence(s, x, S, q, l, u, s.ann2ipl(ann));
1385 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1386 bool val = ce[1]->getBool();
1387 int q = ce[2]->getInt();
1388 int l = ce[3]->getInt();
1389 int u = ce[4]->getInt();
1392 sequence(s, x, S, q, l, u, s.ann2ipl(ann));
1396 IntVarArgs x = s.arg2intvarargs(ce[0]);
1397 IntArgs p = s.arg2intargs(ce[1]);
1399 unary(s, x, p, s.ann2ipl(ann));
1404 IntVarArgs x = s.arg2intvarargs(ce[0]);
1405 IntArgs p = s.arg2intargs(ce[1]);
1406 BoolVarArgs m = s.arg2boolvarargs(ce[2]);
1408 unary(s, x, p, m, s.ann2ipl(ann));
1412 int off = ce[0]->getInt();
1413 IntVarArgs xv = s.arg2intvarargs(ce[1]);
1415 circuit(s,off,xv,s.ann2ipl(ann));
1419 IntArgs
c = s.arg2intargs(ce[0]);
1420 IntVarArgs xv = s.arg2intvarargs(ce[1]);
1421 IntVarArgs yv = s.arg2intvarargs(ce[2]);
1422 IntVar z = s.arg2IntVar(ce[3]);
1424 circuit(s,c,xv,yv,z,s.ann2ipl(ann));
1427 IntArgs
c = s.arg2intargs(ce[0]);
1428 IntVarArgs xv = s.arg2intvarargs(ce[1]);
1429 IntVar z = s.arg2IntVar(ce[2]);
1431 circuit(s,c,xv,z,s.ann2ipl(ann));
1435 IntVarArgs x0 = s.arg2intvarargs(ce[0]);
1436 IntVarArgs w = s.arg2intvarargs(ce[1]);
1437 IntVarArgs y0 = s.arg2intvarargs(ce[2]);
1438 IntVarArgs h = s.arg2intvarargs(ce[3]);
1439 if (w.assigned() && h.assigned()) {
1440 IntArgs iw(w.size());
1441 for (
int i=w.size(); i--;)
1443 IntArgs ih(h.size());
1444 for (
int i=h.size(); i--;)
1446 nooverlap(s,x0,iw,y0,ih,s.ann2ipl(ann));
1448 int miny = y0[0].min();
1449 int maxy = y0[0].max();
1451 for (
int i=1;
i<y0.
size();
i++) {
1452 miny = std::min(miny,y0[i].
min());
1453 maxy = std::max(maxy,y0[i].
max());
1454 maxdy = std::max(maxdy,ih[i]);
1456 int minx = x0[0].min();
1457 int maxx = x0[0].max();
1459 for (
int i=1;
i<x0.
size();
i++) {
1460 minx = std::min(minx,x0[i].
min());
1461 maxx = std::max(maxx,x0[i].
max());
1462 maxdx = std::max(maxdx,iw[i]);
1469 IntVarArgs x1(x0.size()), y1(y0.size());
1470 for (
int i=x0.size(); i--; )
1471 x1[
i] =
expr(s, x0[i] + w[i]);
1472 for (
int i=y0.size(); i--; )
1473 y1[
i] =
expr(s, y0[i] + h[i]);
1474 nooverlap(s,x0,w,x1,y0,h,y1,s.ann2ipl(ann));
1479 IntVarArgs x = s.arg2intvarargs(ce[0]);
1480 int p_s = ce[1]->getInt();
1481 int p_t = ce[2]->getInt();
1482 precede(s,x,p_s,p_t,s.ann2ipl(ann));
1486 IntVarArgs x = s.arg2intvarargs(ce[1]);
1487 if (ce[0]->isIntVar()) {
1488 IntVar y = s.arg2IntVar(ce[0]);
1496 IntVarArgs x = s.arg2intvarargs(ce[1]);
1497 IntSet
v = s.arg2intset(ce[2]);
1498 if (ce[0]->isIntVar()) {
1499 IntVar n = s.arg2IntVar(ce[0]);
1504 count(s,x,v,
IRT_EQ,ce[0]->getInt(),s.ann2ipl(ann));
1509 IntVarArgs x = s.arg2intvarargs(ce[0]);
1510 IntVar y = s.arg2IntVar(ce[1]);
1511 member(s,x,y,s.ann2ipl(ann));
1515 IntVarArgs x = s.arg2intvarargs(ce[0]);
1516 IntVar y = s.arg2IntVar(ce[1]);
1517 BoolVar
b = s.arg2BoolVar(ce[2]);
1518 member(s,x,y,b,s.ann2ipl(ann));
1521 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1522 BoolVar y = s.arg2BoolVar(ce[1]);
1523 member(s,x,y,s.ann2ipl(ann));
1527 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1528 BoolVar y = s.arg2BoolVar(ce[1]);
1529 member(s,x,y,s.arg2BoolVar(ce[2]),s.ann2ipl(ann));
1536 void blackbox_source(
AST::Node* ann, std::string& mode,
1537 std::string& target,
1538 std::vector<std::string>& args) {
1539 auto string_arg = [](
AST::Node* n,
const char* what) {
1540 if ((n ==
nullptr) || !n->isString()) {
1541 throw FlatZinc::Error(
"Registry",
1542 std::string(
"Malformed blackbox annotation: ") +
1543 what +
" must be a string.");
1545 return n->getString();
1548 bool has_dll = (ann !=
nullptr) && ann->hasCall(
"blackbox_dll");
1549 bool has_exec = (ann !=
nullptr) && ann->hasCall(
"blackbox_exec");
1550 if (has_dll && has_exec) {
1551 throw FlatZinc::Error(
1552 "Registry",
"Blackbox constraint has multiple execution method annotations.");
1553 }
else if (has_dll) {
1554 c = ann->getCall(
"blackbox_dll");
1556 }
else if (has_exec) {
1557 c = ann->getCall(
"blackbox_exec");
1560 throw FlatZinc::Error(
1561 "Registry",
"Blackbox constraint is missing a valid annotation specifying "
1562 "execution method.");
1564 if ((c ==
nullptr) || (
c->args ==
nullptr)) {
1565 throw FlatZinc::Error(
"Registry",
1566 "Malformed blackbox annotation: missing target.");
1571 if (arr->a.size() != 2) {
1572 throw FlatZinc::Error(
1573 "Registry",
"Malformed blackbox annotation: expected a target string and "
1574 "an argument array.");
1576 target = string_arg(arr->a[0],
"target");
1577 if (!arr->a[1]->isArray()) {
1578 throw FlatZinc::Error(
1579 "Registry",
"Malformed blackbox annotation: argument list must be an array "
1583 for (
unsigned int i = 0;
i < al->
a.size();
i++) {
1584 args.push_back(string_arg(al->a[i],
"argument"));
1587 target = string_arg(
c->args,
"target");
1594 std::vector<std::string> args;
1595 blackbox_source(ann, mode, target, args);
1596 IntVarArgs int_input = s.arg2intvarargs(ce[0]);
1597 IntVarArgs int_output = s.arg2intvarargs(ce[2]);
1598#ifdef GECODE_HAS_FLOAT_VARS
1599 FloatVarArgs float_input = s.arg2floatvarargs(ce[1]);
1600 FloatVarArgs float_output = s.arg2floatvarargs(ce[3]);
1602 if (!ce[1]->getArray()->
a.empty() || !ce[3]->getArray()->a.empty()) {
1603 throw FlatZinc::Error(
"Registry",
1604 "Blackbox propagator cannot use floating point values when Gecode is compiled without floating point decision variable support.");
1609float_input, float_output,
1611 mode, target, args);
1617 std::vector<std::string> args;
1618 blackbox_source(ann, mode, target, args);
1619 IntVarArgs ivar = s.arg2intvarargs(ce[0]);
1620#ifdef GECODE_HAS_FLOAT_VARS
1621 FloatVarArgs fvar = s.arg2floatvarargs(ce[1]);
1623 if (!ce[1]->getArray()->
a.empty()) {
1624 throw FlatZinc::Error(
"Registry",
1625 "Blackbox propagator cannot use floating point values when Gecode is compiled without floating point decision variable support.");
1628 IntArgs flat_reason = s.arg2intargs(ce[2]);
1629 std::vector<int> reason(flat_reason.size());
1630 for (
int i = 0;
i < flat_reason.
size();
i++) {
1631 reason[
i] = flat_reason[
i];
1637 mode, target, args, reason);
1643 switch (arg->getInt()) {
1650 default:
throw FlatZinc::Error(
"Registry",
"invalid integer relation");
1655 IntVarArgs x = s.arg2intvarargs(ce[0]);
1656 if (ce[1]->isIntVar()) {
1658 x << s.arg2IntVar(ce[1]);
1663 if (ce[1]->getInt() < 0) {
1673 IntVarArgs x = s.arg2intvarargs(ce[0]);
1674 BoolVarArgs present = s.arg2boolvarargs(ce[1]);
1675 if (x.size() != present.size())
1676 throw FlatZinc::Error(
"Registry",
"optional distinct arrays must have equal lengths");
1678 bool mandatory =
true;
1679 for (
int i=0;
i<x.
size();
i++)
1680 if (!present[i].
zero()) {
1681 lo = std::min(lo,x[i].
min());
1682 hi = std::max(hi,x[i].
max());
1684 mandatory = mandatory && present[
i].one();
1691 distinct(s, present, x, s.ann2ipl(ann));
1692 }
else if (mandatory) {
1694 for (
int i=0;
i<x.
size();
i++)
1695 if (present[i].
one()) active << x[
i];
1697 distinct(s, active, s.ann2ipl(ann));
1699 for (
int i=0;
i<x.
size();
i++)
1700 for (
int j=i+1; j<x.size(); j++)
1702 Reify(
expr(s, present[i] && present[j]),
RM_IMP), s.ann2ipl(ann));
1706 IntVarArgs x = s.arg2intvarargs(ce[0]);
1707 int c = ce[1]->getInt();
1715 for (
int i=0;
i<x.
size();
i++)
1716 if (!(x[i].
assigned() && (x[i].val() == c))) {
1717 lo = std::min(lo,x[i].
min());
1718 hi = std::max(hi,x[i].
max());
1728 for (
int i=0;
i<x.
size();
i++)
1729 for (
int j=i+1; j<x.size(); j++)
1731 Reify(
expr(s, (x[i] != c) && (x[j] != c)),
RM_IMP), s.ann2ipl(ann));
1735 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1737 channel(s, x, s.arg2IntVar(ce[1]), ce[2]->getInt(), s.ann2ipl(ann));
1740 IntVarArgs x = s.arg2intvarargs(ce[0]);
1741 IntVarArgs y = s.arg2intvarargs(ce[1]);
1742 IntVarArgs z = s.arg2intvarargs(ce[2]);
1743 if ((x.size() != y.size()) || (x.size() != z.size()))
1744 throw FlatZinc::Error(
"Registry",
"sort arrays must have equal lengths");
1745 int offset = ce[3]->getInt();
1746 for (
int i=0;
i<z.
size();
i++)
1747 z[i] =
expr(s, z[i]-offset);
1751 sorted(s, xyz.slice(0,1,x.size()), xyz.slice(x.size(),1,y.size()),
1752 xyz.slice(x.size()+y.size()), s.ann2ipl(ann));
1756 count(s, s.arg2intvarargs(ce[0]), s.arg2IntVar(ce[1]),
1757 int_relation(ce[2]), s.arg2IntVar(ce[3]), s.ann2ipl(ann));
1760 IntVarArgs x = s.arg2intvarargs(ce[0]);
1761 IntArgs y = s.arg2intargs(ce[1]);
1763 IntVar n = s.arg2IntVar(ce[3]);
1765 if (x.size() != y.size())
1766 throw Int::ArgumentSizeMismatch(
"Int::count");
1769 for (
int i=0;
i<x.
size();
i++)
1777 count(s, x, y, irt, n, ipl);
1779 BoolVarArgs matches(x.size());
1780 for (
int i=0;
i<x.
size();
i++) {
1781 if (x[i].in(y[i])) {
1782 matches[
i] = BoolVar(s,0,1);
1783 rel(s, x[i],
IRT_EQ, y[i], Reify(matches[i]), ipl);
1785 matches[
i] = BoolVar(s,0,0);
1788 linear(s, matches, irt, n, ipl);
1793 s.arg2intvarargs(ce[1]), s.ann2ipl(ann));
1796 rel(s, s.arg2boolvarargs(ce[0]),
IRT_NQ,
1797 s.arg2boolvarargs(ce[1]), s.ann2ipl(ann));
1800 rel(s, s.arg2intvarargs(ce[0]),
IRT_NQ, s.ann2ipl(ann));
1803 ite(s, s.arg2BoolVar(ce[0]), s.arg2IntVar(ce[1]), s.arg2IntVar(ce[2]),
1804 s.arg2IntVar(ce[3]), s.ann2ipl(ann));
1807 ite(s, s.arg2BoolVar(ce[0]), s.arg2BoolVar(ce[1]), s.arg2BoolVar(ce[2]),
1808 s.arg2BoolVar(ce[3]), s.ann2ipl(ann));
1811 gcd(s, s.arg2IntVar(ce[0]), s.arg2IntVar(ce[1]), s.arg2IntVar(ce[2]),
1814 template<ReifyMode mode>
1816 gcd(s, s.arg2IntVar(ce[0]), s.arg2IntVar(ce[1]), s.arg2IntVar(ce[2]),
1817 Reify(s.arg2BoolVar(ce[3]), mode), s.ann2ipl(ann));
1820 divides(s, s.arg2IntVar(ce[0]), s.arg2IntVar(ce[1]),
1821 Reify(BoolVar(s,1,1),
RM_EQV), s.ann2ipl(ann));
1823 template<ReifyMode mode>
1825 divides(s, s.arg2IntVar(ce[0]), s.arg2IntVar(ce[1]),
1826 Reify(s.arg2BoolVar(ce[2]),mode), s.ann2ipl(ann));
1829 product(s, s.arg2intvarargs(ce[0]), s.arg2IntVar(ce[1]), s.ann2ipl(ann));
1831 template<ReifyMode mode>
1833 product(s, s.arg2intvarargs(ce[0]), s.arg2IntVar(ce[1]),
1834 Reify(s.arg2BoolVar(ce[2]),mode), s.ann2ipl(ann));
1836 template<
bool fixed>
1838 IntVarArgs x = s.arg2intvarargs(ce[0]);
1839 IntVar y = s.arg2IntVar(ce[2]);
1841 product_mod(s,x,ce[1]->getInt(),y,s.ann2ipl(ann));
1843 product_mod(s,x,s.arg2IntVar(ce[1]),y,s.ann2ipl(ann));
1845 template<
bool fixed, ReifyMode mode>
1847 IntVarArgs x = s.arg2intvarargs(ce[0]);
1848 IntVar y = s.arg2IntVar(ce[2]);
1849 Reify
r(s.arg2BoolVar(ce[3]),mode);
1851 product_mod(s,x,ce[1]->getInt(),y,r,s.ann2ipl(ann));
1853 product_mod(s,x,s.arg2IntVar(ce[1]),y,r,s.ann2ipl(ann));
1856 IntVarArgs x = s.arg2intvarargs(ce[0]);
1857 IntDistance
d(ce[1]->getInt(),s.arg2intargs(ce[2]));
1862 s.arg2intargs(ce[4]),s.ann2ipl(ann),kind);
1868 nroot(s, s.arg2IntVar(ce[0]), ce[1]->getInt(), s.arg2IntVar(ce[2]),
1873 nooverlap(s, s.arg2intvarargs(ce[0]), s.arg2intargs(ce[1]),
1874 s.arg2intvarargs(ce[2]), s.arg2intargs(ce[3]),
1875 s.arg2boolvarargs(ce[4]), s.ann2ipl(ann));
1878 nooverlap(s, s.arg2intvarargs(ce[0]), s.arg2intvarargs(ce[1]),
1879 s.arg2intvarargs(ce[2]), s.arg2intvarargs(ce[3]),
1880 s.arg2intvarargs(ce[4]), s.arg2intvarargs(ce[5]),
1881 s.arg2boolvarargs(ce[6]), s.ann2ipl(ann));
1885 IntVarArgs xy = s.arg2intvarargs(ce[0]);
1886 xy << s.arg2IntVar(ce[2]);
1888 argmin(s, xy.slice(0,1,xy.size()-1), ce[1]->getInt(),
1889 xy[xy.size()-1], ce[3]->getBool(), s.ann2ipl(ann));
1893 IntVarArgs xy = s.arg2intvarargs(ce[0]);
1894 xy << s.arg2IntVar(ce[2]);
1896 argmax(s, xy.slice(0,1,xy.size()-1), ce[1]->getInt(),
1897 xy[xy.size()-1], ce[3]->getBool(), s.ann2ipl(ann));
1901 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1902 argmin(s, x, ce[1]->getInt(), s.arg2IntVar(ce[2]),
1903 ce[3]->getBool(), s.ann2ipl(ann));
1907 BoolVarArgs x = s.arg2boolvarargs(ce[0]);
1908 argmax(s, x, ce[1]->getInt(), s.arg2IntVar(ce[2]),
1909 ce[3]->getBool(), s.ann2ipl(ann));
1913 IntVarArgs start = s.arg2intvarargs(ce[0]);
1915 unary(s, start, s.arg2intvarargs(ce[1]), s.arg2intvarargs(ce[2]),
1920 IntVarArgs start = s.arg2intvarargs(ce[0]);
1923 s.arg2intvarargs(ce[1]), s.arg2intvarargs(ce[2]),
1924 s.arg2intargs(ce[3]), s.ann2ipl(ann));
1928 IntVarArgs start = s.arg2intvarargs(ce[0]);
1930 unary(s, start, s.arg2intvarargs(ce[1]), s.arg2intvarargs(ce[2]),
1931 s.arg2boolvarargs(ce[3]), s.ann2ipl(ann));
1936 IntVarArgs start = s.arg2intvarargs(ce[0]);
1938 cumulative(s, s.arg2IntVar(ce[4]), start, s.arg2intvarargs(ce[1]),
1939 s.arg2intvarargs(ce[2]), s.arg2intargs(ce[3]),
1940 s.arg2boolvarargs(ce[5]), s.ann2ipl(ann));
1943 class BuiltinPosters {
1945 BuiltinPosters(
void) {
1947 registry().
add(
"all_different_offset", &p_distinctOffset);
1948 registry().
add(
"gecode_all_different_offset_fzn", &p_distinctOffset);
1969 registry().
add(
"int_lin_eq_reif", &p_int_lin_eq_reif);
1970 registry().
add(
"int_lin_eq_imp", &p_int_lin_eq_imp);
1972 registry().
add(
"int_lin_ne_reif", &p_int_lin_ne_reif);
1973 registry().
add(
"int_lin_ne_imp", &p_int_lin_ne_imp);
1975 registry().
add(
"int_lin_le_reif", &p_int_lin_le_reif);
1976 registry().
add(
"int_lin_le_imp", &p_int_lin_le_imp);
1978 registry().
add(
"int_lin_lt_reif", &p_int_lin_lt_reif);
1979 registry().
add(
"int_lin_lt_imp", &p_int_lin_lt_imp);
1981 registry().
add(
"int_lin_ge_reif", &p_int_lin_ge_reif);
1982 registry().
add(
"int_lin_ge_imp", &p_int_lin_ge_imp);
1984 registry().
add(
"int_lin_gt_reif", &p_int_lin_gt_reif);
1985 registry().
add(
"int_lin_gt_imp", &p_int_lin_gt_imp);
2020 registry().
add(
"array_bool_and", &p_array_bool_and);
2021 registry().
add(
"array_bool_and_imp", &p_array_bool_and_imp);
2022 registry().
add(
"array_bool_or", &p_array_bool_or);
2023 registry().
add(
"array_bool_or_imp", &p_array_bool_or_imp);
2024 registry().
add(
"array_bool_xor", &p_array_bool_xor);
2025 registry().
add(
"array_bool_xor_imp", &p_array_bool_xor_imp);
2026 registry().
add(
"bool_clause", &p_array_bool_clause);
2027 registry().
add(
"bool_clause_reif", &p_array_bool_clause_reif);
2028 registry().
add(
"bool_clause_imp", &p_array_bool_clause_imp);
2032 registry().
add(
"array_int_element", &p_array_int_element);
2033 registry().
add(
"array_var_int_element", &p_array_int_element);
2034 registry().
add(
"gecode_int_element", &p_array_int_element_offset);
2035 registry().
add(
"gecode_var_int_element", &p_array_int_element_offset);
2036 registry().
add(
"gecode_int_element2d", &p_array_int_element2d);
2037 registry().
add(
"array_bool_element", &p_array_bool_element);
2038 registry().
add(
"array_var_bool_element", &p_array_bool_element);
2039 registry().
add(
"gecode_bool_element", &p_array_bool_element_offset);
2040 registry().
add(
"gecode_var_bool_element", &p_array_bool_element_offset);
2041 registry().
add(
"gecode_bool_element2d", &p_array_bool_element2d);
2046#ifndef GECODE_HAS_SET_VARS
2054 registry().
add(
"array_bool_lt", &p_array_bool_lt);
2055 registry().
add(
"array_bool_lq", &p_array_bool_lq);
2064 registry().
add(
"gecode_bin_packing_load", &p_bin_packing_load);
2065 registry().
add(
"gecode_global_cardinality", &p_global_cardinality);
2066 registry().
add(
"gecode_global_cardinality_closed",
2067 &p_global_cardinality_closed);
2069 &p_global_cardinality_low_up);
2070 registry().
add(
"global_cardinality_low_up_closed",
2071 &p_global_cardinality_low_up_closed);
2074 registry().
add(
"gecode_minimum_arg_int_offset", &p_minimum_arg);
2075 registry().
add(
"gecode_maximum_arg_int_offset", &p_maximum_arg);
2076 registry().
add(
"gecode_minimum_arg_bool_offset", &p_minimum_arg_bool);
2077 registry().
add(
"gecode_maximum_arg_bool_offset", &p_maximum_arg_bool);
2080 registry().
add(
"gecode_regular_set", &p_regular_set);
2082 registry().
add(
"inverse_offsets", &p_inverse_offsets);
2083 registry().
add(
"increasing_int", &p_increasing_int);
2084 registry().
add(
"increasing_bool", &p_increasing_bool);
2085 registry().
add(
"decreasing_int", &p_decreasing_int);
2086 registry().
add(
"decreasing_bool", &p_decreasing_bool);
2088 registry().
add(
"gecode_table_int_reif", &p_table_int_reif);
2089 registry().
add(
"gecode_table_int_imp", &p_table_int_imp);
2090 registry().
add(
"gecode_table_bool", &p_table_bool);
2091 registry().
add(
"gecode_table_bool_reif", &p_table_bool_reif);
2092 registry().
add(
"gecode_table_bool_imp", &p_table_bool_imp);
2094 registry().
add(
"gecode_among_seq_int", &p_among_seq_int);
2095 registry().
add(
"gecode_among_seq_bool", &p_among_seq_bool);
2104 registry().
add(
"bool_lin_eq_reif", &p_bool_lin_eq_reif);
2105 registry().
add(
"bool_lin_eq_imp", &p_bool_lin_eq_imp);
2106 registry().
add(
"bool_lin_ne_reif", &p_bool_lin_ne_reif);
2107 registry().
add(
"bool_lin_ne_imp", &p_bool_lin_ne_imp);
2108 registry().
add(
"bool_lin_le_reif", &p_bool_lin_le_reif);
2109 registry().
add(
"bool_lin_le_imp", &p_bool_lin_le_imp);
2110 registry().
add(
"bool_lin_lt_reif", &p_bool_lin_lt_reif);
2111 registry().
add(
"bool_lin_lt_imp", &p_bool_lin_lt_imp);
2112 registry().
add(
"bool_lin_ge_reif", &p_bool_lin_ge_reif);
2113 registry().
add(
"bool_lin_ge_imp", &p_bool_lin_ge_imp);
2114 registry().
add(
"bool_lin_gt_reif", &p_bool_lin_gt_reif);
2115 registry().
add(
"bool_lin_gt_imp", &p_bool_lin_gt_imp);
2117 registry().
add(
"gecode_schedule_unary", &p_schedule_unary);
2118 registry().
add(
"gecode_schedule_unary_optional", &p_schedule_unary_optional);
2119 registry().
add(
"gecode_schedule_cumulative_optional", &p_cumulative_opt);
2122 registry().
add(
"gecode_circuit_cost_array", &p_circuit_cost_array);
2123 registry().
add(
"gecode_circuit_cost", &p_circuit_cost);
2125 registry().
add(
"gecode_nooverlap_fzn", &p_nooverlap);
2130 registry().
add(
"gecode_member_int_reif",&p_member_int_reif);
2132 registry().
add(
"gecode_member_bool_reif",&p_member_bool_reif);
2134 registry().
add(
"gecode_unary_flex", &p_unary_flex);
2135 registry().
add(
"gecode_cumulative_flex", &p_cumulative_flex);
2137 registry().
add(
"gecode_unary_flex_optional", &p_unary_flex_optional);
2138 registry().
add(
"gecode_cumulative_flex_optional", &p_cumulative_flex_optional);
2139 registry().
add(
"gecode_array_int_ne", &p_array_int_ne);
2140 registry().
add(
"gecode_not_all_equal_int", &p_not_all_equal_int);
2141 registry().
add(
"gecode_array_bool_ne", &p_array_bool_ne);
2142 registry().
add(
"gecode_inter_distance", &p_inter_distance);
2143 registry().
add(
"gecode_inter_distance_fzn", &p_inter_distance);
2144 registry().
add(
"gecode_bool_int_channel", &p_bool_int_channel);
2145 registry().
add(
"gecode_sort_permutation", &p_sort_permutation);
2146 registry().
add(
"gecode_count_int_fzn", &p_count_int);
2147 registry().
add(
"gecode_count_matches_fzn", &p_count_matches);
2151 registry().
add(
"gecode_gcd_int_reif", &p_gcd_reif<RM_EQV>);
2152 registry().
add(
"gecode_gcd_int_imp", &p_gcd_reif<RM_IMP>);
2154 registry().
add(
"gecode_divides_int_reif", &p_divides_reif<RM_EQV>);
2155 registry().
add(
"gecode_divides_int_imp", &p_divides_reif<RM_IMP>);
2157 registry().
add(
"gecode_product_int_reif", &p_product_reif<RM_EQV>);
2158 registry().
add(
"gecode_product_int_imp", &p_product_reif<RM_IMP>);
2159 registry().
add(
"gecode_product_mod_fixed_fzn", &p_product_mod<true>);
2160 registry().
add(
"gecode_product_mod_fixed_fzn_reif", &p_product_mod_reif<true,RM_EQV>);
2161 registry().
add(
"gecode_product_mod_fixed_fzn_imp", &p_product_mod_reif<true,RM_IMP>);
2162 registry().
add(
"gecode_product_mod_var_fzn", &p_product_mod<false>);
2163 registry().
add(
"gecode_product_mod_var_fzn_reif", &p_product_mod_reif<false,RM_EQV>);
2164 registry().
add(
"gecode_product_mod_var_fzn_imp", &p_product_mod_reif<false,RM_IMP>);
2165 registry().
add(
"gecode_minimum_distance_fzn", &p_minimum_distance);
2166 registry().
add(
"gecode_minimum_distance_required_fzn", &p_minimum_distance);
2168 registry().
add(
"gecode_nooverlap_optional", &p_nooverlap_optional);
2169 registry().
add(
"gecode_all_different_optional", &p_distinct_optional);
2170 registry().
add(
"gecode_all_different_except", &p_distinct_except);
2171 registry().
add(
"gecode_regular_nfa_int_fzn", &p_regular_nfa_int);
2172 registry().
add(
"gecode_nooverlap_flex_optional", &p_nooverlap_flex);
2173 registry().
add(
"gecode_arg_min_int", &p_arg_min_int);
2174 registry().
add(
"gecode_arg_max_int", &p_arg_max_int);
2175 registry().
add(
"gecode_arg_min_bool", &p_arg_min_bool);
2176 registry().
add(
"gecode_arg_max_bool", &p_arg_max_bool);
2179 registry().
add(
"gecode_blackbox_bounds", &p_blackbox_bounds);
2181#ifdef GECODE_HAS_SET_VARS
2184#ifdef GECODE_HAS_FLOAT_VARS
2189 BuiltinPosters builtin_posters;
iterator end(void)
Return an iterator past the end of the array.
int size(void) const
Return size of array (number of elements).
static DFA nfa(int s, Transition t[], int f[])
Construct a nondeterministic finite automaton.
Node representing a function call
A node in a FlatZinc abstract syntax tree.
static BlackBoxContextHandle & context(FlatZincSpace &s)
Abstract representation of a constraint.
std::string id
Identifier for the constraint.
AST::Array * ann
Constraint annotations.
Exception class for FlatZinc errors
A space that can be initialized with a FlatZinc model.
IntVarArgs arg2intvarargs(AST::Node *arg, int offset=0)
Convert arg to IntVarArgs.
IntVar arg2IntVar(AST::Node *n)
Convert n to IntVar.
IntSet arg2intset(AST::Node *n)
Convert n to IntSet.
IntPropLevel ann2ipl(AST::Node *ann)
Convert ann to integer propagation level.
BoolVar arg2BoolVar(AST::Node *n)
Convert n to BoolVar.
Map from constraint identifier to constraint posting functions.
void(* poster)(FlatZincSpace &, const ConExpr &, AST::Node *)
Type of constraint posting function.
void add(const std::string &id, poster p)
Add posting function p with identifier id.
void post(FlatZincSpace &s, const ConExpr &ce)
Post constraint specified by ce.
FloatNum size(void) const
Return size of float value (distance between maximum and minimum).
void * ralloc(size_t s)
Allocate s bytes from heap.
Passing integer arguments.
Range iterator for integer sets.
int min(int i) const
Return minimum of range at position i.
int max(int i) const
Return maximum of range at position i.
unsigned int size(void) const
Return size (cardinality) of set.
Passing integer variables.
Range iterator for computing intersection (binary).
Range iterator for singleton range.
Reification specification.
Heap heap
The single global heap.
void linear(Home home, const FloatVarArgs &x, FloatRelType frt, FloatVal c)
Post propagator for .
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
void ite(Home home, BoolVar b, FloatVar x, FloatVar y, FloatVar z)
Post propagator for if-then-else constraint.
void binpacking(Home home, const IntVarArgs &l, const IntVarArgs &b, const IntArgs &s, IntPropLevel ipl=IPL_DEF)
Post propagator for bin packing.
void extensional(Home home, const IntVarArgs &x, DFA d, IntPropLevel ipl=IPL_DEF)
Post domain consistent propagator for extensional constraint described by a DFA.
void nooverlap(Home home, const IntVarArgs &x, const IntArgs &w, const IntVarArgs &y, const IntArgs &h, IntPropLevel ipl=IPL_DEF)
Post propagator for rectangle packing.
void precede(Home home, const IntVarArgs &x, int s, int t, IntPropLevel=IPL_DEF)
Post propagator that s precedes t in x.
void clause(Home home, BoolOpType o, const BoolVarArgs &x, const BoolVarArgs &y, BoolVar z, IntPropLevel ipl=IPL_DEF)
Post domain consistent propagator for Boolean clause with positive variables x and negative variables...
void product(Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF)
Constrain y to the exact product of the variables in x.
IntRelType
Relation types for integers.
ReifyMode
Mode for reification.
void product_mod(Home home, const IntVarArgs &x, int m, IntVar y, IntPropLevel ipl=IPL_DEF)
Constrain y to the product of x modulo m.
IntPropLevel
Propagation levels for integer propagators.
@ IRT_GQ
Greater or equal ( ).
@ IRT_LQ
Less or equal ( ).
@ RM_IMP
Implication for reification.
@ RM_EQV
Equivalence for reification (default).
@ IPL_DOM
Domain propagation Options: basic versus advanced propagation.
@ IPL_DEF
Simple propagation levels.
@ IPL_BND
Bounds propagation.
void post_int_in_imp(FlatZincSpace &s, const ConExpr &ce, AST::Node *ann)
void register_set(Registry &r)
void register_float(Registry &r)
void post_int_in_reif(FlatZincSpace &s, const ConExpr &ce, AST::Node *ann)
void post_cumulatives(FlatZincSpace &s, const ConExpr &ce, AST::Node *ann)
Interpreter for the FlatZinc language.
Registry & registry(void)
Return global registry object.
void blackbox_bounds(Home home, BlackBoxContextHandle &context, const IntVarArgs &ivar, const FloatVarArgs &fvar, const std::string &mode, const std::string &target, const std::vector< std::string > &args, const std::vector< int > &reason)
void blackbox(Home home, BlackBoxContextHandle &context, const IntVarArgs &int_in, const IntVarArgs &int_out, const FloatVarArgs &float_in, const FloatVarArgs &float_out, const std::string &mode, const std::string &target, const std::vector< std::string > &args)
const int min
Smallest allowed integer value.
const int max
Largest allowed integer value.
ExecStatus assigned(Space &home, const ViewArray< IntView > &x, IntView z, const IntDistance &d, const IntSharedArray &r)
Validate and bind a complete assignment.
ExecStatus zero(Space &home, const ViewArray< IntView > &x, const IntDistance &d, const IntSharedArray &r, bool &changed, bool &realized)
Enforce an actual zero-distance witness when the objective is zero.
Gecode toplevel namespace
ArgArray< IntSet > IntSetArgs
Passing set arguments.
void count(Home home, const IntVarArgs &x, int n, IntRelType irt, int m, IntPropLevel ipl=IPL_DEF)
Post propagator for .
void channel(Home home, FloatVar x0, IntVar x1)
Post propagator for channeling a float and an integer variable .
void mod(Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF)
Post propagator for .
void sequence(Home home, const IntVarArgs &x, const IntSet &s, int q, int l, int u, IntPropLevel ipl=IPL_DEF)
Post propagator for .
SharedArray< int > IntSharedArray
Arrays of integers that can be shared among several element constraints.
IntVar expr(Home home, const LinIntExpr &e, const IntPropLevels &ipls=IntPropLevels::def)
Post linear expression and return its value.
void sorted(Home home, const IntVarArgs &x, const IntVarArgs &y, IntPropLevel ipl=IPL_DEF)
Post propagator that y is x sorted in increasing order.
void divides(Home home, IntVar divisor, IntVar dividend, Reify r, IntPropLevel ipl=IPL_DEF)
Reify whether divisor divides dividend.
void distinct(Home home, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF)
Post propagator for for all .
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
IntRelType neg(IntRelType irt)
Return negated relation type of irt.
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
void abs(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
void div(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
void element(Home home, IntSharedArray n, IntVar x0, IntVar x1, IntPropLevel ipl=IPL_DEF)
Post domain consistent propagator for .
void argmax(Home home, const IntVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF)
Post propagator for .
void mult(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
IntRelType swap(IntRelType irt)
Return swapped relation type of irt.
void cumulative(Home home, int c, const TaskTypeArgs &t, const IntVarArgs &flex, const IntArgs &fix, const IntArgs &u, IntPropLevel ipl=IPL_DEF)
Post propagators for scheduling tasks on cumulative resources.
void inter_distance(Home home, const IntVarArgs &x, int p, IntPropLevel ipl=IPL_DEF)
Post bounds-consistent propagator for for all .
void minimum_distance(Home home, const IntVarArgs &x, IntVar z, const IntDistance &d, IntPropLevel ipl=IPL_DEF, MinDistancePropKind kind=MDP_SINGLE)
Post .
void unshare(Home home, IntVarArgs &x, IntPropLevel ipl=IPL_DEF)
Replace multiple variable occurrences in x by fresh variables.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
MinDistancePropKind
Organization of forward-bound minimum-distance propagation.
@ MDP_SINGLE
One propagator with advisors and cached pair maxima.
@ MDP_DECOMPOSED
One propagator per selected-position pair.
void argmin(Home home, const IntVarArgs &x, IntVar y, bool tiebreak=true, IntPropLevel ipl=IPL_DEF)
Post propagator for .
void nvalues(Home home, const IntVarArgs &x, IntRelType irt, int y, IntPropLevel ipl=IPL_DEF)
Post propagator for .
void unary(Home home, const IntVarArgs &s, const IntArgs &p, IntPropLevel ipl=IPL_DEF)
Post propagators for scheduling tasks on unary resources.
void member(Home home, const IntVarArgs &x, IntVar y, IntPropLevel ipl=IPL_DEF)
Post domain consistent propagator for .
void pow(Home home, FloatVar x0, int n, FloatVar x1)
Post propagator for for .
void circuit(Home home, const IntVarArgs &x, IntPropLevel ipl=IPL_DEF)
Post propagator such that x forms a circuit.
void nroot(Home home, FloatVar x0, int n, FloatVar x1)
Post propagator for for .
void gcd(Home home, IntVar x0, IntVar x1, IntVar x2, IntPropLevel ipl=IPL_DEF)
Post propagator for .
Gecode::FloatVal b(9, 12)
Gecode::FloatVal a(-8, 5)
bool one(const Gecode::FloatValArgs &a)
Check whether has only one coefficients.
Gecode::IntArgs i({1, 2, 3, 4})
#define BOOL_ARRAY_OP(op)
#define GECODE_HAS_FLOAT_VARS