bnd.hpp /usr/include/gecode/int/distinct.hh /usr/include/gecode/int/nvalues/int-base.hpp /usr/include/gecode/int/gcc/post.hpp /usr/include/gecode/int/distinct.hh /usr/include/gecode/int/nvalues/int-gq.hpp /usr/include/gecode/int/nvalues/int-lq.hpp /usr/include/gecode/int/channel.hh /usr/include/gecode/int/nvalues.hh /usr/include/gecode/int/sorted/propagate.hpp /usr/include/gecode/int/gcc.hh /usr/include/gecode/int/sorted.hh /usr/include/gecode/int/nvalues/int-eq.hpp /usr/include/gecode/int/distinct/bnd.hpp /usr/include/gecode/int/circuit.hh Gecode::Int::Distinct::Rank Gecode::Int::Distinct::MaxIncIdx Gecode::Int::Distinct::MinIncIdx Gecode::Int::Distinct::MinInc Gecode::Int::Distinct::HallInfo Gecode Gecode::Int Gecode::Int::Distinct /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2003 * *Lastmodified: *$Date:2012-10-0803:57:23+0200(Mon,08Oct2012)$by$Author:tack$ *$Revision:13143$ * *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{namespaceDistinct{ template<classView> forceinline Bnd<View>::Bnd(Homehome,ViewArray<View>&x0) :Propagator(home),x(x0),y(home,x0){ //Bothxandyinitiallycontainthesamevariables //-xisusedforboundspropagation //-yisusedforperformingsingletonpropagation //Theycannotbesharedassingletonpropagationremoves //determinedvariablesstillrequiredforboundspropagation. y.subscribe(home,*this,PC_INT_BND); intmin=x[x.size()-1].min(),max=x[x.size()-1].max(); for(inti=x.size()-1;i--;){ min=std::min(min,x[i].min()); max=std::max(max,x[i].max()); } min_x=min;max_x=max; } template<classView> forceinlinesize_t Bnd<View>::dispose(Space&home){ y.cancel(home,*this,PC_INT_BND); (void)Propagator::dispose(home); returnsizeof(*this); } template<classView> forceinline Bnd<View>::Bnd(Space&home,boolshare,Bnd<View>&p) :Propagator(home,share,p),min_x(p.min_x),max_x(p.max_x){ x.update(home,share,p.x); y.update(home,share,p.y); } template<classView> Actor* Bnd<View>::copy(Space&home,boolshare){ returnnew(home)Bnd<View>(home,share,*this); } template<classView> PropCost Bnd<View>::cost(constSpace&,constModEventDelta&med)const{ if(View::me(med)==ME_INT_VAL) returnPropCost::linear(PropCost::LO,y.size()); else returnPropCost::quadratic(PropCost::LO,x.size()); } classRank{ public: intmin,max; }; template<classView> classMaxIncIdx{ protected: ViewArray<View>x; public: forceinline MaxIncIdx(constViewArray<View>&x0):x(x0){} forceinlinebool operator()(constinti,constintj){ returnx[i].max()<x[j].max(); } }; template<classView> classMinIncIdx{ protected: ViewArray<View>x; public: forceinline MinIncIdx(constViewArray<View>&x0):x(x0){} forceinlinebool operator()(constinti,constintj){ returnx[i].min()<x[j].min(); } }; template<classView> classMinInc{ public: forceinlinebool operator()(constView&x,constView&y){ returnx.min()<y.min(); } }; classHallInfo{ public: intbounds,t,d,h; }; forceinlinevoid pathset_t(HallInfohall[],intstart,intend,intto){ intk,l; for(l=start;(k=l)!=end;hall[k].t=to){ l=hall[k].t; } } forceinlinevoid pathset_h(HallInfohall[],intstart,intend,intto){ intk,l; for(l=start;(k=l)!=end;hall[k].h=to){ l=hall[k].h; } } forceinlineint pathmin_h(constHallInfohall[],inti){ while(hall[i].h<i) i=hall[i].h; returni; } forceinlineint pathmin_t(constHallInfohall[],inti){ while(hall[i].t<i) i=hall[i].t; returni; } forceinlineint pathmax_h(constHallInfohall[],inti){ while(hall[i].h>i) i=hall[i].h; returni; } forceinlineint pathmax_t(constHallInfohall[],inti){ while(hall[i].t>i) i=hall[i].t; returni; } template<classView> ExecStatus prop_bnd(Space&home,ViewArray<View>&x,int&min_x,int&max_x){ constintn=x.size(); Regionr(home); int*minsorted=r.alloc<int>(n); int*maxsorted=r.alloc<int>(n); unsignedintd=static_cast<unsignedint>(max_x-min_x)+1; if(d<static_cast<unsignedint>(n)) returnES_FAILED; if(d>2*static_cast<unsignedint>(n)){ for(inti=n;i--;) minsorted[i]=maxsorted[i]=i; MinIncIdx<View>min_inc(x); Support::quicksort<int,MinIncIdx<View>>(minsorted,n,min_inc); MaxIncIdx<View>max_inc(x); Support::quicksort<int,MaxIncIdx<View>>(maxsorted,n,max_inc); }else{ int*minbucket=r.alloc<int>(d); int*maxbucket=r.alloc<int>(d); for(unsignedinti=d;i--;) minbucket[i]=maxbucket[i]=0; for(inti=n;i--;){ minbucket[x[i].min()-min_x]++; maxbucket[x[i].max()-min_x]++; } intc_min=0,c_max=0; for(unsignedinti=0;i<d;i++){ intt_min=minbucket[i]; intt_max=maxbucket[i]; minbucket[i]=c_min;c_min+=t_min; maxbucket[i]=c_max;c_max+=t_max; } assert((c_min==n)&&(c_max==n)); for(inti=n;i--;){ minsorted[minbucket[x[i].min()-min_x]++]=i; maxsorted[maxbucket[x[i].max()-min_x]++]=i; } } //Updateminimumandmaximuminformation min_x=x[minsorted[0]].min(); max_x=x[maxsorted[n-1]].max(); //Setuprankandboundsinfo HallInfo*hall=r.alloc<HallInfo>(2*n+2); Rank*rank=r.alloc<Rank>(n); intnb=0; { intmin=x[minsorted[0]].min(); intmax=x[maxsorted[0]].max()+1; intlast=min-2; hall[0].bounds=last; inti=0; intj=0; while(true){ if((i<n)&&(min<max)){ if(min!=last) hall[++nb].bounds=last=min; rank[minsorted[i]].min=nb; if(++i<n) min=x[minsorted[i]].min(); }else{ if(max!=last) hall[++nb].bounds=last=max; rank[maxsorted[j]].max=nb; if(++j==n) break; max=x[maxsorted[j]].max()+1; } } hall[nb+1].bounds=hall[nb].bounds+2; } //Iftellscrossholes,wedonotcomputeafixpoint ExecStatuses=ES_FIX; //Propagatelowerbounds for(inti=nb+2;--i;){ hall[i].t=hall[i].h=i-1; hall[i].d=hall[i].bounds-hall[i-1].bounds; } for(inti=0;i<n;i++){//visitintervalsinincreasingmaxorder intx0=rank[maxsorted[i]].min; intz=pathmax_t(hall,x0+1); intj=hall[z].t; if(--hall[z].d==0) hall[z=pathmax_t(hall,hall[z].t=z+1)].t=j; pathset_t(hall,x0+1,z,z);//pathcompression inty=rank[maxsorted[i]].max; if(hall[z].d<hall[z].bounds-hall[y].bounds) returnES_FAILED; if(hall[x0].h>x0){ intw=pathmax_h(hall,hall[x0].h); intm=hall[w].bounds; ModEventme=x[maxsorted[i]].gq(home,m); if(me_failed(me)) returnES_FAILED; if((me==ME_INT_VAL)|| ((me==ME_INT_BND)&&(m!=x[maxsorted[i]].min()))) es=ES_NOFIX; pathset_h(hall,x0,w,w);//pathcompression } if(hall[z].d==hall[z].bounds-hall[y].bounds){ pathset_h(hall,hall[y].h,j-1,y);//markhallinterval hall[y].h=j-1; } } //Propagateupperbounds for(inti=nb+1;i--;){ hall[i].t=hall[i].h=i+1; hall[i].d=hall[i+1].bounds-hall[i].bounds; } for(inti=n;--i>=0;){//visitintervalsindecreasingminorder intx0=rank[minsorted[i]].max; intz=pathmin_t(hall,x0-1); intj=hall[z].t; if(--hall[z].d==0) hall[z=pathmin_t(hall,hall[z].t=z-1)].t=j; pathset_t(hall,x0-1,z,z); inty=rank[minsorted[i]].min; if(hall[z].d<hall[y].bounds-hall[z].bounds) returnES_FAILED; if(hall[x0].h<x0){ intw=pathmin_h(hall,hall[x0].h); intm=hall[w].bounds-1; ModEventme=x[minsorted[i]].lq(home,m); if(me_failed(me)) returnES_FAILED; if((me==ME_INT_VAL)|| ((me==ME_INT_BND)&&(m!=x[maxsorted[i]].min()))) es=ES_NOFIX; pathset_h(hall,x0,w,w); } if(hall[z].d==hall[y].bounds-hall[z].bounds){ pathset_h(hall,hall[y].h,j+1,y); hall[y].h=j+1; } } returnes; } template<classView> ExecStatus prop_bnd(Space&home,ViewArray<View>&x){ intmin=x[x.size()-1].min(),max=x[x.size()-1].max(); for(inti=x.size()-1;i--;){ min=std::min(min,x[i].min()); max=std::max(max,x[i].max()); } returnprop_bnd(home,x,min,max); } template<classView> ExecStatus Bnd<View>::propagate(Space&home,constModEventDelta&med){ assert(x.size()>1); if(View::me(med)==ME_INT_VAL){ ExecStatuses=prop_val<View,false>(home,y); GECODE_ES_CHECK(es); if(y.size()<2) returnhome.ES_SUBSUMED(*this); if(es==ES_FIX) returnhome.ES_FIX_PARTIAL(*this,View::med(ME_INT_BND)); } if(y.size()==2) GECODE_REWRITE(*this,Rel::Nq<View>::post(home(*this),y[0],y[1])); ExecStatuses=prop_bnd<View>(home,x,min_x,max_x); GECODE_ES_CHECK(es); if(es==ES_NOFIX&&View::me(modeventdelta())==ME_INT_VAL) returnes; constintn=x.size(); if((n>2*y.size())&&(n>6)){ //Iftherearemanyassignedviews,trytoeliminatethem unsignedintd=static_cast<unsignedint>(max_x-min_x)+1; if(d>2*static_cast<unsignedint>(n)){ MinInc<View>min_inc; Support::quicksort<View,MinInc<View>>(&x[0],n,min_inc); }else{ Regionr(home); int*minbucket=r.alloc<int>(d); View*minsorted=r.alloc<View>(n); for(unsignedinti=d;i--;) minbucket[i]=0; for(inti=n;i--;) minbucket[x[i].min()-min_x]++; intc_min=0; for(unsignedinti=0;i<d;i++){ intt_min=minbucket[i]; minbucket[i]=c_min;c_min+=t_min; } assert(c_min==n); for(inti=n;i--;) minsorted[minbucket[x[i].min()-min_x]++]=x[i]; for(inti=n;i--;) x[i]=minsorted[i]; } inti=0; intj=0; intmax=x[0].max()-1; while(i<n-1){ if(!x[i].assigned()|| (x[i].val()<=max)||(x[i].val()>x[i+1].min())){ //Keepviewx[i] max=std::max(max,x[i].max()); x[j++]=x[i]; } i++; } if(!x[i].assigned()||(x[i].val()<=max)) x[j++]=x[i]; x.size(j); } if(x.size()<2) returnhome.ES_SUBSUMED(*this); if(x.size()==2) GECODE_REWRITE(*this,Rel::Nq<View>::post(home(*this),x[0],x[1])); returnes; } template<classView> ExecStatus Bnd<View>::post(Homehome,ViewArray<View>&x){ if(x.size()==2) returnRel::Nq<View>::post(home,x[0],x[1]); if(x.size()>2) (void)new(home)Bnd<View>(home,x); returnES_OK; } }}} //STATISTICS:int-prop