cons.cc

#include<LEDA/list.h>
#include<scil/cons.h>
#include<scil/cons_obj.h>
#include<scil/column.h>

using namespace SCIL;

int SCIL::Hash(cons v) { return LEDA::Hash((void*) v.cons_pointer()); }

cons& cons::operator=(const cons& i) {
  IS=i.IS;
  return *this;
}


cons_obj* cons::cons_pointer() {
  if (IS==nil) cout<<"nil consuality\n";
  return IS;
}

ABA_Constraint* cons::Acons_pointer() {
  if (IS==nil) cout<<"nil variable\n";
  return IS->Acons();
}

column cons::operator+ (column r) {
  return column(*this)+r;
}

column cons::operator* (double d) {
  return column(*this)*d;
}

bool cons::operator< (const cons& v1) const {
  return IS<v1.IS;
}

bool cons::operator<= (const cons& v1) const {
  return IS<=v1.IS;
}

bool cons::operator!= (const cons& v1) const {
  return IS!=v1.IS;
}

bool cons::operator== (const cons& v1) const {
  return IS==v1.IS;
}

bool cons::operator> (const cons& v1) const {
  return IS>v1.IS;
}

int SCIL::compare(const cons& v1, const cons& v2) {
  if(v1>v2) return 1;
  if(v1<v2) return -1;
  return 0;
}



double cons::rhs() {
  return cons_pointer()->rhs();
}; 

cons_sense cons::sense() {
  return cons_pointer()->sense();
};

---