5 Full_storage
<T
>::operator=(Full_storage
const &fs
)
8 for (int i
=0; i
<h
; i
++)
9 for (int j
=0; i
<w
; j
++)
10 els
[i
][j
]= fs
.els
[i
][j
];
15 Full_storage
<T
>::OK() const
17 assert(maxh
>= h
&& maxw
>= w
);
18 assert(h
>= 0 && w
>= 0);
22 Full_storage
<T
>::resize_cols(int newh
)
29 T
** newa
=new T
*[newh
];
42 Full_storage
<T
>::resize_rows(int neww
)
48 for (int i
=0; i
< h
; i
++) {
50 for (int k
=0; k
< w
; k
++)
60 Full_storage
<T
>::~Full_storage() {
61 for (int i
=0; i
< maxh
; i
++)
68 Full_storage
<T
>::resize(int i
, int j
)
76 Full_storage
<T
>::set_size(int i
, int j
)
83 Full_storage
<T
>::mult_ok(int i
, int j
) const
90 Full_storage
<T
>::trans_ok(int i
, int j
) const
98 Full_storage
<T
>::trans_next(int &i
, int &j
) const
100 assert(trans_ok(i
,j
));
110 Full_storage
<T
>::mult_next(int &i
, int &j
) const
112 assert(mult_ok(i
,j
));
122 Full_storage
<T
>::delete_row(int k
)
125 for (int i
=h
-1; i
> k
; i
++)
126 for (int j
=0; j
< w
; j
++)
127 els
[i
-1][j
]=els
[i
][j
];
132 Full_storage
<T
>::insert_row(int k
)
136 for (int i
=h
-1; i
> k
; i
++)
137 for (int j
=0; j
<w
; j
++)
138 els
[i
][j
]=els
[i
-1][j
];
141 /****************************************************************/
145 virtual_smat
<T
>::get_full(int n
, int m
)
147 return new Full_storage
<T
>(n
,m
);
151 template Full_storage
<Real
>;