nodevisitor.hpp /usr/include/gecode/gist/nodevisitor.hh /usr/include/gecode/gist/nodevisitor.hpp /usr/include/gecode/gist/nodevisitor.hh Gecode Gecode::Gist /*-*-mode:C++;c-basic-offset:2;indent-tabs-mode:nil-*-*/ /* *Mainauthors: *GuidoTack<tack@gecode.org> * *Copyright: *GuidoTack,2006 * *Lastmodified: *$Date:2010-07-3017:08:42+0200(Fri,30Jul2010)$by$Author:tack$ *$Revision:11315$ * *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<classCursor> forceinline NodeVisitor<Cursor>::NodeVisitor(constCursor&c0):c(c0){} template<classCursor> forceinlinevoid NodeVisitor<Cursor>::setCursor(constCursor&c0){c=c0;} template<classCursor> forceinlineCursor& NodeVisitor<Cursor>::getCursor(void){returnc;} template<classCursor> forceinlinevoid PostorderNodeVisitor<Cursor>::moveToLeaf(void){ while(c.mayMoveDownwards()){ c.moveDownwards(); } } template<classCursor> PostorderNodeVisitor<Cursor>::PostorderNodeVisitor(constCursor&c0) :NodeVisitor<Cursor>(c0){ moveToLeaf(); } template<classCursor> forceinlinebool PostorderNodeVisitor<Cursor>::next(void){ c.processCurrentNode(); if(c.mayMoveSidewards()){ c.moveSidewards(); moveToLeaf(); }elseif(c.mayMoveUpwards()){ c.moveUpwards(); }else{ returnfalse; } returntrue; } template<classCursor> forceinlinevoid PostorderNodeVisitor<Cursor>::run(void){ while(next()){} } template<classCursor> forceinlinebool PreorderNodeVisitor<Cursor>::backtrack(void){ while(!c.mayMoveSidewards()&&c.mayMoveUpwards()){ c.moveUpwards(); } if(!c.mayMoveUpwards()){ returnfalse; }else{ c.moveSidewards(); } returntrue; } template<classCursor> PreorderNodeVisitor<Cursor>::PreorderNodeVisitor(constCursor&c0) :NodeVisitor<Cursor>(c0){} template<classCursor> forceinlinebool PreorderNodeVisitor<Cursor>::next(void){ c.processCurrentNode(); if(c.mayMoveDownwards()){ c.moveDownwards(); }elseif(c.mayMoveSidewards()){ c.moveSidewards(); }else{ returnbacktrack(); } returntrue; } template<classCursor> forceinlinevoid PreorderNodeVisitor<Cursor>::run(void){ while(next()){} } }} //STATISTICS:gist-any