Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
13 kB · 398 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2004 * * 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>
namespace Gecode { namespace Int { namespace Arithmetic {
/* * Ternary bounds consistent maximum * */
template<class View> forceinline ExecStatus prop_max_bnd(Space& home, View x0, View x1, View x2) { bool mod = false; do { mod = false; { ModEvent me = x2.lq(home,std::max(x0.max(),x1.max())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x2.gq(home,std::max(x0.min(),x1.min())); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x0.lq(home,x2.max()); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } { ModEvent me = x1.lq(home,x2.max()); if (me_failed(me)) return ES_FAILED; mod |= me_modified(me); } } while (mod); return ES_OK; }
template<class View> forceinline MaxBnd<View>::MaxBnd(Home home, View x0, View x1, View x2) : TernaryPropagator<View,PC_INT_BND>(home,x0,x1,x2) {}
template<class View> ExecStatus MaxBnd<View>::post(Home home, View x0, View x1, View x2) { GECODE_ME_CHECK(x2.gq(home,std::max(x0.min(),x1.min()))); GECODE_ME_CHECK(x2.lq(home,std::max(x0.max(),x1.max()))); if (x0 == x1) return Rel::EqBnd<View,View>::post(home,x0,x2); if (x0 == x2) return Rel::Lq<View,View>::post(home,x1,x2); if (x1 == x2) return Rel::Lq<View,View>::post(home,x0,x2); (void) new (home) MaxBnd<View>(home,x0,x1,x2); return ES_OK; }
template<class View> forceinline MaxBnd<View>::MaxBnd(Space& home, MaxBnd<View>& p) : TernaryPropagator<View,PC_INT_BND>(home,p) {}
template<class View> forceinline MaxBnd<View>::MaxBnd(Space& home, Propagator& p, View x0, View x1, View x2) : TernaryPropagator<View,PC_INT_BND>(home,p,x0,x1,x2) {}
template<class View> Actor* MaxBnd<View>::copy(Space& home) { return new (home) MaxBnd<View>(home,*this); }
template<class View> ExecStatus MaxBnd<View>::propagate(Space& home, const ModEventDelta&) { GECODE_ES_CHECK(prop_max_bnd(home,x0,x1,x2)); if ((x0.max() <= x1.min()) || (x0.max() < x2.min())) GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x1,x2))); if ((x1.max() <= x0.min()) || (x1.max() < x2.min())) GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x0,x2))); return x0.assigned() && x1.assigned() && x2.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX; }
/* * Nary bounds consistent maximum * */
template<class View> forceinline NaryMaxBnd<View>::NaryMaxBnd(Home home, ViewArray<View>& x, View y) : NaryOnePropagator<View,PC_INT_BND>(home,x,y) {}
template<class View> ExecStatus NaryMaxBnd<View>::post(Home home, ViewArray<View>& x, View y) { assert(x.size() > 0); x.unique(); if (x.size() == 1) return Rel::EqBnd<View,View>::post(home,x[0],y); if (x.size() == 2) return MaxBnd<View>::post(home,x[0],x[1],y); int l = x[0].min(); int u = x[0].max(); for (int i=1; i<x.size(); i++) { l = std::max(l,x[i].min()); u = std::max(u,x[i].max()); } GECODE_ME_CHECK(y.gq(home,l)); GECODE_ME_CHECK(y.lq(home,u)); if (x.same(y)) { // Check whether y occurs in x for (int i=0; i<x.size(); i++) GECODE_ES_CHECK((Rel::Lq<View,View>::post(home,x[i],y))); } else { (void) new (home) NaryMaxBnd<View>(home,x,y); } return ES_OK; }
template<class View> forceinline NaryMaxBnd<View>::NaryMaxBnd(Space& home, NaryMaxBnd<View>& p) : NaryOnePropagator<View,PC_INT_BND>(home,p) {}
template<class View> Actor* NaryMaxBnd<View>::copy(Space& home) { if (x.size() == 1) return new (home) Rel::EqBnd<View,View>(home,*this,x[0],y); if (x.size() == 2) return new (home) MaxBnd<View>(home,*this,x[0],x[1],y); return new (home) NaryMaxBnd<View>(home,*this); }
/// Status of propagation for nary max enum MaxPropStatus { MPS_ASSIGNED = 1<<0, ///< All views are assigned MPS_REMOVED = 1<<1, ///< A view is removed MPS_NEW_BOUND = 1<<2 ///< Telling has found a new upper bound };
template<class View> forceinline ExecStatus prop_nary_max_bnd(Space& home, Propagator& p, ViewArray<View>& x, View y, PropCond pc) { rerun: assert(x.size() > 0); int maxmax = x[0].max(); int maxmin = x[0].min(); for (int i=1; i<x.size(); i++) { maxmax = std::max(x[i].max(),maxmax); maxmin = std::max(x[i].min(),maxmin); } GECODE_ME_CHECK(y.lq(home,maxmax)); GECODE_ME_CHECK(y.gq(home,maxmin)); maxmin = y.min(); maxmax = y.max(); int status = MPS_ASSIGNED; for (int i=x.size(); i--; ) { ModEvent me = x[i].lq(home,maxmax); if (me == ME_INT_FAILED) return ES_FAILED; if (me_modified(me) && (x[i].max() != maxmax)) status |= MPS_NEW_BOUND; if (x[i].max() < maxmin) { x.move_lst(i,home,p,pc); status |= MPS_REMOVED; } else if (!x[i].assigned()) status &= ~MPS_ASSIGNED; } if (x.size() == 0) return ES_FAILED; if ((status & MPS_REMOVED) != 0) goto rerun; if (((status & MPS_ASSIGNED) != 0) && y.assigned()) return home.ES_SUBSUMED(p); return ((status & MPS_NEW_BOUND) != 0) ? ES_NOFIX : ES_FIX; }
template<class View> ExecStatus NaryMaxBnd<View>::propagate(Space& home, const ModEventDelta&) { ExecStatus es = prop_nary_max_bnd(home,*this,x,y,PC_INT_BND); GECODE_ES_CHECK(es); if (x.size() == 1) GECODE_REWRITE(*this,(Rel::EqBnd<View,View>::post(home(*this),x[0],y))); return es; }
/* * Ternary domain consistent maximum * */
template<class View> forceinline MaxDom<View>::MaxDom(Home home, View x0, View x1, View x2) : TernaryPropagator<View,PC_INT_DOM>(home,x0,x1,x2) {}
template<class View> ExecStatus MaxDom<View>::post(Home home, View x0, View x1, View x2) { GECODE_ME_CHECK(x2.gq(home,std::max(x0.min(),x1.min()))); GECODE_ME_CHECK(x2.lq(home,std::max(x0.max(),x1.max()))); if (x0 == x1) return Rel::EqDom<View,View>::post(home,x0,x2); if (x0 == x2) return Rel::Lq<View,View>::post(home,x1,x2); if (x1 == x2) return Rel::Lq<View,View>::post(home,x0,x2); (void) new (home) MaxDom<View>(home,x0,x1,x2); return ES_OK; }
template<class View> forceinline MaxDom<View>::MaxDom(Space& home, MaxDom<View>& p) : TernaryPropagator<View,PC_INT_DOM>(home,p) {}
template<class View> forceinline MaxDom<View>::MaxDom(Space& home, Propagator& p, View x0, View x1, View x2) : TernaryPropagator<View,PC_INT_DOM>(home,p,x0,x1,x2) {}
template<class View> Actor* MaxDom<View>::copy(Space& home) { return new (home) MaxDom<View>(home,*this); }
template<class View> PropCost MaxDom<View>::cost(const Space&, const ModEventDelta& med) const { return PropCost::ternary((View::me(med) == ME_INT_DOM) ? PropCost::HI : PropCost::LO); }
template<class View> ExecStatus MaxDom<View>::propagate(Space& home, const ModEventDelta& med) { if (View::me(med) != ME_INT_DOM) { GECODE_ES_CHECK(prop_max_bnd(home,x0,x1,x2)); if ((x0.max() <= x1.min()) || (x0.max() < x2.min())) GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x1,x2))); if ((x1.max() <= x0.min()) || (x1.max() < x2.min())) GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x0,x2))); return x0.assigned() && x1.assigned() && x2.assigned() ? home.ES_SUBSUMED(*this) : home.ES_NOFIX_PARTIAL(*this,View::med(ME_INT_DOM)); } ViewRanges<View> r0(x0), r1(x1); Iter::Ranges::Union<ViewRanges<View>,ViewRanges<View> > u(r0,r1); GECODE_ME_CHECK(x2.inter_r(home,u,false)); if (rtest_nq_dom(x0,x2) == RT_TRUE) { GECODE_ES_CHECK((Rel::Lq<View,View>::post(Home(home),x0,x2))); GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x1,x2))); } if (rtest_nq_dom(x1,x2) == RT_TRUE) { GECODE_ES_CHECK((Rel::Lq<View,View>::post(Home(home),x1,x2))); GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x0,x2))); } return ES_FIX; }
/* * Nary domain consistent maximum * */
template<class View> forceinline NaryMaxDom<View>::NaryMaxDom(Home home, ViewArray<View>& x, View y) : NaryOnePropagator<View,PC_INT_DOM>(home,x,y) {}
template<class View> ExecStatus NaryMaxDom<View>::post(Home home, ViewArray<View>& x, View y) { assert(x.size() > 0); x.unique(); if (x.size() == 1) return Rel::EqDom<View,View>::post(home,x[0],y); if (x.size() == 2) return MaxDom<View>::post(home,x[0],x[1],y); int l = x[0].min(); int u = x[0].max(); for (int i=0; i<x.size(); i++) { l = std::max(l,x[i].min()); u = std::max(u,x[i].max()); } GECODE_ME_CHECK(y.gq(home,l)); GECODE_ME_CHECK(y.lq(home,u)); if (x.same(y)) { // Check whether y occurs in x for (int i=0; i<x.size(); i++) GECODE_ES_CHECK((Rel::Lq<View,View>::post(home,x[i],y))); } else { (void) new (home) NaryMaxDom<View>(home,x,y); } return ES_OK; }
template<class View> forceinline NaryMaxDom<View>::NaryMaxDom(Space& home, NaryMaxDom<View>& p) : NaryOnePropagator<View,PC_INT_DOM>(home,p) {}
template<class View> Actor* NaryMaxDom<View>::copy(Space& home) { if (x.size() == 1) return new (home) Rel::EqDom<View,View>(home,*this,x[0],y); if (x.size() == 2) return new (home) MaxDom<View>(home,*this,x[0],x[1],y); return new (home) NaryMaxDom<View>(home,*this); }
template<class View> PropCost NaryMaxDom<View>::cost(const Space&, const ModEventDelta& med) const { if (View::me(med) == ME_INT_DOM) return PropCost::linear(PropCost::HI, y.size()); else return PropCost::linear(PropCost::LO, x.size()); }
template<class View> ExecStatus NaryMaxDom<View>::propagate(Space& home, const ModEventDelta& med) { if (View::me(med) != ME_INT_DOM) { ExecStatus es = prop_nary_max_bnd(home,*this,x,y,PC_INT_DOM); GECODE_ES_CHECK(es); return (es == ES_FIX) ? home.ES_FIX_PARTIAL(*this,View::med(ME_INT_DOM)) : home.ES_NOFIX_PARTIAL(*this,View::med(ME_INT_DOM)); } Region r; ViewRanges<View>* i_x = r.alloc<ViewRanges<View> >(x.size()); for (int i=0; i<x.size(); i++) { ViewRanges<View> i_xi(x[i]); i_x[i]=i_xi; } Iter::Ranges::NaryUnion u(r, i_x, x.size()); GECODE_ME_CHECK(y.inter_r(home,u,false)); for (int i = x.size(); i--; ) if (rtest_nq_dom(x[i],y) == RT_TRUE) { GECODE_ES_CHECK((Rel::Lq<View,View>::post(Home(home),x[i],y))); x.move_lst(i,home,*this,PC_INT_DOM); } assert(x.size() > 0); if (x.size() == 1) GECODE_REWRITE(*this,(Rel::EqDom<View,View>::post(home(*this),x[0],y))); return ES_FIX; }
}}}
// STATISTICS: int-prop