---

sum_deltas.h

Go to the documentation of this file.

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

// Copyright (C) 2001-2003 Evgueni Petrov, 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 SUM_DELTAS
#define SUM_DELTAS
#include <vector>
#include "delta.h"
using namespace std;

inline work_node full_node_to_work_node(full_node& n_full,
                                        gptr<search_node> &ground)
{
  ptr<model> ptr_to_model_from_n_full(*n_full.get_model_ptr());
  ptr<vdbl::database> ptr_to_dbase_from_n_full(*n_full.get_database_ptr());
//  return work_node ( ptr_to_model_from_n_full, n_work_annotation, empty_list_of_delta_id, & ground );
// memory leak !!!
  list<delta_id> empty_list_of_delta_id;
  return work_node(n_full.get_id(), n_full.get_dbuserid(),
                   *new ptr<model>(ptr_to_model_from_n_full),
                   *new ptr<vdbl::database>(ptr_to_dbase_from_n_full),
                   n_full.get_annotations(), empty_list_of_delta_id, &ground);
}

class sum_deltas:public prepost_visitor<search_node*, work_node*>
{
public:
  vector<return_value> ancestors;
  return_value result;
  gptr<search_node> &ground;

  sum_deltas(gptr<search_node>& search_graph_ground) : result(NULL),
      ground(search_graph_ground) {}

  inline void vinit()
  {
    // cout << "vinit" << endl;
  }

  inline void vcollect(return_value const &)
  {
    // cout << "vcollect" << endl;
    throw search_graph_exception
        ("in sum_deltas :: vcollect (...) : do not know how to handle virtual nodes");
  }

  inline return_value vvalue()
  {
    // cout << "vvalue" << endl;
    return result;
  }

  inline bool preorder(search_node* const& r)
  {
    // cout << "preorder" << endl;
    ancestors.clear();
    return r->is_delta();
  }

  inline void collect(search_node* const&, return_value const &ancestor)
  {
    // cout << "collect" << endl;
    ancestors.push_back(ancestor);
  }

  bool postorder(search_node* const &r)
  {
    // cout << "postorder" << endl;
    if(!r->is_delta())
    {
      full_node *r_as_full_node = (full_node *) r;      //  cast to full_node *

      if(result != NULL)
        delete result;

      result = new work_node(full_node_to_work_node(*r_as_full_node, ground));
      return false;
    }
    if(ancestors.size() >= 2)
      throw search_graph_exception
        ("in sum_deltas :: postorder (...) : search_node has several ancestors");
    delta_node *r_as_delta_node = (delta_node *) r;     //  cast to delta_node *
    work_node ancestor_plus_r_as_delta_node(*ancestors[0]);

    for(unsigned int i = 0; i < r_as_delta_node->n_deltas(); ++i)
      ancestor_plus_r_as_delta_node += r_as_delta_node->get_delta_id(i);
    if(result != NULL)
      delete result;

    result = new work_node(ancestor_plus_r_as_delta_node);
    return false;
  }

  inline return_value value()
  {
    // cout << "value" << endl;
    return result;
  }

};
#endif

---