Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
5.2 kB · 192 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2004 * * 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 <algorithm>
namespace Gecode { namespace Int { namespace Rel {
/* * Disequality * */ template<class V0, class V1> forceinline Nq<V0,V1>::Nq(Home home, V0 x0, V1 x1) : MixBinaryPropagator<V0,PC_INT_VAL,V1,PC_INT_VAL>(home,x0,x1) {}
template<class V0, class V1> ExecStatus Nq<V0,V1>::post(Home home, V0 x0, V1 x1){ if (x0.assigned()) { GECODE_ME_CHECK(x1.nq(home,x0.val())); } else if (x1.assigned()) { GECODE_ME_CHECK(x0.nq(home,x1.val())); } else if (x0 == x1) { return ES_FAILED; } else { (void) new (home) Nq<V0,V1>(home,x0,x1); } return ES_OK; }
template<class V0, class V1> forceinline Nq<V0,V1>::Nq(Space& home, Nq<V0,V1>& p) : MixBinaryPropagator<V0,PC_INT_VAL,V1,PC_INT_VAL>(home,p) {}
template<class V0, class V1> Actor* Nq<V0,V1>::copy(Space& home) { return new (home) Nq<V0,V1>(home,*this); }
template<class V0, class V1> PropCost Nq<V0,V1>::cost(const Space&, const ModEventDelta&) const { return PropCost::unary(PropCost::LO); }
template<class V0, class V1> ExecStatus Nq<V0,V1>::propagate(Space& home, const ModEventDelta&) { if (x0.assigned()) { GECODE_ME_CHECK(x1.nq(home,x0.val())); } else { GECODE_ME_CHECK(x0.nq(home,x1.val())); } return home.ES_SUBSUMED(*this); }
/* * Nary disequality propagator */ template<class View> forceinline NaryNq<View>::NaryNq(Home home, ViewArray<View>& x) : NaryPropagator<View,PC_INT_VAL>(home,x) {}
template<class View> PropCost NaryNq<View>::cost(const Space&, const ModEventDelta&) const { return PropCost::linear(PropCost::LO,x.size()); }
template<class View> forceinline NaryNq<View>::NaryNq(Space& home, NaryNq<View>& p) : NaryPropagator<View,PC_INT_VAL>(home,p) {}
template<class View> Actor* NaryNq<View>::copy(Space& home) { return new (home) NaryNq<View>(home,*this); }
template<class View> inline ExecStatus NaryNq<View>::post(Home home, ViewArray<View>& x) { x.unique(); // Try to find an assigned view int n = x.size(); if (n <= 1) return ES_FAILED; for (int i=n; i--; ) if (x[i].assigned()) { std::swap(x[0],x[i]); break; } if (x[0].assigned()) { int v = x[0].val(); // Eliminate all equal views and possibly find disequal view for (int i=n-1; i>0; i--) if (!x[i].in(v)) { return ES_OK; } else if (x[i].assigned()) { assert(x[i].val() == v); x[i]=x[--n]; } x.size(n); } if (n == 1) return ES_FAILED; if (n == 2) return Nq<View,View>::post(home,x[0],x[1]); (void) new (home) NaryNq(home,x); return ES_OK; }
template<class View> forceinline size_t NaryNq<View>::dispose(Space& home) { (void) NaryPropagator<View,PC_INT_VAL>::dispose(home); return sizeof(*this); }
template<class View> ExecStatus NaryNq<View>::propagate(Space& home, const ModEventDelta&) { // Make sure that x[0] is assigned if (!x[0].assigned()) { // Note that there is at least one assigned view for (int i=1; true; i++) if (x[i].assigned()) { std::swap(x[0],x[i]); break; } } int v = x[0].val(); int n = x.size(); for (int i=n-1; i>0; i--) if (!x[i].in(v)) { x.size(n); return home.ES_SUBSUMED(*this); } else if (x[i].assigned()) { assert(x[i].val() == v); x[i] = x[--n]; } x.size(n); if (n == 1) return ES_FAILED; if (n == 2) { GECODE_ME_CHECK(x[1].nq(home,v)); return home.ES_SUBSUMED(*this); } return ES_FIX; }
}}}
// STATISTICS: int-prop