Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
11 kB · 399 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * Gabor Szokoli <szokoli@gecode.org> * Vincent Barichard <Vincent.Barichard@univ-angers.fr> * * Copyright: * Christian Schulte, 2003 * Gabor Szokoli, 2003 * 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 {
/* * Less or equal propagator * */
template<class View> forceinline Lq<View>::Lq(Home home, View x0, View x1) : BinaryPropagator<View,PC_FLOAT_BND>(home,x0,x1) {}
template<class View> ExecStatus Lq<View>::post(Home home, View x0, View x1) { GECODE_ME_CHECK(x0.lq(home,x1.max())); GECODE_ME_CHECK(x1.gq(home,x0.min())); if ((x0 != x1) && (x0.max() > x1.min())) (void) new (home) Lq<View>(home,x0,x1); return ES_OK; }
template<class View> forceinline Lq<View>::Lq(Space& home, Lq<View>& p) : BinaryPropagator<View,PC_FLOAT_BND>(home,p) {}
template<class View> Actor* Lq<View>::copy(Space& home) { return new (home) Lq<View>(home,*this); }
template<class View> ExecStatus Lq<View>::propagate(Space& home, const ModEventDelta&) { GECODE_ME_CHECK(x0.lq(home,x1.max())); GECODE_ME_CHECK(x1.gq(home,x0.min())); return (x0.assigned() || x1.assigned() || (x0.max() <= x1.min())) ? home.ES_SUBSUMED(*this) : ES_FIX; }
/* * Less propagator * */ template<class View> forceinline Le<View>::Le(Home home, View x0, View x1) : BinaryPropagator<View,PC_FLOAT_BND>(home,x0,x1) {}
template<class View> ExecStatus Le<View>::post(Home home, View x0, View x1) { GECODE_ME_CHECK(x0.lq(home,x1.max())); GECODE_ME_CHECK(x1.gq(home,x0.min())); if (x0.assigned() && x1.assigned()) { if (x0.max() >= x1.min()) return ES_FAILED; } else if (x0 == x1) return ES_FAILED; if (x0.max() >= x1.min()) (void) new (home) Le<View>(home,x0,x1); return ES_OK; }
template<class View> forceinline Le<View>::Le(Space& home, Le<View>& p) : BinaryPropagator<View,PC_FLOAT_BND>(home,p) {}
template<class View> Actor* Le<View>::copy(Space& home) { return new (home) Le<View>(home,*this); }
template<class View> ExecStatus Le<View>::propagate(Space& home, const ModEventDelta&) { GECODE_ME_CHECK(x0.lq(home,x1.max())); GECODE_ME_CHECK(x1.gq(home,x0.min())); if (x0.assigned() && x1.assigned()) { return (x0.max() >= x1.min()) ? ES_FAILED : home.ES_SUBSUMED(*this); } return (x0.max() < x1.min()) ? home.ES_SUBSUMED(*this) : ES_FIX; }
/* * Reified less or equal propagator * */
template<class View, class CtrlView, ReifyMode rm> forceinline ReLq<View,CtrlView,rm>::ReLq(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 ReLq<View,CtrlView,rm>::post(Home home, View x0, View x1, CtrlView b) { if (b.one()) { if (rm == RM_PMI) return ES_OK; return Lq<View>::post(home,x0,x1); } if (b.zero()) { if (rm == RM_IMP) return ES_OK; return Le<View>::post(home,x1,x0); } if (x0 != x1) { switch (rtest_lq(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: if (!x0.assigned() || !x1.assigned()) (void) new (home) ReLq<View,CtrlView,rm>(home,x0,x1,b); else { if (rm != RM_IMP) GECODE_ME_CHECK(b.one_none(home)); } break; default: GECODE_NEVER; } } else if (rm != RM_IMP) { GECODE_ME_CHECK(b.one_none(home)); } return ES_OK; }
template<class View, class CtrlView, ReifyMode rm> forceinline ReLq<View,CtrlView,rm>::ReLq(Space& home, ReLq& p) : Int::ReBinaryPropagator<View,PC_FLOAT_BND,CtrlView>(home,p) {}
template<class View, class CtrlView, ReifyMode rm> Actor* ReLq<View,CtrlView,rm>::copy(Space& home) { return new (home) ReLq<View,CtrlView,rm>(home,*this); }
template<class View, class CtrlView, ReifyMode rm> ExecStatus ReLq<View,CtrlView,rm>::propagate(Space& home, const ModEventDelta&) { if (b.one()) { if (rm != RM_PMI) GECODE_REWRITE(*this,Lq<View>::post(home(*this),x0,x1)); } else if (b.zero()) { if (rm != RM_IMP) GECODE_REWRITE(*this,Le<View>::post(home(*this),x1,x0)); } else { switch (rtest_lq(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: if (!x0.assigned() || !x1.assigned()) return ES_FIX; else { if (rm != RM_IMP) GECODE_ME_CHECK(b.one_none(home)); break; } default: GECODE_NEVER; } } return home.ES_SUBSUMED(*this); }
/* * Reified less or equal propagator involving one variable * */
template<class View, class CtrlView, ReifyMode rm> forceinline ReLqFloat<View,CtrlView,rm>::ReLqFloat(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 ReLqFloat<View,CtrlView,rm>::post(Home home, View x, FloatVal c, CtrlView b) { if (b.one()) { if (rm != RM_PMI) GECODE_ME_CHECK(x.lq(home,c.max())); } if (b.zero()) { if (rm != RM_IMP) { GECODE_ME_CHECK(x.gq(home,c.min())); if (x.assigned() && (x.min() <= c.max())) return ES_FAILED; (void) new (home) ReLqFloat<View,CtrlView,rm>(home,x,c,b); } } else { switch (rtest_lq(x,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: (void) new (home) ReLqFloat<View,CtrlView,rm>(home,x,c,b); break; default: GECODE_NEVER; } } return ES_OK; }
template<class View, class CtrlView, ReifyMode rm> forceinline ReLqFloat<View,CtrlView,rm>::ReLqFloat(Space& home, ReLqFloat& p) : Int::ReUnaryPropagator<View,PC_FLOAT_BND,CtrlView>(home,p), c(p.c) {}
template<class View, class CtrlView, ReifyMode rm> Actor* ReLqFloat<View,CtrlView,rm>::copy(Space& home) { return new (home) ReLqFloat<View,CtrlView,rm>(home,*this); }
template<class View, class CtrlView, ReifyMode rm> ExecStatus ReLqFloat<View,CtrlView,rm>::propagate(Space& home, const ModEventDelta&) { if (b.one()) { if (rm != RM_PMI) GECODE_ME_CHECK(x0.lq(home,c.max())); } else if (b.zero()) { if (rm != RM_IMP) { GECODE_ME_CHECK(x0.gq(home,c.min())); if (x0.assigned()) { return (x0.min() <= c.max()) ? ES_FAILED : home.ES_SUBSUMED(*this); } } } else { switch (rtest_lq(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); }
/* * Reified less * */
template<class View, class CtrlView, ReifyMode rm> forceinline ReLeFloat<View,CtrlView,rm>::ReLeFloat(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 ReLeFloat<View,CtrlView,rm>::post(Home home, View x, FloatVal c, CtrlView b) { if (b.one()) { if (rm != RM_PMI) { GECODE_ME_CHECK(x.lq(home,c.max())); if (x.assigned() && (x.max() >= c.min())) return ES_FAILED; (void) new (home) ReLeFloat<View,CtrlView,rm>(home,x,c,b); } } else if (b.zero()) { if (rm != RM_IMP) GECODE_ME_CHECK(x.gq(home,c.min())); } else { switch (rtest_le(x,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: (void) new (home) ReLeFloat<View,CtrlView,rm>(home,x,c,b); break; default: GECODE_NEVER; } } return ES_OK; }
template<class View, class CtrlView, ReifyMode rm> forceinline ReLeFloat<View,CtrlView,rm>::ReLeFloat(Space& home, ReLeFloat& p) : Int::ReUnaryPropagator<View,PC_FLOAT_BND,CtrlView>(home,p), c(p.c) {}
template<class View, class CtrlView, ReifyMode rm> Actor* ReLeFloat<View,CtrlView,rm>::copy(Space& home) { return new (home) ReLeFloat<View,CtrlView,rm>(home,*this); }
template<class View, class CtrlView, ReifyMode rm> ExecStatus ReLeFloat<View,CtrlView,rm>::propagate(Space& home, const ModEventDelta&) { if (b.one()) { if (rm != RM_PMI) { GECODE_ME_CHECK(x0.lq(home,c.max())); if (x0.assigned()) { return (x0.max() >= c.min()) ? ES_FAILED : home.ES_SUBSUMED(*this); } } } else if (b.zero()) { if (rm != RM_IMP) GECODE_ME_CHECK(x0.gq(home,c.min())); } else { switch (rtest_le(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