tree.hpp algorithm /usr/include/gecode/int/unary.hh /usr/include/gecode/int/unary/tree.hpp algorithm /usr/include/gecode/int/cumulative.hh /usr/include/gecode/int/unary.hh /usr/include/gecode/int/unary/tree.hpp Gecode Gecode::Int Gecode::Int::Unary /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> * *Copyright: *ChristianSchulte,2009 * *Lastmodified: *$Date:2011-05-2516:56:41+0200(Wed,25May2011)$by$Author:schulte$ *$Revision:12022$ * *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{namespaceUnary{ /* *Omegatree */ forceinlinevoid OmegaNode::init(constOmegaNode&,constOmegaNode&){ p=0;ect=-Int::Limits::infinity; } forceinlinevoid OmegaNode::update(constOmegaNode&l,constOmegaNode&r){ p=l.p+r.p; ect=std::max(plus(l.ect,r.p),r.ect); } template<classTaskView> OmegaTree<TaskView>::OmegaTree(Region&r,constTaskViewArray<TaskView>&t) :TaskTree<TaskView,OmegaNode>(r,t){ for(inti=tasks.size();i--;){ leaf(i).p=0;leaf(i).ect=-Int::Limits::infinity; } init(); } template<classTaskView> forceinlinevoid OmegaTree<TaskView>::insert(inti){ leaf(i).p=tasks[i].pmin(); leaf(i).ect=tasks[i].est()+tasks[i].pmin(); update(i); } template<classTaskView> forceinlinevoid OmegaTree<TaskView>::remove(inti){ leaf(i).p=0;leaf(i).ect=-Int::Limits::infinity; update(i); } template<classTaskView> forceinlineint OmegaTree<TaskView>::ect(void)const{ returnroot().ect; } template<classTaskView> forceinlineint OmegaTree<TaskView>::ect(inti)const{ //Checkwhethertaskiisin? OmegaTree<TaskView>&o=const_cast<OmegaTree<TaskView>&>(*this); if(o.leaf(i).ect!=-Int::Limits::infinity){ o.remove(i); intect=o.root().ect; o.insert(i); returnect; }else{ returnroot().ect; } } /* *Omelambdatree */ forceinlinevoid OmegaLambdaNode::init(constOmegaLambdaNode&l,constOmegaLambdaNode&r){ OmegaNode::init(l,r); lp=p;lect=ect;resEct=undef;resLp=undef; } forceinlinevoid OmegaLambdaNode::update(constOmegaLambdaNode&l,constOmegaLambdaNode&r){ OmegaNode::update(l,r); if(l.lp+r.p>l.p+r.lp){ resLp=l.resLp; lp=l.lp+r.p; }else{ resLp=r.resLp; lp=l.p+r.lp; } if((r.lect>=plus(l.ect,r.lp))&&(r.lect>=plus(l.lect,r.p))){ lect=r.lect;resEct=r.resEct; }elseif(plus(l.ect,r.lp)>=plus(l.lect,r.p)){ assert(plus(l.ect,r.lp)>r.lect); lect=plus(l.ect,r.lp);resEct=r.resLp; }else{ assert((plus(l.lect,r.p)>r.lect)&& (plus(l.lect,r.p)>plus(l.ect,r.lp))); lect=plus(l.lect,r.p);resEct=l.resEct; } } template<classTaskView> OmegaLambdaTree<TaskView>::OmegaLambdaTree(Region&r, constTaskViewArray<TaskView>&t, boolinc) :TaskTree<TaskView,OmegaLambdaNode>(r,t){ if(inc){ //Enteralltasksintotree(omega=alltasks,lambda=empty) for(inti=tasks.size();i--;){ leaf(i).p=leaf(i).lp=tasks[i].pmin(); leaf(i).ect=leaf(i).lect=tasks[i].est()+tasks[i].pmin(); leaf(i).resEct=OmegaLambdaNode::undef; leaf(i).resLp=OmegaLambdaNode::undef; } update(); }else{ //Enternotasksintotree(omega=empty,lambda=empty) for(inti=tasks.size();i--;){ leaf(i).p=leaf(i).lp=0; leaf(i).ect=leaf(i).lect=-Int::Limits::infinity; leaf(i).resEct=OmegaLambdaNode::undef; leaf(i).resLp=OmegaLambdaNode::undef; } init(); } } template<classTaskView> forceinlinevoid OmegaLambdaTree<TaskView>::shift(inti){ //Thatmeansthatiisinomega assert(leaf(i).ect>-Int::Limits::infinity); leaf(i).p=0; leaf(i).ect=-Int::Limits::infinity; leaf(i).resEct=i; leaf(i).resLp=i; update(i); } template<classTaskView> forceinlinevoid OmegaLambdaTree<TaskView>::oinsert(inti){ leaf(i).p=tasks[i].pmin(); leaf(i).ect=tasks[i].est()+tasks[i].pmin(); update(i); } template<classTaskView> forceinlinevoid OmegaLambdaTree<TaskView>::linsert(inti){ leaf(i).lp=tasks[i].pmin(); leaf(i).lect=tasks[i].est()+tasks[i].pmin(); leaf(i).resEct=i; leaf(i).resLp=i; update(i); } template<classTaskView> forceinlinevoid OmegaLambdaTree<TaskView>::lremove(inti){ leaf(i).lp=0; leaf(i).lect=-Int::Limits::infinity; leaf(i).resEct=OmegaLambdaNode::undef; leaf(i).resLp=OmegaLambdaNode::undef; update(i); } template<classTaskView> forceinlinebool OmegaLambdaTree<TaskView>::lempty(void)const{ returnroot().resEct<0; } template<classTaskView> forceinlineint OmegaLambdaTree<TaskView>::responsible(void)const{ returnroot().resEct; } template<classTaskView> forceinlineint OmegaLambdaTree<TaskView>::ect(void)const{ returnroot().ect; } template<classTaskView> forceinlineint OmegaLambdaTree<TaskView>::lect(void)const{ returnroot().lect; } }}} //STATISTICS:int-prop