basic.hpp /usr/include/gecode/int/extensional.hh /usr/include/gecode/int/extensional/basic.hpp /usr/include/gecode/int/extensional.hh Gecode Gecode::Int Gecode::Int::Extensional /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *MikaelLagerkvist<lagerkvist@gecode.org> * *Contributingauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *MikaelLagerkvist,2007 *ChristianSchulte,2008 * *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{namespaceInt{namespaceExtensional{ /* *Thepropagatorproper * */ template<classView,boolshared> forceinline Basic<View,shared>::Basic(Homehome,ViewArray<View>&x, constTupleSet&t) :Base<View>(home,x,t){ } template<classView,boolshared> forceinlineExecStatus Basic<View,shared>::post(Homehome,ViewArray<View>&x, constTupleSet&t){ //Allvariablesinthecorrectdomain for(inti=x.size();i--;){ GECODE_ME_CHECK(x[i].gq(home,t.min())); GECODE_ME_CHECK(x[i].lq(home,t.max())); } (void)new(home)Basic<View,shared>(home,x,t); returnES_OK; } template<classView,boolshared> forceinline Basic<View,shared>::Basic(Space&home,boolshare,Basic<View,shared>&p) :Base<View>(home,share,p){ } template<classView,boolshared> PropCost Basic<View,shared>::cost(constSpace&,constModEventDelta&med)const{ if(View::me(med)==ME_INT_VAL) returnPropCost::quadratic(PropCost::HI,x.size()); else returnPropCost::cubic(PropCost::HI,x.size()); } template<classView,boolshared> Actor* Basic<View,shared>::copy(Space&home,boolshare){ returnnew(home)Basic<View,shared>(home,share,*this); } template<classView,boolshared> ExecStatus Basic<View,shared>::propagate(Space&home,constModEventDelta&){ //Setupdatastructures //Bit-setsforamortizedO(1)accesstodomains Regionr(home); BitSet*dom=r.alloc<BitSet>(x.size()); init_dom(home,dom); //Bit-setsforprocessedvalues. BitSet*has_support=r.alloc<BitSet>(x.size()); for(inti=x.size();i--;) has_support[i].init(home,ts()->domsize); //Valuestoprune Support::StaticStack<int,Region>nq(r,static_cast<int>(ts()->domsize)); //Runalgorithm //Checkconsistencyforeachview-valuepair for(inti=x.size();i--;){ for(ViewValues<View>vv(x[i]);vv();++vv){ //Valueoffsetforindexing intval=vv.val()-ts()->min; if(!has_support[i].get(static_cast<unsignedint>(val))){ //Findsupportforvaluevv.val()inview Tuplel=find_support(dom,i,val); if(l==NULL){ //Nopossiblesupportsleft nq.push(vv.val()); }else{ //Markvaluesassupported //Onlyforwarddirectionmarkingisneededsinceall //previousvalueshavebeenchecked for(intj=i;j--;){ has_support[j].set(static_cast<unsignedint>(l[j]-ts()->min)); assert(has_support[j].get(l[j]-ts()->min)); } } } } //Prunevaluesforx[i]whichdonothavesupportanymore while(!nq.empty()) GECODE_ME_CHECK(x[i].nq(home,nq.pop())); } for(inti=x.size();i--;) if(!x[i].assigned()) returnshared?ES_NOFIX:ES_FIX; returnhome.ES_SUBSUMED(*this); } }}} //STATISTICS:int-prop