Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
12 kB · 385 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Guido Tack <tack@gecode.org> * Christian Schulte <schulte@gecode.org> * * Contributing authors: * Gabor Szokoli <szokoli@gecode.org> * * Copyright: * Guido Tack, 2004 * Christian Schulte, 2004 * Gabor Szokoli, 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. * */
namespace Gecode { namespace Set { namespace RelOp {
/* * "Ternary intersection" propagator * */
template<class View0, class View1, class View2> ExecStatus Intersection<View0,View1,View2>::post(Home home, View0 x0,View1 x1,View2 x2) { (void) new (home) Intersection<View0,View1,View2>(home,x0,x1,x2); return ES_OK; }
template<class View0, class View1, class View2> Actor* Intersection<View0,View1,View2>::copy(Space& home) { return new (home) Intersection(home,*this); }
template<class View0, class View1, class View2> ExecStatus Intersection<View0,View1,View2>::propagate(Space& home, const ModEventDelta& med) { // This propagator implements the constraint // x2 = x0 \cap x1
bool x0ass = x0.assigned(); bool x1ass = x1.assigned(); bool x2ass = x2.assigned();
ModEvent me0 = View0::me(med); ModEvent me1 = View1::me(med); ModEvent me2 = View2::me(med);
bool x0lbmod = false; bool x1lbmod = false; bool modified = false;
do {
modified = false; do { // 4) glb(x2) <= glb(x0) \cap glb(x1) { GlbRanges<View0> x0lb(x0); GlbRanges<View1> x1lb(x1); Iter::Ranges::Inter<GlbRanges<View0>, GlbRanges<View1> > i2(x0lb,x1lb); GECODE_ME_CHECK_MODIFIED(modified, x2.includeI(home,i2) ); }
if (modified || Rel::testSetEventLB(me2) ) { modified = false; // 5) x2 <= x0 GlbRanges<View2> x2lb1(x2); GECODE_ME_CHECK_MODIFIED(modified, x0.includeI(home,x2lb1) ); x0lbmod |= modified;
// 6) x2 <= x1 bool modified2=false; GlbRanges<View2> x2lb2(x2); GECODE_ME_CHECK_MODIFIED(modified2, x1.includeI(home,x2lb2) ); x1lbmod |= modified2; modified |= modified2; }
} while (modified);
modified = false; do { bool modifiedOld = modified; modified = false;
if (Rel::testSetEventUB(me2) || Rel::testSetEventLB(me0) || x0lbmod || modifiedOld) { // 1) lub(x2) \ glb(x0) => lub(x1) GlbRanges<View0> x0lb(x0); LubRanges<View2> x2ub(x2); Iter::Ranges::Diff<GlbRanges<View0>,LubRanges<View2> > diff(x0lb, x2ub); GECODE_ME_CHECK_MODIFIED(modified, x1.excludeI(home,diff) ); }
if (Rel::testSetEventUB(me2) || Rel::testSetEventLB(me1) || x1lbmod || modifiedOld) { // 2) lub(x2) \ glb(x1) => lub(x0) GlbRanges<View1> x1lb(x1); LubRanges<View2> x2ub(x2); Iter::Ranges::Diff<GlbRanges<View1>, LubRanges<View2> > diff(x1lb, x2ub); GECODE_ME_CHECK_MODIFIED(modified, x0.excludeI(home,diff) ); }
if (Rel::testSetEventUB(me0,me1) || modified) { // modified = false; // 3) lub(x0) \cap lub(x1) <= lub(x2) LubRanges<View0> x0ub(x0); LubRanges<View1> x1ub(x1); Iter::Ranges::Inter<LubRanges<View0>, LubRanges<View1> > i1(x0ub,x1ub); GECODE_ME_CHECK_MODIFIED(modified, x2.intersectI(home,i1) ); }
} while(modified);
modified = false; { // cardinality ExecStatus ret = interCard(home,modified, x0, x1, x2); GECODE_ES_CHECK(ret); }
if (x2.cardMin() == Set::Limits::card) { GECODE_ME_CHECK( x0.cardMin(home, Set::Limits::card) ); GECODE_ME_CHECK( x1.cardMin(home, Set::Limits::card) ); return home.ES_SUBSUMED(*this); }
if (x0.cardMin() == Set::Limits::card) GECODE_REWRITE(*this,(Rel::Eq<View1,View2>::post(home(*this),x1,x2))); if (x1.cardMin() == Set::Limits::card) GECODE_REWRITE(*this,(Rel::Eq<View0,View2>::post(home(*this),x0,x2)));
} while(modified);
if (shared(x0,x1,x2)) { return (x0ass && x1ass && x2ass) ? home.ES_SUBSUMED(*this) : ES_NOFIX; } else { if (x0ass && x1ass && x2ass) return home.ES_SUBSUMED(*this); if (x0ass != x0.assigned() || x1ass != x1.assigned() || x2ass != x2.assigned()) { return ES_NOFIX; } else { return ES_FIX; } } }
template<class View0, class View1, class View2> forceinline Intersection<View0,View1,View2>::Intersection(Home home, View0 y0,View1 y1,View2 y2) : MixTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY, View2,PC_SET_ANY>(home,y0,y1,y2) {}
template<class View0, class View1, class View2> forceinline Intersection<View0,View1,View2>::Intersection(Space& home, Intersection<View0,View1,View2>& p) : MixTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY, View2,PC_SET_ANY>(home,p) {}
/* * "Nary intersection" propagator * */
template<class View0, class View1> forceinline IntersectionN<View0,View1>::IntersectionN(Home home, ViewArray<View0>& x, View1 y) : MixNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,x,y), intOfDets(home) { shared = Gecode::shared(x) || viewarrayshared(x,y); }
template<class View0, class View1> forceinline IntersectionN<View0,View1>::IntersectionN(Home home, ViewArray<View0>& x, const IntSet& z, View1 y) : MixNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,x,y), intOfDets(home) { shared = Gecode::shared(x) || viewarrayshared(x,y); IntSetRanges rz(z); intOfDets.intersectI(home, rz); }
template<class View0, class View1> forceinline IntersectionN<View0,View1>::IntersectionN(Space& home, IntersectionN& p) : MixNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,p), shared(p.shared), intOfDets() { intOfDets.update(home, p.intOfDets); }
template<class View0, class View1> ExecStatus IntersectionN<View0,View1>::post(Home home, ViewArray<View0>& x, View1 y) { switch (x.size()) { case 0: GECODE_ME_CHECK(y.cardMin(home, Limits::card)); return ES_OK; case 1: return Rel::Eq<View0,View1>::post(home, x[0], y); case 2: return Intersection<View0,View0,View1>::post(home, x[0], x[1], y); default: (void) new (home) IntersectionN<View0,View1>(home,x,y); return ES_OK; } }
template<class View0, class View1> ExecStatus IntersectionN<View0,View1>::post(Home home, ViewArray<View0>& x, const IntSet& z, View1 y) { (void) new (home) IntersectionN<View0,View1>(home,x,z,y); return ES_OK; }
template<class View0, class View1> Actor* IntersectionN<View0,View1>::copy(Space& home) { return new (home) IntersectionN<View0,View1>(home,*this); }
template<class View0, class View1> PropCost IntersectionN<View0,View1>::cost(const Space&, const ModEventDelta&) const { return PropCost::quadratic(PropCost::HI, x.size()+1); }
template<class View0, class View1> ExecStatus IntersectionN<View0,View1>::propagate(Space& home, const ModEventDelta&) { bool repeat = false; do { repeat = false; int xsize = x.size(); if (xsize == 0) goto size0; for (int i = xsize; i--; ) { GECODE_ME_CHECK( y.cardMax(home,x[i].cardMax()) ); GECODE_ME_CHECK( x[i].cardMin(home,y.cardMin()) ); if (x[i].cardMax()==0) { GECODE_ME_CHECK( y.cardMax(home, 0)); intOfDets.dispose(home); return home.ES_SUBSUMED(*this); } } { Region r; GlbRanges<View0>* xLBs = r.alloc<GlbRanges<View0> >(xsize); LubRanges<View0>* xUBs = r.alloc<LubRanges<View0> >(xsize); for (int i = xsize; i--; ) { GlbRanges<View0> lb(x[i]); LubRanges<View0> ub(x[i]); xLBs[i]=lb; xUBs[i]=ub; } { Iter::Ranges::NaryInter lbi(r,xLBs,xsize); BndSetRanges dets(intOfDets); lbi &= dets; GECODE_ME_CHECK(y.includeI(home,lbi)); } { Iter::Ranges::NaryInter ubi(r,xUBs,xsize); BndSetRanges dets(intOfDets); ubi &= dets; GECODE_ME_CHECK(y.intersectI(home,ubi)); } }
for (int i = xsize; i--; ) { GlbRanges<View1> ylb(y); GECODE_ME_CHECK( x[i].includeI(home,ylb) ); }
// xi.exclude (Intersection(xj.lb) - y.ub) { Region r; GLBndSet* rightSet = static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*xsize)); new (&rightSet[xsize-1]) GLBndSet(home); rightSet[xsize-1].update(home,intOfDets); for (int i=xsize-1;i--;) { GlbRanges<View0> xilb(x[i+1]); BndSetRanges prev(rightSet[i+1]); Iter::Ranges::Inter<GlbRanges<View0>, BndSetRanges> inter(xilb,prev); new (&rightSet[i]) GLBndSet(home); rightSet[i].includeI(home,inter); }
LUBndSet leftAcc(home);
for (int i=0;i<xsize;i++) { BndSetRanges left(leftAcc); BndSetRanges right(rightSet[i]); Iter::Ranges::Inter<BndSetRanges, BndSetRanges> inter(left, right); LubRanges<View1> yub(y); Iter::Ranges::Diff<Iter::Ranges::Inter<BndSetRanges, BndSetRanges>, LubRanges<View1> > forbidden(inter, yub); GECODE_ME_CHECK( x[i].excludeI(home,forbidden) ); GlbRanges<View0> xlb(x[i]); leftAcc.intersectI(home,xlb); } for (int i=xsize; i--;) rightSet[i].dispose(home); leftAcc.dispose(home); }
for(int i=0;i<x.size();i++) { //Do not reverse! Eats away the end of the array! while (i<x.size() && x[i].assigned()) { GlbRanges<View0> det(x[i]); if (intOfDets.intersectI(home,det)) {repeat = true;} x.move_lst(i); if (intOfDets.size()==0) { GECODE_ME_CHECK( y.cardMax(home,0) ); intOfDets.dispose(home); return home.ES_SUBSUMED(*this); } } } size0: if (x.size()==0) { BndSetRanges all1(intOfDets); GECODE_ME_CHECK( y.intersectI(home,all1) ); BndSetRanges all2(intOfDets); GECODE_ME_CHECK( y.includeI(home,all2) ); intOfDets.dispose(home); return home.ES_SUBSUMED(*this); }
} while (repeat);
return shared ? ES_NOFIX : ES_FIX; }
}}}
// STATISTICS: set-prop