inter.hpp /usr/include/gecode/set/rel-op.hh /usr/include/gecode/set/element.hh /usr/include/gecode/set/rel-op/inter.hpp /usr/include/gecode/set/rel-op.hh /usr/include/gecode/set/rel-op/post.hpp Gecode Gecode::Set Gecode::Set::RelOp /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *GuidoTack<tack@gecode.org> *ChristianSchulte<schulte@gecode.org> * *Contributingauthors: *GaborSzokoli<szokoli@gecode.org> * *Copyright: *GuidoTack,2004 *ChristianSchulte,2004 *GaborSzokoli,2004 * *Lastmodified: *$Date:2012-09-0717:31:22+0200(Fri,07Sep2012)$by$Author:schulte$ *$Revision:13068$ * *ThisfileispartofGecode,thegenericconstraint *developmentenvironment: *http://www.gecode.org * *Permissionisherebygranted,freeofcharge,toanypersonobtaining *acopyofthissoftwareandassociateddocumentationfiles(the *"Software"),todealintheSoftwarewithoutrestriction,including *withoutlimitationtherightstouse,copy,modify,merge,publish, *distribute,sublicense,and/orsellcopiesoftheSoftware,andto *permitpersonstowhomtheSoftwareisfurnishedtodoso,subjectto *thefollowingconditions: * *Theabovecopyrightnoticeandthispermissionnoticeshallbe *includedinallcopiesorsubstantialportionsoftheSoftware. * *THESOFTWAREISPROVIDED"ASIS",WITHOUTWARRANTYOFANYKIND, *EXPRESSORIMPLIED,INCLUDINGBUTNOTLIMITEDTOTHEWARRANTIESOF *MERCHANTABILITY,FITNESSFORAPARTICULARPURPOSEAND *NONINFRINGEMENT.INNOEVENTSHALLTHEAUTHORSORCOPYRIGHTHOLDERSBE *LIABLEFORANYCLAIM,DAMAGESOROTHERLIABILITY,WHETHERINANACTION *OFCONTRACT,TORTOROTHERWISE,ARISINGFROM,OUTOFORINCONNECTION *WITHTHESOFTWAREORTHEUSEOROTHERDEALINGSINTHESOFTWARE. * */ namespaceGecode{namespaceSet{namespaceRelOp{ /* *"Ternaryintersection"propagator * */ template<classView0,classView1,classView2>ExecStatus Intersection<View0,View1,View2>::post(Homehome, View0x0,View1x1,View2x2){ (void)new(home)Intersection<View0,View1,View2>(home,x0,x1,x2); returnES_OK; } template<classView0,classView1,classView2> Actor* Intersection<View0,View1,View2>::copy(Space&home,boolshare){ returnnew(home)Intersection(home,share,*this); } template<classView0,classView1,classView2> ExecStatus Intersection<View0,View1,View2>::propagate(Space&home,constModEventDelta&med){ //Thispropagatorimplementstheconstraint //x2=x0\capx1 boolx0ass=x0.assigned(); boolx1ass=x1.assigned(); boolx2ass=x2.assigned(); ModEventme0=View0::me(med); ModEventme1=View1::me(med); ModEventme2=View2::me(med); boolx0lbmod=false; boolx1lbmod=false; boolmodified=false; do{ modified=false; do{ //4)glb(x2)<=glb(x0)\capglb(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 boolmodified2=false; GlbRanges<View2>x2lb2(x2); GECODE_ME_CHECK_MODIFIED(modified2,x1.includeI(home,x2lb2)); x1lbmod|=modified2; modified|=modified2; } }while(modified); modified=false; do{ boolmodifiedOld=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)\caplub(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 ExecStatusret=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)); returnhome.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) returnhome.ES_SUBSUMED(*this); if(x0ass!=x0.assigned()|| x1ass!=x1.assigned()|| x2ass!=x2.assigned()){ returnES_NOFIX; }else{ returnES_FIX; } } } template<classView0,classView1,classView2> forceinline Intersection<View0,View1,View2>::Intersection(Homehome, View0y0,View1y1,View2y2) :MixTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY, View2,PC_SET_ANY>(home,y0,y1,y2){} template<classView0,classView1,classView2> forceinline Intersection<View0,View1,View2>::Intersection(Space&home,boolshare, Intersection<View0,View1,View2>&p) :MixTernaryPropagator<View0,PC_SET_ANY,View1,PC_SET_ANY, View2,PC_SET_ANY>(home,share,p){} /* *"Naryintersection"propagator * */ template<classView0,classView1> forceinline IntersectionN<View0,View1>::IntersectionN(Homehome,ViewArray<View0>&x, View1y) :MixNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,x,y), intOfDets(home){ shared=x.shared(home)||viewarrayshared(home,x,y); } template<classView0,classView1> forceinline IntersectionN<View0,View1>::IntersectionN(Homehome,ViewArray<View0>&x, constIntSet&z,View1y) :MixNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,x,y), intOfDets(home){ shared=x.shared(home)||viewarrayshared(home,x,y); IntSetRangesrz(z); intOfDets.intersectI(home,rz); } template<classView0,classView1> forceinline IntersectionN<View0,View1>::IntersectionN(Space&home,boolshare, IntersectionN&p) :MixNaryOnePropagator<View0,PC_SET_ANY,View1,PC_SET_ANY>(home,share,p), shared(p.shared), intOfDets(){ intOfDets.update(home,p.intOfDets); } template<classView0,classView1> ExecStatus IntersectionN<View0,View1>::post(Homehome, ViewArray<View0>&x,View1y){ switch(x.size()){ case0: GECODE_ME_CHECK(y.cardMin(home,Limits::card)); returnES_OK; case1: returnRel::Eq<View0,View1>::post(home,x[0],y); case2: returnIntersection<View0,View0,View1>::post(home,x[0],x[1],y); default: (void)new(home)IntersectionN<View0,View1>(home,x,y); returnES_OK; } } template<classView0,classView1> ExecStatus IntersectionN<View0,View1>::post(Homehome,ViewArray<View0>&x, constIntSet&z,View1y){ (void)new(home)IntersectionN<View0,View1>(home,x,z,y); returnES_OK; } template<classView0,classView1> Actor* IntersectionN<View0,View1>::copy(Space&home,boolshare){ returnnew(home)IntersectionN<View0,View1>(home,share,*this); } template<classView0,classView1> PropCost IntersectionN<View0,View1>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::quadratic(PropCost::HI,x.size()+1); } template<classView0,classView1> ExecStatus IntersectionN<View0,View1>::propagate(Space&home,constModEventDelta&){ boolrepeat=false; do{ repeat=false; intxsize=x.size(); if(xsize==0) gotosize0; for(inti=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); returnhome.ES_SUBSUMED(*this); } } { Regionr(home); GlbRanges<View0>*xLBs=r.alloc<GlbRanges<View0>>(xsize); LubRanges<View0>*xUBs=r.alloc<LubRanges<View0>>(xsize); for(inti=xsize;i--;){ GlbRanges<View0>lb(x[i]); LubRanges<View0>ub(x[i]); xLBs[i]=lb; xUBs[i]=ub; } { Iter::Ranges::NaryInterlbi(r,xLBs,xsize); BndSetRangesdets(intOfDets); lbi&=dets; GECODE_ME_CHECK(y.includeI(home,lbi)); } { Iter::Ranges::NaryInterubi(r,xUBs,xsize); BndSetRangesdets(intOfDets); ubi&=dets; GECODE_ME_CHECK(y.intersectI(home,ubi)); } } for(inti=xsize;i--;){ GlbRanges<View1>ylb(y); GECODE_ME_CHECK(x[i].includeI(home,ylb)); } //xi.exclude(Intersection(xj.lb)-y.ub) { Regionr(home); GLBndSet*rightSet= static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*xsize)); new(&rightSet[xsize-1])GLBndSet(home); rightSet[xsize-1].update(home,intOfDets); for(inti=xsize-1;i--;){ GlbRanges<View0>xilb(x[i+1]); BndSetRangesprev(rightSet[i+1]); Iter::Ranges::Inter<GlbRanges<View0>, BndSetRanges>inter(xilb,prev); new(&rightSet[i])GLBndSet(home); rightSet[i].includeI(home,inter); } LUBndSetleftAcc(home); for(inti=0;i<xsize;i++){ BndSetRangesleft(leftAcc); BndSetRangesright(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(inti=xsize;i--;) rightSet[i].dispose(home); leftAcc.dispose(home); } for(inti=0;i<x.size();i++){ //Donotreverse!Eatsawaytheendofthearray! 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); returnhome.ES_SUBSUMED(*this); } } } size0: if(x.size()==0){ BndSetRangesall1(intOfDets); GECODE_ME_CHECK(y.intersectI(home,all1)); BndSetRangesall2(intOfDets); GECODE_ME_CHECK(y.includeI(home,all2)); intOfDets.dispose(home); returnhome.ES_SUBSUMED(*this); } }while(repeat); returnshared?ES_NOFIX:ES_FIX; } }}} //STATISTICS:set-prop