/* -*- 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 Dom { template forceinline ReIntSet::ReIntSet (Space* home, View x, const IntSet& s, BoolView b) : ReUnaryPropagator(home,x,b), is(s) { Propagator::force(home); } template forceinline size_t ReIntSet::dispose(Space* home) { Propagator::unforce(home); is.~IntSet(); (void) ReUnaryPropagator::dispose(home); return sizeof(*this); } template ExecStatus ReIntSet::post(Space* home, View x, const IntSet& s, BoolView b) { if (s.size() == 0) { GECODE_ME_CHECK(b.zero(home)); } else if (s.size() == 1) { return ReRange::post(home,x,s.min(),s.max(),b); } else { (void) new (home) ReIntSet(home,x,s,b); } return ES_OK; } template forceinline ReIntSet::ReIntSet(Space* home, bool share, ReIntSet& p) : ReUnaryPropagator(home,share,p) { is.update(home,share,p.is); } template Actor* ReIntSet::copy(Space* home, bool share) { return new (home) ReIntSet(home,share,*this); } template inline Support::Symbol ReIntSet::ati(void) { return Reflection::mangle("Gecode::Int::Dom::ReIntSet"); } template Reflection::ActorSpec ReIntSet::spec(const Space* home, Reflection::VarMap& m) const { Reflection::ActorSpec s = ReUnaryPropagator::spec(home, m, ati()); int count=0; for (IntSetRanges isr(is); isr(); ++isr) count++; Reflection::IntArrayArg* a = Reflection::Arg::newIntArray(count*2); count = 0; for (IntSetRanges isr(is); isr(); ++isr) { (*a)[count++] = isr.min(); (*a)[count++] = isr.max(); } return s << a; } template void ReIntSet::post(Space* home, Reflection::VarMap& vars, const Reflection::ActorSpec& spec) { spec.checkArity(3); View x0(home, vars, spec[0]); BoolView b(home, vars, spec[1]); Reflection::IntArrayArgRanges r(spec[2]->toIntArray()); (void) new (home) ReIntSet(home, x0, IntSet(r), b); } template ExecStatus ReIntSet::propagate(Space* home, ModEventDelta) { IntSetRanges i_is(is); if (b.one()) { GECODE_ME_CHECK(x0.inter_r(home,i_is,false)); goto subsumed; } if (b.zero()) { GECODE_ME_CHECK(x0.minus_r(home,i_is,false)); goto subsumed; } { ViewRanges i_x(x0); switch (Iter::Ranges::subsumes(i_is,i_x)) { case Iter::Ranges::SS_SUBSUMED: GECODE_ME_CHECK(b.one_none(home)); goto subsumed; case Iter::Ranges::SS_EMPTY: GECODE_ME_CHECK(b.zero_none(home)); goto subsumed; case Iter::Ranges::SS_NONE: break; default: GECODE_NEVER; } } return ES_FIX; subsumed: return ES_SUBSUMED(this,home); } }}} // STATISTICS: int-prop