unionConst.hpp /usr/include/gecode/set/element.hh /usr/include/gecode/set/element/unionConst.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,2007 *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<classSView,classRView> forceinline ElementUnionConst<SView,RView>:: ElementUnionConst(Homehome,SViewy0, constIntSetArgs&iv0, RViewy1) :Propagator(home),x0(y0),n_iv(iv0.size()),x1(y1){ home.notice(*this,AP_DISPOSE); x0.subscribe(home,*this,PC_SET_ANY); x1.subscribe(home,*this,PC_SET_ANY); iv=static_cast<Space&>(home).alloc<IntSet>(n_iv); for(unsignedinti=iv0.size();i--;) iv[i]=iv0[i]; } template<classSView,classRView> forceinline ElementUnionConst<SView,RView>:: ElementUnionConst(Space&home,boolshare, ElementUnionConst<SView,RView>&p) :Propagator(home,share,p),n_iv(p.n_iv){ x0.update(home,share,p.x0); x1.update(home,share,p.x1); iv=home.alloc<IntSet>(n_iv); for(unsignedinti=n_iv;i--;) iv[i].update(home,share,p.iv[i]); } template<classSView,classRView> PropCost ElementUnionConst<SView,RView>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::linear(PropCost::HI,n_iv+2); } template<classSView,classRView> forceinlinesize_t ElementUnionConst<SView,RView>::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); } for(unsignedinti=n_iv;i--;) iv[i].~IntSet(); (void)Propagator::dispose(home); returnsizeof(*this); } template<classSView,classRView> ExecStatus ElementUnionConst<SView,RView>:: post(Homehome,SViewx0,constIntSetArgs&xs, RViewx1){ intn=xs.size(); //s2\subseteq{1,...,n} Iter::Ranges::Singletons(0,n-1); GECODE_ME_CHECK(x1.intersectI(home,s)); (void)new(home) ElementUnionConst<SView,RView>(home,x0,xs,x1); returnES_OK; } template<classSView,classRView> Actor* ElementUnionConst<SView,RView>::copy(Space&home,boolshare){ returnnew(home)ElementUnionConst<SView,RView>(home,share,*this); } template<classSView,classRView> ExecStatus ElementUnionConst<SView,RView>::propagate(Space&home,constModEventDelta&){ Regionr(home); bool*stillSelected=r.alloc<bool>(n_iv); boolloopVar; do{ loopVar=false; for(inti=n_iv;i--;) stillSelected[i]=false; //Cachetheupperbounditerator,aswehaveto //modifytheupperboundwhileiterating LubRanges<RView>x1ub(x1); Iter::Ranges::Cachex1ubc(r,x1ub); Iter::Ranges::ToValues<Iter::Ranges::Cache> vx1ub(x1ubc); GlbRanges<RView>x1lb(x1); Iter::Ranges::Cachex1lbc(r,x1lb); Iter::Ranges::ToValues<Iter::Ranges::Cache> vx1(x1lbc); //Inthefirstiteration,computeinbefore[i]theunion //ofalltheupperboundsofthex_i.Atthesametime, //excludeinconsistentx_ifromx1. GLBndSetsofarBefore(home); LUBndSetselectedInter(home,IntSet(Limits::min, Limits::max)); GLBndSet*before= static_cast<GLBndSet*>(r.ralloc(sizeof(GLBndSet)*n_iv)); unsignedintmaxCard=0; unsignedintminCard=Limits::card; while(vx1ub()){ inti=vx1ub.val(); IntSetRangescandCardR(iv[i]); unsignedintcandidateCard=Iter::Ranges::size(candCardR); IntSetRangescandlb(iv[i]); LubRanges<SView>x0ub(x0); Iter::Ranges::Diff<IntSetRanges, LubRanges<SView>>diff(candlb,x0ub); boolselectSingleInconsistent=false; if(x1.cardMax()<=1){ GlbRanges<SView>x0lb(x0); IntSetRangescandub(iv[i]); Iter::Ranges::Diff<GlbRanges<SView>, IntSetRanges>diff2(x0lb,candub); selectSingleInconsistent=diff2()||candidateCard<x0.cardMin(); } //excludeinconsistentx_i //anx_iisinconsistentif //*atmostonex_icanbeselectedandthereare //elementsinx_0thatcan'tbeinx_i //(selectSingleInconsistent) //*itsmincardinalityisgreaterthanmaxCardofx0 //*interisnotempty(thereareelementsinx_i //thatcan'tbeinx_0) if(selectSingleInconsistent|| candidateCard>x0.cardMax()|| diff()){ ModEventme=(x1.exclude(home,i)); loopVar|=me_modified(me); GECODE_ME_CHECK(me); }else{ stillSelected[i]=true; //ifx_iisconsistent,checkwhetherweknow //thatitsindexisinx1 if(vx1()&&vx1.val()==i){ //x0>=candidate,candidate<=x0 //GlbRanges<SView>candlb(candidate); IntSetRangescandlb(iv[i]); ModEventme=x0.includeI(home,candlb); loopVar|=me_modified(me); GECODE_ME_CHECK(me); ++vx1; } new(&before[i])GLBndSet(home); before[i].update(home,sofarBefore); IntSetRangescub(iv[i]); sofarBefore.includeI(home,cub); IntSetRangesclb(iv[i]); selectedInter.intersectI(home,clb); maxCard=std::max(maxCard,candidateCard); minCard=std::min(minCard,candidateCard); } ++vx1ub; } if(x1.cardMax()==0){ //Selectorisempty,hencetheresultmustbeempty { GECODE_ME_CHECK(x0.cardMax(home,0)); } for(inti=n_iv;i--;) if(stillSelected[i]) before[i].dispose(home); selectedInter.dispose(home); sofarBefore.dispose(home); returnhome.ES_SUBSUMED(*this); } if(x1.cardMin()>0){ //Selectorisnotempty,hencetheintersectionofthe //possiblyselectedlowerboundsiscontainedinx0 BndSetRangessi(selectedInter); ModEventme=x0.includeI(home,si); loopVar|=me_modified(me); GECODE_ME_CHECK(me); me=x0.cardMin(home,minCard); loopVar|=me_modified(me); GECODE_ME_CHECK(me); } selectedInter.dispose(home); if(x1.cardMax()<=1){ ModEventme=x0.cardMax(home,maxCard); loopVar|=me_modified(me); GECODE_ME_CHECK(me); } { //x0<=sofarBefore BndSetRangessfB(sofarBefore); ModEventme=x0.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_iv;i--;){ if(!stillSelected[i]) continue; BndSetRangesb(before[i]); BndSetRangess(sofarAfter); GlbRanges<SView>x0lb(x0); Iter::Ranges::Union<BndSetRanges, BndSetRanges>inter(b,s); Iter::Ranges::Diff<GlbRanges<SView>, Iter::Ranges::Union<BndSetRanges,BndSetRanges>>diff(x0lb,inter); if(diff()){ ModEventme=(x1.include(home,i)); loopVar|=me_modified(me); GECODE_ME_CHECK(me); //candidate!=extra IntSetRangesivi(iv[i]); if(!Iter::Ranges::subset(diff,ivi)) GECODE_ME_CHECK(ME_SET_FAILED); } IntSetRangesiviub(iv[i]); sofarAfter.includeI(home,iviub); before[i].dispose(home); } sofarAfter.dispose(home); }while(loopVar); if(x1.assigned()){ assert(x0.assigned()); returnhome.ES_SUBSUMED(*this); } returnES_FIX; } }}} //STATISTICS:set-prop