BonQuadRow.hpp

Go to the documentation of this file.

// All Rights Reserved.
// This code is published under the Common Public License.
//
// Authors :
// Pierre Bonami, International Business Machines Corporation
//
// Date : 10/06/2007

#ifndef BonQuadRow_H
#define BonQuadRow_H

#include "CoinPackedVector.hpp"
#include "BonTMatrix.hpp"
#include "BonQuadCut.hpp"

namespace Bonmin{

  typedef std::pair<int, int> matEntry;
  typedef std::pair<int, int> matIdx;
#if HAS_HASH_MAP
  typedef std::has_map<matEntry, matIdx, std::hash< matEntry> > AdjustableMat;
#else
  typedef std::map<matEntry, matIdx> AdjustableMat;
#endif

class QuadRow {
 public:
 QuadRow();

 QuadRow(const QuadRow & other);

 QuadRow& operator=(const QuadRow& rhs);

 QuadRow(const QuadCut &cut);

 QuadRow& operator=(const QuadCut & rhs);

 QuadRow(const OsiRowCut &cut);

 QuadRow& operator=(const OsiRowCut & rhs);

 double eval_f(const double *x, bool new_x);

 int nnz_grad();
  void gradiant_struct(const int nnz, int * indices, bool offset);
 void eval_grad(const int nnz, const double * x, bool new_x, double * values);

 int nnz_hessian(){
   return Q_.nnz_;}

 bool isLinear(){
   return Q_.nnz_ == 0;}

 void eval_hessian(double lambda, double * values);

  void add_to_hessian(AdjustableMat &H, bool offset); 

  void remove_from_hessian(AdjustableMat &H);
void print();

 private:
 void initialize();

 void internal_eval_grad(const double *x);

 double lb_;
 double ub_;
 double c_;
 CoinPackedVector a_;
 TMat Q_;


#if HAS_HASH_MAP
  typedef  std::has_map<int, std::pair<double, double >, std::hash<int> > gStore;
#else
  typedef std::map<int, std::pair<double, double> > gStore;
#endif

 gStore g_;
 std::vector<gStore::iterator> a_grad_idx_;
 std::vector<gStore::iterator> Q_row_grad_idx_;
 std::vector<gStore::iterator> Q_col_grad_idx_;
 std::vector<AdjustableMat::iterator> Q_hessian_idx_;
 bool grad_evaled_;
};
}//End Bonmin namespace
#endif