Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
9.8 kB · 342 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * Vincent Barichard <Vincent.Barichard@univ-angers.fr> * * Copyright: * Christian Schulte, 2004 * Vincent Barichard, 2012 * * 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 Float { namespace Rel {
/* * Binary bounds consistent equality * */
template<class View0, class View1> forceinline Eq<View0,View1>::Eq(Home home, View0 x0, View1 x1) : MixBinaryPropagator<View0,PC_FLOAT_BND,View1,PC_FLOAT_BND>(home,x0,x1) {}
template<class View0, class View1> ExecStatus Eq<View0,View1>::post(Home home, View0 x0, View1 x1){ if (x0.assigned()) { GECODE_ME_CHECK(x1.eq(home,x0.val())); } else if (x1.assigned()) { GECODE_ME_CHECK(x0.eq(home,x1.val())); } else if (x0 != x1) { GECODE_ME_CHECK(x0.lq(home,x1.max())); GECODE_ME_CHECK(x1.lq(home,x0.max())); GECODE_ME_CHECK(x0.gq(home,x1.min())); GECODE_ME_CHECK(x1.gq(home,x0.min())); (void) new (home) Eq<View0,View1>(home,x0,x1); } return ES_OK; }
template<class View0, class View1> forceinline Eq<View0,View1>::Eq(Space& home, Eq<View0,View1>& p) : MixBinaryPropagator<View0,PC_FLOAT_BND,View1,PC_FLOAT_BND>(home,p) {}
template<class View0, class View1> forceinline Eq<View0,View1>::Eq(Space& home, Propagator& p, View0 x0, View1 x1) : MixBinaryPropagator<View0,PC_FLOAT_BND,View1,PC_FLOAT_BND>(home,p, x0,x1) {}
template<class View0, class View1> Actor* Eq<View0,View1>::copy(Space& home) { return new (home) Eq<View0,View1>(home,*this); }
template<class View0, class View1> ExecStatus Eq<View0,View1>::propagate(Space& home, const ModEventDelta&) { if (x0.assigned()) { GECODE_ME_CHECK(x1.eq(home,x0.val())); } else if (x1.assigned()) { GECODE_ME_CHECK(x0.eq(home,x1.val())); } else { do { GECODE_ME_CHECK(x0.gq(home,x1.min())); GECODE_ME_CHECK(x1.gq(home,x0.min())); } while (x0.min() != x1.min()); do { GECODE_ME_CHECK(x0.lq(home,x1.max())); GECODE_ME_CHECK(x1.lq(home,x0.max())); } while (x0.max() != x1.max()); if (!x0.assigned()) return ES_FIX; } assert(x0.assigned() && x1.assigned()); return home.ES_SUBSUMED(*this); }
/* * Nary bound consistent equality * */
template<class View> forceinline NaryEq<View>::NaryEq(Home home, ViewArray<View>& x) : NaryPropagator<View,PC_FLOAT_BND>(home,x) {}
template<class View> ExecStatus NaryEq<View>::post(Home home, ViewArray<View>& x) { x.unique(home); if (x.size() == 2) { return Eq<View,View>::post(home,x[0],x[1]); } else if (x.size() > 2) { FloatNum l = x[0].min(); FloatNum u = x[0].max(); for (int i=x.size(); i-- > 1; ) { l = std::max(l,x[i].min()); u = std::min(u,x[i].max()); } for (int i=x.size(); i--; ) { GECODE_ME_CHECK(x[i].gq(home,l)); GECODE_ME_CHECK(x[i].lq(home,u)); } (void) new (home) NaryEq<View>(home,x); } return ES_OK; }
template<class View> forceinline NaryEq<View>::NaryEq(Space& home, NaryEq<View>& p) : NaryPropagator<View,PC_FLOAT_BND>(home,p) {}
template<class View> Actor* NaryEq<View>::copy(Space& home) { return new (home) NaryEq<View>(home,*this); }
template<class View> PropCost NaryEq<View>::cost(const Space&, const ModEventDelta& med) const { if (View::me(med) == ME_FLOAT_VAL) return PropCost::unary(PropCost::LO); else return PropCost::linear(PropCost::LO, x.size()); }
template<class View> ExecStatus NaryEq<View>::propagate(Space& home, const ModEventDelta& med) { assert(x.size() > 2); if (View::me(med) == ME_FLOAT_VAL) { // One of the variables is assigned for (int i = 0; ; i++) if (x[i].assigned()) { FloatVal n = x[i].val(); x.move_lst(i); for (int j = x.size(); j--; ) GECODE_ME_CHECK(x[j].eq(home,n)); return home.ES_SUBSUMED(*this); } GECODE_NEVER; }
FloatNum mn = x[0].min(); restart_min: for (int i = x.size(); i--; ) { GECODE_ME_CHECK(x[i].gq(home,mn)); if (mn < x[i].min()) { mn = x[i].min(); goto restart_min; } } FloatNum mx = x[0].max(); restart_max: for (int i = x.size(); i--; ) { GECODE_ME_CHECK(x[i].lq(home,mx)); if (mx > x[i].max()) { mx = x[i].max(); goto restart_max; } } return x[0].assigned() ? home.ES_SUBSUMED(*this) : ES_FIX; }
/* * Reified bounds consistent equality * */
template<class View, class CtrlView, ReifyMode rm> forceinline ReEq<View,CtrlView,rm>::ReEq(Home home, View x0, View x1, CtrlView b) : Int::ReBinaryPropagator<View,PC_FLOAT_BND,CtrlView>(home,x0,x1,b) {}
template<class View, class CtrlView, ReifyMode rm> ExecStatus ReEq<View,CtrlView,rm>::post(Home home, View x0, View x1, CtrlView b){ if (b.one()) { if (rm == RM_PMI) return ES_OK; return Eq<View,View>::post(home,x0,x1); } if (b.zero()) { if (rm == RM_IMP) return ES_OK; return Nq<View,View>::post(home,x0,x1); } if (x0 != x1) { (void) new (home) ReEq(home,x0,x1,b); } else if (rm != RM_IMP) { GECODE_ME_CHECK(b.one(home)); } return ES_OK; }
template<class View, class CtrlView, ReifyMode rm> forceinline ReEq<View,CtrlView,rm>::ReEq(Space& home, ReEq& p) : Int::ReBinaryPropagator<View,PC_FLOAT_BND,CtrlView>(home,p) {}
template<class View, class CtrlView, ReifyMode rm> Actor* ReEq<View,CtrlView,rm>::copy(Space& home) { return new (home) ReEq<View,CtrlView,rm>(home,*this); }
template<class View, class CtrlView, ReifyMode rm> ExecStatus ReEq<View,CtrlView,rm>::propagate(Space& home, const ModEventDelta&) { if (b.one()) { if (rm == RM_PMI) return home.ES_SUBSUMED(*this); GECODE_REWRITE(*this,(Eq<View,View>::post(home(*this),x0,x1))); } if (b.zero()) { if (rm == RM_IMP) return home.ES_SUBSUMED(*this); GECODE_REWRITE(*this,(Nq<View,View>::post(home(*this),x0,x1))); } switch (rtest_eq(x0,x1)) { case RT_TRUE: if (rm != RM_IMP) GECODE_ME_CHECK(b.one_none(home)); break; case RT_FALSE: if (rm != RM_PMI) GECODE_ME_CHECK(b.zero_none(home)); break; case RT_MAYBE: return ES_FIX; default: GECODE_NEVER; } return home.ES_SUBSUMED(*this); }
/* * Reified bounds consistent equality (one variable) * */
template<class View, class CtrlView, ReifyMode rm> forceinline ReEqFloat<View,CtrlView,rm>::ReEqFloat (Home home, View x, FloatVal c0, CtrlView b) : Int::ReUnaryPropagator<View,PC_FLOAT_BND,CtrlView>(home,x,b), c(c0) {}
template<class View, class CtrlView, ReifyMode rm> ExecStatus ReEqFloat<View,CtrlView,rm>::post(Home home, View x, FloatVal c, CtrlView b) { if (b.one()) { if (rm != RM_PMI) GECODE_ME_CHECK(x.eq(home,c)); } else if (x.assigned()) { if (overlap(x.val(),c)) { if (rm != RM_IMP) GECODE_ME_CHECK(b.one(home)); } else { if (rm != RM_PMI) GECODE_ME_CHECK(b.zero(home)); } } else { (void) new (home) ReEqFloat(home,x,c,b); } return ES_OK; }
template<class View, class CtrlView, ReifyMode rm> forceinline ReEqFloat<View,CtrlView,rm>::ReEqFloat(Space& home, ReEqFloat& p) : Int::ReUnaryPropagator<View,PC_FLOAT_BND,CtrlView>(home,p), c(p.c) {}
template<class View, class CtrlView, ReifyMode rm> Actor* ReEqFloat<View,CtrlView,rm>::copy(Space& home) { return new (home) ReEqFloat<View,CtrlView,rm>(home,*this); }
template<class View, class CtrlView, ReifyMode rm> ExecStatus ReEqFloat<View,CtrlView,rm>::propagate(Space& home, const ModEventDelta&) { if (b.one()) { if (rm != RM_PMI) GECODE_ME_CHECK(x0.eq(home,c)); } else { switch (rtest_eq(x0,c)) { case RT_TRUE: if (rm != RM_IMP) GECODE_ME_CHECK(b.one(home)); break; case RT_FALSE: if (rm != RM_PMI) GECODE_ME_CHECK(b.zero(home)); break; case RT_MAYBE: return ES_FIX; default: GECODE_NEVER; } } return home.ES_SUBSUMED(*this); }
}}}
// STATISTICS: float-prop