union.hpp /usr/include/gecode/set/element.hh /usr/include/gecode/set/element/union.hpp /usr/include/gecode/set/element.hh 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,2006 *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 ElementUnion<View,View0,View1>:: ElementUnion(Homehome,IdxViewArray&iv0,View0y0,View1y1) :Propagator(home),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 ElementUnion<View,View0,View1>:: ElementUnion(Space&home,boolshare,ElementUnion<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); } template<classView,classView0,classView1> PropCost ElementUnion<View,View0,View1>::cost(constSpace&, constModEventDelta&)const{ returnPropCost::linear(PropCost::HI,iv.size()+2); } template<classView,classView0,classView1> forceinlinesize_t ElementUnion<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); } (void)Propagator::dispose(home); returnsizeof(*this); } template<classView,classView0,classView1> ExecStatus ElementUnion<View,View0,View1>:: post(Homehome,IdxViewArray&xs,View0x0,View1x1){ intn=xs.size(); //x0\subseteq{1,...,n} Iter::Ranges::Singletons(0,n-1); GECODE_ME_CHECK(x0.intersectI(home,s)); (void)new(home) ElementUnion<View,View0,View1>(home,xs,x0,x1); returnES_OK; } template<classView,classView0,classView1> Actor* ElementUnion<View,View0,View1>::copy(Space&home,boolshare){ returnnew(home)ElementUnion<View,View0,View1>(home,share,*this); } template<classView,classView0,classView1> ExecStatus ElementUnion<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]theunion //ofalltheupperboundsofthex_i.Atthesametime, //excludeinconsistentx_ifromx0andremovethemfrom //thelist,canceltheirdependencies. GLBndSetsofarBefore(home); LUBndSetselectedInter(home,IntSet(Limits::min, Limits::max)); GLBndSet*before= static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*n)); intj=0; inti=0; unsignedintmaxCard=0; unsignedintminCard=Limits::card; 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(candidate)&complement(lub(x1)) GlbRanges<View>candlb(candidate); LubRanges<View1>x1ub(x1); Iter::Ranges::Diff<GlbRanges<View>,LubRanges<View1>> diff(candlb,x1ub); boolselectSingleInconsistent=false; if(x0.cardMax()<=1){ GlbRanges<View1>x1lb(x1); LubRanges<View>candub(candidate); Iter::Ranges::Diff<GlbRanges<View1>, LubRanges<View>>diff2(x1lb,candub); selectSingleInconsistent= diff2()||candidate.cardMax()<x1.cardMin(); } //excludeinconsistentx_i //anx_iisinconsistentif //*atmostonex_icanbeselectedandthereare //elementsinx_0thatcan'tbeinx_i //(selectSingleInconsistent) //*itsmincardinalityisgreaterthanmaxCardofx1 //*interisnotempty(thereareelementsinx_i //thatcan'tbeinx_0) if(selectSingleInconsistent|| candidate.cardMin()>x1.cardMax()|| diff()){ 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<View>candlb(candidate); ModEventme=x1.includeI(home,candlb); loopVar|=me_modified(me); GECODE_ME_CHECK(me); LubRanges<View1>x1ub(x1); me=candidate.intersectI(home,x1ub); loopVar|=me_modified(me); GECODE_ME_CHECK(me); ++vx0; } new(&before[j])GLBndSet(home); before[j].update(home,sofarBefore); LubRanges<View>cub(candidate); sofarBefore.includeI(home,cub); GlbRanges<View>clb(candidate); selectedInter.intersectI(home,clb); maxCard=std::max(maxCard,candidate.cardMax()); minCard=std::min(minCard,candidate.cardMin()); } ++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){ //Selectorisempty,hencetheresultmustbeempty { GECODE_ME_CHECK(x1.cardMax(home,0)); } for(inti=n;i--;) before[i].dispose(home); returnhome.ES_SUBSUMED(*this); } if(x0.cardMin()>0){ //Selectorisnotempty,hencetheintersectionofthe //possiblyselectedlowerboundsiscontainedinx1 BndSetRangessi(selectedInter); ModEventme=x1.includeI(home,si); loopVar|=me_modified(me); GECODE_ME_CHECK(me); me=x1.cardMin(home,minCard); loopVar|=me_modified(me); GECODE_ME_CHECK(me); } selectedInter.dispose(home); if(x0.cardMax()<=1){ ModEventme=x1.cardMax(home,maxCard); loopVar|=me_modified(me); GECODE_ME_CHECK(me); } { //x1<=sofarBefore BndSetRangessfB(sofarBefore); ModEventme=x1.intersectI(home,sfB); loopVar|=me_modified(me); GECODE_ME_CHECK(me); } sofarBefore.dispose(home); GLBndSetsofarAfter(home); //Intheseconditeration,thistimebackwards,compute //sofarAfterastheunionofalllub(x_j)withj>i for(inti=n;i--;){ //TODO:checkforsizeofuniversehere? //if(sofarAfter.size()==0)break; //extra=inter(before[i],sofarAfter)-lub(x1) BndSetRangesb(before[i]); BndSetRangess(sofarAfter); GlbRanges<View1>x1lb(x1); Iter::Ranges::Union<BndSetRanges, BndSetRanges>inter(b,s); Iter::Ranges::Diff<GlbRanges<View1>, Iter::Ranges::Union<BndSetRanges,BndSetRanges>>diff(x1lb,inter); if(diff()){ ModEventme=(x0.include(home,iv[i].idx)); loopVar|=me_modified(me); GECODE_ME_CHECK(me); //candidate!=extra me=iv[i].view.includeI(home,diff); loopVar|=me_modified(me); GECODE_ME_CHECK(me); } LubRanges<View>iviub(iv[i].view); sofarAfter.includeI(home,iviub); 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::UnionN<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::Union<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