---

dbtools.cc

Go to the documentation of this file.

// Database tools implementation -*- C++ -*-

// Copyright (C) 2003 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.

#include <search_node.h>
#include <dbtools.h>
#include <int_evaluator.h>

bool point_check_feasibility::operator() () const
{
  typedef model::walker nodeptr;
  const std::vector<double>* x;
  const double* f;

  bool error;
  const vdbl::col& _ca(_r->get_col(x_ci, error));
  if(error) return false;
  _ca.get_ptr(x);

  const vdbl::col& _cb(_r->get_col(f_ci, error));
  if(error) return false;
  _cb.get_ptr(f);

  const work_node *wn = wnc->wn()->get_local_copy();
  const model* __mod = wn->get_model_ptr();
  variable_indicator v_i(__mod->number_of_variables());
  v_i.set(0, __mod->number_of_variables());

  std::vector<interval> xi;
  std::copy((*x).begin(), (*x).end(), std::back_inserter(xi));
  interval fi;
  interval_eval ie(xi, v_i, *__mod, NULL, false);

  std::vector<nodeptr>::const_iterator __b, __e(__mod->constraints.end());
  for(__b = __mod->constraints.begin(); __b != __e; ++__b)
  {
    fi = evaluate(ie, *__b);
    if(!fi.subset((*__b)->f_bounds))
      return false;
  }
  return true;
}

bool box_check_intersection::operator() () const
{
  typedef model::walker nodeptr;
  const std::vector<interval>* x;

  bool error;
  const vdbl::col& _ca(_r->get_col(x_ci, error));
  if(error) return false;
  _ca.get_ptr(x);

  const work_node *wn = wnc->wn()->get_local_copy();
  const model* __mod = wn->get_model_ptr();
  const std::vector<interval>& ranges(wn->node_ranges);

  unsigned int e(x->size());
  for(unsigned int i = 0; i < e; ++i)
  {
    if((*x)[i].disjoint(ranges[__mod->var(i)->node_num]))
      return false;
  }
  return true;
}

---