row.h

#ifndef SCIL_ROW_H
#define SCIL_ROW_H

#include <LEDA/list.h>
#undef set
#include <scil/row_entry.h>

namespace SCIL {

class var;
class cons_obj;

class row {

public:
  LEDA_MEMORY(row)

//private:
  typedef LEDA::list_item item;

  private:
  LEDA::list<row_entry> NZ;

  public:

  row() {
  };

  row(double d);

  row(var v); 

  row(LEDA::list<row_entry>& L);

  row operator* (double d);

  row operator+ (const row& r1);

  row operator+ (const var& v);

  row operator+ (double d);

  row operator- (const row& r1);

  row& operator+= (const row& r1);

  row& operator+= (const var& v);

  row& operator-= (const var& v);

  row& operator+= (const row_entry& r);

  row& operator-= (const row& r1);

  cons_obj* operator== (row r1);

  cons_obj* operator<= (row r1);

  cons_obj* operator>= (row r1);

  void normalize();

  item first_item() const;

  item next_item(item i) const;

  row_entry inf(const item i) const;

  int size();

/*{\Mtext {\bf forall\_items}($it,L$)       
  $\{$ ``the items of $L$ are successively assigned to $it$'' $\}$}*/

  friend ostream& operator<<(ostream& o,const row&);
};

row operator*(double d, var v);

row operator*(double d, row r1);

}


#endif

---