Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
14 kB · 478 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479/* -*- 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 nth root * */
template<class Ops, bool minus> forceinline ExecStatus prop_nroot_plus_bnd(Space& home, IntView x0, IntView x1, const Ops& ops) { if (minus) { bool mod; do { mod = false; { ModEvent me = x1.gq(home,-ops.cnroot(-x0.min())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x1.lq(home,-ops.cnroot(-x0.max())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x0.gq(home,-ops.tpow(-x1.min())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x0.lq(home,-(ops.tpow(-x1.max()-1)+1)); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } } while (mod); } else { bool mod; do { mod = false; { ModEvent me = x1.lq(home,ops.fnroot(x0.max())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x1.gq(home,ops.fnroot(x0.min())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x0.le(home,ops.tpow(x1.max()+1)); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x0.gq(home,ops.tpow(x1.min())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } } while (mod); } return ES_OK; }
template<class Ops, bool minus> forceinline NrootPlusBnd<Ops,minus>::NrootPlusBnd(Home home, IntView x0, IntView x1, const Ops& o) : BinaryPropagator<IntView,PC_INT_BND>(home,x0,x1), ops(o) {}
template<class Ops, bool minus> forceinline ExecStatus NrootPlusBnd<Ops,minus>::post(Home home, IntView x0, IntView x1, Ops ops) { if (minus) { GECODE_ME_CHECK(x0.lq(home,0)); GECODE_ME_CHECK(x1.lq(home,0)); } else { GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); } (void) new (home) NrootPlusBnd<Ops,minus>(home,x0,x1,ops); return ES_OK; }
template<class Ops, bool minus> forceinline NrootPlusBnd<Ops,minus>::NrootPlusBnd(Space& home, NrootPlusBnd<Ops,minus>& p) : BinaryPropagator<IntView,PC_INT_BND>(home,p), ops(p.ops) {}
template<class Ops, bool minus> Actor* NrootPlusBnd<Ops,minus>::copy(Space& home) { return new (home) NrootPlusBnd<Ops,minus>(home,*this); }
template<class Ops, bool minus> ExecStatus NrootPlusBnd<Ops,minus>::propagate(Space& home, const ModEventDelta&) { GECODE_ES_CHECK((prop_nroot_plus_bnd<Ops,minus>(home,x0,x1,ops))); return x1.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX; }
/* * Bounds consistent nth root * */
template<class Ops> forceinline ExecStatus prop_nroot_bnd(Space& home, IntView x0, IntView x1, const Ops& ops) { assert((x0.min() < 0) && (x0.max() > 0)); assert((x1.min() < 0) && (x1.max() > 0));
GECODE_ME_CHECK(x1.lq(home,ops.fnroot(x0.max()))); GECODE_ME_CHECK(x1.gq(home,-ops.cnroot(-x0.min()))); GECODE_ME_CHECK(x0.le(home,ops.tpow(x1.max()+1))); GECODE_ME_CHECK(x0.gq(home,ops.tpow(x1.min()-1)+1));
return ES_OK; }
template<class Ops> forceinline NrootBnd<Ops>::NrootBnd(Home home, IntView x0, IntView x1, const Ops& o) : BinaryPropagator<IntView,PC_INT_BND>(home,x0,x1), ops(o) {}
template<class Ops> forceinline ExecStatus NrootBnd<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 -2, -1, 0, 1 for x1 GECODE_ME_CHECK(x1.lq(home,1)); GECODE_ME_CHECK(x1.gq(home,-2)); // Just rewrite to values that can be handeled without overflow ops.exp(ops.even() ? 30 : 31); }
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() > 1); GECODE_ME_CHECK(x0.lq(home,1)); GECODE_ME_CHECK(x0.gq(home,ops.even() ? 0 : -2)); return ES_OK; }
// Limits values such that no overflow can occur GECODE_ME_CHECK(x1.lq(home,ops.fnroot(Limits::max))); GECODE_ME_CHECK(x1.gq(home,-ops.cnroot(-Limits::min)));
if (ops.even()) { GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); }
if ((x0.min() >= 0) || (x1.min() >= 0)) return NrootPlusBnd<Ops,false>::post(home,x0,x1,ops);
if ((x0.max() <= 0) || (x1.max() <= 0)) return NrootPlusBnd<Ops,true>::post(home,x0,x1,ops);
assert((x0.min() < 0) && (x0.max() > 0)); assert((x1.min() < 0) && (x1.max() > 0)); GECODE_ES_CHECK(prop_nroot_bnd<Ops>(home,x0,x1,ops)); (void) new (home) NrootBnd(home,x0,x1,ops); return ES_OK; }
template<class Ops> forceinline NrootBnd<Ops>::NrootBnd(Space& home, NrootBnd<Ops>& p) : BinaryPropagator<IntView,PC_INT_BND>(home,p), ops(p.ops) {}
template<class Ops> Actor* NrootBnd<Ops>::copy(Space& home) { return new (home) NrootBnd<Ops>(home,*this); }
template<class Ops> ExecStatus NrootBnd<Ops>::propagate(Space& home, const ModEventDelta&) { assert(!ops.even()); if ((x0.min() >= 0) || (x1.min() >= 0)) GECODE_REWRITE(*this,(NrootPlusBnd<Ops,false>::post(home(*this),x0,x1,ops)));
if ((x0.max() <= 0) || (x1.max() <= 0)) GECODE_REWRITE(*this,(NrootPlusBnd<Ops,true>::post(home(*this),x0,x1,ops)));
GECODE_ES_CHECK(prop_nroot_bnd(home,x0,x1,ops));
return x0.assigned() && x1.assigned() ? home.ES_SUBSUMED(*this) : ES_NOFIX; }
/* * Domain consistent nth root * */ /// Mapping ranges to powers template<class Ops> class RangesMapPow { protected: /// Power operations Ops ops; public: /// Initialize with operations \a o forceinline RangesMapPow(const Ops& o) : ops(o) {} /// Perform mapping of minimum forceinline int min(int x) const { return ops.tpow(x); } /// Perform mapping of maximum forceinline int max(int x) const { return ops.tpow(x+1)-1; } };
/// Mapping integer to n-th root template<class Ops> class RangesMapNroot { protected: /// Power operations Ops ops; public: /// Initialize with operations \a o forceinline RangesMapNroot(const Ops& o) : ops(o) {} /// Perform mapping of minimum forceinline int min(int x) const { return (x < 0) ? -ops.cnroot(-x) : ops.fnroot(x); } /// Perform mapping of maximum forceinline int max(int x) const { return (x < 0) ? -ops.cnroot(-x) : ops.fnroot(x); } };
template<class Ops, bool minus> forceinline NrootPlusDom<Ops,minus>::NrootPlusDom(Home home, IntView x0, IntView x1, const Ops& o) : BinaryPropagator<IntView,PC_INT_DOM>(home,x0,x1), ops(o) {}
template<class Ops, bool minus> forceinline ExecStatus NrootPlusDom<Ops,minus>::post(Home home, IntView x0, IntView x1, Ops ops) { if (minus) { GECODE_ME_CHECK(x0.lq(home,0)); GECODE_ME_CHECK(x1.lq(home,0)); } else { GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); } GECODE_ES_CHECK((prop_nroot_plus_bnd<Ops,minus>(home,x0,x1,ops))); (void) new (home) NrootPlusDom<Ops,minus>(home,x0,x1,ops); return ES_OK; }
template<class Ops, bool minus> forceinline NrootPlusDom<Ops,minus>::NrootPlusDom(Space& home, NrootPlusDom<Ops,minus>& p) : BinaryPropagator<IntView,PC_INT_DOM>(home,p), ops(p.ops) {}
template<class Ops, bool minus> Actor* NrootPlusDom<Ops,minus>::copy(Space& home) { return new (home) NrootPlusDom<Ops,minus>(home,*this); }
template<class Ops, bool minus> PropCost NrootPlusDom<Ops,minus>::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, bool minus> ExecStatus NrootPlusDom<Ops,minus>::propagate(Space& home, const ModEventDelta& med) { if (IntView::me(med) != ME_INT_DOM) { GECODE_ES_CHECK((prop_nroot_plus_bnd<Ops,minus>(home,x0,x1,ops))); return x1.assigned() ? home.ES_SUBSUMED(*this) : home.ES_NOFIX_PARTIAL(*this,IntView::med(ME_INT_DOM)); }
{ ViewRanges<IntView> r(x0); RangesMapNroot<Ops> rmn(ops); Iter::Ranges::Map<ViewRanges<IntView>,RangesMapNroot<Ops>,false> m(r,rmn); GECODE_ME_CHECK(x1.inter_r(home,m,false)); }
{ ViewRanges<IntView> r(x1); RangesMapPow<Ops> rmp(ops); Iter::Ranges::Map<ViewRanges<IntView>,RangesMapPow<Ops>,true> m(r,rmp); GECODE_ME_CHECK(x0.inter_r(home,m,false)); }
return x1.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX; }
template<class Ops> forceinline NrootDom<Ops>::NrootDom(Home home, IntView x0, IntView x1, const Ops& o) : BinaryPropagator<IntView,PC_INT_DOM>(home,x0,x1), ops(o) {}
template<class Ops> forceinline ExecStatus NrootDom<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 -2, -1, 0, 1 for x1 GECODE_ME_CHECK(x1.lq(home,1)); GECODE_ME_CHECK(x1.gq(home,-2)); // Just rewrite to values that can be handeled without overflow ops.exp(ops.even() ? 30 : 31); }
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() > 1); GECODE_ME_CHECK(x0.lq(home,1)); GECODE_ME_CHECK(x0.gq(home,ops.even() ? 0 : -2)); return ES_OK; }
// Limits values such that no overflow can occur GECODE_ME_CHECK(x1.lq(home,ops.fnroot(Limits::max))); GECODE_ME_CHECK(x1.gq(home,-ops.cnroot(-Limits::min)));
if (ops.even()) { GECODE_ME_CHECK(x0.gq(home,0)); GECODE_ME_CHECK(x1.gq(home,0)); }
if ((x0.min() >= 0) || (x1.min() >= 0)) return NrootPlusDom<Ops,false>::post(home,x0,x1,ops);
if ((x0.max() <= 0) || (x1.max() <= 0)) return NrootPlusDom<Ops,true>::post(home,x0,x1,ops);
assert((x0.min() < 0) && (x0.max() > 0)); assert((x1.min() < 0) && (x1.max() > 0)); GECODE_ES_CHECK(prop_nroot_bnd<Ops>(home,x0,x1,ops)); (void) new (home) NrootDom(home,x0,x1,ops); return ES_OK; }
template<class Ops> forceinline NrootDom<Ops>::NrootDom(Space& home, NrootDom<Ops>& p) : BinaryPropagator<IntView,PC_INT_DOM>(home,p), ops(p.ops) {}
template<class Ops> Actor* NrootDom<Ops>::copy(Space& home) { return new (home) NrootDom<Ops>(home,*this); }
template<class Ops> PropCost NrootDom<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 NrootDom<Ops>::propagate(Space& home, const ModEventDelta& med) { assert(!ops.even()); if ((x0.min() >= 0) || (x1.min() >= 0)) GECODE_REWRITE(*this,(NrootPlusDom<Ops,false>::post(home(*this),x0,x1,ops)));
if ((x0.max() <= 0) || (x1.max() <= 0)) GECODE_REWRITE(*this,(NrootPlusDom<Ops,true>::post(home(*this),x0,x1,ops)));
if (IntView::me(med) != ME_INT_DOM) { GECODE_ES_CHECK(prop_nroot_bnd<Ops>(home,x0,x1,ops)); return x0.assigned() && x1.assigned() ? home.ES_SUBSUMED(*this) : home.ES_NOFIX_PARTIAL(*this,IntView::med(ME_INT_DOM)); }
{ ViewRanges<IntView> r(x0); RangesMapNroot<Ops> rmn(ops); Iter::Ranges::Map<ViewRanges<IntView>,RangesMapNroot<Ops>,false> m(r,rmn); GECODE_ME_CHECK(x1.inter_r(home,m,false)); }
{ ViewRanges<IntView> r(x1); RangesMapPow<Ops> rmp(ops); Iter::Ranges::Map<ViewRanges<IntView>,RangesMapPow<Ops>,true> m(r,rmp); GECODE_ME_CHECK(x0.inter_r(home,m,false)); }
return x0.assigned() && x1.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX; }
}}}
// STATISTICS: int-prop