node.hpp /usr/include/gecode/gist/visualnode.hh /usr/include/gecode/gist/mainwindow.hh /usr/include/gecode/gist/nodecursor.hh /usr/include/gecode/gist/visualnode.hh /usr/include/gecode/gist/qtgist.hh /usr/include/gecode/gist/node.hpp /usr/include/gecode/gist/treecanvas.hh /usr/include/gecode/gist/nodestats.hh /usr/include/gecode/gist/nodewidget.hh /usr/include/gecode/gist/layoutcursor.hh /usr/include/gecode/gist/drawingcursor.hh Gecode Gecode::Gist /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *GuidoTack<tack@gecode.org> * *Copyright: *GuidoTack,2006 * *Lastmodified: *$Date:2013-05-0609:02:17+0200(Mon,06May2013)$by$Author:tack$ *$Revision:13613$ * *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{namespaceGist{ template<classT> void NodeAllocatorBase<T>::allocate(void){ cur_b++; cur_t=0; if(cur_b==n){ intoldn=n; n=static_cast<int>(n*1.5+1.0); b=heap.realloc<Block*>(b,oldn,n); } b[cur_b]=static_cast<Block*>(heap.ralloc(sizeof(Block))); } template<classT> NodeAllocatorBase<T>::NodeAllocatorBase(boolbab) :_bab(bab){ b=heap.alloc<Block*>(10); n=10; cur_b=-1; cur_t=NodeBlockSize-1; } template<classT> NodeAllocatorBase<T>::~NodeAllocatorBase(void){ for(inti=cur_b+1;i--;) heap.rfree(b[i]); heap.free<Block*>(b,n); } template<classT> forceinlineint NodeAllocatorBase<T>::allocate(intp){ cur_t++; if(cur_t==NodeBlockSize) allocate(); new(&b[cur_b]->b[cur_t])T(p); b[cur_b]->best[cur_t]=-1; returncur_b*NodeBlockSize+cur_t; } template<classT> forceinlineint NodeAllocatorBase<T>::allocate(Space*root){ cur_t++; if(cur_t==NodeBlockSize) allocate(); new(&b[cur_b]->b[cur_t])T(root); b[cur_b]->best[cur_t]=-1; returncur_b*NodeBlockSize+cur_t; } template<classT> forceinlineT* NodeAllocatorBase<T>::operator [](inti)const{ assert(i/NodeBlockSize<n); assert(i/NodeBlockSize<cur_b||i%NodeBlockSize<=cur_t); return&(b[i/NodeBlockSize]->b[i%NodeBlockSize]); } template<classT> forceinlineT* NodeAllocatorBase<T>::best(inti)const{ assert(i/NodeBlockSize<n); assert(i/NodeBlockSize<cur_b||i%NodeBlockSize<=cur_t); intbi=b[i/NodeBlockSize]->best[i%NodeBlockSize]; returnbi==-1?NULL:(*this)[bi]; } template<classT> forceinlinevoid NodeAllocatorBase<T>::setBest(inti,intbest){ assert(i/NodeBlockSize<n); assert(i/NodeBlockSize<cur_b||i%NodeBlockSize<=cur_t); b[i/NodeBlockSize]->best[i%NodeBlockSize]=best; } template<classT> forceinlinebool NodeAllocatorBase<T>::bab(void)const{ return_bab; } template<classT> forceinlinebool NodeAllocatorBase<T>::showLabels(void)const{ return!labels.isEmpty(); } template<classT> bool NodeAllocatorBase<T>::hasLabel(T*n)const{ returnlabels.contains(n); } template<classT> void NodeAllocatorBase<T>::setLabel(T*n,constQString&l){ labels[n]=l; } template<classT> void NodeAllocatorBase<T>::clearLabel(T*n){ labels.remove(n); } template<classT> QString NodeAllocatorBase<T>::getLabel(T*n)const{ returnlabels.value(n); } forceinlineunsignedint Node::getTag(void)const{ returnstatic_cast<unsignedint> (reinterpret_cast<ptrdiff_t>(childrenOrFirstChild)&3); } forceinlinevoid Node::setTag(unsignedinttag){ assert(tag<=3); assert(getTag()==UNDET); childrenOrFirstChild=reinterpret_cast<void*> ((reinterpret_cast<ptrdiff_t>(childrenOrFirstChild)&~(3))|tag); } forceinlinevoid* Node::getPtr(void)const{ returnreinterpret_cast<void*> (reinterpret_cast<ptrdiff_t>(childrenOrFirstChild)&~(3)); } forceinlineint Node::getFirstChild(void)const{ returnstatic_cast<int> ((reinterpret_cast<ptrdiff_t>(childrenOrFirstChild)&~(3))>>2); } forceinline Node::Node(intp,boolfailed):parent(p){ childrenOrFirstChild=NULL; noOfChildren=0; setTag(failed?LEAF:UNDET); } forceinlineint Node::getParent(void)const{ returnparent; } forceinlineVisualNode* Node::getParent(constNodeAllocator&na)const{ returnparent<0?NULL:na[parent]; } forceinlinebool Node::isUndetermined(void)const{returngetTag()==UNDET;} forceinlineint Node::getChild(intn)const{ assert(getTag()!=UNDET&&getTag()!=LEAF); if(getTag()==TWO_CHILDREN){ assert(n!=1||noOfChildren<=0); returnn==0?getFirstChild():-noOfChildren; } assert(n<noOfChildren); returnstatic_cast<int*>(getPtr())[n]; } forceinlineVisualNode* Node::getChild(constNodeAllocator&na,intn)const{ returnna[getChild(n)]; } forceinlinebool Node::isRoot(void)const{returnparent==-1;} forceinlineunsignedint Node::getNumberOfChildren(void)const{ switch(getTag()){ caseUNDET:return0; caseLEAF:return0; caseTWO_CHILDREN:return1+(noOfChildren<=0); default:returnnoOfChildren; } } inlineint Node::getIndex(constNodeAllocator&na)const{ if(parent==-1) return0; Node*p=na[parent]; for(inti=p->getNumberOfChildren();i--;) if(p->getChild(na,i)==this) returnp->getChild(i); GECODE_NEVER; return-1; } }} //STATISTICS:gist-any