54#include <unordered_set>
60 template<>
struct hash<
Gecode::TupleSet> {
69 template<>
struct hash<
Gecode::SharedArray<int> > {
73 size_t seed =
static_cast<size_t>(x.
size());
74 for (
int i=x.
size(); i--; )
81 template<>
struct hash<
Gecode::DFA> {
150 virtual size_t size(
void)
const {
164#ifdef GECODE_HAS_SET_VARS
168#ifdef GECODE_HAS_FLOAT_VARS
176 if (
done)
return false;
182#ifdef GECODE_HAS_SET_VARS
186#ifdef GECODE_HAS_FLOAT_VARS
200#ifdef GECODE_HAS_SET_VARS
203#ifdef GECODE_HAS_FLOAT_VARS
210 return new Choice(*
this,
false);
212 return new Choice(*
this,
true);
217 bool fail; e >> fail;
218 return new Choice(*
this, fail);
227 std::ostream& o)
const {
229 << (
static_cast<const Choice&
>(c).
fail ?
"fail" :
"ok")
265 return sizeof(*this);
274 std::vector<std::string> n;
275 BI(
void) : r0(
""), r1(
""), n(0) {}
276 BI(
const std::string& r00,
const std::string& r10,
277 const std::vector<std::string>& n0)
278 : r0(r00), r1(r10), n(n0) {}
290 const std::string& rel0,
291 const std::string& rel1,
292 const std::vector<std::string>& n) {
293 v.resize(std::max(
static_cast<unsigned int>(v.size()),bg.
id()+1));
294 v[bg.
id()] = BI(rel0,rel1,n);
298 unsigned int a,
int i,
int n, std::ostream& o)
const {
299 const BI& bi = v[b.group().id()];
300 o << bi.n[i] <<
" " << (a==0 ? bi.r0 : bi.r1) <<
" " << n;
302#ifdef GECODE_HAS_FLOAT_VARS
305 std::ostream& o)
const {
306 const BI& bi = v[b.group().id()];
308 << (((a == 0) == nl.
l) ?
"<=" :
">=") << nl.
n;
321 assert(
object() ==
nullptr);
327 const std::string& rel0,
328 const std::string& rel1,
329 const std::vector<std::string>& n) {
334 int n, std::ostream& o)
const {
337#ifdef GECODE_HAS_FLOAT_VARS
347 Var,
int i,
const int& n,
352#ifdef GECODE_HAS_FLOAT_VARS
370 int* newdom =
heap.alloc<
int>(
static_cast<unsigned long int>(sl->
s.size()));
371 for (
int i=sl->
s.size(); i--;)
372 newdom[i] = sl->
s[i];
373 IntSet ret(newdom, sl->
s.size());
374 heap.free(newdom,
static_cast<unsigned long int>(sl->
s.size()));
388 return std::min(1, std::max(0, sl->
min));
400 return std::max(0, std::min(1, sl->
max));
407 if (s->id ==
"input_order")
409 if (s->id ==
"first_fail")
411 if (s->id ==
"anti_first_fail")
413 if (s->id ==
"smallest")
415 if (s->id ==
"largest")
417 if (s->id ==
"occurrence")
419 if (s->id ==
"max_regret")
421 if (s->id ==
"most_constrained")
424 if (s->id ==
"random") {
427 if (s->id ==
"dom_w_deg") {
430 if (s->id ==
"afc_min")
432 if (s->id ==
"afc_max")
434 if (s->id ==
"afc_size_min")
436 if (s->id ==
"afc_size_max") {
439 if (s->id ==
"action_min")
441 if (s->id ==
"action_max")
443 if (s->id ==
"action_size_min")
445 if (s->id ==
"action_size_max")
448 std::cerr <<
"Warning, ignored search annotation: ";
449 ann->
print(std::cerr);
450 std::cerr << std::endl;
457 if (s->id ==
"indomain_min") {
461 if (s->id ==
"indomain_max") {
465 if (s->id ==
"indomain_median") {
469 if (s->id ==
"indomain_split") {
473 if (s->id ==
"indomain_reverse_split") {
477 if (s->id ==
"indomain_random") {
481 if (s->id ==
"indomain") {
485 if (s->id ==
"indomain_middle") {
486 std::cerr <<
"Warning, replacing unsupported annotation "
487 <<
"indomain_middle with indomain_median" << std::endl;
491 if (s->id ==
"indomain_interval") {
492 std::cerr <<
"Warning, replacing unsupported annotation "
493 <<
"indomain_interval with indomain_split" << std::endl;
498 std::cerr <<
"Warning, ignored search annotation: ";
499 ann->
print(std::cerr);
500 std::cerr << std::endl;
507 if (s->id ==
"indomain_min")
509 if (s->id ==
"indomain_max")
511 if (s->id ==
"indomain_median")
513 if (s->id ==
"indomain_random") {
517 std::cerr <<
"Warning, ignored search annotation: ";
518 ann->
print(std::cerr);
519 std::cerr << std::endl;
525 if ((s->id ==
"input_order") ||
526 (s->id ==
"first_fail") ||
527 (s->id ==
"anti_first_fail") ||
528 (s->id ==
"smallest") ||
529 (s->id ==
"largest") ||
530 (s->id ==
"max_regret"))
532 if ((s->id ==
"occurrence") ||
533 (s->id ==
"most_constrained"))
535 if (s->id ==
"random")
537 if ((s->id ==
"afc_min") ||
538 (s->id ==
"afc_size_min"))
540 if ((s->id ==
"afc_max") ||
541 (s->id ==
"afc_size_max") ||
542 (s->id ==
"dom_w_deg"))
544 if ((s->id ==
"action_min") &&
545 (s->id ==
"action_size_min"))
547 if ((s->id ==
"action_max") ||
548 (s->id ==
"action_size_max"))
551 std::cerr <<
"Warning, ignored search annotation: ";
552 ann->
print(std::cerr);
553 std::cerr << std::endl;
560 if (s->id ==
"indomain_min") {
564 if (s->id ==
"indomain_max") {
568 if (s->id ==
"indomain_median") {
572 if (s->id ==
"indomain_split") {
576 if (s->id ==
"indomain_reverse_split") {
580 if (s->id ==
"indomain_random") {
584 if (s->id ==
"indomain") {
588 if (s->id ==
"indomain_middle") {
589 std::cerr <<
"Warning, replacing unsupported annotation "
590 <<
"indomain_middle with indomain_median" << std::endl;
594 if (s->id ==
"indomain_interval") {
595 std::cerr <<
"Warning, replacing unsupported annotation "
596 <<
"indomain_interval with indomain_split" << std::endl;
601 std::cerr <<
"Warning, ignored search annotation: ";
602 ann->
print(std::cerr);
603 std::cerr << std::endl;
610 if ((s->id ==
"indomain_min") ||
611 (s->id ==
"indomain_median"))
613 if (s->id ==
"indomain_max")
615 if (s->id ==
"indomain_random") {
619 std::cerr <<
"Warning, ignored search annotation: ";
620 ann->
print(std::cerr);
621 std::cerr << std::endl;
625#ifdef GECODE_HAS_SET_VARS
628 if (s->id ==
"input_order")
630 if (s->id ==
"first_fail")
632 if (s->id ==
"anti_first_fail")
634 if (s->id ==
"smallest")
636 if (s->id ==
"largest")
638 if (s->id ==
"afc_min")
640 if (s->id ==
"afc_max")
642 if (s->id ==
"afc_size_min")
644 if (s->id ==
"afc_size_max")
646 if (s->id ==
"action_min")
648 if (s->id ==
"action_max")
650 if (s->id ==
"action_size_min")
652 if (s->id ==
"action_size_max")
654 if (s->id ==
"random") {
658 std::cerr <<
"Warning, ignored search annotation: ";
659 ann->
print(std::cerr);
660 std::cerr << std::endl;
668 if (s->id ==
"indomain_min") {
669 r0 =
"in"; r1 =
"not in";
672 if (s->id ==
"indomain_max") {
673 r0 =
"in"; r1 =
"not in";
676 if (s->id ==
"outdomain_min") {
677 r1 =
"in"; r0 =
"not in";
680 if (s->id ==
"outdomain_max") {
681 r1 =
"in"; r0 =
"not in";
685 std::cerr <<
"Warning, ignored search annotation: ";
686 ann->
print(std::cerr);
687 std::cerr << std::endl;
688 r0 =
"in"; r1 =
"not in";
693#ifdef GECODE_HAS_FLOAT_VARS
697 if (s->id ==
"input_order")
699 if (s->id ==
"first_fail")
701 if (s->id ==
"anti_first_fail")
703 if (s->id ==
"smallest")
705 if (s->id ==
"largest")
707 if (s->id ==
"occurrence")
709 if (s->id ==
"most_constrained")
712 if (s->id ==
"random") {
715 if (s->id ==
"afc_min")
717 if (s->id ==
"afc_max")
719 if (s->id ==
"afc_size_min")
721 if (s->id ==
"afc_size_max")
723 if (s->id ==
"action_min")
725 if (s->id ==
"action_max")
727 if (s->id ==
"action_size_min")
729 if (s->id ==
"action_size_max")
732 std::cerr <<
"Warning, ignored search annotation: ";
733 ann->
print(std::cerr);
734 std::cerr << std::endl;
740 if (s->id ==
"indomain_split") {
744 if (s->id ==
"indomain_reverse_split") {
749 std::cerr <<
"Warning, ignored search annotation: ";
750 ann->
print(std::cerr);
751 std::cerr << std::endl;
798 iv.update(*
this, f.iv);
799 iv_lns.update(*
this, f.iv_lns);
812 for (
int i=0; i<f.iv_aux.size(); i++) {
813 if (!f.iv_aux[i].assigned()) {
815 iva[iva.
size()-1].update(*
this, f.iv_aux[i]);
821 bv.update(*
this, f.bv);
825 for (
int i=0; i<f.bv_aux.size(); i++) {
826 if (!f.bv_aux[i].assigned()) {
828 bva[bva.
size()-1].update(*
this, f.bv_aux[i]);
834#ifdef GECODE_HAS_SET_VARS
835 sv.update(*
this, f.sv);
839 for (
int i=0; i<f.sv_aux.size(); i++) {
840 if (!f.sv_aux[i].assigned()) {
842 sva[sva.
size()-1].update(*
this, f.sv_aux[i]);
848#ifdef GECODE_HAS_FLOAT_VARS
849 fv.update(*
this, f.fv);
853 for (
int i=0; i<f.fv_aux.size(); i++) {
854 if (!f.fv_aux[i].assigned()) {
856 fva[fva.
size()-1].update(*
this, f.fv_aux[i]);
885 int setVars,
int floatVars) {
896#ifdef GECODE_HAS_SET_VARS
901#ifdef GECODE_HAS_FLOAT_VARS
946#ifdef GECODE_HAS_SET_VARS
958 int* is =
heap.alloc<
int>(
static_cast<unsigned long int>(vsv->
s.size()));
959 for (
int i=vsv->
s.size(); i--; )
962 heap.free(is,
static_cast<unsigned long int>(vsv->
s.size()));
971 int* is =
heap.alloc<
int>(
static_cast<unsigned long int>(vsv->
s.size()));
972 for (
int i=vsv->
s.size(); i--; )
975 heap.free(is,
static_cast<unsigned long int>(vsv->
s.size()));
993#ifdef GECODE_HAS_FLOAT_VARS
1024 struct ConExprOrder {
1025 bool operator() (ConExpr* ce0, ConExpr* ce1) {
1026 return ce0->args->a.size() < ce1->args->a.size();
1034 std::sort(ces.begin(), ces.end(), ceo);
1036 for (
unsigned int i=0; i<ces.
size(); i++) {
1051 for (
unsigned int i=0; i<ann->
a.size(); i++) {
1052 if (ann->
a[i]->isCall(
"seq_search")) {
1054 if (c->args->isArray())
1057 out.push_back(c->args);
1059 out.push_back(ann->
a[i]);
1067 std::ostream& err) {
1068 int seed = opt.
seed();
1069 double decay = opt.decay();
1070 Rnd rnd(
static_cast<unsigned int>(seed));
1074 std::string def_int_rel_left =
"=";
1075 std::string def_int_rel_right =
"!=";
1078 std::string def_bool_rel_left =
"=";
1079 std::string def_bool_rel_right =
"!=";
1080#ifdef GECODE_HAS_SET_VARS
1083 std::string def_set_rel_left =
"in";
1084 std::string def_set_rel_right =
"not in";
1086#ifdef GECODE_HAS_FLOAT_VARS
1089 std::string def_float_rel_left =
"<=";
1090 std::string def_float_rel_right =
">";
1093 std::vector<bool> iv_searched(
iv.size());
1094 for (
unsigned int i=
iv.size(); i--;)
1095 iv_searched[i] =
false;
1096 std::vector<bool> bv_searched(
bv.size());
1097 for (
unsigned int i=
bv.size(); i--;)
1098 bv_searched[i] =
false;
1099#ifdef GECODE_HAS_SET_VARS
1100 std::vector<bool> sv_searched(
sv.size());
1101 for (
unsigned int i=
sv.size(); i--;)
1102 sv_searched[i] =
false;
1104#ifdef GECODE_HAS_FLOAT_VARS
1105 std::vector<bool> fv_searched(
fv.size());
1106 for (
unsigned int i=
fv.size(); i--;)
1107 fv_searched[i] =
false;
1112 std::vector<AST::Node*> flatAnn;
1116 flatAnn.push_back(ann);
1119 for (
unsigned int i=0; i<flatAnn.
size(); i++) {
1120 if (flatAnn[i]->isCall(
"restart_geometric")) {
1124 opt.restart_base(args->
a[0]->getFloat());
1125 opt.restart_scale(args->
a[1]->getInt());
1126 }
else if (flatAnn[i]->isCall(
"restart_luby")) {
1130 }
else if (flatAnn[i]->isCall(
"restart_linear")) {
1134 }
else if (flatAnn[i]->isCall(
"restart_constant")) {
1138 }
else if (flatAnn[i]->isCall(
"restart_none")) {
1140 }
else if (flatAnn[i]->isCall(
"relax_and_reconstruct")) {
1143 "Only one relax_and_reconstruct annotation allowed");
1151 _lns = args->
a[1]->getInt();
1153 int k=vars->
a.size();
1154 for (
int i=vars->
a.size(); i--;)
1155 if (vars->
a[i]->isInt())
1159 for (
unsigned int i=0; i<vars->
a.size(); i++) {
1160 if (vars->
a[i]->isInt())
1162 iv_lns[k++] =
iv[vars->
a[i]->getIntVar()];
1164 if (args->
a.size()==3) {
1167 for (
unsigned int i=initial->
a.size(); i--;)
1170 }
else if (flatAnn[i]->isCall(
"gecode_search")) {
1172 branchWithPlugin(
c->args);
1173 }
else if (flatAnn[i]->isCall(
"int_search")) {
1177 int k=vars->
a.size();
1178 for (
int i=vars->
a.size(); i--;)
1179 if (vars->
a[i]->isInt())
1182 std::vector<std::string> names;
1184 for (
unsigned int i=0; i<vars->
a.size(); i++) {
1185 if (vars->
a[i]->isInt())
1187 va[k++] =
iv[vars->
a[i]->getIntVar()];
1188 iv_searched[vars->
a[i]->getIntVar()] =
true;
1189 names.push_back(vars->
a[i]->getVarName());
1201 }
else if (flatAnn[i]->isCall(
"int_assign")) {
1205 int k=vars->
a.size();
1206 for (
int i=vars->
a.size(); i--;)
1207 if (vars->
a[i]->isInt())
1211 for (
unsigned int i=0; i<vars->
a.size(); i++) {
1212 if (vars->
a[i]->isInt())
1214 va[k++] =
iv[vars->
a[i]->getIntVar()];
1215 iv_searched[vars->
a[i]->getIntVar()] =
true;
1219 }
else if (flatAnn[i]->isCall(
"bool_search")) {
1223 int k=vars->
a.size();
1224 for (
int i=vars->
a.size(); i--;)
1225 if (vars->
a[i]->isBool())
1229 std::vector<std::string> names;
1230 for (
unsigned int i=0; i<vars->
a.size(); i++) {
1231 if (vars->
a[i]->isBool())
1233 va[k++] =
bv[vars->
a[i]->getBoolVar()];
1234 bv_searched[vars->
a[i]->getBoolVar()] =
true;
1235 names.push_back(vars->
a[i]->getVarName());
1248 }
else if (flatAnn[i]->isCall(
"int_default_search")) {
1253 def_int_rel_left,def_int_rel_right,rnd);
1254 }
else if (flatAnn[i]->isCall(
"bool_default_search")) {
1259 def_bool_rel_left,def_bool_rel_right,
1261 }
else if (flatAnn[i]->isCall(
"set_search")) {
1262#ifdef GECODE_HAS_SET_VARS
1266 int k=vars->
a.size();
1267 for (
int i=vars->
a.size(); i--;)
1268 if (vars->
a[i]->isSet())
1272 std::vector<std::string> names;
1273 for (
unsigned int i=0; i<vars->
a.size(); i++) {
1274 if (vars->
a[i]->isSet())
1276 va[k++] =
sv[vars->
a[i]->getSetVar()];
1277 sv_searched[vars->
a[i]->getSetVar()] =
true;
1278 names.push_back(vars->
a[i]->getVarName());
1291 if (!ignoreUnknown) {
1292 err <<
"Warning, ignored search annotation: ";
1293 flatAnn[i]->print(err);
1297 }
else if (flatAnn[i]->isCall(
"set_default_search")) {
1298#ifdef GECODE_HAS_SET_VARS
1303 def_set_rel_left,def_set_rel_right,rnd);
1305 if (!ignoreUnknown) {
1306 err <<
"Warning, ignored search annotation: ";
1307 flatAnn[i]->print(err);
1311 }
else if (flatAnn[i]->isCall(
"float_default_search")) {
1312#ifdef GECODE_HAS_FLOAT_VARS
1317 def_float_rel_left,def_float_rel_right);
1319 if (!ignoreUnknown) {
1320 err <<
"Warning, ignored search annotation: ";
1321 flatAnn[i]->print(err);
1325 }
else if (flatAnn[i]->isCall(
"float_search")) {
1326#ifdef GECODE_HAS_FLOAT_VARS
1330 int k=vars->
a.size();
1331 for (
int i=vars->
a.size(); i--;)
1332 if (vars->
a[i]->isFloat())
1336 std::vector<std::string> names;
1337 for (
unsigned int i=0; i<vars->
a.size(); i++) {
1338 if (vars->
a[i]->isFloat())
1340 va[k++] =
fv[vars->
a[i]->getFloatVar()];
1341 fv_searched[vars->
a[i]->getFloatVar()] =
true;
1342 names.push_back(vars->
a[i]->getVarName());
1355 if (!ignoreUnknown) {
1356 err <<
"Warning, ignored search annotation: ";
1357 flatAnn[i]->print(err);
1362 if (!ignoreUnknown) {
1363 err <<
"Warning, ignored search annotation: ";
1364 flatAnn[i]->print(err);
1373 for (
int i=
iv.size(); i--;) {
1384 std::vector<std::string> iv_sol_names(
iv.size()-(introduced+funcdep+searched));
1385 IntVarArgs iv_sol(
iv.size()-(introduced+funcdep+searched));
1386 std::vector<std::string> iv_tmp_names(introduced);
1388 for (
int i=
iv.size(), j=0, k=0; i--;) {
1393 iv_tmp_names[j] =
p.intVarName(i);
1394 iv_tmp[j++] =
iv[i];
1397 iv_sol_names[k] =
p.intVarName(i);
1398 iv_sol[k++] =
iv[i];
1405 for (
int i=
bv.size(); i--;) {
1406 if (bv_searched[i]) {
1416 std::vector<std::string> bv_sol_names(
bv.size()-(introduced+funcdep+searched));
1417 BoolVarArgs bv_sol(
bv.size()-(introduced+funcdep+searched));
1419 std::vector<std::string> bv_tmp_names(introduced);
1420 for (
int i=
bv.size(), j=0, k=0; i--;) {
1425 bv_tmp_names[j] =
p.boolVarName(i);
1426 bv_tmp[j++] =
bv[i];
1429 bv_sol_names[k] =
p.boolVarName(i);
1430 bv_sol[k++] =
bv[i];
1434 if (iv_sol.
size() > 0 && bv_sol.
size() > 0) {
1435 branch(*
this, iv_sol, bv_sol, def_intbool_varsel, def_int_valsel);
1436 }
else if (iv_sol.
size() > 0) {
1438 branch(bg(*
this), iv_sol, def_int_varsel, def_int_valsel,
nullptr,
1440 branchInfo.add(bg,def_int_rel_left,def_int_rel_right,iv_sol_names);
1441 }
else if (bv_sol.
size() > 0) {
1443 branch(bg(*
this), bv_sol, def_bool_varsel, def_bool_valsel,
nullptr,
1445 branchInfo.add(bg,def_bool_rel_left,def_bool_rel_right,bv_sol_names);
1447#ifdef GECODE_HAS_FLOAT_VARS
1451 for (
int i=
fv.size(); i--;) {
1462 std::vector<std::string> fv_sol_names(
fv.size()-(introduced+funcdep+searched));
1465 std::vector<std::string> fv_tmp_names(introduced);
1466 for (
int i=
fv.size(), j=0, k=0; i--;) {
1471 fv_tmp_names[j] =
p.floatVarName(i);
1472 fv_tmp[j++] =
fv[i];
1475 fv_sol_names[k] =
p.floatVarName(i);
1476 fv_sol[k++] =
fv[i];
1480 if (fv_sol.
size() > 0) {
1482 branch(bg(*
this), fv_sol, def_float_varsel, def_float_valsel,
nullptr,
1484 branchInfo.add(bg,def_float_rel_left,def_float_rel_right,fv_sol_names);
1487#ifdef GECODE_HAS_SET_VARS
1491 for (
int i=
sv.size(); i--;) {
1492 if (sv_searched[i]) {
1502 std::vector<std::string> sv_sol_names(
sv.size()-(introduced+funcdep+searched));
1503 SetVarArgs sv_sol(
sv.size()-(introduced+funcdep+searched));
1505 std::vector<std::string> sv_tmp_names(introduced);
1506 for (
int i=
sv.size(), j=0, k=0; i--;) {
1511 sv_tmp_names[j] =
p.setVarName(i);
1512 sv_tmp[j++] =
sv[i];
1515 sv_sol_names[k] =
p.setVarName(i);
1516 sv_sol[k++] =
sv[i];
1520 if (sv_sol.
size() > 0) {
1522 branch(bg(*
this), sv_sol, def_set_varsel, def_set_valsel,
nullptr,
1524 branchInfo.add(bg,def_set_rel_left,def_set_rel_right,sv_sol_names);
1531#ifdef GECODE_HAS_SET_VARS
1535#ifdef GECODE_HAS_FLOAT_VARS
1543 def_bool_varsel, def_bool_valsel
1545 , def_set_varsel, def_set_valsel
1548 , def_float_varsel, def_float_valsel
1554 branch(bg(*
this),
iv_aux,def_int_varsel,def_int_valsel,
nullptr,
1556 branchInfo.add(bg,def_int_rel_left,def_int_rel_right,iv_tmp_names);
1560 branch(bg(*
this),
bv_aux,def_bool_varsel,def_bool_valsel,
nullptr,
1562 branchInfo.add(bg,def_bool_rel_left,def_bool_rel_right,bv_tmp_names);
1564 #ifdef GECODE_HAS_SET_VARS
1567 branch(bg(*
this),
sv_aux,def_set_varsel,def_set_valsel,
nullptr,
1569 branchInfo.add(bg,def_set_rel_left,def_set_rel_right,sv_tmp_names);
1572 #ifdef GECODE_HAS_FLOAT_VARS
1575 branch(bg(*
this),
fv_aux,def_float_varsel,def_float_valsel,
nullptr,
1577 branchInfo.add(bg,def_float_rel_left,def_float_rel_right,fv_tmp_names);
1586 std::vector<std::string> names(1);
1593#ifdef GECODE_HAS_FLOAT_VARS
1594 std::vector<std::string> names(1);
1595 names[0] =
p.floatVarName(
_optVar);
1604 std::vector<std::string> names(1);
1611#ifdef GECODE_HAS_FLOAT_VARS
1612 std::vector<std::string> names(1);
1613 names[0] =
p.floatVarName(
_optVar);
1656#ifdef GECODE_HAS_GIST
1661 template<
class Engine>
1666 template<
typename S>
1672 o.
c_d = opt.c_d(); o.
a_d = opt.a_d();
1680 template<
typename S>
1686 o.
c_d = opt.c_d(); o.
a_d = opt.a_d();
1748 dynamic_cast<const S&
>(s0).
compare(
dynamic_cast<const S&
>(s1),
1786 template<
template<
class>
class Engine>
1788 FlatZincSpace::runEngine(std::ostream& out,
const Printer& p,
1791 runMeta<Engine,Driver::EngineToMeta>(out,
p,opt,t_total);
1793 runMeta<Engine,RBS>(out,
p,opt,t_total);
1797#ifdef GECODE_HAS_CPPROFILER
1805 std::stringstream ss;
1807 ss <<
"{\n\t\"domains\": \"";
1808 ss << fz_space->getDomains(
p);
1819 os <<
"int: " << name <<
" = " << x.
val() <<
";";
1820 }
else if (x.
range()) {
1821 os << x.
min() <<
".." << x.
max() <<
": " << name <<
";";
1823 os <<
"array_union([";
1826 os << r.min() <<
".." << r.max();
1831 os <<
"]): " << name <<
";";
1836 os <<
"var bool: " << name;
1838 os <<
" = " << (b.val() ?
"true" :
"false");
1841#ifdef GECODE_HAS_FLOAT_VARS
1845 os <<
"float: " << name <<
" = " << f.med() <<
";";
1847 os << f.min() <<
".." << f.max() <<
": " << name <<
";";
1852 std::ostringstream oss;
1854 for (
int i = 0; i <
iv.size(); i++)
1857 for (
int i = 0; i <
bv.size(); i++)
1860#ifdef GECODE_HAS_FLOAT_VARS
1861 for (
int i = 0; i <
fv.size(); i++)
1864#ifdef GECODE_HAS_SET_VARS
1865 for (
int i = 0; i <
sv.size(); i++)
1866 oss <<
"var " <<
sv[i] <<
": " <<
p.setVarName(i) <<
";" << std::endl;
1874 template<
template<
class>
class Engine,
1875 template<
class,
template<
class>
class>
class Meta>
1878 const FlatZincOptions& opt, Support::Timer& t_total) {
1879#ifdef GECODE_HAS_FLOAT_VARS
1882#ifdef GECODE_HAS_GIST
1889 (void)
GistEngine<Engine<FlatZincSpace> >::explore(
this,opt,&
pi,&pc);
1895 unsigned int n_p = 0;
1901 BlackBoxContextHandle& black_box_context = BlackBoxAccess::context(*
this);
1902 black_box_context.rethrow();
1904 std::unique_ptr<Search::Stop> stop(
1905 Driver::CombinedStop::create(opt.node(), opt.fail(), opt.time(),
1906 opt.restart_limit(),
true));
1907 if (black_box_context) {
1908 stop.reset(
new FlatZincStop(stop.release(), black_box_context));
1910 o.stop =
stop.get();
1911 std::unique_ptr<SearchTracer> tracer;
1915#ifdef GECODE_HAS_CPPROFILER
1916 if (
opt.profiler_port()) {
1917 FlatZincGetInfo* getInfo =
nullptr;
1918 if (
opt.profiler_info())
1919 getInfo =
new FlatZincGetInfo(p);
1920 tracer.reset(
new CPProfilerSearchTracer(
opt.profiler_id(),
1921 opt.name(),
opt.profiler_port(),
1923 o.tracer = tracer.get();
1929 o.nogoods_limit =
opt.nogoods() ?
opt.nogoods_limit() : 0;
1930 if (
opt.restart() != RM_NONE)
1931 o.cutoff =
new Search::CutoffAppend(
new Search::CutoffConstant(0), 1,
1932 Driver::createCutoff(opt));
1933 int noOfSolutions =
opt.solutions();
1934 if (noOfSolutions == -1) {
1935 noOfSolutions = (_method == SAT) ? 1 : 0;
1937 bool printAll = _method == SAT ||
opt.allSolutions() || noOfSolutions != 0;
1938 int findSol = noOfSolutions;
1939 bool solution_limit_reached =
false;
1940 bool engine_stopped =
false;
1941 Gecode::Search::Statistics stat;
1942 std::unique_ptr<FlatZincSpace> sol;
1944 InterruptHandlerGuard interrupt_handler(
opt.interrupt());
1945 Meta<FlatZincSpace,Engine> se(
this,o);
1946 while (FlatZincSpace* next = se.next()) {
1947 std::unique_ptr<FlatZincSpace> next_sol(next);
1948 if (black_box_context.failed()) {
1951 sol = std::move(next_sol);
1954 out <<
"----------" << std::endl;
1956 if (--findSol == 0) {
1957 solution_limit_reached =
true;
1961 engine_stopped = se.stopped();
1962 if (
opt.mode() == SM_STAT) {
1963 stat = se.statistics();
1966 if (black_box_context.failed()) {
1968 black_box_context.rethrow();
1970 if (sol && !printAll) {
1972 out <<
"----------" << std::endl;
1974 if (!solution_limit_reached) {
1975 if (!engine_stopped) {
1977 out <<
"==========" << std::endl;
1979 out <<
"=====UNSATISFIABLE=====" << std::endl;
1982 out <<
"=====UNKNOWN=====" << std::endl;
1985 if (
opt.mode() == SM_STAT) {
1986 double totalTime = (t_total.
stop() / 1000.0);
1987 double solveTime = (t_solve.
stop() / 1000.0);
1988 double initTime = totalTime - solveTime;
1990 <<
"%%%mzn-stat: initTime=" << initTime
1992 out <<
"%%%mzn-stat: solveTime=" << solveTime
1994 out <<
"%%%mzn-stat: solutions="
1995 << std::abs(noOfSolutions - findSol) << std::endl
1996 <<
"%%%mzn-stat: variables="
1997 << (intVarCount + boolVarCount + setVarCount) << std::endl
1998 <<
"%%%mzn-stat: propagators=" << n_p << std::endl
2000 <<
"%%%mzn-stat: nodes=" << stat.
node << std::endl
2001 <<
"%%%mzn-stat: failures=" << stat.
fail << std::endl
2002 <<
"%%%mzn-stat: restarts=" << stat.
restart << std::endl
2003 <<
"%%%mzn-stat: peakDepth=" << stat.
depth << std::endl
2004 <<
"%%%mzn-stat-end" << std::endl
2011 FlatZincSpace::branchWithPlugin(
AST::Node* ann) {
2012 if (AST::Call*
c =
dynamic_cast<AST::Call*
>(ann)) {
2013 QString pluginName(
c->id.c_str());
2014 if (QLibrary::isLibrary(pluginName+
".dll")) {
2015 pluginName +=
".dll";
2016 }
else if (QLibrary::isLibrary(pluginName+
".dylib")) {
2017 pluginName =
"lib" + pluginName +
".dylib";
2018 }
else if (QLibrary::isLibrary(pluginName+
".so")) {
2020 pluginName =
"lib" + pluginName +
".so";
2022 QPluginLoader pl(pluginName);
2023 QObject* plugin_o = pl.instance();
2025 throw FlatZinc::Error(
"FlatZinc",
2026 "Error loading plugin "+pluginName.toStdString()+
2027 ": "+pl.errorString().toStdString());
2029 BranchPlugin* pb = qobject_cast<BranchPlugin*>(plugin_o);
2031 throw FlatZinc::Error(
"FlatZinc",
2032 "Error loading plugin "+pluginName.toStdString()+
2033 ": does not contain valid PluginBrancher");
2035 pb->branch(*
this,
c);
2040 FlatZincSpace::branchWithPlugin(
AST::Node*) {
2041 throw FlatZinc::Error(
"FlatZinc",
2042 "Branching with plugins not supported (requires Qt support)");
2049#ifndef GECODE_HAS_GIST
2052 "Gist mode is unavailable in this build");
2057 runEngine<BAB>(out,
p,opt,t_total);
2060 runEngine<DFS>(out,
p,opt,t_total);
2075#ifdef GECODE_HAS_FLOAT_VARS
2118 for (
int i = 0; i <
restart_data().on_restart_iv_sol; ++i) {
2126 for (
size_t i = 0; i <
restart_data().last_val_int.size(); ++i) {
2132 for (
size_t i = 0; i <
restart_data().uniform_range_int.size(); ++i) {
2134 const unsigned long long int width =
2135 static_cast<unsigned long long int>(
2136 static_cast<long long int>(
range.second) -
2137 static_cast<long long int>(
range.first)) + 1ULL;
2139 static_cast<int>(
static_cast<long long int>(
range.first) +
2140 static_cast<long long int>(
_random(width)));
2172 for (
int i = 0; i <
restart_data().on_restart_iv_sol; ++i) {
2185 for (
int i = 0; i <
restart_data().on_restart_bv_sol; ++i) {
2193 for (
size_t i = 0; i <
restart_data().last_val_bool.size(); ++i) {
2201 for (
int i = 0; i <
restart_data().on_restart_bv_sol; ++i) {
2208#ifdef GECODE_HAS_SET_VARS
2215 for (
int i = 0; i <
restart_data().on_restart_sv_sol; ++i) {
2224 for (
size_t i = 0; i <
restart_data().last_val_set.size(); ++i) {
2232 for (
int i = 0; i <
restart_data().on_restart_sv_sol; ++i) {
2240#ifdef GECODE_HAS_FLOAT_VARS
2247 for (
int i = 0; i <
restart_data().on_restart_fv_sol; ++i) {
2255 for (
size_t i = 0; i <
restart_data().last_val_float.size(); ++i) {
2261 for (
size_t i = 0; i <
restart_data().uniform_range_float.size(); ++i) {
2266 static_cast<FloatVal>(INT_MAX - 1)) *
2275 for (
int i = 0; i <
restart_data().on_restart_fv_sol; ++i) {
2290 for (
unsigned int i=
iv_lns.size(); i--;) {
2300 for (
unsigned int i=
iv_lns.size(); i--;) {
2344 (void) s; (void) out;
2345#ifdef GECODE_HAS_GIST
2347 for (
int i = 0; i <
iv.size(); ++i) {
2348 std::stringstream ss;
2349 ss <<
"iv[" << i <<
"]";
2352 if (result.length() > 0) out << result << std::endl;
2354 for (
int i = 0; i <
bv.size(); ++i) {
2355 std::stringstream ss;
2356 ss <<
"bv[" << i <<
"]";
2359 if (result.length() > 0) out << result << std::endl;
2361#ifdef GECODE_HAS_SET_VARS
2362 for (
int i = 0; i <
sv.size(); ++i) {
2363 std::stringstream ss;
2364 ss <<
"sv[" << i <<
"]";
2367 if (result.length() > 0) out << result << std::endl;
2370#ifdef GECODE_HAS_FLOAT_VARS
2371 for (
int i = 0; i <
fv.size(); ++i) {
2372 std::stringstream ss;
2373 ss <<
"fv[" << i <<
"]";
2376 if (result.length() > 0) out << result << std::endl;
2411 for (
int i=offset; i--;)
2413 for (
int i=a->a.
size(); i--;)
2414 ia[i+offset] = a->a[i]->getInt();
2419 int noOfTuples = a.
size() == 0 ? 0 : (a.
size()/noOfVars);
2423 for (
int i=0; i<noOfTuples; i++) {
2425 for (
int j=0; j<noOfVars; j++) {
2426 t[j] = a[i*noOfVars+j];
2433 FlatZincSpaceInitData::TupleSetSet::iterator it =
_initData->tupleSetSet.find(ts);
2434 if (it !=
_initData->tupleSetSet.end()) {
2448 FlatZincSpaceInitData::IntSharedArraySet::iterator it =
_initData->intSharedArraySet.find(sia);
2449 if (it !=
_initData->intSharedArraySet.end()) {
2452 _initData->intSharedArraySet.insert(sia);
2461 for (
int i=offset; i--;)
2463 for (
int i=a->a.
size(); i--;)
2464 ia[i+offset] = a->a[i]->getBool();
2472 FlatZincSpaceInitData::IntSharedArraySet::iterator it =
_initData->intSharedArraySet.find(sia);
2473 if (it !=
_initData->intSharedArraySet.end()) {
2476 _initData->intSharedArraySet.insert(sia);
2489 int* is = re.
alloc<
int>(
static_cast<unsigned long int>(sl->
s.size()));
2490 for (
int i=sl->
s.size(); i--; )
2499 if (a->a.
size() == 0) {
2504 for (
int i=offset; i--;)
2506 for (
int i=a->a.
size(); i--;) {
2514 if (a->a.
size() == 0) {
2519 for (
int i=offset; i--;)
2520 ia[i] =
IntVar(*
this, 0, 0);
2521 for (
int i=a->a.
size(); i--;) {
2522 if (a->a[i]->isIntVar()) {
2523 ia[i+offset] =
iv[a->a[i]->getIntVar()];
2525 int value = a->a[i]->getInt();
2535 if (a->a.
size() == 0) {
2540 for (
int i=offset; i--;)
2542 for (
int i=0; i<static_cast<int>(a->a.
size()); i++) {
2545 if (a->a[i]->isBool()) {
2546 bool value = a->a[i]->getBool();
2549 }
else if (a->a[i]->isIntVar() &&
2553 ia[offset++] =
bv[a->a[i]->getBoolVar()];
2583 if (a->a.
size() == 0)
2585 for (
int i=a->a.
size(); i--;) {
2586 if (a->a[i]->isBoolVar() || a->a[i]->isBool()) {
2587 }
else if (a->a[i]->isIntVar()) {
2589 if (singleInt != -1) {
2598 return singleInt==-1 || a->a.
size() > 1;
2600#ifdef GECODE_HAS_SET_VARS
2606 x0 =
SetVar(*
this, d, d);
2617 for (
int i=offset; i--;) {
2619 ia[i] =
SetVar(*
this, d, d);
2621 for (
int i=a->a.
size(); i--;) {
2627#ifdef GECODE_HAS_FLOAT_VARS
2632 for (
int i=offset; i--;)
2634 for (
int i=a->a.
size(); i--;)
2635 fa[i+offset] = a->a[i]->getFloat();
2641 if (a->a.
size() == 0) {
2646 for (
int i=offset; i--;)
2648 for (
int i=a->a.
size(); i--;) {
2649 if (a->a[i]->isFloatVar()) {
2650 fa[i+offset] =
fv[a->a[i]->getFloatVar()];
2652 double value = a->a[i]->getFloat();
2676 else if (ann->
hasAtom(
"domain") || ann->
hasAtom(
"domain_propagation"))
2678 else if (ann->
hasAtom(
"bounds") ||
2679 ann->
hasAtom(
"bounds_propagation") ||
2684 if (ann->
hasAtom(
"gecode_full_propagation"))
2687 if (ann->
hasAtom(
"gecode_basic_propagation"))
2689 if (ann->
hasAtom(
"gecode_advanced_propagation"))
2699 FlatZincSpaceInitData::DFASet::iterator it =
_initData->dfaSet.find(a);
2714 Printer::printElem(std::ostream& out,
2734 }
else if (bv[ai->
getBoolVar()].max() == 0) {
2737 out <<
"false..true";
2739#ifdef GECODE_HAS_SET_VARS
2745 SetVarGlbRanges svr(sv[ai->
getSetVar()]);
2750 int min = svr.min();
2751 int max = svr.max();
2754 SetVarGlbValues svv(sv[ai->
getSetVar()]);
2758 for (; svv(); ++svv)
2759 out <<
", " << svv.val();
2762 out <<
min <<
".." <<
max;
2765#ifdef GECODE_HAS_FLOAT_VARS
2776 std::ostringstream oss;
2778 oss << std::setprecision(std::numeric_limits<double>::digits10);
2780 if (oss.str().find(
".") == std::string::npos)
2787 }
else if (ai->
isBool()) {
2788 out << (ai->
getBool() ?
"true" :
"false");
2789 }
else if (ai->
isSet()) {
2790 AST::SetLit* s = ai->
getSet();
2792 out << s->min <<
".." << s->max;
2795 for (
unsigned int i=0;
i<s->s.
size();
i++) {
2796 out << s->s[
i] << (
i < s->s.
size()-1 ?
", " :
"}");
2801 for (
unsigned int i=0;
i<s.
size();
i++) {
2802 if (s[i] ==
'\\' && i<s.size()-1) {
2804 case 'n': out <<
"\n";
break;
2805 case '\\': out <<
"\\";
break;
2806 case 't': out <<
"\t";
break;
2807 default: out <<
"\\" << s[
i+1];
2818 Printer::printElemDiff(std::ostream& out,
2820 const Gecode::IntVarArray& iv1,
2821 const Gecode::IntVarArray& iv2,
2822 const Gecode::BoolVarArray& bv1,
2823 const Gecode::BoolVarArray& bv2
2825 ,
const Gecode::SetVarArray& sv1,
2826 const Gecode::SetVarArray& sv2
2829 ,
const Gecode::FloatVarArray& fv1,
2830 const Gecode::FloatVarArray& fv2
2833#ifdef GECODE_HAS_GIST
2834 using namespace Gecode::Gist;
2838 }
else if (ai->isIntVar()) {
2839 std::string res(Comparator::compare(
"",iv1[ai->getIntVar()],
2840 iv2[ai->getIntVar()]));
2841 if (res.length() > 0) {
2845 out << iv1[ai->getIntVar()];
2847 }
else if (ai->isBoolVar()) {
2848 std::string res(Comparator::compare(
"",bv1[ai->getBoolVar()],
2849 bv2[ai->getBoolVar()]));
2850 if (res.length() > 0) {
2854 out << bv1[ai->getBoolVar()];
2856#ifdef GECODE_HAS_SET_VARS
2857 }
else if (ai->isSetVar()) {
2858 std::string res(Comparator::compare(
"",sv1[ai->getSetVar()],
2859 sv2[ai->getSetVar()]));
2860 if (res.length() > 0) {
2864 out << sv1[ai->getSetVar()];
2867#ifdef GECODE_HAS_FLOAT_VARS
2868 }
else if (ai->isFloatVar()) {
2869 std::string res(Comparator::compare(
"",fv1[ai->getFloatVar()],
2870 fv2[ai->getFloatVar()]));
2871 if (res.length() > 0) {
2875 out << fv1[ai->getFloatVar()];
2878 }
else if (ai->isBool()) {
2879 out << (ai->getBool() ?
"true" :
"false");
2880 }
else if (ai->isSet()) {
2881 AST::SetLit* s = ai->getSet();
2883 out << s->min <<
".." << s->max;
2886 for (
unsigned int i=0;
i<s->s.
size();
i++) {
2887 out << s->s[
i] << (
i < s->s.
size()-1 ?
", " :
"}");
2890 }
else if (ai->isString()) {
2891 std::string s = ai->getString();
2892 for (
unsigned int i=0;
i<s.
size();
i++) {
2893 if (s[i] ==
'\\' && i<s.size()-1) {
2895 case 'n': out <<
"\n";
break;
2896 case '\\': out <<
"\\";
break;
2897 case 't': out <<
"\t";
break;
2898 default: out <<
"\\" << s[
i+1];
2913#ifdef GECODE_HAS_SET_VARS
2917#ifdef GECODE_HAS_FLOAT_VARS
2938 if (_output ==
nullptr)
2940 for (
unsigned int i=0; i< _output->
a.size(); i++) {
2944 int size = aia->
a.size();
2946 for (
int j=0; j<size; j++) {
2947 printElem(out,aia->
a[j],iv,bv
2960 printElem(out,ai,iv,bv
2989 if (_output ==
nullptr)
2991 for (
unsigned int i=0; i< _output->
a.size(); i++) {
2995 int size = aia->
a.size();
2997 for (
int j=0; j<size; j++) {
2998 printElemDiff(out,aia->
a[j],iv1,iv2,bv1,bv2
3011 printElemDiff(out,ai,iv1,iv2,bv1,bv2
3025 iv_names.push_back(n);
3029 bv_names.push_back(n);
3031#ifdef GECODE_HAS_FLOAT_VARS
3034 fv_names.push_back(n);
3037#ifdef GECODE_HAS_SET_VARS
3040 sv_names.push_back(n);
3046 std::map<int,int>& iv, std::map<int,int>& bv,
3047 std::map<int,int>& sv, std::map<int,int>& fv) {
3050 if (iv.find(x->
i) == iv.end()) {
3051 int newi = iv.size();
3057 if (bv.find(x->
i) == bv.end()) {
3058 int newi = bv.size();
3064 if (sv.find(x->
i) == sv.end()) {
3065 int newi = sv.size();
3071 if (fv.find(x->
i) == fv.end()) {
3072 int newi = fv.size();
3081 int& optVar,
bool optVarIsInt,
3093 if (_output ==
nullptr) {
3094 if (optVarIsInt && optVar != -1) {
3103#ifdef GECODE_HAS_SET_VARS
3106#ifdef GECODE_HAS_FLOAT_VARS
3107 if (!optVarIsInt && optVar != -1) {
3118 std::map<int,int> iv_new;
3119 std::map<int,int> bv_new;
3120 std::map<int,int> sv_new;
3121 std::map<int,int> fv_new;
3131 for (
unsigned int i=0; i< _output->
a.size(); i++) {
3135 for (
unsigned int j=0; j<aia->
a.size(); j++) {
3144 std::vector<std::string> iv_names_new(iv_new.size());
3145 for (std::map<int,int>::iterator i=iv_new.begin(); i != iv_new.end(); ++i) {
3146 iva[(*i).second] = iv[(*i).first];
3147 iv_names_new[(*i).second] = iv_names[(*i).first];
3150 iv_names = iv_names_new;
3153 std::vector<std::string> bv_names_new(bv_new.size());
3154 for (std::map<int,int>::iterator i=bv_new.begin(); i != bv_new.end(); ++i) {
3155 bva[(*i).second] = bv[(*i).first];
3156 bv_names_new[(*i).second] = bv_names[(*i).first];
3159 bv_names = bv_names_new;
3161#ifdef GECODE_HAS_SET_VARS
3163 std::vector<std::string> sv_names_new(sv_new.size());
3164 for (std::map<int,int>::iterator i=sv_new.begin(); i != sv_new.end(); ++i) {
3165 sva[(*i).second] = sv[(*i).first];
3166 sv_names_new[(*i).second] = sv_names[(*i).first];
3169 sv_names = sv_names_new;
3172#ifdef GECODE_HAS_FLOAT_VARS
3174 std::vector<std::string> fv_names_new(fv_new.size());
3175 for (std::map<int,int>::iterator i=fv_new.begin(); i != fv_new.end(); ++i) {
3176 fva[(*i).second] = fv[(*i).first];
3177 fv_names_new[(*i).second] = fv_names[(*i).first];
3180 fv_names = fv_names_new;
void put(unsigned int i)
Add i to the contents.
int size(void) const
Return size of array (number of elements).
Depth-first branch-and-bound search engine.
Which values to select for assignment.
Which values to select for branching first.
Passing Boolean variables.
Boolean integer variables.
Base-class for branchers.
Brancher(Home home)
Constructor for creation.
Class to send solution information to CPProfiler.
Choice for performing commit
virtual void archive(Archive &e) const
Archive into e.
Finite automaton with deterministic construction by default.
Depth-first search engine.
static void installCtrlHandler(bool install, bool force=false)
Install handler for catching Ctrl-C.
Exception: Base-class for exceptions
virtual const char * what(void) const noexcept
Return information.
Node representing an atom
Node representing a function call
Array * getArgs(unsigned int n)
A node in a FlatZinc abstract syntax tree.
bool isSetVar(void)
Test if node is a set variable node.
Array * getArray(void)
Cast this node to an array node.
bool isBool(void)
Test if node is a Boolean node.
bool isFloatVar(void)
Test if node is a float variable node.
bool isSet(void)
Test if node is a set literal node.
double getFloat(void)
Cast this node to a Float node.
int getFloatVar(void)
Cast this node to a Float variable node.
bool isArray(void)
Test if node is an array node.
SetLit * getSet(void)
Cast this node to a set literal node.
bool isString(void)
Test if node is a string node.
bool hasAtom(const std::string &id)
Test if node has atom with id.
bool isInt(int &i)
Test if node is int, if yes set i to the value.
int getInt(void)
Cast this node to an integer node.
bool isIntVar(void)
Test if node is an integer variable node.
int getIntVar(void)
Cast this node to an integer variable node.
bool isBoolVar(void)
Test if node is a Boolean variable node.
Call * getCall(void)
Return function call.
int getBoolVar(void)
Cast this node to a Boolean variable node.
virtual void print(std::ostream &)=0
Output string representation.
int getSetVar(void)
Cast this node to a set variable node.
bool getBool(void)
Cast this node to a Boolean node.
std::string getString(void)
Cast this node to a string node.
Exception signaling type error
Choice that only signals failure or success
bool fail
Whether brancher should fail.
virtual size_t size(void) const
Report size occupied.
Choice(const Brancher &b, bool fail0)
Initialize choice for brancher b.
virtual void archive(Archive &e) const
Archive into e.
virtual Choice * choice(const Space &, Archive &e)
Return choice.
FloatValBranch float_valsel
TieBreak< BoolVarBranch > bool_varsel
virtual void print(const Space &, const Gecode::Choice &c, unsigned int, std::ostream &o) const
Print explanation.
TieBreak< IntVarBranch > int_varsel
virtual bool status(const Space &_home) const
Check status of brancher, return true if alternatives left.
bool done
Flag whether brancher is done.
virtual Actor * copy(Space &home)
Copy brancher.
static void post(Home home, TieBreak< IntVarBranch > int_varsel, IntValBranch int_valsel, TieBreak< BoolVarBranch > bool_varsel, BoolValBranch bool_valsel, SetVarBranch set_varsel, SetValBranch set_valsel, TieBreak< FloatVarBranch > float_varsel, FloatValBranch float_valsel)
Post brancher.
TieBreak< FloatVarBranch > float_varsel
virtual Choice * choice(Space &home)
Return choice.
virtual ExecStatus commit(Space &, const Gecode::Choice &c, unsigned int)
Perform commit for choice c.
virtual size_t dispose(Space &)
Delete brancher and return its size.
BoolValBranch bool_valsel
AuxVarBrancher(Home home, TieBreak< IntVarBranch > int_varsel0, IntValBranch int_valsel0, TieBreak< BoolVarBranch > bool_varsel0, BoolValBranch bool_valsel0, SetVarBranch set_varsel0, SetValBranch set_valsel0, TieBreak< FloatVarBranch > float_varsel0, FloatValBranch float_valsel0)
Construct brancher.
AuxVarBrancher(Space &home, AuxVarBrancher &b)
Copy constructor.
static BlackBoxContextHandle & context(FlatZincSpace &s)
Model-local context shared by blackbox propagators and search support.
void rethrow(void) const
Rethrow the first recorded propagation exception.
Specification for Boolean variables.
Option< AST::SetLit * > domain
Abstract representation of a constraint.
AST::Array * ann
Constraint annotations.
Exception class for FlatZinc errors
virtual void compare(const Space &s0, const Space &s1)
Use the compare method of the template class S to compare two spaces.
FZPrintingComparator(const Printer &p0)
Constructor.
An inspector for printing simple text output.
virtual void finalize(void)
Finalize when Gist exits.
FZPrintingInspector(const Printer &p0)
Constructor.
virtual void inspect(const Space &node)
Use the print method of the template class S to print a space.
FlatZincGetInfo(const Printer &printer)
virtual std::string getInfo(const Space &space) const
Return info for a space.
Options for running FlatZinc models
std::unordered_set< TupleSet > TupleSetSet
Hash table of tuple sets.
BlackBoxContextHandle blackBoxContext
Opaque state shared by blackbox propagators in this model.
DFASet dfaSet
Hash table of DFAs.
std::unordered_set< DFA > DFASet
Hash table of DFAs.
FlatZincSpaceInitData(void)
Initialize.
IntSharedArraySet intSharedArraySet
Hash table of shared integer arrays.
TupleSetSet tupleSetSet
Hash table of tuple sets.
std::unordered_set< SharedArray< int > > IntSharedArraySet
Hash table of shared integer arrays.
A space that can be initialized with a FlatZinc model.
void createBranchers(Printer &p, AST::Node *ann, FlatZincOptions &opt, bool ignoreUnknown, std::ostream &err=std::cerr)
Create branchers corresponding to the solve item annotations.
Gecode::IntVarArray iv_lns
The integer variables used in LNS.
void shrinkArrays(Printer &p)
Remove all variables not needed for output.
unsigned int _lns
Percentage of variables to keep in LNS (or 0 for no LNS).
void maximize(int var, bool isInt, AST::Array *annotation)
Post that integer variable var should be maximized.
IntVarArgs arg2intvarargs(AST::Node *arg, int offset=0)
Convert arg to IntVarArgs.
Gecode::FloatVarArray fv
The float variables.
Rnd _random
Random number generator.
Gecode::FloatVarArray on_restart_fv
On Restart Tracked Floating Point Variables.
void newBoolVar(BoolVarSpec *vs)
Create new Boolean variable from specification.
FloatVar arg2FloatVar(AST::Node *n)
Convert n to FloatVar.
void print(std::ostream &out, const Printer &p) const
Produce output on out using p.
std::vector< bool > fv_introduced
Indicates whether a float variable is introduced by mzn2fzn.
AST::Array * _solveAnnotations
Annotations on the solve item.
int _optVar
Index of the variable to optimize.
BranchInformation branchInfo
Information for printing branches.
void run(std::ostream &out, const Printer &p, const FlatZincOptions &opt, Gecode::Support::Timer &t_total)
Run the search.
DFA getSharedDFA(DFA &a)
Share DFA a if possible.
void newFloatVar(FloatVarSpec *vs)
Create new float variable from specification.
SetVar arg2SetVar(AST::Node *n)
Convert n to SetVar.
int * iv_boolalias
Indicates whether an integer variable aliases a Boolean variable.
virtual bool slave(const MetaInfo &mi)
Slave function for restarts.
void postConstraints(std::vector< ConExpr * > &ces)
Post a constraint specified by ce.
SetVarArgs arg2setvarargs(AST::Node *arg, int offset=0, int doffset=0, const IntSet &od=IntSet::empty)
Convert n to SetVarArgs.
bool _optVarIsInt
Whether variable to optimize is integer (or float).
FlatZincSpace(FlatZincSpace &)
Copy constructor.
Gecode::BoolVarArray bv
The Boolean variables.
void newSetVar(SetVarSpec *vs)
Create new set variable from specification.
bool optVarIsInt(void) const
Return whether variable used for optimization is integer (or float).
Gecode::SetVarArray on_restart_sv
On Restart Tracked Set Variables.
std::vector< bool > iv_introduced
Indicates whether an integer variable is introduced by mzn2fzn.
IntVar arg2IntVar(AST::Node *n)
Convert n to IntVar.
std::string getDomains(const Printer &p) const
Get string representing the domains of variables (for cpprofiler).
FlatZincSpaceInitData * _initData
Initialisation data (only used for posting constraints).
Meth method(void) const
Return whether to solve a satisfaction or optimization problem.
std::vector< bool > sv_introduced
Indicates whether a set variable is introduced by mzn2fzn.
IntSet arg2intset(AST::Node *n)
Convert n to IntSet.
std::vector< bool > bv_introduced
Indicates whether a Boolean variable is introduced by mzn2fzn.
Gecode::FloatVarArray fv_aux
The introduced float variables.
void minimize(int var, bool isInt, AST::Array *annotation)
Post that integer variable var should be minimized.
virtual void constrain(const Space &s)
Implement optimization.
IntArgs arg2boolargs(AST::Node *arg, int offset=0)
Convert arg (array of Booleans) to IntArgs.
Gecode::SetVarArray sv_aux
The introduced set variables.
int floatVarCount
Number of float variables.
int boolVarCount
Number of Boolean variables.
Gecode::SetVarArray sv
The set variables.
int setVarCount
Number of set variables.
~FlatZincSpace(void)
Destructor.
OnRestartHandle restart_data
Gecode::IntVarArray on_restart_iv
On Restart Tracked Integer Variables.
int optVar(void) const
Return index of variable used for optimization.
FloatVarArgs arg2floatvarargs(AST::Node *arg, int offset=0)
Convert n to FloatVarArgs.
IntSharedArray arg2boolsharedarray(AST::Node *arg, int offset=0)
Convert arg (array of integers) to IntSharedArray.
void solve(AST::Array *annotation)
Post the solve item.
Gecode::FloatNum step
Step by which a next solution has to have lower cost.
IntSharedArray _lnsInitialSolution
Initial solution to start the LNS (or nullptr for no LNS).
Gecode::BoolVarArray bv_aux
The introduced Boolean variables.
IntSharedArray arg2intsharedarray(AST::Node *arg, int offset=0)
Convert arg (array of integers) to IntSharedArray.
BoolVarArgs arg2boolvarargs(AST::Node *arg, int offset=0, int siv=-1)
Convert arg to BoolVarArgs.
void aliasBool2Int(int iv, int bv)
Link integer variable iv to Boolean variable bv.
AST::Array * solveAnnotations(void) const
Return the solve item annotations.
Gecode::IntVarArray iv_aux
The introduced integer variables.
Gecode::IntVarArray iv
The integer variables.
virtual Gecode::Space * copy(void)
Copy function.
void init(int intVars, int boolVars, int setVars, int floatVars)
Initialize space with given number of variables.
Gecode::BoolVarArray on_restart_bv
On Restart Tracked Boolean Variables.
bool isBoolArray(AST::Node *b, int &singleInt)
Check if b is array of Booleans (or has a single integer).
IntPropLevel ann2ipl(AST::Node *ann)
Convert ann to integer propagation level.
void newIntVar(IntVarSpec *vs)
Create new integer variable from specification.
Meth _method
Whether to solve as satisfaction or optimization problem.
void compare(const Space &s, std::ostream &out) const
Compare this space with space s and print the differences on out.
int intVarCount
Number of integer variables.
BoolVar arg2BoolVar(AST::Node *n)
Convert n to BoolVar.
TupleSet arg2tupleset(const IntArgs &a, int noOfVars)
Convert a to TupleSet.
IntSetArgs arg2intsetargs(AST::Node *arg, int offset=0)
Convert arg to IntSetArgs.
FloatValArgs arg2floatargs(AST::Node *arg, int offset=0)
Convert n to FloatValArgs.
bool needAuxVars
Whether the introduced variables still need to be copied.
IntArgs arg2intargs(AST::Node *arg, int offset=0)
Convert arg (array of integers) to IntArgs.
std::unique_ptr< Search::Stop > stop_object
FlatZincStop(Search::Stop *stop_object0, const BlackBoxContextHandle &black_box_context0)
BlackBoxContextHandle black_box_context
bool stop(const Search::Statistics &s, const Search::Options &o) override
Stop search, if returns true.
Specification for floating point variables.
Option< std::pair< double, double > > domain
static void explore(S *root, const FlatZincOptions &opt, Gist::Inspector *i, Gist::Comparator *c)
static void explore(S *root, const FlatZincOptions &opt, Gist::Inspector *i, Gist::Comparator *c)
Traits class for search engines.
Which integer or Boolean variable to select for branching.
Specification for integer variables.
Option< AST::SetLit * > domain
InterruptHandlerGuard(bool install)
~InterruptHandlerGuard(void)
Output support class for FlatZinc interpreter.
void addFloatVarName(const std::string &n)
void printDiff(std::ostream &out, const Gecode::IntVarArray &iv1, const Gecode::IntVarArray &iv2, const Gecode::BoolVarArray &bv1, const Gecode::BoolVarArray &bv2, const Gecode::SetVarArray &sv1, const Gecode::SetVarArray &sv2, const Gecode::FloatVarArray &fv1, const Gecode::FloatVarArray &fv2) const
void addSetVarName(const std::string &n)
void init(AST::Array *output)
void print(std::ostream &out, const Gecode::IntVarArray &iv, const Gecode::BoolVarArray &bv, const Gecode::SetVarArray &sv, const Gecode::FloatVarArray &fv) const
void shrinkArrays(Space &home, int &optVar, bool optVarIsInt, Gecode::IntVarArray &iv, Gecode::BoolVarArray &bv, Gecode::SetVarArray &sv, Gecode::FloatVarArray &fv)
void addIntVarName(const std::string &n)
void addBoolVarName(const std::string &n)
void shrinkElement(AST::Node *node, std::map< int, int > &iv, std::map< int, int > &bv, std::map< int, int > &sv, std::map< int, int > &fv)
void post(FlatZincSpace &s, const ConExpr &ce)
Post constraint specified by ce.
Specification for set variables.
Option< AST::SetLit * > upperBound
bool introduced
Whether the variable was introduced in the mzn2fzn translation.
bool assigned
Whether the variable is assigned.
bool alias
Whether the variable aliases another variable.
bool funcDep
Whether the variable functionally depends on another variable.
Value description class for branching.
bool l
Whether to try the lower or upper half first.
FloatNum n
The middle value for branching.
Which values to select for branching first.
FloatNum size(void) const
Return size of float value (distance between maximum and minimum).
Float view for float variables.
Abstract base class for comparators.
virtual void compare(const Space &s0, const Space &s1)=0
Call-back function.
Abstract base class for inspectors.
void compare(Comparator *c)
Add comparator.
void click(Inspector *i)
Add inspector that reacts on node double clicks.
class Gecode::Gist::Options::I_ inspect
An window for simple text output.
void finalize(void)
Clean up when Gist exits.
TextOutput(const std::string &name)
Constructor.
std::ostream & getStream(void)
Get the stream that is used to output text.
void init(void)
Initialize the implementation object.
VarComparator(std::string name)
Constructor.
unsigned int id(void) const
Return a unique id for the group.
Home class for posting propagators
Passing integer arguments.
Which values to select for assignment.
static const IntSet empty
Empty set.
Which values to select for branching first.
Passing integer variables.
Integer view for integer variables.
int min(void) const
Return minimum of domain.
bool range(void) const
Test whether domain is a range.
int val(void) const
Return assigned value (only if assigned).
int max(void) const
Return maximum of domain.
Range iterator for integer views.
static PropagatorGroup all
Group of all propagators.
T * alloc(long unsigned int n)
Allocate block of n objects of type T from region.
unsigned int c_d
Create a clone after every c_d commits (commit distance).
unsigned int a_d
Create a clone during recomputation if distance is greater than a_d (adaptive distance).
unsigned long int restart
Number of restarts.
unsigned long int depth
Maximum depth of search stack.
unsigned long long int fail
Number of failed nodes in search tree.
unsigned long long int node
Number of nodes expanded.
Base-class for Stop-object.
Which values to select for branching first.
Which variable to select for branching.
Range iterator for the greatest lower bound.
Shared array with arbitrary number of elements.
int size(void) const
Return number of elements.
SharedHandle(void)
Create shared handle with no object pointing to.
SharedHandle::Object * object(void) const
Access to the shared object.
struct Gecode::Space::@055132133326276162005044145100211202071356247106::@275070317317120154232063063134255170030071110047 p
Data only available during propagation or branching.
struct Gecode::Space::@055132133326276162005044145100211202071356247106::@155123175027073262103111264343315000271204104107 c
Data available only during copying.
T * alloc(long unsigned int n)
Allocate block of n objects of type T from space heap.
friend class BrancherGroup
Statistics for execution of status
unsigned long long int propagate
Number of propagator executions.
double stop(void)
Get time since start of timer.
void start(void)
Start timer.
Combine variable selection criteria for tie-breaking.
Class representing a set of tuples.
TupleSet & add(const IntArgs &t)
Add tuple t to tuple set.
std::size_t hash(void) const
Return hash key.
void finalize(void)
Finalize tuple set with dense support data.
bool assigned(void) const
Test if all variables are assigned.
int size(void) const
Return size of array (number of elements).
bool assigned(void) const
Test whether view is assigned.
Base class for variables.
unsigned int seed
The random seed to be used.
unsigned int threads
Number of threads to use.
Heap heap
The single global heap.
void fail(void)
Fail space.
@ SM_GIST
Run script in Gist.
@ RM_CONSTANT
Restart with constant sequence.
@ RM_LINEAR
Restart with linear sequence.
@ RM_LUBY
Restart with Luby sequence.
@ RM_GEOMETRIC
Restart with geometric sequence.
int bab(Space *root, const Gist::Options &opt=Gist::Options::def)
Create a new stand-alone Gist for branch-and-bound search of root.
int dfs(Space *root, const Gist::Options &opt=Gist::Options::def)
Create a new stand-alone Gist for root.
void assign(Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatAssign vals, FloatBranchFilter bf=nullptr, FloatVarValPrint vvp=nullptr)
Assign all x with variable selection vars and value selection vals.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
double FloatNum
Floating point number base type.
@ FRT_LQ
Less or equal ( ).
@ FRT_GQ
Greater or equal ( ).
IntPropLevel
Propagation levels for integer propagators.
@ IPL_BASIC
Use basic propagation algorithm.
@ IPL_DOM
Domain propagation Options: basic versus advanced propagation.
@ IPL_FULL
Use full propagation.
@ IPL_VAL
Value propagation.
@ IPL_ADVANCED
Use advanced propagation algorithm.
@ IPL_DEF
Simple propagation levels.
@ IPL_BND
Bounds propagation.
Space(void)
Default constructor.
Space * clone(void) const
Clone space.
@ SS_FAILED
Space is failed
void stop(Support::Timer &timer, std::ostream &os)
Get time since start of timer and print user friendly time information.
Interpreter for the FlatZinc language.
void printIntVar(std::ostream &os, const std::string name, const Int::IntView &x)
Registry & registry(void)
Return global registry object.
void varValPrintF(const Space &home, const Brancher &b, unsigned int a, FloatVar, int i, const FloatNumBranch &nl, std::ostream &o)
TieBreak< IntVarBranch > ann2ivarsel(AST::Node *ann, Rnd rnd, double decay)
void varValPrint(const Space &home, const Brancher &b, unsigned int a, Var, int i, const int &n, std::ostream &o)
BoolAssign ann2asnbvalsel(AST::Node *ann, Rnd rnd)
TieBreak< BoolVarBranch > ann2bvarsel(AST::Node *ann, Rnd rnd, double decay)
void printFloatVar(std::ostream &os, const std::string name, const Float::FloatView &f)
void printBoolVar(std::ostream &os, const std::string name, const BoolVar &b)
TieBreak< FloatVarBranch > ann2fvarsel(AST::Node *ann, Rnd rnd, double decay)
BoolValBranch ann2bvalsel(AST::Node *ann, std::string &r0, std::string &r1, Rnd rnd)
IntSet vs2is(IntVarSpec *vs)
FloatValBranch ann2fvalsel(AST::Node *ann, std::string r0, std::string r1)
int vs2bsl(BoolVarSpec *bs)
IntValBranch ann2ivalsel(AST::Node *ann, std::string &r0, std::string &r1, Rnd rnd)
IntBoolVarBranch INTBOOL_VAR_AFC_SIZE_MAX(double d=1.0)
Select variable with largest accumulated failure count divided by domain size.
GECODE_FLATZINC_EXPORT Rnd defrnd
Uninitialized default random number generator.
void branch(Home home, const IntVarArgs &x, const BoolVarArgs &y, IntBoolVarBranch vars, IntValBranch vals)
Branch function for integer and Boolean variables.
SetVarBranch ann2svarsel(AST::Node *ann, Rnd rnd, double decay)
SetValBranch ann2svalsel(AST::Node *ann, std::string r0, std::string r1, Rnd rnd)
int vs2bsh(BoolVarSpec *bs)
IntAssign ann2asnivalsel(AST::Node *ann, Rnd rnd)
void flattenAnnotations(AST::Array *ann, std::vector< AST::Node * > &out)
const FloatNum max
Largest allowed float value.
const FloatNum min
Smallest allowed float value.
The Gecode Interactive Search Tool.
const int min
Smallest allowed integer value.
const int max
Largest allowed integer value.
const int min
Smallest allowed integer in integer set.
const int max
Largest allowed integer in integer set.
void print(std::basic_ostream< Char, Traits > &s, bool assigned, IL &lb, IU &ub, unsigned int cardMin, unsigned int cardMax)
Print set view.
Gecode toplevel namespace
FloatVarBranch FLOAT_VAR_RND(Rnd r)
Select random variable (uniform distribution, for tie breaking).
FloatValBranch FLOAT_VAL_SPLIT_MAX(void)
Select values greater than mean of smallest and largest value.
ArgArray< IntSet > IntSetArgs
Passing set arguments.
SetVarBranch SET_VAR_ACTION_SIZE_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smallest action divided by domain size with decay factor d.
IntAssign INT_ASSIGN_RND(Rnd r)
Select random value.
SetVarBranch SET_VAR_ACTION_SIZE_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest action divided by domain size with decay factor d.
IntValBranch INT_VAL_SPLIT_MIN(void)
Select values not greater than mean of smallest and largest value.
FloatVarBranch FLOAT_VAR_AFC_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smallest accumulated failure count with decay factor d.
BoolAssign BOOL_ASSIGN_MAX(void)
Select largest value.
FloatVarBranch FLOAT_VAR_SIZE_MAX(BranchTbl tbl=nullptr)
Select variable with largest domain size.
IntVarBranch INT_VAR_AFC_SIZE_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest accumulated failure count divided by domain size with decay factor d.
FloatVarBranch FLOAT_VAR_MAX_MAX(BranchTbl tbl=nullptr)
Select variable with largest max.
SetVarBranch SET_VAR_NONE(void)
Select first unassigned variable.
IntVarBranch INT_VAR_DEGREE_MAX(BranchTbl tbl=nullptr)
Select variable with largest degree.
IntVarBranch INT_VAR_ACTION_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with highest action with decay factor d.
FloatVarBranch FLOAT_VAR_AFC_SIZE_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smalllest accumulated failure count divided by domain size with decay factor d.
SharedArray< int > IntSharedArray
Arrays of integers that can be shared among several element constraints.
IntValBranch INT_VAL_MED(void)
Select greatest value not greater than the median.
IntVarBranch INT_VAR_REGRET_MIN_MAX(BranchTbl tbl=nullptr)
Select variable with largest min-regret.
IntVarBranch INT_VAR_ACTION_SIZE_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest action divided by domain size with decay factor d.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
BoolValBranch BOOL_VAL_MIN(void)
Select smallest value.
IntVarBranch INT_VAR_NONE(void)
Select first unassigned variable.
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
BoolVarBranch BOOL_VAR_NONE(void)
Select first unassigned variable.
IntVarBranch INT_VAR_AFC_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest accumulated failure count with decay factor d.
IntVarBranch INT_VAR_AFC_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smallest accumulated failure count with decay factor d.
IntValBranch INT_VALUES_MIN(void)
Try all values starting from smallest.
SetVarBranch SET_VAR_SIZE_MIN(BranchTbl tbl=nullptr)
Select variable with smallest unknown set.
SetVarBranch SET_VAR_RND(Rnd r)
Select random variable (uniform distribution, for tie breaking).
void range(Home home, const IntVarArgs &x, SetVar y, SetVar z)
Post constraint .
void cmb_hash(std::size_t &seed, const T h)
Combine hash value h into seed.
SetVarBranch SET_VAR_MAX_MAX(BranchTbl tbl=nullptr)
Select variable with largest maximum unknown element.
IntValBranch INT_VAL_MAX(void)
Select largest value.
FloatVarBranch FLOAT_VAR_ACTION_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with highest action with decay factor d.
BoolValBranch BOOL_VAL_MAX(void)
Select largest value.
BoolVarBranch BOOL_VAR_RND(Rnd r)
Select random variable (uniform distribution, for tie breaking).
BoolVarBranch BOOL_VAR_ACTION_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with lowest action with decay factor d.
SetVarBranch SET_VAR_AFC_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest accumulated failure count with decay factor d.
FloatVarBranch FLOAT_VAR_MIN_MIN(BranchTbl tbl=nullptr)
Select variable with smallest min.
SetVarBranch SET_VAR_MIN_MIN(BranchTbl tbl=nullptr)
Select variable with smallest minimum unknown element.
FloatVarBranch FLOAT_VAR_ACTION_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with lowest action with decay factor d.
SetValBranch SET_VAL_MAX_INC(void)
Include largest element.
BoolAssign BOOL_ASSIGN_RND(Rnd r)
Select random value.
IntValBranch INT_VAL_SPLIT_MAX(void)
Select values greater than mean of smallest and largest value.
IntValBranch INT_VAL_MIN(void)
Select smallest value.
IntAssign INT_ASSIGN_MED(void)
Select greatest value not greater than the median.
SetVarBranch SET_VAR_AFC_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smallest accumulated failure count with decay factor d.
BoolVarBranch BOOL_VAR_AFC_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smallest accumulated failure count with decay factor d.
T * dfs(T *s, const Search::Options &o=Search::Options::def)
Invoke depth-first search engine for subclass T of space s with options o.
BoolVarBranch BOOL_VAR_AFC_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest accumulated failure count with decay factor d.
FloatVarBranch FLOAT_VAR_NONE(void)
Select first unassigned variable.
IntVarBranch INT_VAR_MAX_MAX(BranchTbl tbl=nullptr)
Select variable with largest max.
IntAssign INT_ASSIGN_MIN(void)
Select smallest value.
IntVarBranch INT_VAR_ACTION_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with lowest action with decay factor d.
IntVarBranch INT_VAR_RND(Rnd r)
Select random variable (uniform distribution, for tie breaking).
IntVarBranch INT_VAR_AFC_SIZE_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smallest accumulated failure count divided by domain size with decay factor d.
SetValBranch SET_VAL_MIN_INC(void)
Include smallest element.
@ ES_OK
Execution is okay.
@ ES_FAILED
Execution has resulted in failure.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
FloatVarBranch FLOAT_VAR_DEGREE_MAX(BranchTbl tbl=nullptr)
Select variable with largest degree.
SetVarBranch SET_VAR_AFC_SIZE_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smallest accumulated failure count divided by domain size with decay factor d.
SetValBranch SET_VAL_MAX_EXC(void)
Exclude largest element.
FloatVarBranch FLOAT_VAR_ACTION_SIZE_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest action divided by domain size with decay factor d.
BoolValBranch BOOL_VAL_RND(Rnd r)
Select random value.
SetVarBranch SET_VAR_AFC_SIZE_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest accumulated failure count divided by domain size with decay factor d.
SetVarBranch SET_VAR_ACTION_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with lowest action with decay factor d.
IntVarBranch INT_VAR_SIZE_MIN(BranchTbl tbl=nullptr)
Select variable with smallest domain size.
BoolVarBranch BOOL_VAR_DEGREE_MAX(BranchTbl tbl=nullptr)
Select variable with largest degree.
FloatVarBranch FLOAT_VAR_AFC_SIZE_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest accumulated failure count divided by domain size with decay factor d.
IntVarBranch INT_VAR_ACTION_SIZE_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smallest action divided by domain size with decay factor d.
BoolVarBranch BOOL_VAR_ACTION_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with highest action with decay factor d.
BoolAssign BOOL_ASSIGN_MIN(void)
Select smallest value.
FloatValBranch FLOAT_VAL_SPLIT_MIN(void)
Select values not greater than mean of smallest and largest value.
IntAssign INT_ASSIGN_MAX(void)
Select largest value.
FloatVarBranch FLOAT_VAR_SIZE_MIN(BranchTbl tbl=nullptr)
Select variable with smallest domain size.
IntVarBranch INT_VAR_MIN_MIN(BranchTbl tbl=nullptr)
Select variable with smallest min.
FloatVarBranch FLOAT_VAR_AFC_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with largest accumulated failure count with decay factor d.
SetValBranch SET_VAL_MIN_EXC(void)
Exclude smallest element.
IntVarBranch INT_VAR_SIZE_MAX(BranchTbl tbl=nullptr)
Select variable with largest domain size.
SetVarBranch SET_VAR_SIZE_MAX(BranchTbl tbl=nullptr)
Select variable with largest unknown set.
IntValBranch INT_VAL_RND(Rnd r)
Select random value.
SetVarBranch SET_VAR_ACTION_MAX(double d=1.0, BranchTbl tbl=nullptr)
Select variable with highest action with decay factor d.
FloatVarBranch FLOAT_VAR_ACTION_SIZE_MIN(double d=1.0, BranchTbl tbl=nullptr)
Select variable with smallest action divided by domain size with decay factor d.
Gecode::IntArgs i({1, 2, 3, 4})
const Val & some(void) const
size_t operator()(const Gecode::DFA &d) const
Return hash key for d.
size_t operator()(const Gecode::SharedArray< int > &x) const
Return hash key for x.
size_t operator()(const Gecode::TupleSet &x) const
Return hash key for x.
#define GECODE_HAS_FLOAT_VARS
#define GECODE_HAS_SET_VARS