Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
16 kB · 537 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 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. * */
#include <gecode/int/rel.hh>
#include <climits>#include <algorithm>
namespace Gecode { namespace Int { namespace Arithmetic {
/* * Positive bounds consistent power * */ template<class VA, class VB, class Ops> inline ExecStatus prop_pow_plus_bnd(Space& home, VA x0, VB x1, const Ops& ops) { bool mod; do { mod = false; { ModEvent me = x0.lq(home,ops.fnroot(x1.max())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x0.gq(home,ops.cnroot(x1.min())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x1.lq(home,ops.pow(x0.max())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x1.gq(home,ops.pow(x0.min())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } } while (mod); return ES_OK; }
template<class VA, class VB, class Ops> forceinline PowPlusBnd<VA,VB,Ops>::PowPlusBnd(Home home, VA x0, VB x1, const Ops& o) : MixBinaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND>(home,x0,x1), ops(o) {}
template<class VA, class VB, class Ops> forceinline ExecStatus PowPlusBnd<VA,VB,Ops>::post(Home home, VA x0, VB x1, Ops ops) { GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); GECODE_ES_CHECK(prop_pow_plus_bnd(home,x0,x1,ops)); if (!x0.assigned()) { assert(!x1.assigned()); (void) new (home) PowPlusBnd<VA,VB,Ops>(home,x0,x1,ops); } return ES_OK; }
template<class VA, class VB, class Ops> forceinline PowPlusBnd<VA,VB,Ops>::PowPlusBnd(Space& home, PowPlusBnd<VA,VB,Ops>& p) : MixBinaryPropagator<VA,PC_INT_BND,VB,PC_INT_BND>(home,p), ops(p.ops) {}
template<class VA, class VB, class Ops> Actor* PowPlusBnd<VA,VB,Ops>::copy(Space& home) { return new (home) PowPlusBnd<VA,VB,Ops>(home,*this); }
template<class VA, class VB, class Ops> ExecStatus PowPlusBnd<VA,VB,Ops>::propagate(Space& home, const ModEventDelta&) { GECODE_ES_CHECK(prop_pow_plus_bnd(home,x0,x1,ops)); return x0.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX; }
/* * Bounds consistent power * */
template<class Ops> inline ExecStatus prop_pow_bnd(Space& home, IntView x0, IntView x1, const Ops& ops) { assert((x0.min() < 0) && (0 < x0.max())); if (ops.even()) { assert(x1.min() >= 0); int u = ops.fnroot(x1.max()); GECODE_ME_CHECK(x0.lq(home,u)); GECODE_ME_CHECK(x0.gq(home,-u)); GECODE_ME_CHECK(x1.lq(home,std::max(ops.pow(x0.max()), ops.pow(-x0.min())))); } else { assert((x1.min() < 0) && (0 < x1.max())); GECODE_ME_CHECK(x0.lq(home,ops.fnroot(x1.max()))); GECODE_ME_CHECK(x0.gq(home,-ops.fnroot(-x1.min()))); GECODE_ME_CHECK(x1.lq(home,ops.pow(x0.max()))); GECODE_ME_CHECK(x1.gq(home,ops.pow(x0.min()))); } return ES_OK; }
template<class Ops> forceinline PowBnd<Ops>::PowBnd(Home home, IntView x0, IntView x1, const Ops& o) : BinaryPropagator<IntView,PC_INT_BND>(home,x0,x1), ops(o) {}
template<class Ops> inline ExecStatus PowBnd<Ops>::post(Home home, IntView x0, IntView x1, Ops ops) { if (static_cast<unsigned int>(ops.exp()) >= sizeof(int) * CHAR_BIT) { // The integer limits allow only -1, 0, 1 for x0 GECODE_ME_CHECK(x0.lq(home,1)); GECODE_ME_CHECK(x0.gq(home,-1)); // Just rewrite to values that can be handeled without overflow ops.exp(ops.even() ? 2 : 1); }
if (ops.exp() == 0) { GECODE_ME_CHECK(x1.eq(home,1)); return ES_OK; } else if (ops.exp() == 1) { return Rel::EqBnd<IntView,IntView>::post(home,x0,x1); }
if (x0 == x1) { assert(ops.exp() != 0); GECODE_ME_CHECK(x0.lq(home,1)); GECODE_ME_CHECK(x0.gq(home,ops.even() ? 0 : -1)); return ES_OK; }
// Limits values such that no overflow can occur assert(Limits::max == -Limits::min); { int l = ops.fnroot(Limits::max); GECODE_ME_CHECK(x0.lq(home,l)); GECODE_ME_CHECK(x0.gq(home,-l)); }
if ((x0.min() >= 0) || ((x1.min() >= 0) && !ops.even())) return PowPlusBnd<IntView,IntView,Ops>::post(home,x0,x1,ops);
if (ops.even() && (x0.max() <= 0)) return PowPlusBnd<MinusView,IntView,Ops> ::post(home,MinusView(x0),x1,ops);
if (!ops.even() && ((x0.max() <= 0) || (x1.max() <= 0))) return PowPlusBnd<MinusView,MinusView,Ops> ::post(home,MinusView(x0),MinusView(x1),ops);
if (ops.even()) GECODE_ME_CHECK(x1.gq(home,0));
assert((x0.min() < 0) && (x0.max() > 0));
if (ops.even()) { GECODE_ME_CHECK(x1.lq(home,std::max(ops.pow(x0.min()), ops.pow(x0.max())))); } else { GECODE_ME_CHECK(x1.lq(home,ops.pow(x0.max()))); GECODE_ME_CHECK(x1.gq(home,ops.pow(x0.min()))); }
(void) new (home) PowBnd<Ops>(home,x0,x1,ops); return ES_OK; }
template<class Ops> forceinline PowBnd<Ops>::PowBnd(Space& home, PowBnd<Ops>& p) : BinaryPropagator<IntView,PC_INT_BND>(home,p), ops(p.ops) {}
template<class Ops> Actor* PowBnd<Ops>::copy(Space& home) { return new (home) PowBnd<Ops>(home,*this); }
template<class Ops> ExecStatus PowBnd<Ops>::propagate(Space& home, const ModEventDelta&) { if ((x0.min() >= 0) || ((x1.min() >= 0) && !ops.even())) GECODE_REWRITE(*this,(PowPlusBnd<IntView,IntView,Ops> ::post(home(*this),x0,x1,ops)));
if (ops.even() && (x0.max() <= 0)) GECODE_REWRITE(*this,(PowPlusBnd<MinusView,IntView,Ops> ::post(home(*this),MinusView(x0),x1,ops)));
if (!ops.even() && ((x0.max() <= 0) || (x1.max() <= 0))) GECODE_REWRITE(*this,(PowPlusBnd<MinusView,MinusView,Ops> ::post(home(*this),MinusView(x0), MinusView(x1),ops)));
GECODE_ES_CHECK(prop_pow_bnd<Ops>(home,x0,x1,ops));
if (x0.assigned() && x1.assigned()) return (ops.pow(x0.val()) == x1.val()) ? home.ES_SUBSUMED(*this) : ES_FAILED;
return ES_NOFIX; }
/* * Value mappings for power and nroot * */
/// Mapping integer to power template<class Ops> class ValuesMapPow { protected: /// Operations Ops ops; public: /// Initialize with operations \a o forceinline ValuesMapPow(const Ops& o) : ops(o) {} /// Perform mapping forceinline int val(int x) const { return ops.pow(x); } };
/// Mapping integer (must be an n-th power) to n-th root template<class Ops> class ValuesMapNroot { protected: /// Operations Ops ops; public: /// Initialize with operations \a o forceinline ValuesMapNroot(const Ops& o) : ops(o) {} /// Perform mapping forceinline int val(int x) const { return ops.fnroot(x); } };
/// Mapping integer (must be an n-th power) to n-th root (signed) template<class Ops> class ValuesMapNrootSigned { protected: /// Operations Ops ops; public: /// Initialize with operations \a o forceinline ValuesMapNrootSigned(const Ops& o) : ops(o) {} /// Perform mapping forceinline int val(int x) const { if (x < 0) return -ops.fnroot(-x); else return ops.fnroot(x); } };
/* * Positive domain consistent power * */ template<class VA, class VB, class Ops> forceinline PowPlusDom<VA,VB,Ops>::PowPlusDom(Home home, VA x0, VB x1, const Ops& o) : MixBinaryPropagator<VA,PC_INT_DOM,VB,PC_INT_DOM>(home,x0,x1), ops(o) {}
template<class VA, class VB, class Ops> forceinline ExecStatus PowPlusDom<VA,VB,Ops>::post(Home home, VA x0, VB x1, Ops ops) { GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); GECODE_ES_CHECK(prop_pow_plus_bnd(home,x0,x1,ops)); if (!x0.assigned()) { assert(!x1.assigned()); (void) new (home) PowPlusDom<VA,VB,Ops>(home,x0,x1,ops); } return ES_OK; }
template<class VA, class VB, class Ops> forceinline PowPlusDom<VA,VB,Ops>::PowPlusDom(Space& home, PowPlusDom<VA,VB,Ops>& p) : MixBinaryPropagator<VA,PC_INT_DOM,VB,PC_INT_DOM>(home,p), ops(p.ops) {}
template<class VA, class VB, class Ops> Actor* PowPlusDom<VA,VB,Ops>::copy(Space& home) { return new (home) PowPlusDom<VA,VB,Ops>(home,*this); }
template<class VA, class VB, class Ops> PropCost PowPlusDom<VA,VB,Ops>::cost(const Space&, const ModEventDelta& med) const { if (VA::me(med) == ME_INT_VAL) return PropCost::unary(PropCost::LO); else if (VA::me(med) == ME_INT_DOM) return PropCost::binary(PropCost::HI); else return PropCost::binary(PropCost::LO); }
template<class VA, class VB, class Ops> ExecStatus PowPlusDom<VA,VB,Ops>::propagate(Space& home, const ModEventDelta& med) { if (VA::me(med) != ME_INT_DOM) { GECODE_ES_CHECK(prop_pow_plus_bnd(home,x0,x1,ops)); return x0.assigned() ? home.ES_SUBSUMED(*this) : home.ES_NOFIX_PARTIAL(*this,VA::med(ME_INT_DOM)); }
{ ViewValues<VA> v0(x0); ValuesMapPow<Ops> vmp(ops); Iter::Values::Map<ViewValues<VA>,ValuesMapPow<Ops> > s0(v0,vmp); GECODE_ME_CHECK(x1.inter_v(home,s0,false)); }
{ ViewValues<VB> v1(x1); ValuesMapNroot<Ops> vmn(ops); Iter::Values::Map<ViewValues<VB>,ValuesMapNroot<Ops> > s1(v1,vmn); GECODE_ME_CHECK(x0.inter_v(home,s1,false)); }
return x0.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX; }
/* * Domain consistent power * */
template<class Ops> forceinline PowDom<Ops>::PowDom(Home home, IntView x0, IntView x1, const Ops& o) : BinaryPropagator<IntView,PC_INT_DOM>(home,x0,x1), ops(o) {}
template<class Ops> inline ExecStatus PowDom<Ops>::post(Home home, IntView x0, IntView x1, Ops ops) { if (static_cast<unsigned int>(ops.exp()) >= sizeof(int) * CHAR_BIT) { // The integer limits allow only -1, 0, 1 for x0 GECODE_ME_CHECK(x0.lq(home,1)); GECODE_ME_CHECK(x0.gq(home,-1)); // Just rewrite to values that can be handeled without overflow ops.exp(ops.even() ? 2 : 1); }
if (ops.exp() == 0) { GECODE_ME_CHECK(x1.eq(home,1)); return ES_OK; } else if (ops.exp() == 1) { return Rel::EqDom<IntView,IntView>::post(home,x0,x1); }
if (x0 == x1) { assert(ops.exp() != 0); GECODE_ME_CHECK(x0.lq(home,1)); GECODE_ME_CHECK(x0.gq(home,ops.even() ? 0 : -1)); return ES_OK; }
// Limits values such that no overflow can occur assert(Limits::max == -Limits::min); { int l = ops.fnroot(Limits::max); GECODE_ME_CHECK(x0.lq(home,l)); GECODE_ME_CHECK(x0.gq(home,-l)); }
if ((x0.min() >= 0) || ((x1.min() >= 0) && !ops.even())) return PowPlusDom<IntView,IntView,Ops>::post(home,x0,x1,ops);
if (ops.even() && (x0.max() <= 0)) return PowPlusDom<MinusView,IntView,Ops> ::post(home,MinusView(x0),x1,ops);
if (!ops.even() && ((x0.max() <= 0) || (x1.max() <= 0))) return PowPlusDom<MinusView,MinusView,Ops> ::post(home,MinusView(x0),MinusView(x1),ops);
if (ops.even()) GECODE_ME_CHECK(x1.gq(home,0));
assert((x0.min() < 0) && (x0.max() > 0));
if (ops.even()) { GECODE_ME_CHECK(x1.lq(home,std::max(ops.pow(x0.min()), ops.pow(x0.max())))); } else { GECODE_ME_CHECK(x1.lq(home,ops.pow(x0.max()))); GECODE_ME_CHECK(x1.gq(home,ops.pow(x0.min()))); }
(void) new (home) PowDom<Ops>(home,x0,x1,ops); return ES_OK; }
template<class Ops> forceinline PowDom<Ops>::PowDom(Space& home, PowDom<Ops>& p) : BinaryPropagator<IntView,PC_INT_DOM>(home,p), ops(p.ops) {}
template<class Ops> Actor* PowDom<Ops>::copy(Space& home) { return new (home) PowDom<Ops>(home,*this); }
template<class Ops> PropCost PowDom<Ops>::cost(const Space&, const ModEventDelta& med) const { if (IntView::me(med) == ME_INT_VAL) return PropCost::unary(PropCost::LO); else if (IntView::me(med) == ME_INT_DOM) return PropCost::binary(PropCost::HI); else return PropCost::binary(PropCost::LO); }
template<class Ops> ExecStatus PowDom<Ops>::propagate(Space& home, const ModEventDelta& med) { if ((x0.min() >= 0) || ((x1.min() >= 0) && !ops.even())) GECODE_REWRITE(*this,(PowPlusDom<IntView,IntView,Ops> ::post(home(*this),x0,x1,ops)));
if (ops.even() && (x0.max() <= 0)) GECODE_REWRITE(*this,(PowPlusDom<MinusView,IntView,Ops> ::post(home(*this),MinusView(x0),x1,ops)));
if (!ops.even() && ((x0.max() <= 0) || (x1.max() <= 0))) GECODE_REWRITE(*this,(PowPlusDom<MinusView,MinusView,Ops> ::post(home(*this),MinusView(x0), MinusView(x1),ops)));
if (IntView::me(med) != ME_INT_DOM) { GECODE_ES_CHECK(prop_pow_bnd<Ops>(home,x0,x1,ops)); if (x0.assigned() && x1.assigned()) return (ops.pow(x0.val()) == x1.val()) ? home.ES_SUBSUMED(*this) : ES_FAILED;
return home.ES_NOFIX_PARTIAL(*this,IntView::med(ME_INT_DOM)); }
Region r; if (ops.even()) { ViewValues<IntView> i(x0), j(x0); using namespace Iter::Values; Positive<ViewValues<IntView> > pos(i); Negative<ViewValues<IntView> > neg(j); Minus m(r,neg);
ValuesMapPow<Ops> vmp(ops); Map<Positive<ViewValues<IntView> >,ValuesMapPow<Ops>,true> sp(pos,vmp); Map<Minus,ValuesMapPow<Ops>,true> sm(m,vmp); Union<Map<Positive<ViewValues<IntView> >,ValuesMapPow<Ops>,true>, Map<Minus,ValuesMapPow<Ops>,true> > u(sp,sm); GECODE_ME_CHECK(x1.inter_v(home,u,false)); } else { ViewValues<IntView> v0(x0); ValuesMapPow<Ops> vmp(ops); Iter::Values::Map<ViewValues<IntView>,ValuesMapPow<Ops> > s0(v0,vmp); GECODE_ME_CHECK(x1.inter_v(home,s0,false)); }
if (ops.even()) { ViewValues<IntView> i(x1), j(x1); using namespace Iter::Values; ValuesMapNroot<Ops> vmn(ops); Map<ViewValues<IntView>,ValuesMapNroot<Ops>,true> si(i,vmn), sj(j,vmn); Minus mi(r,si); Union<Minus, Map<ViewValues<IntView>,ValuesMapNroot<Ops>,true> > u(mi,sj); GECODE_ME_CHECK(x0.inter_v(home,u,false)); } else { ViewValues<IntView> v1(x1); ValuesMapNrootSigned<Ops> vmn(ops); Iter::Values::Map<ViewValues<IntView>,ValuesMapNrootSigned<Ops> > s1(v1,vmn); GECODE_ME_CHECK(x0.inter_v(home,s1,false)); }
return x0.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX; }
}}}
// STATISTICS: int-prop