/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Christian Schulte * * 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 #include #include 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::post(home,x0,x1))); } else { GECODE_ES_FAIL((Rel::EqBnd::post(home,x0,x1))); } break; case IRT_NQ: GECODE_ES_FAIL((Rel::Nq::post(home,x0,x1))); break; case IRT_GQ: std::swap(x0,x1); // Fall through case IRT_LQ: GECODE_ES_FAIL((Rel::Lq::post(home,x0,x1))); break; case IRT_GR: std::swap(x0,x1); // Fall through case IRT_LE: GECODE_ES_FAIL((Rel::Le::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 xv(home,x.size()+1); xv[x.size()]=y; for (int i=0; i::post(home,xv)); } else { GECODE_ES_FAIL(Rel::NaryEqBnd::post(home,xv)); } } break; case IRT_NQ: for (int i=0; i::post(home,x[i],y))); } break; case IRT_GQ: for (int i=0; i::post(home,y,x[i]))); } break; case IRT_LQ: for (int i=0; i::post(home,x[i],y))); } break; case IRT_GR: for (int i=0; i::post(home,y,x[i]))); } break; case IRT_LE: for (int i=0; i::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 ::post(home,x0,x1,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqDom ::post(home,x0,x1,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqDom ::post(home,x0,x1,r.var()))); break; default: throw UnknownReifyMode("Int::rel"); } } else { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqBnd ::post(home,x0,x1,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqBnd ::post(home,x0,x1,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqBnd ::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 ::post(home,x0,x1,n))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqBnd ::post(home,x0,x1,n))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqBnd ::post(home,x0,x1,n))); break; default: throw UnknownReifyMode("Int::rel"); } } else { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqDom ::post(home,x0,x1,n))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqDom ::post(home,x0,x1,n))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqDom ::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 ::post(home,x0,x1,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReLq ::post(home,x0,x1,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReLq ::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 ::post(home,x0,x1,n))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReLq ::post(home,x0,x1,n))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReLq ::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 ::post(home,x,n,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqDomInt ::post(home,x,n,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqDomInt ::post(home,x,n,r.var()))); break; default: throw UnknownReifyMode("Int::rel"); } } else { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqBndInt ::post(home,x,n,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqBndInt ::post(home,x,n,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqBndInt ::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 ::post(home,x,n,nb))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqBndInt ::post(home,x,n,nb))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqBndInt ::post(home,x,n,nb))); break; default: throw UnknownReifyMode("Int::rel"); } } else { switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((Rel::ReEqDomInt ::post(home,x,n,nb))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReEqDomInt ::post(home,x,n,nb))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReEqDomInt ::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 ::post(home,x,n,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReLqInt ::post(home,x,n,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReLqInt ::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 ::post(home,x,n,nb))); break; case RM_IMP: GECODE_ES_FAIL((Rel::ReLqInt ::post(home,x,n,nb))); break; case RM_PMI: GECODE_ES_FAIL((Rel::ReLqInt ::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 xv(home,x); if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) { GECODE_ES_FAIL(Rel::NaryEqDom::post(home,xv)); } else { GECODE_ES_FAIL(Rel::NaryEqBnd::post(home,xv)); } } break; case IRT_NQ: { ViewArray y(home,x); GECODE_ES_FAIL((Rel::NaryNq::post(home,y))); } break; case IRT_LE: { ViewArray y(home,x); GECODE_ES_FAIL((Rel::NaryLqLe::post(home,y))); } break; case IRT_LQ: { ViewArray y(home,x); GECODE_ES_FAIL((Rel::NaryLqLe::post(home,y))); } break; case IRT_GR: { ViewArray y(home,x.size()); for (int i=0; i::post(home,y))); } break; case IRT_GQ: { ViewArray y(home,x.size()); for (int i=0; i::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 xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexLqLe ::post(home,yv,xv,true))); } break; case IRT_LE: { ViewArray xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexLqLe ::post(home,xv,yv,true))); } break; case IRT_GQ: { ViewArray xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexLqLe ::post(home,yv,xv,false))); } break; case IRT_LQ: { ViewArray xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexLqLe ::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 ::post(home,x[i],y[i]))); } else for (int i=0; i ::post(home,x[i],y[i]))); } break; case IRT_NQ: { ViewArray xv(home,x), yv(home,y); GECODE_ES_FAIL((Rel::LexNq ::post(home,xv,yv))); } break; default: throw UnknownRelation("Int::rel"); } } namespace { /// Return view array ViewArray viewarray(Space& home, const IntArgs& x) { ViewArray xv(home, x.size()); for (int i=0; i xv(home,x); ViewArray yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexLqLe ::post(home,yv,xv,true))); } break; case IRT_LE: { ViewArray xv(home,x); ViewArray yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexLqLe ::post(home,xv,yv,true))); } break; case IRT_GQ: { ViewArray xv(home,x); ViewArray yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexLqLe ::post(home,yv,xv,false))); } break; case IRT_LQ: { ViewArray xv(home,x); ViewArray yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexLqLe ::post(home,xv,yv,false))); } break; case IRT_EQ: if (x.size() != y.size()) { home.fail(); } else { for (int i=0; i xv(home,x); ViewArray yv(viewarray(home,y)); GECODE_ES_FAIL((Rel::LexNq ::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