lex.hpp /usr/include/gecode/int/rel.hh /usr/include/gecode/int/nvalues/int-base.hpp /usr/include/gecode/int/arithmetic.hh /usr/include/gecode/int/gcc/post.hpp /usr/include/gecode/int/dom/range.hpp /usr/include/gecode/int/distinct.hh /usr/include/gecode/int/member/prop.hpp /usr/include/gecode/int/rel.hh /usr/include/gecode/int/arithmetic/nroot.hpp /usr/include/gecode/int/arithmetic/max.hpp /usr/include/gecode/int/member.hh /usr/include/gecode/int/nvalues/bool-gq.hpp /usr/include/gecode/int/count.hh /usr/include/gecode/int/nvalues/int-gq.hpp /usr/include/gecode/int/count/rel.hpp /usr/include/gecode/set/element.hh /usr/include/gecode/int/nvalues/int-lq.hpp /usr/include/gecode/int/element.hh /usr/include/gecode/int/channel.hh /usr/include/gecode/int/bool.hh /usr/include/gecode/int/member/re-prop.hpp /usr/include/gecode/int/nvalues.hh /usr/include/gecode/int/bool/ite.hpp /usr/include/gecode/int/sequence.hh /usr/include/gecode/int/rel/lex.hpp /usr/include/gecode/int/linear/bool-int.hpp /usr/include/gecode/int/sorted/propagate.hpp /usr/include/gecode/int/gcc.hh /usr/include/gecode/int/nvalues/bool-eq.hpp /usr/include/gecode/int/nvalues/bool-lq.hpp /usr/include/gecode/int/extensional.hh /usr/include/gecode/int/sorted.hh /usr/include/gecode/int/nvalues/int-eq.hpp /usr/include/gecode/int/arithmetic/divmod.hpp /usr/include/gecode/int/linear.hh /usr/include/gecode/int/dom.hh /usr/include/gecode/int/element/pair.hpp /usr/include/gecode/int/circuit.hh /usr/include/gecode/int/arithmetic/pow.hpp Gecode Gecode::Int Gecode::Int::Rel /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2003 * *Lastmodified: *$Date:2011-07-0811:58:02+0200(Fri,08Jul2011)$by$Author:schulte$ *$Revision:12163$ * *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{namespaceRel{ /* *Lexicalorderpropagator */ template<classView> inline LexLqLe<View>::LexLqLe(Homehome, ViewArray<View>&x0,ViewArray<View>&y0,bools) :Propagator(home),x(x0),y(y0),strict(s){ x.subscribe(home,*this,PC_INT_BND); y.subscribe(home,*this,PC_INT_BND); } template<classView> forceinline LexLqLe<View>::LexLqLe(Space&home,boolshare,LexLqLe<View>&p) :Propagator(home,share,p),strict(p.strict){ x.update(home,share,p.x); y.update(home,share,p.y); } template<classView> Actor* LexLqLe<View>::copy(Space&home,boolshare){ returnnew(home)LexLqLe<View>(home,share,*this); } template<classView> PropCost LexLqLe<View>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::linear(PropCost::LO,x.size()); } template<classView> forceinlinesize_t LexLqLe<View>::dispose(Space&home){ assert(!home.failed()); x.cancel(home,*this,PC_INT_BND); y.cancel(home,*this,PC_INT_BND); (void)Propagator::dispose(home); returnsizeof(*this); } template<classView> ExecStatus LexLqLe<View>::propagate(Space&home,constModEventDelta&){ /* *State1 * */ { inti=0; intn=x.size(); while((i<n)&&(x[i].min()==y[i].max())){ //case:=,>= GECODE_ME_CHECK(x[i].lq(home,y[i].max())); GECODE_ME_CHECK(y[i].gq(home,x[i].min())); i++; } if(i==n)//case:$ returnstrict?ES_FAILED:home.ES_SUBSUMED(*this); //Possiblecasesleft:<,<=,>(yieldsfailure),? GECODE_ME_CHECK(x[i].lq(home,y[i].max())); GECODE_ME_CHECK(y[i].gq(home,x[i].min())); if(x[i].max()<y[i].min())//case:<(aftertell) returnhome.ES_SUBSUMED(*this); //x[i]canneverbeequaltoy[i](otherwise:>=) assert(!(x[i].assigned()&&y[i].assigned()&& x[i].val()==y[i].val())); //Removeallelementsbetween0...i-1astheyareassignedandequal x.drop_fst(i);y.drop_fst(i); //Afterthis,executioncontinuesat[1] } /* *State2 *prefix:(?|<=) * */ { inti=1; intn=x.size(); while((i<n)&& (x[i].min()==y[i].max())&& (x[i].max()==y[i].min())){//case:= assert(x[i].assigned()&&y[i].assigned()&& (x[i].val()==y[i].val())); i++; } if(i==n){//case:$ if(strict) gotorewrite_le; else gotorewrite_lq; } if(x[i].max()<y[i].min())//case:< gotorewrite_lq; if(x[i].min()>y[i].max())//case:> gotorewrite_le; if(i>1){ //Removeequalelements[1...i-1],keepelement[0] x[i-1]=x[0];x.drop_fst(i-1); y[i-1]=y[0];y.drop_fst(i-1); } } if(x[1].max()<=y[1].min()){ //case:<=(invariant:not=,<) /* *State3 *prefix:(?|<=),<= * */ inti=2; intn=x.size(); while((i<n)&&(x[i].max()==y[i].min()))//case:<=,= i++; if(i==n){//case:$ if(strict) returnES_FIX; else gotorewrite_lq; } if(x[i].max()<y[i].min())//case:< gotorewrite_lq; if(x[i].min()>y[i].max()){//case:> //Eliminate[i]...[n-1] for(intj=i;j<n;j++){ x[j].cancel(home,*this,PC_INT_BND); y[j].cancel(home,*this,PC_INT_BND); } x.size(i);y.size(i); strict=true; } returnES_FIX; } if(x[1].min()>=y[1].max()){ //case:>=(invariant:not=,>) /* *State4 *prefix:(?|<=)>= * */ inti=2; intn=x.size(); while((i<n)&&(x[i].min()==y[i].max())) //case:>=,= i++; if(i==n){//case:$ if(strict) gotorewrite_le; else returnES_FIX; } if(x[i].min()>y[i].max())//case:> gotorewrite_le; if(x[i].max()<y[i].min()){//case:< //Eliminate[i]...[n-1] for(intj=i;j<n;j++){ x[j].cancel(home,*this,PC_INT_BND); y[j].cancel(home,*this,PC_INT_BND); } x.size(i);y.size(i); strict=false; } returnES_FIX; } returnES_FIX; rewrite_le: GECODE_REWRITE(*this,Le<View>::post(home(*this),x[0],y[0])); rewrite_lq: GECODE_REWRITE(*this,Lq<View>::post(home(*this),x[0],y[0])); } template<classView> ExecStatus LexLqLe<View>::post(Homehome, ViewArray<View>&x,ViewArray<View>&y,boolstrict){ if(x.size()<y.size()){ y.size(x.size());strict=false; }elseif(x.size()>y.size()){ x.size(y.size());strict=true; } if(x.size()==0) returnstrict?ES_FAILED:ES_OK; if(x.size()==1){ if(strict) returnLe<View>::post(home,x[0],y[0]); else returnLq<View>::post(home,x[0],y[0]); } (void)new(home)LexLqLe<View>(home,x,y,strict); returnES_OK; } /* *Lexicaldisequalitypropagator */ template<classView> forceinline LexNq<View>::LexNq(Homehome,ViewArray<View>&xv,ViewArray<View>&yv) :Propagator(home), x0(xv[xv.size()-2]),y0(yv[xv.size()-2]), x1(xv[xv.size()-1]),y1(yv[xv.size()-1]), x(xv),y(yv){ intn=x.size(); assert(n>1); assert(n==y.size()); x.size(n-2);y.size(n-2); x0.subscribe(home,*this,PC_INT_VAL);y0.subscribe(home,*this,PC_INT_VAL); x1.subscribe(home,*this,PC_INT_VAL);y1.subscribe(home,*this,PC_INT_VAL); } template<classView> PropCost LexNq<View>::cost(constSpace&,constModEventDelta&)const{ returnPropCost::binary(PropCost::HI); } template<classView> forceinline LexNq<View>::LexNq(Space&home,boolshare,LexNq<View>&p) :Propagator(home,share,p){ x0.update(home,share,p.x0);y0.update(home,share,p.y0); x1.update(home,share,p.x1);y1.update(home,share,p.y1); x.update(home,share,p.x);y.update(home,share,p.y); } template<classView> Actor* LexNq<View>::copy(Space&home,boolshare){ /* intn=x.size(); if(n>0){ //Eliminateallequalviewsandkeeponedisequalpair for(inti=n;i--;) switch(rtest_eq_bnd(x[i],y[i])){ caseRT_TRUE: //Eliminateequalpair n--;x[i]=x[n];y[i]=y[n]; break; caseRT_FALSE: //Justkeepasingledisequalpair n=1;x[0]=x[i];y[0]=y[i]; gotodone; caseRT_MAYBE: break; default: GECODE_NEVER; } done: x.size(n);y.size(n); } */ returnnew(home)LexNq<View>(home,share,*this); } template<classView> inlineExecStatus LexNq<View>::post(Homehome,ViewArray<View>&x,ViewArray<View>&y){ if(x.size()!=y.size()) returnES_OK; intn=x.size(); if(n>0){ //Eliminateallequalviews for(inti=n;i--;) switch(rtest_eq_bnd(x[i],y[i])){ caseRT_TRUE: //Eliminateequalpair n--;x[i]=x[n];y[i]=y[n]; break; caseRT_FALSE: returnES_OK; caseRT_MAYBE: if(same(x[i],y[i])){ //Eliminateequalpair n--;x[i]=x[n];y[i]=y[n]; } break; default: GECODE_NEVER; } x.size(n);y.size(n); } if(n==0) returnES_FAILED; if(n==1) returnNq<View>::post(home,x[0],y[0]); (void)new(home)LexNq(home,x,y); returnES_OK; } template<classView> forceinlinesize_t LexNq<View>::dispose(Space&home){ x0.cancel(home,*this,PC_INT_VAL);y0.cancel(home,*this,PC_INT_VAL); x1.cancel(home,*this,PC_INT_VAL);y1.cancel(home,*this,PC_INT_VAL); (void)Propagator::dispose(home); returnsizeof(*this); } template<classView> forceinlineExecStatus LexNq<View>::resubscribe(Space&home, RelTestrt,View&x0,View&y0,Viewx1,Viewy1){ if(rt==RT_TRUE){ assert(x0.assigned()&&y0.assigned()); assert(x0.val()==y0.val()); intn=x.size(); for(inti=n;i--;) switch(rtest_eq_bnd(x[i],y[i])){ caseRT_TRUE: //Eliminateequalpair n--;x[i]=x[n];y[i]=y[n]; break; caseRT_FALSE: returnhome.ES_SUBSUMED(*this); caseRT_MAYBE: //Movetox0,y0andsubscribe x0=x[i];y0=y[i]; n--;x[i]=x[n];y[i]=y[n]; x.size(n);y.size(n); x0.subscribe(home,*this,PC_INT_VAL,false); y0.subscribe(home,*this,PC_INT_VAL,false); returnES_FIX; default: GECODE_NEVER; } //Nomoreviewstosubscribetoleft GECODE_REWRITE(*this,Nq<View>::post(home,x1,y1)); } returnES_FIX; } template<classView> ExecStatus LexNq<View>::propagate(Space&home,constModEventDelta&){ RelTestrt0=rtest_eq_bnd(x0,y0); if(rt0==RT_FALSE) returnhome.ES_SUBSUMED(*this); RelTestrt1=rtest_eq_bnd(x1,y1); if(rt1==RT_FALSE) returnhome.ES_SUBSUMED(*this); GECODE_ES_CHECK(resubscribe(home,rt0,x0,y0,x1,y1)); GECODE_ES_CHECK(resubscribe(home,rt1,x1,y1,x0,y0)); returnES_FIX; } }}} //STATISTICS:int-prop