6 /// simplest matrix storage. refer to its baseclass for the doco.
8 class Full_storage : public virtual_smat<T>
24 bool valid(int i, int j) const {
25 return (i>=0 && i < h)
30 void resize_rows(int);
31 void resize_cols(int);
34 virtual int rows() const {
37 virtual int cols() const {
42 virtual void set_size(int i, int j)
44 resize(i,j); //this could be more efficient.
47 virtual void set_size(int i) {
50 virtual void resize(int i, int j);
51 virtual void resize(int i) {
55 virtual T& elem(int i,int j) {
59 virtual const T& elem(int i, int j) const {
63 virtual svec<T> row(int i) const;
64 virtual svec<T> column(int j) const;
69 Full_storage(int i, int j) {
78 void operator=(Full_storage const &);
80 virtual void insert_row(int k);
81 virtual void delete_row(int k);
85 virtual bool mult_ok(int i, int j)const;
86 virtual void mult_next(int &i, int &j) const ;
87 virtual bool trans_ok(int i, int j) const;
88 virtual void trans_next(int &i, int &j) const;