order.hpp /usr/include/gecode/int/sorted.hh /usr/include/gecode/int/sorted/order.hpp /usr/include/gecode/int/sorted.hh 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,boolPerm> inlinevoid sort_sigma(Space&home,ViewArray<View>&x,ViewArray<View>&z){ if(Perm){ Regionr(home); ViewPair<View>*xz=r.alloc<ViewPair<View>>(x.size()); for(inti=x.size();i--;){ xz[i].x=x[i];xz[i].z=z[i]; } TupleMinIncExt<View>min_inc; Support::quicksort<ViewPair<View>,TupleMinIncExt<View>> (&xz[0],x.size(),min_inc); for(inti=x.size();i--;){ x[i]=xz[i].x;z[i]=xz[i].z; } }else{ TupleMinInc<View>min_inc; Support::quicksort<View,TupleMinInc<View>>(&x[0],x.size(),min_inc); } } template<classView,boolPerm> inlinevoid sort_tau(ViewArray<View>&x,ViewArray<View>&z,inttau[]){ if(Perm){ TupleMaxIncExt<View>ltmax(x,z); Support::quicksort(&(*tau),x.size(),ltmax); }else{ TupleMaxInc<View>ltmax(x); Support::quicksort(&(*tau),x.size(),ltmax); } } template<classView> inlinebool normalize(Space&home, ViewArray<View>&y, ViewArray<View>&x, bool&nofix){ intys=y.size(); for(inti=1;i<ys;i++){ ModEventme_lb=y[i].gq(home,y[i-1].min()); if(me_failed(me_lb)) returnfalse; nofix|=(me_modified(me_lb)&&y[i-1].min()!=y[i].min()); } for(inti=ys-1;i--;){ ModEventme_ub=y[i].lq(home,y[i+1].max()); if(me_failed(me_ub)) returnfalse; nofix|=(me_modified(me_ub)&&y[i+1].max()!=y[i].max()); } intxs=x.size(); for(inti=xs;i--;){ ModEventme=x[i].gq(home,y[0].min()); if(me_failed(me)) returnfalse; nofix|=(me_modified(me)&&x[i].min()!=y[0].min()); me=x[i].lq(home,y[xs-1].max()); if(me_failed(me)) returnfalse; nofix|=(me_modified(me)&&x[i].max()!=y[xs-1].max()); } returntrue; } template<classView> inlinebool perm_bc(Space&home,inttau[], SccComponentsinfo[], intscclist[], ViewArray<View>&x, ViewArray<View>&z, bool&crossingedge, bool&nofix){ intps=x.size(); for(inti=1;i<ps;i++){ //ifthereare"crossededges" if(x[i-1].min()<x[i].min()){ if(z[i-1].min()>z[i].min()){ if(z[i].min()!=sinfo[scclist[i]].leftmost){ //edgedoesnottakepartinsolution if(z[i].assigned()){//vitaledgedonotremoveit if(x[i-1].max()<x[i].min()){ //invalidpermutation //theupperboundsortingcannotfixthis returnfalse; } }else{ crossingedge=true; //andthepermutationcanstillbechanged //fixthepermutation,i.e.modifyz ModEventme_z=z[i].gq(home,z[i-1].min()); if(me_failed(me_z)){ returnfalse; } nofix|=(me_modified(me_z)&& z[i-1].min()!=z[i].min()); } } } } } //thesamecheckasabovefortheupperbounds for(inti=ps-1;i--;){ if(x[tau[i]].max()<x[tau[i+1]].max()){ if(z[tau[i]].max()>z[tau[i+1]].max()){ if(z[tau[i]].max()!=sinfo[scclist[tau[i]]].rightmost){ //edgedoesnottakepartinsolution if(z[tau[i]].assigned()){ if(x[tau[i+1]].min()>x[tau[i]].max()){ //invalidpermutation returnfalse; } }else{ crossingedge=true; ModEventme_z=z[tau[i]].lq(home,z[tau[i+1]].max()); if(me_failed(me_z)){ returnfalse; } nofix|=(me_modified(me_z)&& z[tau[i+1]].max()!=z[tau[i]].max()); } } } } } returntrue; } }}} //STATISTICS:int-prop