/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Guido Tack * Christian Schulte * * Copyright: * Guido Tack, 2004 * Christian Schulte, 2004 * * Last modified: * $Date: 2010-03-04 03:32:21 +1100 (Thu, 04 Mar 2010) $ by $Author: schulte $ * $Revision: 10364 $ * * 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 Set { namespace Rel { template forceinline ReSubset::ReSubset(Home home, View0 y0, View1 y1, Gecode::Int::BoolView y2) : Propagator(home), x0(y0), x1(y1), b(y2) { b.subscribe(home,*this, Gecode::Int::PC_INT_VAL); x0.subscribe(home,*this, PC_SET_ANY); x1.subscribe(home,*this, PC_SET_ANY); } template forceinline ReSubset::ReSubset(Space& home, bool share, ReSubset& p) : Propagator(home,share,p) { x0.update(home,share,p.x0); x1.update(home,share,p.x1); b.update(home,share,p.b); } template PropCost ReSubset::cost(const Space&, const ModEventDelta&) const { return PropCost::ternary(PropCost::LO); } template forceinline size_t ReSubset::dispose(Space& home) { b.cancel(home,*this, Gecode::Int::PC_INT_VAL); x0.cancel(home,*this, PC_SET_ANY); x1.cancel(home,*this, PC_SET_ANY); (void) Propagator::dispose(home); return sizeof(*this); } template ExecStatus ReSubset::post(Home home, View0 x0, View1 x1, Gecode::Int::BoolView b) { (void) new (home) ReSubset(home,x0,x1,b); return ES_OK; } template Actor* ReSubset::copy(Space& home, bool share) { return new (home) ReSubset(home,share,*this); } template ExecStatus ReSubset::propagate(Space& home, const ModEventDelta&) { if (b.one()) GECODE_REWRITE(*this,(Subset::post(home(*this),x0,x1))); if (b.zero()) GECODE_REWRITE(*this,(NoSubset::post(home(*this),x0,x1))); // check whether cardinalities still allow subset if (x0.cardMin() > x1.cardMax()) { GECODE_ME_CHECK(b.zero_none(home)); return home.ES_SUBSUMED(*this); } // check lub(x0) subset glb(x1) { LubRanges x0ub(x0); GlbRanges x1lb(x1); Iter::Ranges::Diff,GlbRanges > d(x0ub,x1lb); if (!d()) { GECODE_ME_CHECK(b.one_none(home)); return home.ES_SUBSUMED(*this); } } // check glb(x0) subset lub(x1) { GlbRanges x0lb(x0); LubRanges x1ub(x1); Iter::Ranges::Diff,LubRanges > d(x0lb,x1ub); if (d()) { GECODE_ME_CHECK(b.zero_none(home)); return home.ES_SUBSUMED(*this); } else if (x0.assigned() && x1.assigned()) { GECODE_ME_CHECK(b.one_none(home)); return home.ES_SUBSUMED(*this); } } if (x0.cardMin() > 0) { LubRanges x0ub(x0); LubRanges x1ub(x1); Iter::Ranges::Inter,LubRanges > i(x0ub,x1ub); if (!i()) { GECODE_ME_CHECK(b.zero_none(home)); return home.ES_SUBSUMED(*this); } } return ES_FIX; } }}} // STATISTICS: set-prop