/*
 *  Main authors:
 *     Guido Tack <tack@gecode.org>
 *
 *  Copyright:
 *     Guido Tack, 2006
 *
 *  Last modified:
 *     $Date: 2007-11-25 22:16:57 +0100 (Sun, 25 Nov 2007) $ by $Author: tack $
 *     $Revision: 5420 $
 *
 *  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 Node>
  NodeCursor<Node>::NodeCursor(Node* theNode) : _startNode(theNode), _node(theNode) {}

  template <class Node>
  Node*
  NodeCursor<Node>::node(void) { return _node; }

  template <class Node>
  bool
  NodeCursor<Node>::mayMoveUpwards(void) { return _node != _startNode && !_node->isRoot(); }

  template <class Node>
  void
  NodeCursor<Node>::moveUpwards(void) {
    _node = static_cast<Node*>(_node->getParent());
  }

  template <class Node>
  bool
  NodeCursor<Node>::mayMoveDownwards(void) { return _node->getNumberOfChildren() > 0; }

  template <class Node>
  void
  NodeCursor<Node>::moveDownwards(void) { _node = _node->getChild(0); }

  template <class Node>
  bool
  NodeCursor<Node>::mayMoveSidewards(void) {
    return (!_node->isRoot()) &&
      (_node->getAlternative() < _node->getParent()->getNumberOfChildren() - 1);
  }

  template <class Node>
  void
  NodeCursor<Node>::moveSidewards(void) {
    _node = static_cast<Node*>(_node->getParent()->getChild(_node->getAlternative()+1));
  }

}}

// STATISTICS: gist-any