inter.hpp /usr/include/gecode/set/element.hh /usr/include/gecode/set/element.hh /usr/include/gecode/set/element/inter.hpp Gecode Gecode::Set Gecode::Set::Element /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *GuidoTack<tack@gecode.org> *ChristianSchulte<schulte@gecode.org> * *Copyright: *GuidoTack,2004 *ChristianSchulte,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{namespaceElement{ template<classView,classView0,classView1> forceinline ElementIntersection<View,View0,View1>:: ElementIntersection(Homehome,IdxViewArray&iv0,View0y0,View1y1, constIntSet&theUniverse) :Propagator(home),universe(theUniverse),iv(iv0),x0(y0),x1(y1){ home.notice(*this,AP_DISPOSE); x0.subscribe(home,*this,PC_SET_ANY); x1.subscribe(home,*this,PC_SET_ANY); iv.subscribe(home,*this,PC_SET_ANY); } template<classView,classView0,classView1> forceinline ElementIntersection<View,View0,View1>:: ElementIntersection(Space&home,boolshare, ElementIntersection<View,View0,View1>&p) :Propagator(home,share,p){ x0.update(home,share,p.x0); x1.update(home,share,p.x1); iv.update(home,share,p.iv); universe.update(home,share,p.universe); } template<classView,classView0,classView1> PropCost ElementIntersection<View,View0,View1>::cost(constSpace&, constModEventDelta&)const{ returnPropCost::linear(PropCost::HI,iv.size()+2); } template<classView,classView0,classView1> forceinlinesize_t ElementIntersection<View,View0,View1>::dispose(Space&home){ home.ignore(*this,AP_DISPOSE); if(!home.failed()){ x0.cancel(home,*this,PC_SET_ANY); x1.cancel(home,*this,PC_SET_ANY); iv.cancel(home,*this,PC_SET_ANY); } universe.~IntSet(); (void)Propagator::dispose(home); returnsizeof(*this); } template<classView,classView0,classView1> ExecStatus ElementIntersection<View,View0,View1>:: post(Homehome,IdxViewArray&xs,View0x0,View1x1, constIntSet&universe){ intn=xs.size(); //x0\subseteq{1,...,n} Iter::Ranges::Singletons(0,n-1); GECODE_ME_CHECK(x0.intersectI(home,s)); (void)new(home) ElementIntersection<View,View0,View1>(home,xs,x0,x1,universe); returnES_OK; } template<classView,classView0,classView1> Actor* ElementIntersection<View,View0,View1>::copy(Space&home,boolshare){ returnnew(home)ElementIntersection<View,View0,View1>(home,share,*this); } template<classView,classView0,classView1> ExecStatus ElementIntersection<View,View0,View1>::propagate(Space&home, constModEventDelta&){ Regionr(home); intn=iv.size(); boolloopVar; do{ loopVar=false; //Cachetheupperbounditerator,aswehaveto //modifytheupperboundwhileiterating LubRanges<View0>x0ub(x0); Iter::Ranges::Cachex0ubc(r,x0ub); Iter::Ranges::ToValues<Iter::Ranges::Cache>vx0ub(x0ubc); GlbRanges<View0>x0lb(x0); Iter::Ranges::Cachex0lbc(r,x0lb); Iter::Ranges::ToValues<Iter::Ranges::Cache>vx0(x0lbc); //Inthefirstiteration,computeinbefore[i]theintersection //ofallthelowerboundsofthex_i.Atthesametime, //excludeinconsistentx_ifromx0andremovethemfrom //thelist,canceltheirdependencies. LUBndSetsofarBefore(home,universe); LUBndSet*before=r.alloc<LUBndSet>(n); intj=0; inti=0; while(vx0ub()){ //Removevarsatindicesnotintheupperbound if(iv[i].idx<vx0ub.val()){ iv[i].view.cancel(home,*this,PC_SET_ANY); ++i; continue; } assert(iv[i].idx==vx0ub.val()); iv[j]=iv[i]; Viewcandidate=iv[j].view; intcandidateInd=iv[j].idx; //inter=glb(x1)&complement(lub(candidate)) GlbRanges<View1>x1lb(x1); LubRanges<View>candub(candidate); Iter::Ranges::Diff<GlbRanges<View1>,LubRanges<View>> inter(x1lb,candub); //excludeinconsistentx_i //anx_iisinconsistentif //*itsmaxcardinalityislessthanminCardofx1 //*interisnotempty(thereareelementsinx_0 //thatcan'tbeinx_i) if(candidate.cardMax()<x1.cardMin()|| inter()){ ModEventme=(x0.exclude(home,candidateInd)); loopVar|=me_modified(me); GECODE_ME_CHECK(me); iv[j].view.cancel(home,*this,PC_SET_ANY); ++i; ++vx0ub; continue; }else{ //ifx_iisconsistent,checkwhetherweknow //thatitsindexisinx0 if(vx0()&&vx0.val()==candidateInd){ //x1<=candidate,candidate>=x1 GlbRanges<View1>x1lb(x1); ModEventme=candidate.includeI(home,x1lb); loopVar|=me_modified(me); GECODE_ME_CHECK(me); LubRanges<View>candub(candidate); me=x1.intersectI(home,candub); loopVar|=me_modified(me); GECODE_ME_CHECK(me); ++vx0; } new(&before[j])LUBndSet(home); before[j].update(home,sofarBefore); GlbRanges<View>clb(candidate); sofarBefore.intersectI(home,clb); } ++vx0ub; ++i;++j; } //cancelthevariableswithindexgreaterthan //maxoflub(x0) for(intk=i;k<n;k++){ iv[k].view.cancel(home,*this,PC_SET_ANY); } n=j; iv.size(n); if(x0.cardMax()==0){ //Elementorisempty,hencetheresultmustbeuniverse { IntSetRangesuniI(universe); GECODE_ME_CHECK(x1.includeI(home,uniI)); } { IntSetRangesuniI(universe); GECODE_ME_CHECK(x1.intersectI(home,uniI)); } for(inti=n;i--;) before[i].dispose(home); returnhome.ES_SUBSUMED(*this); } { //x1>=sofarBefore BndSetRangessfB(sofarBefore); ModEventme=x1.includeI(home,sfB); loopVar|=me_modified(me); GECODE_ME_CHECK(me); } sofarBefore.dispose(home); LUBndSetsofarAfter(home,universe); //Intheseconditeration,thistimebackwards,compute //sofarAfterastheintersectionofallglb(x_j)withj>i for(inti=n;i--;){ if(sofarAfter.size()==0)break; //extra=inter(before[i],sofarAfter)-lub(x1) BndSetRangesb(before[i]); BndSetRangess(sofarAfter); LubRanges<View1>x1ub(x1); Iter::Ranges::Inter<BndSetRanges, BndSetRanges>inter(b,s); Iter::Ranges::Diff<Iter::Ranges::Inter<BndSetRanges, BndSetRanges>,LubRanges<View1>>diff(inter,x1ub); if(diff()){ ModEventme=(x0.include(home,iv[i].idx)); loopVar|=me_modified(me); GECODE_ME_CHECK(me); //candidate!=extra me=iv[i].view.excludeI(home,diff); loopVar|=me_modified(me); GECODE_ME_CHECK(me); } GlbRanges<View>ivilb(iv[i].view); sofarAfter.intersectI(home,ivilb); before[i].dispose(home); } sofarAfter.dispose(home); }while(loopVar); //Testwhetherwedeterminedx0withoutdeterminingx1 if(x0.assigned()&&!x1.assigned()){ intubsize=static_cast<int>(x0.lubSize()); if(ubsize>2){ assert(ubsize==n); ViewArray<View>is(home,ubsize); for(inti=n;i--;) is[i]=iv[i].view; GECODE_REWRITE(*this,(RelOp::IntersectionN<View, View1> ::post(home(*this),is,x1))); }elseif(ubsize==2){ assert(n==2); Viewa=iv[0].view; Viewb=iv[1].view; GECODE_REWRITE(*this,(RelOp::Intersection<View,View,View1> ::post(home(*this),a,b,x1))); }elseif(ubsize==1){ assert(n==1); GECODE_REWRITE(*this, (Rel::Eq<View1,View>::post(home(*this),x1,iv[0].view))); }else{ GECODE_ME_CHECK(x1.cardMax(home,0)); returnhome.ES_SUBSUMED(*this); } } boolallAssigned=true; for(inti=iv.size();i--;){ if(!iv[i].view.assigned()){ allAssigned=false; break; } } if(x1.assigned()&&x0.assigned()&&allAssigned){ returnhome.ES_SUBSUMED(*this); } returnES_FIX; } }}} //STATISTICS:set-prop