basic.hpp /usr/include/gecode/int/cumulative.hh /usr/include/gecode/int/cumulative.hh /usr/include/gecode/int/cumulative/basic.hpp Gecode::Int::Cumulative::Event Gecode::Int::Cumulative::TaskByDecCap 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> * *Copyright: *ChristianSchulte,2010 *GuidoTack,2010 * *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{namespaceCumulative{ classEvent{ public: enumType{ LRT=0, LCT=1, EST=2, ZRO=3, ERT=4, END=5 }; Typee; intt; inti; voidinit(Typee,intt,inti); booloperator <(constEvent&e)const; }; template<classTask> classTaskByDecCap{ public: booloperator ()(constTask&t1,constTask&t2)const; }; forceinlinevoid Event::init(Event::Typee0,intt0,inti0){ e=e0;t=t0;i=i0; } forceinlinebool Event::operator <(constEvent&e)const{ if(this->t==e.t) returnthis->e<e.e; returnthis->t<e.t; } template<classTask> forceinlinebool TaskByDecCap<Task>::operator ()(constTask&t1,constTask&t2)const{ returnt1.c()>t2.c(); } //Basicpropagation template<classTask,classCap> ExecStatus basic(Space&home,bool&subsumed,Capc,TaskArray<Task>&t){ subsumed=false; intccur=c.max(); intcmax=ccur; intcmin=ccur; //Sorttasksbydecreasingcapacity TaskByDecCap<Task>tbdc; Support::quicksort(&t[0],t.size(),tbdc); Regionr(home); Event*e=r.alloc<Event>(4*t.size()+1); //Initializeevents boolassigned=true; { boolrequired=false; intn=0; for(inti=t.size();i--;) if(t[i].assigned()){ //Onlyaddrequiredpart if(t[i].pmin()>0){ required=true; e[n++].init(Event::ERT,t[i].lst(),i); e[n++].init(Event::LRT,t[i].ect(),i); }elseif(t[i].pmax()==0){ required=true; e[n++].init(Event::ZRO,t[i].lst(),i); } }else{ assigned=false; e[n++].init(Event::EST,t[i].est(),i); e[n++].init(Event::LCT,t[i].lct(),i); //Checkwhethertaskhasrequiredpart if(t[i].lst()<t[i].ect()){ required=true; e[n++].init(Event::ERT,t[i].lst(),i); e[n++].init(Event::LRT,t[i].ect(),i); } } //Checkwhethernotaskhasarequiredpart if(!required){ subsumed=assigned; returnES_FIX; } //Writeendmarker e[n++].init(Event::END,Int::Limits::infinity,-1); //Sortevents Support::quicksort(e,n); } //Setofcurrentbutnotrequiredtasks Support::BitSet<Region>tasks(r,static_cast<unsignedint>(t.size())); //Processevents,useccurasthecapacitythatisstillfree while(e->e!=Event::END){ //Currenttime inttime=e->t; //Processeventsforcompletionofrequiredpart for(;(e->t==time)&&(e->e==Event::LRT);e++) if(t[e->i].mandatory()){ tasks.set(static_cast<unsignedint>(e->i));ccur+=t[e->i].c(); } //Processeventsforcompletionoftask for(;(e->t==time)&&(e->e==Event::LCT);e++) tasks.clear(static_cast<unsignedint>(e->i)); //Processeventsforstartoftask for(;(e->t==time)&&(e->e==Event::EST);e++) tasks.set(static_cast<unsignedint>(e->i)); //Processeventsforzero-lengthtask for(;(e->t==time)&&(e->e==Event::ZRO);e++){ ccur-=t[e->i].c(); if(ccur<cmin)cmin=ccur; if(ccur<0) returnES_FAILED; ccur+=t[e->i].c(); } //norunstarttimefor0-lengthtasks intzltime=time; //Processeventsforstartofrequiredpart for(;(e->t==time)&&(e->e==Event::ERT);e++) if(t[e->i].mandatory()){ tasks.clear(static_cast<unsignedint>(e->i)); ccur-=t[e->i].c(); if(ccur<cmin)cmin=ccur; zltime=time+1; if(ccur<0) returnES_FAILED; }elseif(t[e->i].optional()&&(t[e->i].c()>ccur)){ GECODE_ME_CHECK(t[e->i].excluded(home)); } //Exploitthattasksaresortedaccordingtocapacity for(Iter::Values::BitSet<Support::BitSet<Region>>j(tasks); j()&&(t[j.val()].c()>ccur);++j) //Taskjcannotrunfromtimetonexttime-1 if(t[j.val()].mandatory()){ if(t[j.val()].pmin()>0){ GECODE_ME_CHECK(t[j.val()].norun(home,time,e->t-1)); }else{ GECODE_ME_CHECK(t[j.val()].norun(home,zltime,e->t-1)); } } } GECODE_ME_CHECK(c.gq(home,cmax-cmin)); subsumed=assigned; returnES_NOFIX; } }}} //STATISTICS:int-prop