Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
3.3 kB · 122 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Guido Tack <tack@gecode.org> * * Copyright: * Guido Tack, 2006 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
namespace Gecode { namespace Gist {
template<class Cursor> forceinline NodeVisitor<Cursor>::NodeVisitor(const Cursor& c0) : c(c0) {}
template<class Cursor> forceinline void NodeVisitor<Cursor>::setCursor(const Cursor& c0) { c = c0; }
template<class Cursor> forceinline Cursor& NodeVisitor<Cursor>::getCursor(void) { return c; }
template<class Cursor> forceinline void PostorderNodeVisitor<Cursor>::moveToLeaf(void) { while (c.mayMoveDownwards()) { c.moveDownwards(); } }
template<class Cursor> PostorderNodeVisitor<Cursor>::PostorderNodeVisitor(const Cursor& c0) : NodeVisitor<Cursor>(c0) { moveToLeaf(); }
template<class Cursor> forceinline bool PostorderNodeVisitor<Cursor>::next(void) { c.processCurrentNode(); if (c.mayMoveSidewards()) { c.moveSidewards(); moveToLeaf(); } else if (c.mayMoveUpwards()) { c.moveUpwards(); } else { return false; } return true; }
template<class Cursor> forceinline void PostorderNodeVisitor<Cursor>::run(void) { while (next()) {} }
template<class Cursor> forceinline bool PreorderNodeVisitor<Cursor>::backtrack(void) { while (! c.mayMoveSidewards() && c.mayMoveUpwards()) { c.moveUpwards(); } if (! c.mayMoveUpwards()) { return false; } else { c.moveSidewards(); } return true; }
template<class Cursor> PreorderNodeVisitor<Cursor>::PreorderNodeVisitor(const Cursor& c0) : NodeVisitor<Cursor>(c0) {}
template<class Cursor> forceinline bool PreorderNodeVisitor<Cursor>::next(void) { c.processCurrentNode(); if (c.mayMoveDownwards()) { c.moveDownwards(); } else if (c.mayMoveSidewards()) { c.moveSidewards(); } else { return backtrack(); } return true; }
template<class Cursor> forceinline void PreorderNodeVisitor<Cursor>::run(void) { while (next()) {} }}}
// STATISTICS: gist-any