int-dom.hpp /usr/include/gecode/int/linear.hh /usr/include/gecode/int/arithmetic.hh /usr/include/gecode/int/gcc/post.hpp /usr/include/gecode/int/gcc.hh /usr/include/gecode/int/arithmetic/divmod.hpp /usr/include/gecode/int/linear.hh /usr/include/gecode/int/linear/int-dom.hpp Gecode::Int::Linear::SupportSet Gecode::Int::Linear::SupportSet::ResultIter Gecode::Int::Linear::SupportIter Gecode::Int::Linear::PosSupportIter Gecode::Int::Linear::NegSupportIter Gecode Gecode::Int Gecode::Int::Linear /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2006 * *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{namespaceLinear{ classSupportSet{ private: Support::BitSetBasebs; public: SupportSet(void); voidinit(Region&r,unsignedintn); voidsupport(unsignedinti); boolsupported(unsignedinti)const; private: classResultIter:publicViewValues<IntView>{ protected: constSupportSet&s; unsignedintp; public: ResultIter(constSupportSet&s0,constIntView&x); voidoperator++(void); }; public: ModEventtell(Space&home,IntView&x)const; }; template<classVal> classSupportIter{ protected: inta; IntViewx; SupportSets; intc; unsignedintp; Vall; Valu; public: voidinit(Region&r,inta,constIntView&x,Vall,Valu); voidsupport(void); ModEventtell(Space&home); }; template<classVal> classPosSupportIter:publicSupportIter<Val>{ private: IntVarImpFwdi; //Using-declarationsfordependantnames usingSupportIter<Val>::a; usingSupportIter<Val>::x; usingSupportIter<Val>::s; usingSupportIter<Val>::c; usingSupportIter<Val>::p; usingSupportIter<Val>::l; usingSupportIter<Val>::u; public: boolreset(Val&d); booladjust(Val&d); }; template<classVal> classNegSupportIter:publicSupportIter<Val>{ private: IntVarImpBwdi; //Using-declarationsfordependantnames usingSupportIter<Val>::a; usingSupportIter<Val>::x; usingSupportIter<Val>::s; usingSupportIter<Val>::c; usingSupportIter<Val>::p; usingSupportIter<Val>::l; usingSupportIter<Val>::u; public: boolreset(Val&d); booladjust(Val&d); }; /* *Supportset * */ forceinline SupportSet::SupportSet(void){} forceinlinevoid SupportSet::init(Region&r,unsignedintn){ bs.init(r,n); } forceinlinevoid SupportSet::support(unsignedinti){ bs.set(i); } forceinlinebool SupportSet::supported(unsignedinti)const{ returnbs.get(i); } forceinline SupportSet::ResultIter::ResultIter(constSupportSet&s0,constIntView&x) :ViewValues<IntView>(x),s(s0),p(0){ while(ViewValues<IntView>::operator()()&&s.supported(p)){ ViewValues<IntView>::operator ++();++p; } } forceinlinevoid SupportSet::ResultIter::operator++(void){ do{ ViewValues<IntView>::operator ++();++p; }while(ViewValues<IntView>::operator()()&&s.supported(p)); } forceinlineModEvent SupportSet::tell(Space&home,IntView&x)const{ switch(bs.status()){ caseSupport::BSS_NONE: returnME_INT_FAILED; caseSupport::BSS_ALL: returnME_INT_NONE; caseSupport::BSS_SOME: { ResultIteri(*this,x); returnx.minus_v(home,i); } default: GECODE_NEVER; } returnME_INT_NONE; } /* *Base-classforsupport-basediterator * */ template<classVal> forceinlinevoid SupportIter<Val>::init(Region&r, inta0,constIntView&x0,Vall0,Valu0){ a=a0;x=x0;l=l0;u=u0; s.init(r,x.size()); } template<classVal> forceinlinevoid SupportIter<Val>::support(void){ s.support(p); } template<classVal> forceinlineModEvent SupportIter<Val>::tell(Space&home){ returns.tell(home,x); } /* *Support-basediteratorforpositiveview * */ template<classVal> forceinlinebool PosSupportIter<Val>::reset(Val&d){ //Waytoosmall,novaluecanmakeitbigenough if(d+static_cast<Val>(a)*x.max()<u) returnfalse; //Restartiteratorandpositionofvalues i.init(x.varimp());p=0; //Skipallrangeswhicharetoosmall while(d+static_cast<Val>(a)*i.max()<u){ p+=i.width();++i; } //Thereisatleastonerangeleft(checkofmax) assert(i()); //Initializecurrentrangeandadjustvalue c=i.min(); //Skipallvalueswhicharetoosmall while(d+static_cast<Val>(a)*c<u){ p++;c++; } //Adjusttonewvalue d+=static_cast<Val>(a)*c; returntrue; } template<classVal> forceinlinebool PosSupportIter<Val>::adjust(Val&d){ //Currentvalue Valv=static_cast<Val>(a)*c; //Subtractcurrentvaluefromd d-=v; //Movetonextposition(numberofvalue) p++; //Stillinthesamerange if(c<i.max()){ //Decrementcurrentvalues c+=1;v+=a; }else{ //Gotonextrange ++i; if(!i()) returnfalse; c=i.min();v=static_cast<Val>(a)*c; } //Isdwiththecurrentvaluetoolarge? if(d+v>l) returnfalse; //Updated d+=v; returntrue; } /* *Support-basediteratorfornegativeview * */ template<classVal> forceinlinebool NegSupportIter<Val>::reset(Val&d){ //Waytoosmall,novaluecanmakeitbigenough if(d+static_cast<Val>(a)*x.min()<u) returnfalse; //Restartiteratorandpositionofvalues i.init(x.varimp());p=x.size()-1; //Skipallrangeswhicharetoosmall while(d+static_cast<Val>(a)*i.min()<u){ p-=i.width();++i; } //Thereisatleastonerangeleft(checkofmax) assert(i()); //Initializecurrentrange c=i.max(); //Skipallvalueswhicharetoosmall while(d+static_cast<Val>(a)*c<u){ p--;c--; } //Adjusttonewvalue d+=static_cast<Val>(a)*c; returntrue; } template<classVal> forceinlinebool NegSupportIter<Val>::adjust(Val&d){ //Currentvalue Valv=static_cast<Val>(a)*c; //Subtractcurrentvaluefromd d-=v; //Movetonextposition(numberofvalue) p--; //Stillinthesamerange if(c>i.min()){ //Decrementcurrentvalues c-=1;v-=a; }else{ //Gotonextrange ++i; if(!i()) returnfalse; c=i.max();v=static_cast<Val>(a)*c; } //Isdwiththecurrentvaluetoolarge? if(d+v>l) returnfalse; //Updated d+=v; returntrue; } /* *Thedomainconsistenequalitypropagator * */ template<classVal,classView> forceinline DomEq<Val,View>::DomEq(Homehome, ViewArray<View >&x,ViewArray<View >&y, Valc) :Lin<Val,View,View,PC_INT_DOM>(home,x,y,c){} template<classVal,classView> ExecStatus DomEq<Val,View>::post(Homehome, ViewArray<View>&x,ViewArray<View>&y, Valc){ (void)new(home)DomEq<Val,View>(home,x,y,c); returnES_OK; } template<classVal,classView> forceinline DomEq<Val,View>::DomEq(Space&home,boolshare,DomEq<Val,View>&p) :Lin<Val,View,View,PC_INT_DOM>(home,share,p){} template<classVal,classView> Actor* DomEq<Val,View>::copy(Space&home,boolshare){ returnnew(home)DomEq<Val,View>(home,share,*this); } template<classVal,classView> PropCost DomEq<Val,View>::cost(constSpace&,constModEventDelta&med)const{ if(View::me(med)!=ME_INT_DOM) returnPropCost::linear(PropCost::LO,x.size()+y.size()); else returnPropCost::crazy(PropCost::HI,x.size()+y.size()); } template<classVal,classView> ExecStatus DomEq<Val,View>::propagate(Space&home,constModEventDelta&med){ if(View::me(med)!=ME_INT_DOM){ ExecStatuses=prop_bnd<Val,View,View>(home,med,*this,x,y,c); GECODE_ES_CHECK(es); returnhome.ES_FIX_PARTIAL(*this,View::med(ME_INT_DOM)); } //Valueofequationforpartialassignment Vald=-c; intn=x.size(); intm=y.size(); Regionr(home); //Createsupport-baseiterators PosSupportIter<Val>*xp=r.alloc<PosSupportIter<Val>>(n); NegSupportIter<Val>*yp=r.alloc<NegSupportIter<Val>>(m); //Initializeviewsforassignments { Vall=0; Valu=0; for(intj=m;j--;){ yp[j].init(r,-y[j].scale(),y[j].base(),l,u); l+=y[j].max();u+=y[j].min(); } for(inti=n;i--;){ xp[i].init(r,x[i].scale(),x[i].base(),l,u); l-=x[i].min();u-=x[i].max(); } } //Collectsupportinformationbyiteratingassignments { //Forceresetofalliteratorsinfirstround inti=0; intj=0; next_i: //Resetalliteratorsforpositiveviewsandupdated while(i<n){ if(!xp[i].reset(d))gotoprev_i; i++; } next_j: //Resetalliteratorsfornegativeviewsandupdated while(j<m){ if(!yp[j].reset(d))gotoprev_j; j++; } //Checkwhethercurrentassignmentissolution if(d==0){ //Recordsupport for(intis=n;is--;)xp[is].support(); for(intjs=m;js--;)yp[js].support(); } prev_j: //Tryiteratingtonextassignment:negativeviews while(j>0){ if(yp[j-1].adjust(d))gotonext_j; j--; } prev_i: //Tryiteratingtonextassignment:positiveviews while(i>0){ if(xp[i-1].adjust(d))gotonext_i; i--; } } //Tellbacknewvariabledomains boolassigned=true; for(inti=n;i--;){ GECODE_ME_CHECK(xp[i].tell(home)); if(!x[i].assigned()) assigned=false; } for(intj=m;j--;){ GECODE_ME_CHECK(yp[j].tell(home)); if(!y[j].assigned()) assigned=false; } if(assigned) returnhome.ES_SUBSUMED(*this); returnES_FIX; } }}} //STATISTICS:int-prop