node.hh gecode/kernel.hh QHash QString /usr/include/gecode/gist/spacenode.hh gecode/support/cast.hpp gecode/kernel/brancher-val-sel-commit.hpp gecode/support/static-stack.hpp gecode/kernel/var-imp.hpp gecode/support/random.hpp limits gecode/kernel/var.hpp gecode/support/thread/none.hpp iterator gecode/support/timer.hpp gecode/support/thread/thread.hpp gecode/kernel/brancher-val-commit.hpp gecode/kernel/afc.hpp gecode/kernel/var-type.hpp gecode/support/hw-rnd.hpp cmath cassert gecode/kernel/brancher-view-sel.hpp gecode/kernel/allocators.hpp cstdarg gecode/support/bitset-base.hpp gecode/kernel/shared-array.hpp gecode/kernel/modevent.hpp gecode/kernel/memory-config.hpp gecode/support/int-type.hpp gecode/support/exception.hpp exception gecode/kernel/region.hpp gecode/support/marked-pointer.hpp gecode/support/thread.hpp gecode/kernel.hh gecode/kernel/branch-traits.hpp gecode/kernel/array.hpp gecode/kernel/branch-val.hpp gecode/support/dynamic-stack.hpp gecode/kernel/archive.hpp gecode/kernel/range-list.hpp gecode/kernel/brancher-merit.hpp gecode/support/config.hpp gecode/kernel/branch-var.hpp gecode/kernel/memory-manager.hpp /usr/include/gecode/gist/node.hh gecode/support/dynamic-queue.hpp gecode/kernel/macros.hpp ctime vector gecode/kernel/advisor.hpp gecode/kernel/brancher-view-val.hpp sstream QString gecode/kernel/brancher-val-sel.hpp gecode/kernel/propagator.hpp gecode/support/block-allocator.hpp gecode/kernel/activity.hpp cstdlib gecode/support/bitset.hpp gecode/support/auto-link.hpp iostream gecode/kernel/exception.hpp gecode/support/macros.hpp gecode/kernel/view.hpp gecode/kernel/branch-tiebreak.hpp cstddef climits gecode/kernel/core.hpp gecode/support.hh QHash gecode/support/dynamic-array.hpp gecode/support/sort.hpp gecode/kernel/rnd.hpp algorithm gecode/kernel/brancher-view.hpp gecode/kernel/global-afc.hpp cstring gecode/support/bitset-offset.hpp gecode/support/heap.hpp /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/treecanvas.hh /usr/include/gecode/gist/nodestats.hh /usr/include/gecode/gist/nodewidget.hh /usr/include/gecode/gist/node.hh /usr/include/gecode/gist/layoutcursor.hh /usr/include/gecode/gist/spacenode.hh /usr/include/gecode/gist/drawingcursor.hh Gecode::Gist::NodeAllocatorBase Gecode::Gist::NodeAllocatorBase::Block Gecode::Gist::Node Gecode Gecode::Gist /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *GuidoTack<tack@gecode.org> * *Copyright: *GuidoTack,2006 * *Lastmodified: *$Date:2013-07-0203:35:13+0200(Tue,02Jul2013)$by$Author:tack$ *$Revision:13749$ * *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. * */ #ifndefGECODE_GIST_NODE_HH #defineGECODE_GIST_NODE_HH #include<gecode/kernel.hh> #include<QHash> #include<QString> namespaceGecode{namespaceGist{ classVisualNode; template<classT> classNodeAllocatorBase{ private: staticconstintNodeBlockSize=1<<14; classBlock{ public: Tb[NodeBlockSize]; intbest[NodeBlockSize]; }; Block**b; intn; intcur_b; intcur_t; voidallocate(void); bool_bab; QHash<T*,QString>labels; public: NodeAllocatorBase(boolbab); ~NodeAllocatorBase(void); intallocate(intp); intallocate(Space*root); T*operator [](inti)const; T*best(inti)const; voidsetBest(inti,intb); boolbab(void)const; boolshowLabels(void)const; voidshowLabels(boolb); boolhasLabel(T*n)const; voidsetLabel(T*n,constQString&l); voidclearLabel(T*n); QStringgetLabel(T*n)const; }; classNode{ private: enum{ UNDET,//<Numberofchildrennotdetermined LEAF,//<Leafnode TWO_CHILDREN,//<Nodewithatmosttwochildren MORE_CHILDREN//<Nodewithmorethantwochildren }; void*childrenOrFirstChild; intnoOfChildren; intparent; unsignedintgetTag(void)const; voidsetTag(unsignedinttag); void*getPtr(void)const; intgetFirstChild(void)const; protected: boolisUndetermined(void)const; intgetChild(intn)const; public: typedefNodeAllocatorBase<VisualNode>NodeAllocator; Node(intp,boolfailed=false); intgetParent(void)const; VisualNode*getParent(constNodeAllocator&na)const; VisualNode*getChild(constNodeAllocator&na,intn)const; intgetIndex(constNodeAllocator&na)const; boolisRoot(void)const; voidsetNumberOfChildren(unsignedintn,NodeAllocator&na); unsignedintgetNumberOfChildren(void)const; }; }} #endif //STATISTICS:gist-any