vgtl_addalgo.h

Go to the documentation of this file.

// Additional algorithms for VGTL -*- C++ -*-

// $Id: vgtl_addalgo.h 347 2008-02-06 15:20:01Z schilly $
// Copyright (C) 2004 Hermann Schichl
//
// This file is part of the COCONUT API.  This library
// is free software; you can redistribute it and/or modify it under the
// terms of the Library GNU General Public License as published by the
// Free Software Foundation; either version 2, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// Library GNU General Public License for more details.

// As a special exception, you may use this file as part of a free software
// library without restriction.  Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// the Library GNU General Public License.  This exception does not however
// invalidate any other reasons why the executable file might be covered by
// the Library GNU General Public License.

#ifndef _VGTL_ADDALGO_H_
#define _VGTL_ADDALGO_H_

#include <algorithm>
#include <vgtl_helpers.h>
#include <vgtl_gdata.h>

__VGTL_BEGIN_NAMESPACE

#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma set woff 1209
#endif

template <class _Walker, class _Visitor>
typename _Visitor::return_value recursive_safe_walk_if(_Walker __w, _Visitor __f)
{
  typename _Walker::children_const_iterator __it;
  unsigned int i;

  if(__w.is_ground())
  {
    __f.vinit();
    for(i = 0; i < __w.n_children(); ++i)
    {
      __it = __w.node()->_C_children.begin()+i;
      __f.vcollect(_recursive_safe_walk_if(__w>>__it, __f));
    }
    return __f.vvalue();
  }
  else if(__w.is_sky())
    return __f.vvalue();
  else
  {
    while(1)
    {
      if(__f.preorder(*__w))
      {
        for(i = 0; i < __w.n_children(); ++i)
        {
          __it = __w.node()->_C_children.begin()+i;
          __f.collect(*__w, _recursive_safe_walk_if(__w>>__it, __f));
        }
      }
      if(!__f.postorder(*__w))
        break;
    }
    return __f.value();
  }
}

template <class _Walker, class _Visitor>
typename _Visitor::return_value _recursive_safe_walk_if(_Walker __w, _Visitor __f)
{
  typename _Walker::children_const_iterator __it;
  unsigned int i;

  if(__w.is_sky())
    return __f.vvalue();
  while(1)
  {
    if(__f.preorder(*__w))
    {
      for(i = 0; i < __w.n_children(); ++i)
      {
        __it = __w.node()->_C_children.begin()+i;
        __f.collect(*__w, _recursive_safe_walk_if(__w>>__it, __f));
      }
    }
    if(!__f.postorder(*__w))
      break;
  }
  return __f.value();
}

#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma reset woff 1209
#endif

__VGTL_END_NAMESPACE

#endif /* _VGTL_ADDALGO_H_ */

---