/usr/include/gecode/gist/nodevisitor.hpp is in libgecode-dev 3.7.1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 2006
*
* Last modified:
* $Date: 2010-07-30 17:08:42 +0200 (Fri, 30 Jul 2010) $ by $Author: tack $
* $Revision: 11315 $
*
* 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
|