row.h

#ifndef SCIL_ROW_H
#define SCIL_ROW_H

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

namespace SCIL {

class var;
class cons_obj;
class polynomial;

class row {

  public:

//private:

  private:
  std::list<row_entry> NZ;

  public:

  row() {
  };

  row(double d);

  row(var v); 

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

  row operator* (double d);
  polynomial operator* (const polynomial& p);
  polynomial operator* (const var& v);
  polynomial operator* (const monomial& m);
  polynomial operator+ (const polynomial& p);
  polynomial operator- (const polynomial& p);
  row operator- (const var& v);
  row operator+ (const row& r1);
  row operator+ (const var& v);
  row operator+ (double d);
  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);
  row& operator-= (const row& r1);
  cons_obj* operator== (row r1);
  cons_obj* operator<= (row r1);
  cons_obj* operator>= (row r1);

  void normalize(bool clean = false);

  std::list<row_entry>::const_iterator begin() const;

  std::list<row_entry>::const_iterator end() const;

  std::list<row_entry>::iterator begin();

  std::list<row_entry>::iterator end();

  int size() const;

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

row operator*(double d, var v);

row operator*(double d, row r1);

}


#endif

---