Generated on Mon Nov 30 23:53:19 2009 for Gecode by doxygen 1.6.1

nodecursor.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  *  Last modified:
00010  *     $Date: 2009-09-08 21:10:29 +0200 (Tue, 08 Sep 2009) $ by $Author: schulte $
00011  *     $Revision: 9692 $
00012  *
00013  *  This file is part of Gecode, the generic constraint
00014  *  development environment:
00015  *     http://www.gecode.org
00016  *
00017  * Permission is hereby granted, free of charge, to any person obtaining
00018  * a copy of this software and associated documentation files (the
00019  * "Software"), to deal in the Software without restriction, including
00020  * without limitation the rights to use, copy, modify, merge, publish,
00021  * distribute, sublicense, and/or sell copies of the Software, and to
00022  * permit persons to whom the Software is furnished to do so, subject to
00023  * the following conditions:
00024  *
00025  * The above copyright notice and this permission notice shall be
00026  * included in all copies or substantial portions of the Software.
00027  *
00028  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00029  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00030  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00031  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00032  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00033  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00034  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00035  *
00036  */
00037 
00038 namespace Gecode { namespace Gist {
00039 
00040   template<class Node>
00041   forceinline
00042   NodeCursor<Node>::NodeCursor(Node* theNode) : _startNode(theNode), _node(theNode), _alternative(theNode->getAlternative()) {}
00043 
00044   template<class Node>
00045   forceinline Node*
00046   NodeCursor<Node>::node(void) { return _node; }
00047 
00048   template<class Node>
00049   forceinline unsigned int
00050   NodeCursor<Node>::alternative(void) { return _alternative; }
00051 
00052   template<class Node>
00053   forceinline void
00054   NodeCursor<Node>::alternative(unsigned int a) { _alternative=a; }
00055 
00056   template<class Node>
00057   forceinline Node*
00058   NodeCursor<Node>::startNode(void) { return _startNode; }
00059 
00060   template<class Node>
00061   forceinline void
00062   NodeCursor<Node>::node(Node* n) { _node = n; }
00063 
00064   template<class Node>
00065   forceinline bool
00066   NodeCursor<Node>::mayMoveUpwards(void) {
00067     return _node != _startNode && !_node->isRoot();
00068   }
00069 
00070   template<class Node>
00071   forceinline void
00072   NodeCursor<Node>::moveUpwards(void) {
00073     _node = static_cast<Node*>(_node->getParent());
00074     if (_node->isRoot()) {
00075       _alternative = 0;
00076     } else {
00077       Node* p = static_cast<Node*>(_node->getParent());
00078       for (int i=p->getNumberOfChildren(); i--;) {
00079         if (p->getChild(i) == _node) {
00080           _alternative = i;
00081           break;
00082         }
00083       }
00084     }
00085   }
00086 
00087   template<class Node>
00088   forceinline bool
00089   NodeCursor<Node>::mayMoveDownwards(void) {
00090     return _node->getNumberOfChildren() > 0;
00091   }
00092 
00093   template<class Node>
00094   forceinline void
00095   NodeCursor<Node>::moveDownwards(void) {
00096     _alternative = 0;
00097     _node = _node->getChild(0);
00098   }
00099 
00100   template<class Node>
00101   forceinline bool
00102   NodeCursor<Node>::mayMoveSidewards(void) {
00103     return (!_node->isRoot()) && (_node != _startNode) &&
00104       (_alternative < _node->getParent()->getNumberOfChildren() - 1);
00105   }
00106 
00107   template<class Node>
00108   forceinline void
00109   NodeCursor<Node>::moveSidewards(void) {
00110     _node = static_cast<Node*>(_node->getParent()->getChild(++_alternative));
00111   }
00112 
00113   forceinline bool
00114   HideFailedCursor::mayMoveDownwards(void) {
00115     VisualNode* n = node();
00116     return NodeCursor<VisualNode>::mayMoveDownwards() &&
00117            (n->hasSolvedChildren() || n->getNoOfOpenChildren() > 0) &&
00118            (! n->isHidden());
00119   }
00120 
00121 }}
00122 
00123 // STATISTICS: gist-any