edge-finding.hpp algorithm /usr/include/gecode/int/cumulative.hh /usr/include/gecode/int/cumulative/edge-finding.hpp algorithm /usr/include/gecode/int/cumulative.hh /usr/include/gecode/int/cumulative/edge-finding.hpp Gecode::Int::Cumulative::StoCap Gecode::Int::Cumulative::PrecOrder Gecode Gecode::Int Gecode::Int::Cumulative /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> *GuidoTack<tack@gecode.org> * *Contributingauthors: *JosephScott<joseph.scott@it.uu.se> * *Copyright: *ChristianSchulte,2009 *GuidoTack,2010 *JosephScott,2011 * *Lastmodified: *$Date:2013-03-1106:26:07+0100(Mon,11Mar2013)$by$Author:tack$ *$Revision:13487$ * *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. * */ #include<algorithm> namespaceGecode{namespaceInt{namespaceCumulative{ template<classTaskView,boolinc> classStoCap{ public: booloperator ()(constTaskView&t1,constTaskView&t2)const{ returninc?(t1.c()<t2.c()):(t2.c()<t1.c()); } }; classPrecOrder{ public: int*prec; PrecOrder(int*prec0):prec(prec0){} booloperator ()(inti,intj)const{ returnprec[i]>prec[j]; } }; template<classTaskView> forceinlineExecStatus edgefinding(Space&home,intc,TaskViewArray<TaskView>&t){ sort<TaskView,STO_LCT,false>(t); Regionr(home); //Detection int*prec=r.alloc<int>(t.size()); for(inti=t.size();i--;) prec[i]=t[i].ect(); OmegaLambdaTree<TaskView>ol(r,c,t); for(intj=0;j<t.size();j++){ while(!ol.lempty()&& (ol.lenv()>static_cast<longlongint>(c)*t[j].lct())){ inti=ol.responsible(); prec[i]=std::max(prec[i],t[j].lct()); ol.lremove(i); } ol.shift(j); } //Propagation //Computearrayofuniquecapacitiesandamapping //fromthetaskarraytothecorrespondingentryin //thecapacityarray int*cap=r.alloc<int>(t.size()); for(inti=t.size();i--;) cap[i]=i; SortMap<TaskView,StoCap,true>o(t); Support::quicksort(cap,t.size(),o); int*capacities=r.alloc<int>(t.size()); int*capInv=r.alloc<int>(t.size()); for(inti=t.size();i--;){ capacities[cap[i]]=t[i].c(); capInv[cap[i]]=i; } intn_c=0; for(inti=0,cur_c=INT_MIN;i<t.size();i++){ if(capacities[i]!=cur_c) capacities[n_c++]=cur_c=capacities[i]; cap[capInv[i]]=n_c-1; } r.free<int>(capInv,t.size()); //ComputeupdatevaluesforeachcapacityandLCut int*update=r.alloc<int>(t.size()*n_c); for(inti=t.size()*n_c;i--;) update[i]=-Int::Limits::infinity; ExtOmegaTree<TaskView>eo(r,c,ol); for(inti=0;i<n_c;i++){ eo.init(capacities[i]); intu=-Int::Limits::infinity; for(intj=t.size();j--;){ longlongintlctj= static_cast<longlongint>(c-capacities[i])*t[j].lct(); longlonginteml=plus(eo.env(j),-lctj); longlongintdiff_l; if(eml==-Limits::llinfinity) diff_l=-Limits::llinfinity; else diff_l=ceil_div_xx(eml, static_cast<longlongint>(capacities[i])); intdiff=(diff_l<=-Limits::infinity)? -Limits::infinity:static_cast<int>(diff_l); u=std::max(u,diff); update[i*t.size()+j]=u; } } //Updateestbyiteratinginparallelovertheprecarray //andthetaskarray,bothsortedbylct int*precMap=r.alloc<int>(t.size()); for(inti=t.size();i--;) precMap[i]=i; PrecOrderpo(prec); Support::quicksort(precMap,t.size(),po); intcurJ=0; for(inti=0;i<t.size();i++){ //discardanycurJwithlct>prec[i]: while(curJ<t.size()&&t[curJ].lct()>prec[precMap[i]]) curJ++; if(curJ>=t.size()) break; //iflct[curJ]==prec[i],thenLCut(T,j)<=i,soupdateest[i] intlocJ=curJ; do{ if(t[locJ].lct()!=t[precMap[i]].lct()){ GECODE_ME_CHECK(t[precMap[i]].est(home,update[cap[precMap[i]]*t.size()+locJ])); break; } }while(t[locJ].lct()==prec[precMap[i]]&&locJ++<t.size()-1); } returnES_OK; } template<classTask> ExecStatus edgefinding(Space&home,intc,TaskArray<Task>&t){ TaskViewArray<typename TaskTraits<Task>::TaskViewFwd>f(t); GECODE_ES_CHECK(edgefinding(home,c,f)); TaskViewArray<typename TaskTraits<Task>::TaskViewBwd>b(t); GECODE_ES_CHECK(edgefinding(home,c,b)); returnES_OK; } }}} //STATISTICS:int-prop