tree.hpp /usr/include/gecode/int/task.hh /usr/include/gecode/int/task/tree.hpp /usr/include/gecode/int/cumulative.hh /usr/include/gecode/int/unary.hh /usr/include/gecode/int/task.hh Gecode Gecode::Int /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *ChristianSchulte<schulte@gecode.org> *GuidoTack<tack@gecode.org> * *Copyright: *ChristianSchulte,2009 *GuidoTack,2010 * *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. * */ namespaceGecode{namespaceInt{ forceinlineint plus(intx,inty){ assert(y!=-Int::Limits::infinity); return(x==-Int::Limits::infinity)?x:x+y; } forceinlinelonglongint plus(longlongintx,longlonginty){ assert(y!=-Int::Limits::llinfinity); return(x==-Int::Limits::llinfinity)?x:x+y; } template<classTaskView,classNode> forceinlineint TaskTree<TaskView,Node>::n_inner(void)const{ returntasks.size()-1; } template<classTaskView,classNode> forceinlineint TaskTree<TaskView,Node>::n_nodes(void)const{ return2*tasks.size()-1; } template<classTaskView,classNode> forceinlinebool TaskTree<TaskView,Node>::n_root(inti){ returni==0; } template<classTaskView,classNode> forceinlinebool TaskTree<TaskView,Node>::n_leaf(inti)const{ returni>=n_inner(); } template<classTaskView,classNode> forceinlineint TaskTree<TaskView,Node>::n_left(inti){ return2*(i+1)-1; } template<classTaskView,classNode> forceinlinebool TaskTree<TaskView,Node>::left(inti){ assert(!n_root(i)); //Aleftnodehasanoddnumber return(i&1)!=0; } template<classTaskView,classNode> forceinlineint TaskTree<TaskView,Node>::n_right(inti){ return2*(i+1); } template<classTaskView,classNode> forceinlinebool TaskTree<TaskView,Node>::right(inti){ assert(!n_root(i)); //Aleftnodehasanevennumber return(i&1)==0; } template<classTaskView,classNode> forceinlineint TaskTree<TaskView,Node>::n_parent(inti){ return(i+1)/2-1; } template<classTaskView,classNode> forceinlineNode& TaskTree<TaskView,Node>::leaf(inti){ returnnode[_leaf[i]]; } template<classTaskView,classNode> forceinlineconstNode& TaskTree<TaskView,Node>::root(void)const{ returnnode[0]; } template<classTaskView,classNode> forceinlinevoid TaskTree<TaskView,Node>::init(void){ for(inti=n_inner();i--;) node[i].init(node[n_left(i)],node[n_right(i)]); } template<classTaskView,classNode> forceinlinevoid TaskTree<TaskView,Node>::update(void){ for(inti=n_inner();i--;) node[i].update(node[n_left(i)],node[n_right(i)]); } template<classTaskView,classNode> forceinlinevoid TaskTree<TaskView,Node>::update(inti,booll){ if(l) i=_leaf[i]; assert(!n_root(i)); do{ i=n_parent(i); node[i].update(node[n_left(i)],node[n_right(i)]); }while(!n_root(i)); } template<classTaskView,classNode> forceinline TaskTree<TaskView,Node>::TaskTree(Region&r, constTaskViewArray<TaskView>&t) :tasks(t), node(r.alloc<Node>(n_nodes())), _leaf(r.alloc<int>(tasks.size())){ //Computeasortingmaptoorderbynondecreasingest int*map=r.alloc<int>(tasks.size()); sort<TaskView,STO_EST,true>(map,tasks); //Computeinverseofsortingmap for(inti=tasks.size();i--;) _leaf[map[i]]=i; r.free<int>(map,tasks.size()); //Computeindexoffirstleafintree:thenextlargerpoweroftwo intfst=1; while(fst<tasks.size()) fst<<=1; fst--; //Remaptaskindicestoleafindices for(inti=tasks.size();i--;) if(_leaf[i]+fst>=n_nodes()) _leaf[i]+=fst-tasks.size(); else _leaf[i]+=fst; } template<classTaskView,classNode>template<classNode2> forceinline TaskTree<TaskView,Node>::TaskTree(Region&r, constTaskTree<TaskView,Node2>&t) :tasks(t.tasks), node(r.alloc<Node>(n_nodes())), _leaf(r.alloc<int>(tasks.size())){ for(inti=tasks.size();i--;) _leaf[i]=t._leaf[i]; } }} //STATISTICS:int-prop