int-eq.hpp /usr/include/gecode/int/count.hh /usr/include/gecode/int/count.hh /usr/include/gecode/int/count/int-eq.hpp Gecode Gecode::Int Gecode::Int::Count /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2006 * *Lastmodified: *$Date:2011-08-2914:59:24+0200(Mon,29Aug2011)$by$Author:schulte$ *$Revision:12359$ * *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{namespaceCount{ template<classVX,classVY> forceinline EqInt<VX,VY>::EqInt(Homehome,ViewArray<VX>&x,intn_s,VYy,intc) :IntBase<VX,VY>(home,x,n_s,y,c){} template<classVX,classVY> ExecStatus EqInt<VX,VY>::post(Homehome,ViewArray<VX>&x,VYy,intc){ //Eliminatedecidedviews intn_x=x.size(); for(inti=n_x;i--;) switch(holds(x[i],y)){ caseRT_FALSE: x[i]=x[--n_x];break; caseRT_TRUE: x[i]=x[--n_x];c--;break; caseRT_MAYBE: break; default: GECODE_NEVER; } x.size(n_x); //RHStoosmallortoolarge if((c<0)||(c>n_x)) returnES_FAILED; //Allviewsmustbedifferent if(c==0) returnpost_false(home,x,y); //Allviewsmustbeequal if(c==n_x) returnpost_true(home,x,y); //Computehowmanysubscriptionsmustbecreated intn_s=std::max(c,n_x-c)+1; assert(n_s<=n_x); (void)new(home)EqInt<VX,VY>(home,x,n_s,y,c); returnES_OK; } template<classVX,classVY> forceinline EqInt<VX,VY>::EqInt(Space&home,boolshare,EqInt<VX,VY>&p) :IntBase<VX,VY>(home,share,p){} template<classVX,classVY> Actor* EqInt<VX,VY>::copy(Space&home,boolshare){ returnnew(home)EqInt<VX,VY>(home,share,*this); } template<classVX,classVY> ExecStatus EqInt<VX,VY>::propagate(Space&home,constModEventDelta&){ //Eliminatedecidedviewsfromsubscribedviews intn_x=x.size(); for(inti=n_s;i--;) switch(holds(x[i],y)){ caseRT_FALSE: x[i].cancel(home,*this,PC_INT_DOM); x[i]=x[--n_s];x[n_s]=x[--n_x]; break; caseRT_TRUE: x[i].cancel(home,*this,PC_INT_DOM); x[i]=x[--n_s];x[n_s]=x[--n_x];c--; break; caseRT_MAYBE: break; default: GECODE_NEVER; } x.size(n_x); if((c<0)||(c>n_x)) returnES_FAILED; //Eliminatedecidedviewsfromunsubscribedviews for(inti=n_x;i-->n_s;) switch(holds(x[i],y)){ caseRT_FALSE:x[i]=x[--n_x];break; caseRT_TRUE:x[i]=x[--n_x];c--;break; caseRT_MAYBE:break; default:GECODE_NEVER; } x.size(n_x); if((c<0)||(c>n_x)) returnES_FAILED; if(c==0){ //Allviewsmustbedifferent GECODE_ES_CHECK(post_false(home,x,y)); returnhome.ES_SUBSUMED(*this); } if(c==n_x){ //Allviewsmustbeequal GECODE_ES_CHECK(post_true(home,x,y)); returnhome.ES_SUBSUMED(*this); } intm=std::max(c,n_x-c)+1; assert(m<=n_x); //Now,theremustbenewsubscriptionsfromx[n_s]uptox[m-1] while(n_s<m) x[n_s++].subscribe(home,*this,PC_INT_DOM,false); returnES_FIX; } }}} //STATISTICS:int-prop