nodevisitor.hpp
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Guido Tack <tack@gecode.org> 00005 * 00006 * Copyright: 00007 * Guido Tack, 2006 00008 * 00009 * This file is part of Gecode, the generic constraint 00010 * development environment: 00011 * http://www.gecode.org 00012 * 00013 * Permission is hereby granted, free of charge, to any person obtaining 00014 * a copy of this software and associated documentation files (the 00015 * "Software"), to deal in the Software without restriction, including 00016 * without limitation the rights to use, copy, modify, merge, publish, 00017 * distribute, sublicense, and/or sell copies of the Software, and to 00018 * permit persons to whom the Software is furnished to do so, subject to 00019 * the following conditions: 00020 * 00021 * The above copyright notice and this permission notice shall be 00022 * included in all copies or substantial portions of the Software. 00023 * 00024 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00025 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00026 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00027 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00028 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00029 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00030 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00031 * 00032 */ 00033 00034 namespace Gecode { namespace Gist { 00035 00036 template<class Cursor> 00037 forceinline 00038 NodeVisitor<Cursor>::NodeVisitor(const Cursor& c0) : c(c0) {} 00039 00040 template<class Cursor> 00041 forceinline void 00042 NodeVisitor<Cursor>::setCursor(const Cursor& c0) { c = c0; } 00043 00044 template<class Cursor> 00045 forceinline Cursor& 00046 NodeVisitor<Cursor>::getCursor(void) { return c; } 00047 00048 template<class Cursor> 00049 forceinline void 00050 PostorderNodeVisitor<Cursor>::moveToLeaf(void) { 00051 while (c.mayMoveDownwards()) { 00052 c.moveDownwards(); 00053 } 00054 } 00055 00056 template<class Cursor> 00057 PostorderNodeVisitor<Cursor>::PostorderNodeVisitor(const Cursor& c0) 00058 : NodeVisitor<Cursor>(c0) { 00059 moveToLeaf(); 00060 } 00061 00062 template<class Cursor> 00063 forceinline bool 00064 PostorderNodeVisitor<Cursor>::next(void) { 00065 c.processCurrentNode(); 00066 if (c.mayMoveSidewards()) { 00067 c.moveSidewards(); 00068 moveToLeaf(); 00069 } else if (c.mayMoveUpwards()) { 00070 c.moveUpwards(); 00071 } else { 00072 return false; 00073 } 00074 return true; 00075 } 00076 00077 template<class Cursor> 00078 forceinline void 00079 PostorderNodeVisitor<Cursor>::run(void) { 00080 while (next()) {} 00081 } 00082 00083 template<class Cursor> 00084 forceinline bool 00085 PreorderNodeVisitor<Cursor>::backtrack(void) { 00086 while (! c.mayMoveSidewards() && c.mayMoveUpwards()) { 00087 c.moveUpwards(); 00088 } 00089 if (! c.mayMoveUpwards()) { 00090 return false; 00091 } else { 00092 c.moveSidewards(); 00093 } 00094 return true; 00095 } 00096 00097 template<class Cursor> 00098 PreorderNodeVisitor<Cursor>::PreorderNodeVisitor(const Cursor& c0) 00099 : NodeVisitor<Cursor>(c0) {} 00100 00101 template<class Cursor> 00102 forceinline bool 00103 PreorderNodeVisitor<Cursor>::next(void) { 00104 c.processCurrentNode(); 00105 if (c.mayMoveDownwards()) { 00106 c.moveDownwards(); 00107 } else if (c.mayMoveSidewards()) { 00108 c.moveSidewards(); 00109 } else { 00110 return backtrack(); 00111 } 00112 return true; 00113 } 00114 00115 template<class Cursor> 00116 forceinline void 00117 PreorderNodeVisitor<Cursor>::run(void) { 00118 while (next()) {} 00119 } 00120 }} 00121 00122 // STATISTICS: gist-any