Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
10 kB · 356 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357/* -*- 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 Arithmetic {
/// Test whether \a x is postive template<class View> forceinline bool pos(const View& x) { return x.min() >= 0.0; } /// Test whether \a x is negative template<class View> forceinline bool neg(const View& x) { return x.max() <= 0.0; } /// Test whether \a x is neither positive nor negative template<class View> forceinline bool any(const View& x) { return (x.min() <= 0.0) && (x.max() >= 0.0); }
/* * Propagator for x * y = x * */
template<class View> forceinline MultZeroOne<View>::MultZeroOne(Home home, View x0, View x1) : BinaryPropagator<View,PC_FLOAT_BND>(home,x0,x1) {}
template<class View> forceinline ExecStatus MultZeroOne<View>::post(Home home, View x0, View x1) { switch (rtest_eq(x0,0.0)) { case RT_FALSE: GECODE_ME_CHECK(x1.eq(home,1.0)); break; case RT_TRUE: break; case RT_MAYBE: switch (rtest_eq(x1,1.0)) { case RT_FALSE: GECODE_ME_CHECK(x0.eq(home,0.0)); break; case RT_TRUE: break; case RT_MAYBE: (void) new (home) MultZeroOne<View>(home,x0,x1); break; default: GECODE_NEVER; } break; default: GECODE_NEVER; } return ES_OK; }
template<class View> forceinline MultZeroOne<View>::MultZeroOne(Space& home, MultZeroOne<View>& p) : BinaryPropagator<View,PC_FLOAT_BND>(home,p) {}
template<class View> Actor* MultZeroOne<View>::copy(Space& home) { return new (home) MultZeroOne<View>(home,*this); }
template<class View> ExecStatus MultZeroOne<View>::propagate(Space& home, const ModEventDelta&) { switch (rtest_eq(x0,0.0)) { case RT_FALSE: GECODE_ME_CHECK(x1.eq(home,1.0)); break; case RT_TRUE: break; case RT_MAYBE: switch (rtest_eq(x1,1.0)) { case RT_FALSE: GECODE_ME_CHECK(x0.eq(home,0.0)); break; case RT_TRUE: break; case RT_MAYBE: return ES_FIX; default: GECODE_NEVER; } break; default: GECODE_NEVER; } return home.ES_SUBSUMED(*this); }
/* * Positive bounds consistent multiplication * */ template<class VA, class VB, class VC> forceinline MultPlus<VA,VB,VC>::MultPlus(Home home, VA x0, VB x1, VC x2) : MixTernaryPropagator<VA,PC_FLOAT_BND,VB,PC_FLOAT_BND,VC,PC_FLOAT_BND> (home,x0,x1,x2) {}
template<class VA, class VB, class VC> forceinline MultPlus<VA,VB,VC>::MultPlus(Space& home, MultPlus<VA,VB,VC>& p) : MixTernaryPropagator<VA,PC_FLOAT_BND,VB,PC_FLOAT_BND,VC,PC_FLOAT_BND> (home,p) {}
template<class VA, class VB, class VC> Actor* MultPlus<VA,VB,VC>::copy(Space& home) { return new (home) MultPlus<VA,VB,VC>(home,*this); }
template<class VA, class VB, class VC> ExecStatus MultPlus<VA,VB,VC>::propagate(Space& home, const ModEventDelta&) { if (x1.min() != 0.0) GECODE_ME_CHECK(x0.eq(home,x2.val() / x1.val())); if (x0.min() != 0.0) GECODE_ME_CHECK(x1.eq(home,x2.val() / x0.val())); GECODE_ME_CHECK(x2.eq(home,x0.val() * x1.val())); if (x0.assigned() && x1.assigned() && x2.assigned()) return home.ES_SUBSUMED(*this); return ES_NOFIX; }
template<class VA, class VB, class VC> forceinline ExecStatus MultPlus<VA,VB,VC>::post(Home home, VA x0, VB x1, VC x2) { GECODE_ME_CHECK(x0.gq(home,0.0)); GECODE_ME_CHECK(x1.gq(home,0.0)); Rounding r; GECODE_ME_CHECK(x2.gq(home,r.mul_down(x0.min(),x1.min()))); (void) new (home) MultPlus<VA,VB,VC>(home,x0,x1,x2); return ES_OK; }
/* * Bounds consistent multiplication * */ template<class View> forceinline Mult<View>::Mult(Home home, View x0, View x1, View x2) : TernaryPropagator<View,PC_FLOAT_BND>(home,x0,x1,x2) {}
template<class View> forceinline Mult<View>::Mult(Space& home, Mult<View>& p) : TernaryPropagator<View,PC_FLOAT_BND>(home,p) {}
template<class View> Actor* Mult<View>::copy(Space& home) { return new (home) Mult<View>(home,*this); }
template<class View> ExecStatus Mult<View>::propagate(Space& home, const ModEventDelta&) { Rounding r; if (pos(x0)) { if (pos(x1) || pos(x2)) goto rewrite_ppp; if (neg(x1) || neg(x2)) goto rewrite_pnn; goto prop_pxx; } if (neg(x0)) { if (neg(x1) || pos(x2)) goto rewrite_nnp; if (pos(x1) || neg(x2)) goto rewrite_npn; goto prop_nxx; } if (pos(x1)) { if (pos(x2)) goto rewrite_ppp; if (neg(x2)) goto rewrite_npn; goto prop_xpx; } if (neg(x1)) { if (pos(x2)) goto rewrite_nnp; if (neg(x2)) goto rewrite_pnn; goto prop_xnx; }
assert(any(x0) && any(x1)); GECODE_ME_CHECK(x2.lq(home,std::max(r.mul_up(x0.max(),x1.max()), r.mul_up(x0.min(),x1.min())))); GECODE_ME_CHECK(x2.gq(home,std::min(r.mul_down(x0.min(),x1.max()), r.mul_down(x0.max(),x1.min()))));
if (pos(x2)) { if (r.div_up(x2.min(),x1.min()) < x0.min()) GECODE_ME_CHECK(x0.gq(home,0)); if (r.div_up(x2.min(),x0.min()) < x1.min()) GECODE_ME_CHECK(x1.gq(home,0)); } if (neg(x2)) { if (r.div_up(x2.max(),x1.max()) < x0.min()) GECODE_ME_CHECK(x0.gq(home,0)); if (r.div_up(x2.max(),x0.max()) < x1.min()) GECODE_ME_CHECK(x1.gq(home,0)); }
if (x0.assigned()) { assert((x0.val() == 0.0) && (x2.val() == 0.0)); return home.ES_SUBSUMED(*this); }
if (x1.assigned()) { assert((x1.val() == 0.0) && (x2.val() == 0.0)); return home.ES_SUBSUMED(*this); }
return ES_NOFIX;
prop_xpx: std::swap(x0,x1); prop_pxx: assert(pos(x0) && any(x1) && any(x2));
GECODE_ME_CHECK(x2.lq(home,r.mul_up(x0.max(),x1.max()))); GECODE_ME_CHECK(x2.gq(home,r.mul_down(x0.max(),x1.min())));
if (pos(x2)) goto rewrite_ppp; if (neg(x2)) goto rewrite_pnn;
GECODE_ME_CHECK(x1.lq(home,r.div_up(x2.max(),x0.min()))); GECODE_ME_CHECK(x1.gq(home,r.div_down(x2.min(),x0.min())));
if (x0.assigned() && x1.assigned()) { GECODE_ME_CHECK(x2.eq(home,x0.val()*x1.val())); return home.ES_SUBSUMED(*this); }
return ES_NOFIX;
prop_xnx: std::swap(x0,x1); prop_nxx: assert(neg(x0) && any(x1) && any(x2));
GECODE_ME_CHECK(x2.lq(home,r.mul_up(x0.min(),x1.min()))); GECODE_ME_CHECK(x2.gq(home,r.mul_down(x0.min(),x1.max())));
if (pos(x2)) goto rewrite_nnp; if (neg(x2)) goto rewrite_npn;
if (x0.max() != 0.0) { GECODE_ME_CHECK(x1.lq(home,r.div_up(x2.min(),x0.max()))); GECODE_ME_CHECK(x1.gq(home,r.div_down(x2.max(),x0.max()))); }
if (x0.assigned() && x1.assigned()) { GECODE_ME_CHECK(x2.eq(home,x0.val()*x1.val())); return home.ES_SUBSUMED(*this); }
return ES_NOFIX;
rewrite_ppp: GECODE_REWRITE(*this,(MultPlus<FloatView,FloatView,FloatView> ::post(home(*this),x0,x1,x2))); rewrite_nnp: GECODE_REWRITE(*this,(MultPlus<MinusView,MinusView,FloatView> ::post(home(*this),MinusView(x0),MinusView(x1),x2))); rewrite_pnn: std::swap(x0,x1); rewrite_npn: GECODE_REWRITE(*this,(MultPlus<MinusView,FloatView,MinusView> ::post(home(*this),MinusView(x0),x1,MinusView(x2)))); }
template<class View> ExecStatus Mult<View>::post(Home home, View x0, View x1, View x2) { if (x0 == x1) return Sqr<View>::post(home,x0,x2); if (x0 == x2) return MultZeroOne<View>::post(home,x0,x1); if (x1 == x2) return MultZeroOne<View>::post(home,x1,x0); if (pos(x0)) { if (pos(x1) || pos(x2)) goto post_ppp; if (neg(x1) || neg(x2)) goto post_pnn; } else if (neg(x0)) { if (neg(x1) || pos(x2)) goto post_nnp; if (pos(x1) || neg(x2)) goto post_npn; } else if (pos(x1)) { if (pos(x2)) goto post_ppp; if (neg(x2)) goto post_npn; } else if (neg(x1)) { if (pos(x2)) goto post_nnp; if (neg(x2)) goto post_pnn; } { GECODE_ME_CHECK(x2.eq(home,x0.val()*x1.val())); (void) new (home) Mult<View>(home,x0,x1,x2); } return ES_OK;
post_ppp: return MultPlus<FloatView,FloatView,FloatView>::post(home,x0,x1,x2); post_nnp: return MultPlus<MinusView,MinusView,FloatView>::post(home, MinusView(x0),MinusView(x1),x2); post_pnn: std::swap(x0,x1); post_npn: return MultPlus<MinusView,FloatView,MinusView>::post(home, MinusView(x0),x1,MinusView(x2)); }
}}}
// STATISTICS: float-prop