var_obj.cc

#include<abacus/column.h>
#include<scil/var_obj.h>
#include<scil/cons_obj.h>
#include<scil/column.h>
#include<scil/aba_constraint.h>
#include<scil/aba_variable.h>

using namespace SCIL;

int var_obj::genColumn(Active_Inequalities* cons, Column& co)
{ 
  //cout<<row.size()<<" "<<row.nnz()<<" rowsize\n";
  column C;
  non_zero_entries(C);

  //cons_obj* i;
  //forall_defined(i, IC) { TODO wird von genRow erzeugt
  //  C+=cons(i)*IC[i];
  //}

  column_entry::list_iterator it;
  int j;
  co.realloc(C.size());
  foreach(it, C) {
    j=it->Cons.cons_pointer()->Acons()->index();
    if (j!=-1) co.insert(j, it->coeff);
  }
  co.obj(obj());
  co.lBound(lower_bound());
  co.uBound(upper_bound());

  cout<<C.size()<<" gencol\n";

  return(C.size());
};

double var_obj::coeff(ABA_CONSTRAINT* i) {
  cons_obj* I=((ABA_Constraint*) i)->Scons();

  // if Map contains constraint i
  if( IC.find(I) != IC.end() ) {
    return IC[I];
  }
  return coeff(I);
}

void var_obj::set(cons_obj* i, double d) {
  IC[i]=d;
}

void var_obj::init(subproblem& S, int nr, Activation a) {
  vi=nr; // TODO
  Ref_AVar=new ABA_Variable(S, this, a, Local, obj_, lBound_, uBound_, vt);
};

void var_obj::init(ILP_Problem& IP, int nr, Activation a) {
  vi=nr;
  Ref_AVar=new ABA_Variable(IP, this, a, Global, obj_, lBound_, uBound_, vt);
};

---