search_graph_funcs.cc

Go to the documentation of this file.

// Search graph helper functions -*- C++ -*-

// $Id: sparsity.h 411 2008-02-29 13:05:41Z mihaly $
// Copyright (C) 2001-2008 Hermann Schichl, Mihaly Csaba Markot
//
// This file is a COCONUT inference engine.  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.

#include <coconut_config.h>
#include <search_graph_funcs.h>

namespace coco {

void get_ids(const std::vector<si_ri_pair>& riv,
                          std::vector<search_node_id>& v)
{
  v.reserve(riv.size());
  std::vector<si_ri_pair>::const_iterator riv_c, riv_e(riv.end());
  for(riv_c = riv.begin(); riv_c != riv_e; ++riv_c)
    v.push_back(riv_c->second);
}

void get_leaves_vector(const search_graph& __sgraph,
                       std::vector<si_ri_pair>& v,
                       search_inspector* sfoc)
{
  search_graph::parents_const_iterator __p;
  search_inspector sky = __sgraph.sky();
  for(__p = __sgraph.leaf_begin(); __p != __sgraph.leaf_end(); ++__p)
  {
    search_inspector n(sky << __p);
    if(!sfoc || (*n)->get_id() != (*(*sfoc))->get_id())
      v.push_back(std::make_pair((*(sky << __p))->get_rowid(),
                               (*(sky << __p))->get_id()));
  }
  std::sort(v.begin(), v.end());
}

bool get_children_vector(const search_graph& __sgraph,
                         const search_node_id& pid,
                         std::vector<si_ri_pair>& v,
                         search_inspector* sfoc)
{
  bool ret(true);
  search_graph::children_const_iterator __c;
  search_inspector par = __sgraph.get(pid);
  if(par == __sgraph.ground())
    ret = false;
  else
  {
    for(__c = par.child_begin(); __c != par.child_end(); ++__c)
    {
      search_graph::const_walker w(par >> __c);
      if(!w.is_sky() && (!sfoc || (*w)->get_id() != (*(*sfoc))->get_id()))
        v.push_back(std::make_pair((*w)->get_rowid(),
                                   (*w)->get_id()));
    }
    std::sort(v.begin(), v.end());
  }
  return ret;
}

} // namespace coco

---