narrowing.hpp /usr/include/gecode/int/sorted.hh /usr/include/gecode/int/sorted.hh /usr/include/gecode/int/sorted/narrowing.hpp Gecode Gecode::Int Gecode::Int::Sorted /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *PatrickPekczynski<pekczynski@ps.uni-sb.de> * *Copyright: *PatrickPekczynski,2004 * *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{namespaceSorted{ template<classView> inlinevoid computesccs(Space&home,ViewArray<View>&x,ViewArray<View>&y, intphi[],SccComponentsinfo[],intscclist[]){ //numberofsccsisboundedbyxs(numberofx-nodes) intxs=x.size(); Regionr(home); Support::StaticStack<int,Region>cs(r,xs); //selectanynodefromthegraph for(intj=0;j<xs;j++){ intyjmin=y[j].min();//theprocessedmin while(!cs.empty()&&x[phi[sinfo[cs.top()].rightmost]].max()<yjmin){ //thetopmostscccannot"reach"y_joranodetotherightofit cs.pop(); } //acomponenthastheformC(y-Node,matchingx-Node) //Cisaminimalsccintheorientedintersectiongraph //weonlystorey_j-Node,since\phi(j)givesthematchingX-node inti=phi[j]; intximin=x[i].min(); while(!cs.empty()&&ximin<=y[sinfo[cs.top()].rightmost].max()){ //y_jcan"reach"cs.top(), //i.e.componentccanreachcomponentcs.top() //mergecandcs.top()intonewcomponent inttop=cs.top(); //connecting sinfo[sinfo[j].leftmost].left=top; sinfo[top].right=sinfo[j].leftmost; //movingleftmost sinfo[j].leftmost=sinfo[top].leftmost; //movingrightmost sinfo[sinfo[top].leftmost].rightmost=j; cs.pop(); } cs.push(j); } cs.reset(); //nowwemarkallcomponentswiththerespectivescc-number //labelingisboundbyO(k)whichisboundbyO(n) for(inti=0;i<xs;i++){ if(sinfo[i].left==i){//onlylabelvariablesinsccs intscc=sinfo[i].rightmost; intz=i; //boundbythesizeofthelargestscc=k while(sinfo[z].right!=z){ sinfo[z].rightmost=scc; scclist[phi[z]]=scc; z=sinfo[z].right; } sinfo[z].rightmost=scc; scclist[phi[z]]=scc; } } } template<classView,boolPerm> inlinebool narrow_domx(Space&home, ViewArray<View>&x, ViewArray<View>&y, ViewArray<View>&z, inttau[], int[], intscclist[], SccComponentsinfo[], bool&nofix){ intxs=x.size(); //Foreveryxnode for(inti=0;i<xs;i++){ intxmin=x[i].min(); /* *takethescc-listforthecurrentxnode *startfromtheleftmostreachableynodeofthescc *andcheckwhichYnodeinthesccis *reallytherightmostnodeintersectingx,i.e. *searchforthegreatestlowerboundofx */ intstart=sinfo[scclist[i]].leftmost; while(y[start].max()<xmin){ start=sinfo[start].right; } if(Perm){ //startistheleftmost-positionforx_i //thatdenotesthelowerboundonp_i ModEventme_plb=z[i].gq(home,start); if(me_failed(me_plb)){ returnfalse; } nofix|=(me_modified(me_plb)&&start!=z[i].min()); } ModEventme_lb=x[i].gq(home,y[start].min()); if(me_failed(me_lb)){ returnfalse; } nofix|=(me_modified(me_lb)&& y[start].min()!=x[i].min()); intptau=tau[xs-1-i]; intxmax=x[ptau].max(); /* *takethescc-listforthecurrentxnode *startfromtherightmostreachablenodeandcheckwhich *ynodeinthesccis *reallytherightmostnodeintersectingx,i.e. *searchforthesmallestupperboundofx */ start=sinfo[scclist[ptau]].rightmost; while(y[start].min()>xmax){ start=sinfo[start].left; } if(Perm){ //startistherightmost-positionforx_i //thatdenotestheupperboundonp_i ModEventme_pub=z[ptau].lq(home,start); if(me_failed(me_pub)){ returnfalse; } nofix|=(me_modified(me_pub)&&start!=z[ptau].max()); } ModEventme_ub=x[ptau].lq(home,y[start].max()); if(me_failed(me_ub)){ returnfalse; } nofix|=(me_modified(me_ub)&& y[start].max()!=x[ptau].max()); } returntrue; } template<classView> inlinebool narrow_domy(Space&home, ViewArray<View>&x,ViewArray<View>&y, intphi[],intphiprime[],bool&nofix){ for(inti=x.size();i--;){ ModEventme_lb=y[i].gq(home,x[phiprime[i]].min()); if(me_failed(me_lb)){ returnfalse; } nofix|=(me_modified(me_lb)&& x[phiprime[i]].min()!=y[i].min()); ModEventme_ub=y[i].lq(home,x[phi[i]].max()); if(me_failed(me_ub)){ returnfalse; } nofix|=(me_modified(me_ub)&& x[phi[i]].max()!=y[i].max()); } returntrue; } }}} //STATISTICS:int-prop