search_graph.hpp

Go to the documentation of this file.

// Search Graph implementation -*- C++ -*-

// $Id: search_graph.hpp 725 2008-09-23 12:42:45Z mihaly $
// Copyright (C) 2001-2003 Hermann Schichl, Evgueni Petrov, Brice Pajot
//
// 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 _SEARCH_GRAPH_HPP
#define _SEARCH_GRAPH_HPP

#include <sgraphctx.h>

namespace coco {

inline search_graph::search_graph(model& root_model, gptr<vdbl::database>& _db)
     : _Base(), ptr_ground(NULL), ptr_root_model(NULL),
       __dbase(&_db), __dbuser(0),
       sgc(new search_graph_context(*this)),
       __vdbf(*this->__dbase->get_local_copy(), this->__dbuser, *sgc,
              vdbl::V_window),
       __maxid(0), __id_ref()
{
  ptr_root_model = root_model; // the actual initialization of ptr_root_model
  *ground() = new search_node(get_node_id(), __dbuser, *__dbase, snr_virtual);
  search_nodes_to_deallocate.push_front(*ground());
  ptr_ground = **ground();    // the actual initialization of ptr_ground
  root = new full_node(get_node_id(), __dbuser, ptr_root_model, ptr_ground,
                       *__dbase, snr_root);
  search_nodes_to_deallocate.push_front(root);
  inspector_for_root = insert(ground(), *root);
  __id_ref[root->get_id()] = inspector_for_root;
}

inline search_graph::search_graph(model & root_model, gptr<vdbl::database>& _db,
             const std::vector<annotation>& _a)
     : _Base(), ptr_ground(NULL), ptr_root_model(NULL),
       __dbase(&_db), __dbuser(0),
       sgc(new search_graph_context(*this)),
       __vdbf(*this->__dbase->get_local_copy(), this->__dbuser, *sgc,
              vdbl::V_window),
       __maxid(0)
{
  ptr_root_model = root_model;  // the actual initialization of ptr_root_model
  *ground() = new search_node(get_node_id(), __dbuser, *__dbase, snr_virtual);
  search_nodes_to_deallocate.push_front(*ground());
  ptr_ground = **ground();    // the actual initialization of ptr_ground
  root = new full_node(get_node_id(), __dbuser, ptr_root_model, ptr_ground,
                       *__dbase, _a, snr_root);
  search_nodes_to_deallocate.push_front(root);
  inspector_for_root = insert(ground(), *root);
  __id_ref[root->get_id()] = inspector_for_root;
}

inline search_graph::~search_graph()
{
  for(std::list<search_node*>::iterator i = search_nodes_to_deallocate.begin();
      i != search_nodes_to_deallocate.end(); ++i)
    delete *i;

  vdbl::standard_table* dtable = (vdbl::standard_table *)
      (*__dbase)->get_table("deltas", __dbuser);
  if(dtable == NULL)
    throw api_exception(apiee_internal,
        "Database inconsistency: Programming Error!");
  for(std::list<delta_id>::iterator i = db_deltas_to_remove.begin();
      i != db_deltas_to_remove.end(); ++i)
    dtable->remove(*i);
  vdbl::standard_table* stable = (vdbl::standard_table *)
      (*__dbase)->get_table("search info", __dbuser);
  for(std::list<work_node_comp_hook*>::iterator __b = wn_hooks.begin();
      __b != wn_hooks.end(); ++__b)
  {
    if(stable)
      (*__b)->drop_columns(*stable);
    delete *__b;
  }
  wn_hooks.erase(wn_hooks.begin(), wn_hooks.end());
  (*__dbase)->drop_table("search info", __dbuser);
  delete sgc;
}

inline search_graph::search_inspector search_graph::child(search_inspector& n,
        unsigned int i)
{
  if(n.n_children() < i || i < 0)
    throw api_exception(apiee_search_graph,
      "in search_graph :: child (...) : the index of child is out of range");
  return new_inspector(n >> (n.child_begin() + i));
}

inline search_graph::search_inspector search_graph::parent(search_inspector& n,
        unsigned int i)
{
  if(n.n_parents() < i || i < 0)
    throw api_exception(apiee_search_graph,
      "in search_graph :: parent (...) : the index of parent is out of range");
  return new_inspector(n >> (n.parent_begin() + i));
}

inline search_graph::search_inspector search_graph::get(search_node_id id) const
{
  std::map<search_node_id,search_inspector>::const_iterator
      i(__id_ref.find(id));
  if(i == __id_ref.end())
    return ground();
  else
    return (*i).second;
}

} // namespace coco

#endif // _SEARCH_GRAPH_HPP

---