Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
19 kB · 628 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2002 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
#include <gecode/int/rel.hh>#include <gecode/int/bool.hh>
#include <algorithm>
namespace Gecode {
void rel(Home home, IntVar x0, IntRelType irt, int n, IntPropLevel) { using namespace Int; Limits::check(n,"Int::rel"); GECODE_POST; IntView x(x0); switch (irt) { case IRT_EQ: GECODE_ME_FAIL(x.eq(home,n)); break; case IRT_NQ: GECODE_ME_FAIL(x.nq(home,n)); break; case IRT_LQ: GECODE_ME_FAIL(x.lq(home,n)); break; case IRT_LE: GECODE_ME_FAIL(x.le(home,n)); break; case IRT_GQ: GECODE_ME_FAIL(x.gq(home,n)); break; case IRT_GR: GECODE_ME_FAIL(x.gr(home,n)); break; default: throw UnknownRelation("Int::rel"); } }
void rel(Home home, const IntVarArgs& x, IntRelType irt, int n, IntPropLevel) { using namespace Int; Limits::check(n,"Int::rel"); GECODE_POST; switch (irt) { case IRT_EQ: for (int i=0; i<x.size(); i++) { IntView xi(x[i]); GECODE_ME_FAIL(xi.eq(home,n)); } break; case IRT_NQ: for (int i=0; i<x.size(); i++) { IntView xi(x[i]); GECODE_ME_FAIL(xi.nq(home,n)); } break; case IRT_LQ: for (int i=0; i<x.size(); i++) { IntView xi(x[i]); GECODE_ME_FAIL(xi.lq(home,n)); } break; case IRT_LE: for (int i=0; i<x.size(); i++) { IntView xi(x[i]); GECODE_ME_FAIL(xi.le(home,n)); } break; case IRT_GQ: for (int i=0; i<x.size(); i++) { IntView xi(x[i]); GECODE_ME_FAIL(xi.gq(home,n)); } break; case IRT_GR: for (int i=0; i<x.size(); i++) { IntView xi(x[i]); GECODE_ME_FAIL(xi.gr(home,n)); } break; default: throw UnknownRelation("Int::rel"); } }
void rel(Home home, IntVar x0, IntRelType irt, IntVar x1, IntPropLevel ipl) { using namespace Int; GECODE_POST; switch (irt) { case IRT_EQ: if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) { GECODE_ES_FAIL((Rel::EqDom<IntView,IntView>::post(home,x0,x1))); } else { GECODE_ES_FAIL((Rel::EqBnd<IntView,IntView>::post(home,x0,x1))); } break; case IRT_NQ: GECODE_ES_FAIL((Rel::Nq<IntView,IntView>::post(home,x0,x1))); break; case IRT_GQ: std::swap(x0,x1); // Fall through case IRT_LQ: GECODE_ES_FAIL((Rel::Lq<IntView,IntView>::post(home,x0,x1))); break; case IRT_GR: std::swap(x0,x1); // Fall through case IRT_LE: GECODE_ES_FAIL((Rel::Le<IntView,IntView>::post(home,x0,x1))); break; default: throw UnknownRelation("Int::rel"); } }
void rel(Home home, const IntVarArgs& x, IntRelType irt, IntVar y, IntPropLevel ipl) { using namespace Int; GECODE_POST; switch (irt) { case IRT_EQ: { ViewArray<IntView> xv(home,x.size()+1); xv[x.size()]=y; for (int i=0; i<x.size(); i++) xv[i]=x[i]; if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) { GECODE_ES_FAIL(Rel::NaryEqDom<IntView>::post(home,xv)); } else { GECODE_ES_FAIL(Rel::NaryEqBnd<IntView>::post(home,xv)); } } break; case IRT_NQ: for (int i=0; i<x.size(); i++) { GECODE_ES_FAIL((Rel::Nq<IntView,IntView>::post(home,x[i],y))); } break; case IRT_GQ: for (int i=0; i<x.size(); i++) { GECODE_ES_FAIL((Rel::Lq<IntView,IntView>::post(home,y,x[i]))); } break; case IRT_LQ: for (int i=0; i<x.size(); i++) { GECODE_ES_FAIL((Rel::Lq<IntView,IntView>::post(home,x[i],y))); } break; case IRT_GR: for (int i=0; i<x.size(); i++) { GECODE_ES_FAIL((Rel::Le<IntView,IntView>::post(home,y,x[i]))); } break; case IRT_LE: for (int i=0; i<x.size(); i++) { GECODE_ES_FAIL((Rel::Le<IntView,IntView>::post(home,x[i],y))); } break; default: throw UnknownRelation("Int::rel"); } }
void rel(Home home, IntVar x0, IntRelType irt, IntVar x1, Reify r, IntPropLevel ipl) { using namespace Int; GECODE_POST; switch (irt) { case IRT_EQ: if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqDom<IntView,BoolView,RM_EQV> ::post(home,x0,x1,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqDom<IntView,BoolView,RM_IMP> ::post(home,x0,x1,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqDom<IntView,BoolView,RM_PMI> ::post(home,x0,x1,r.var()))); break; default: throw UnknownReifyMode("Int::rel"); } } else { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqBnd<IntView,BoolView,RM_EQV> ::post(home,x0,x1,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqBnd<IntView,BoolView,RM_IMP> ::post(home,x0,x1,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqBnd<IntView,BoolView,RM_PMI> ::post(home,x0,x1,r.var()))); break; default: throw UnknownReifyMode("Int::rel"); } } break; case IRT_NQ: { NegBoolView n(r.var()); if (vbd(ipl) == IPL_BND) { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqBnd<IntView,NegBoolView,RM_EQV> ::post(home,x0,x1,n))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqBnd<IntView,NegBoolView,RM_PMI> ::post(home,x0,x1,n))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqBnd<IntView,NegBoolView,RM_IMP> ::post(home,x0,x1,n))); break; default: throw UnknownReifyMode("Int::rel"); } } else { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqDom<IntView,NegBoolView,RM_EQV> ::post(home,x0,x1,n))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqDom<IntView,NegBoolView,RM_PMI> ::post(home,x0,x1,n))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqDom<IntView,NegBoolView,RM_IMP> ::post(home,x0,x1,n))); break; default: throw UnknownReifyMode("Int::rel"); } } } break; case IRT_GQ: std::swap(x0,x1); // Fall through case IRT_LQ: switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReLq<IntView,BoolView,RM_EQV> ::post(home,x0,x1,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReLq<IntView,BoolView,RM_IMP> ::post(home,x0,x1,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReLq<IntView,BoolView,RM_PMI> ::post(home,x0,x1,r.var()))); break; default: throw UnknownReifyMode("Int::rel"); } break; case IRT_LE: std::swap(x0,x1); // Fall through case IRT_GR: { NegBoolView n(r.var()); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReLq<IntView,NegBoolView,RM_EQV> ::post(home,x0,x1,n))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReLq<IntView,NegBoolView,RM_PMI> ::post(home,x0,x1,n))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReLq<IntView,NegBoolView,RM_IMP> ::post(home,x0,x1,n))); break; default: throw UnknownReifyMode("Int::rel"); } } break; default: throw UnknownRelation("Int::rel"); } }
void rel(Home home, IntVar x, IntRelType irt, int n, Reify r, IntPropLevel ipl) { using namespace Int; Limits::check(n,"Int::rel"); GECODE_POST; switch (irt) { case IRT_EQ: if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqDomInt<IntView,BoolView,RM_EQV> ::post(home,x,n,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqDomInt<IntView,BoolView,RM_IMP> ::post(home,x,n,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqDomInt<IntView,BoolView,RM_PMI> ::post(home,x,n,r.var()))); break; default: throw UnknownReifyMode("Int::rel"); } } else { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqBndInt<IntView,BoolView,RM_EQV> ::post(home,x,n,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqBndInt<IntView,BoolView,RM_IMP> ::post(home,x,n,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqBndInt<IntView,BoolView,RM_PMI> ::post(home,x,n,r.var()))); break; default: throw UnknownReifyMode("Int::rel"); } } break; case IRT_NQ: { NegBoolView nb(r.var()); if (vbd(ipl) == IPL_BND) { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqBndInt<IntView,NegBoolView,RM_EQV> ::post(home,x,n,nb))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqBndInt<IntView,NegBoolView,RM_PMI> ::post(home,x,n,nb))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqBndInt<IntView,NegBoolView,RM_IMP> ::post(home,x,n,nb))); break; default: throw UnknownReifyMode("Int::rel"); } } else { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqDomInt<IntView,NegBoolView,RM_EQV> ::post(home,x,n,nb))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqDomInt<IntView,NegBoolView,RM_PMI> ::post(home,x,n,nb))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqDomInt<IntView,NegBoolView,RM_IMP> ::post(home,x,n,nb))); break; default: throw UnknownReifyMode("Int::rel"); } } } break; case IRT_LE: n--; // Fall through case IRT_LQ: switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReLqInt<IntView,BoolView,RM_EQV> ::post(home,x,n,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReLqInt<IntView,BoolView,RM_IMP> ::post(home,x,n,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReLqInt<IntView,BoolView,RM_PMI> ::post(home,x,n,r.var()))); break; default: throw UnknownReifyMode("Int::rel"); } break; case IRT_GQ: n--; // Fall through case IRT_GR: { NegBoolView nb(r.var()); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReLqInt<IntView,NegBoolView,RM_EQV> ::post(home,x,n,nb))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReLqInt<IntView,NegBoolView,RM_PMI> ::post(home,x,n,nb))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReLqInt<IntView,NegBoolView,RM_IMP> ::post(home,x,n,nb))); break; default: throw UnknownReifyMode("Int::rel"); } } break; default: throw UnknownRelation("Int::rel"); } }
void rel(Home home, const IntVarArgs& x, IntRelType irt, IntPropLevel ipl) { using namespace Int; GECODE_POST; if ((irt != IRT_NQ) && (x.size() < 2)) return; switch (irt) { case IRT_EQ: { ViewArray<IntView> xv(home,x); if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) { GECODE_ES_FAIL(Rel::NaryEqDom<IntView>::post(home,xv)); } else { GECODE_ES_FAIL(Rel::NaryEqBnd<IntView>::post(home,xv)); } } break; case IRT_NQ: { ViewArray<IntView> y(home,x); GECODE_ES_FAIL((Rel::NaryNq<IntView>::post(home,y))); } break; case IRT_LE: { ViewArray<IntView> y(home,x); GECODE_ES_FAIL((Rel::NaryLqLe<IntView,1>::post(home,y))); } break; case IRT_LQ: { ViewArray<IntView> y(home,x); GECODE_ES_FAIL((Rel::NaryLqLe<IntView,0>::post(home,y))); } break; case IRT_GR: { ViewArray<IntView> y(home,x.size()); for (int i=0; i<x.size(); i++) y[i] = x[x.size()-1-i]; GECODE_ES_FAIL((Rel::NaryLqLe<IntView,1>::post(home,y))); } break; case IRT_GQ: { ViewArray<IntView> y(home,x.size()); for (int i=0; i<x.size(); i++) y[i] = x[x.size()-1-i]; GECODE_ES_FAIL((Rel::NaryLqLe<IntView,0>::post(home,y))); } break; default: throw UnknownRelation("Int::rel"); } }
void rel(Home home, const IntVarArgs& x, IntRelType irt, const IntVarArgs& y, IntPropLevel ipl) { using namespace Int; GECODE_POST;
switch (irt) { case IRT_GR: { ViewArray<IntView> xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexLqLe<IntView,IntView> ::post(home,yv,xv,true))); } break; case IRT_LE: { ViewArray<IntView> xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexLqLe<IntView,IntView> ::post(home,xv,yv,true))); } break; case IRT_GQ: { ViewArray<IntView> xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexLqLe<IntView,IntView> ::post(home,yv,xv,false))); } break; case IRT_LQ: { ViewArray<IntView> xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexLqLe<IntView,IntView> ::post(home,xv,yv,false))); } break; case IRT_EQ: if (x.size() != y.size()) { home.fail(); } else if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) for (int i=0; i<x.size(); i++) { GECODE_ES_FAIL((Rel::EqDom<IntView,IntView> ::post(home,x[i],y[i]))); } else for (int i=0; i<x.size(); i++) { GECODE_ES_FAIL((Rel::EqBnd<IntView,IntView> ::post(home,x[i],y[i]))); } break; case IRT_NQ: { ViewArray<IntView> xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexNq<IntView,IntView> ::post(home,xv,yv))); } break; default: throw UnknownRelation("Int::rel"); } }
namespace {
/// Return view array ViewArray<Int::ConstIntView> viewarray(Space& home, const IntArgs& x) { ViewArray<Int::ConstIntView> xv(home, x.size()); for (int i=0; i<x.size(); i++) { Int::Limits::check(x[i],"Int::rel"); xv[i] = Int::ConstIntView(x[i]); } return xv; }
}
void rel(Home home, const IntVarArgs& x, IntRelType irt, const IntArgs& y, IntPropLevel) { using namespace Int; GECODE_POST;
switch (irt) { case IRT_GR: { ViewArray<IntView> xv(home,x); ViewArray<ConstIntView> yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexLqLe<ConstIntView,IntView> ::post(home,yv,xv,true))); } break; case IRT_LE: { ViewArray<IntView> xv(home,x); ViewArray<ConstIntView> yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexLqLe<IntView,ConstIntView> ::post(home,xv,yv,true))); } break; case IRT_GQ: { ViewArray<IntView> xv(home,x); ViewArray<ConstIntView> yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexLqLe<ConstIntView,IntView> ::post(home,yv,xv,false))); } break; case IRT_LQ: { ViewArray<IntView> xv(home,x); ViewArray<ConstIntView> yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexLqLe<IntView,ConstIntView> ::post(home,xv,yv,false))); } break; case IRT_EQ: if (x.size() != y.size()) { home.fail(); } else { for (int i=0; i<x.size(); i++) GECODE_ME_FAIL(IntView(x[i]).eq(home,y[i])); } break; case IRT_NQ: { ViewArray<IntView> xv(home,x); ViewArray<ConstIntView> yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexNq<IntView,ConstIntView> ::post(home,xv,yv))); } break; default: throw UnknownRelation("Int::rel"); } }
void rel(Home home, const IntArgs& x, IntRelType irt, const IntVarArgs& y, IntPropLevel ipl) { rel(home,y,irt,x,ipl); }
}
// STATISTICS: int-post