/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Christian Schulte * * Copyright: * Christian Schulte, 2004 * * Last modified: * $Date: 2008-01-31 18:29:16 +0100 (Thu, 31 Jan 2008) $ by $Author: tack $ * $Revision: 6017 $ * * 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. * */ namespace Gecode { namespace Int { namespace Linear { /* * Base-class * */ template LinBoolView::LinBoolView(Space* home, ViewArray& x0, YV y0, int c0) : Propagator(home), x(x0), y(y0), c(c0) { x.subscribe(home,this,PC_INT_VAL); y.subscribe(home,this,PC_INT_BND); } template forceinline size_t LinBoolView::dispose(Space* home) { assert(!home->failed()); x.cancel(home,this,PC_INT_VAL); y.cancel(home,this,PC_INT_BND); (void) Propagator::dispose(home); return sizeof(*this); } template forceinline LinBoolView::LinBoolView(Space* home, bool share, LinBoolView& p) : Propagator(home,share,p), c(p.c) { x.update(home,share,p.x); y.update(home,share,p.y); } template PropCost LinBoolView::cost(ModEventDelta) const { return cost_lo(x.size(),PC_LINEAR_LO); } template Reflection::ActorSpec LinBoolView::spec(const Space* home, Reflection::VarMap& m, const Support::Symbol& ati) const { Reflection::ActorSpec s(ati); return s << x.spec(home, m) << y.spec(home, m) << c; } /* * Equality propagator * */ template forceinline EqBoolView::EqBoolView(Space* home, ViewArray& x, YV y, int c) : LinBoolView(home,x,y,c) {} template ExecStatus EqBoolView::post(Space* home, ViewArray& x, YV y, int c) { if (y.assigned()) return EqBoolInt::post(home,x,y.val()+c); int n = x.size(); for (int i = n; i--; ) if (x[i].one()) { x[i]=x[--n]; c--; } else if (x[i].zero()) { x[i]=x[--n]; } x.size(n); GECODE_ME_CHECK(y.lq(home,n-c)); GECODE_ME_CHECK(y.gq(home,-c)); if (n == 0) return ES_OK; if (y.min()+c == n) { assert(y.assigned()); for (int i = n; i--; ) GECODE_ME_CHECK(x[i].one_none(home)); return ES_OK; } if (y.max()+c == 0) { assert(y.assigned()); for (int i = n; i--; ) GECODE_ME_CHECK(x[i].zero_none(home)); return ES_OK; } (void) new (home) EqBoolView(home,x,y,c); return ES_OK; } template forceinline EqBoolView::EqBoolView(Space* home, bool share, EqBoolView& p) : LinBoolView(home,share,p) {} template Actor* EqBoolView::copy(Space* home, bool share) { return new (home) EqBoolView(home,share,*this); } template inline Support::Symbol EqBoolView::ati(void) { return Reflection::mangle("Gecode::Int::Linear::EqBoolView"); } template Reflection::ActorSpec EqBoolView::spec(const Space* home, Reflection::VarMap& m) const { return LinBoolView::spec(home, m, ati()); } template void EqBoolView::post(Space* home, Reflection::VarMap& vars, const Reflection::ActorSpec& spec) { spec.checkArity(3); ViewArray x(home, vars, spec[0]); YV y(home, vars, spec[1]); int c = spec[2]->toInt(); (void) new (home) EqBoolView(home, x, y, c); } template ExecStatus EqBoolView::propagate(Space* home, ModEventDelta) { int n = x.size(); for (int i = n; i--; ) if (x[i].one()) { x[i]=x[--n]; c--; } else if (x[i].zero()) { x[i]=x[--n]; } x.size(n); GECODE_ME_CHECK(y.lq(home,n-c)); GECODE_ME_CHECK(y.gq(home,-c)); if (n == 0) return ES_SUBSUMED(this,sizeof(*this)); if (y.min()+c == n) { assert(y.assigned()); for (int i = n; i--; ) GECODE_ME_CHECK(x[i].one_none(home)); return ES_SUBSUMED(this,sizeof(*this)); } if (y.max()+c == 0) { assert(y.assigned()); for (int i = n; i--; ) GECODE_ME_CHECK(x[i].zero_none(home)); return ES_SUBSUMED(this,sizeof(*this)); } if (y.assigned()) GECODE_REWRITE(this,EqBoolInt::post(home,x,y.val()+c)); return ES_FIX; } /* * Disequality propagator * */ template forceinline NqBoolView::NqBoolView(Space* home, ViewArray& x, YV y, int c) : LinBoolView(home,x,y,c) {} template ExecStatus NqBoolView::post(Space* home, ViewArray& x, YV y, int c) { if (y.assigned()) return NqBoolInt::post(home,x,y.val()+c); int n = x.size(); for (int i = n; i--; ) if (x[i].one()) { x[i]=x[--n]; c--; } else if (x[i].zero()) { x[i]=x[--n]; } x.size(n); if ((n-c < y.min() ) || (-c > y.max())) return ES_OK; if (n == 0) { GECODE_ME_CHECK(y.nq(home,-c)); return ES_OK; } if ((n == 1) && y.assigned()) { if (y.val()+c == 1) { GECODE_ME_CHECK(x[0].zero_none(home)); } else { assert(y.val()+c == 0); GECODE_ME_CHECK(x[0].one_none(home)); } return ES_OK; } (void) new (home) NqBoolView(home,x,y,c); return ES_OK; } template forceinline NqBoolView::NqBoolView(Space* home, bool share, NqBoolView& p) : LinBoolView(home,share,p) {} template Actor* NqBoolView::copy(Space* home, bool share) { return new (home) NqBoolView(home,share,*this); } template inline Support::Symbol NqBoolView::ati(void) { return Reflection::mangle("Gecode::Int::Linear::NqBoolView"); } template Reflection::ActorSpec NqBoolView::spec(const Space* home, Reflection::VarMap& m) const { return LinBoolView::spec(home, m, ati()); } template void NqBoolView::post(Space* home, Reflection::VarMap& vars, const Reflection::ActorSpec& spec) { spec.checkArity(3); ViewArray x(home, vars, spec[0]); YV y(home, vars, spec[1]); int c = spec[2]->toInt(); (void) new (home) NqBoolView(home, x, y, c); } template ExecStatus NqBoolView::propagate(Space* home, ModEventDelta) { int n = x.size(); for (int i = n; i--; ) if (x[i].one()) { x[i]=x[--n]; c--; } else if (x[i].zero()) { x[i]=x[--n]; } x.size(n); if ((n-c < y.min() ) || (-c > y.max())) return ES_SUBSUMED(this,home); if (n == 0) { GECODE_ME_CHECK(y.nq(home,-c)); return ES_SUBSUMED(this,home); } if ((n == 1) && y.assigned()) { if (y.val()+c == 1) { GECODE_ME_CHECK(x[0].zero_none(home)); } else { assert(y.val()+c == 0); GECODE_ME_CHECK(x[0].one_none(home)); } return ES_SUBSUMED(this,sizeof(*this)); } return ES_FIX; } /* * Greater or equal propagator * */ template forceinline GqBoolView::GqBoolView(Space* home, ViewArray& x, YV y, int c) : LinBoolView(home,x,y,c) {} template ExecStatus GqBoolView::post(Space* home, ViewArray& x, YV y, int c) { if (y.assigned()) return GqBoolInt::post(home,x,y.val()+c); // Eliminate assigned views int n = x.size(); for (int i = n; i--; ) if (x[i].one()) { x[i]=x[--n]; c--; } else if (x[i].zero()) { x[i]=x[--n]; } x.size(n); GECODE_ME_CHECK(y.lq(home,n-c)); if (-c >= y.max()) return ES_OK; if (y.min()+c == n) { for (int i = n; i--; ) GECODE_ME_CHECK(x[i].one_none(home)); return ES_OK; } (void) new (home) GqBoolView(home,x,y,c); return ES_OK; } template forceinline GqBoolView::GqBoolView(Space* home, bool share, GqBoolView& p) : LinBoolView(home,share,p) {} template Actor* GqBoolView::copy(Space* home, bool share) { return new (home) GqBoolView(home,share,*this); } template inline Support::Symbol GqBoolView::ati(void) { return Reflection::mangle("Gecode::Int::Linear::GqBoolView"); } template Reflection::ActorSpec GqBoolView::spec(const Space* home, Reflection::VarMap& m) const { return LinBoolView::spec(home, m, ati()); } template void GqBoolView::post(Space* home, Reflection::VarMap& vars, const Reflection::ActorSpec& spec) { spec.checkArity(3); ViewArray x(home, vars, spec[0]); YV y(home, vars, spec[1]); int c = spec[2]->toInt(); (void) new (home) GqBoolView(home, x, y, c); } template ExecStatus GqBoolView::propagate(Space* home, ModEventDelta) { int n = x.size(); for (int i = n; i--; ) if (x[i].one()) { x[i]=x[--n]; c--; } else if (x[i].zero()) { x[i]=x[--n]; } x.size(n); GECODE_ME_CHECK(y.lq(home,n-c)); if (-c >= y.max()) return ES_SUBSUMED(this,home); if (y.min()+c == n) { for (int i = n; i--; ) GECODE_ME_CHECK(x[i].one_none(home)); return ES_SUBSUMED(this,home); } if (y.assigned()) GECODE_REWRITE(this,GqBoolInt::post(home,x,y.val()+c)); return ES_FIX; } }}} // STATISTICS: int-prop