25 #include "general_matrix.h"
48 typedef const AT* const_iterator;
50 typedef AT value_type;
58 friend class Vector<Ref,AT>;
68 const AT* elePtr(
int i)
const {
69 return tp ? ele+i : ele+lda*i;
73 return tp ? ele+i : ele+lda*i;
76 RowVector(
int n_,
int lda_,
bool tp, Memory<AT> memory,
const AT* ele_) :
Matrix<General,Ref,Ref,AT>(1,n_, lda_, tp, memory, ele_) {
93 RowVector(
int n, Init ini=INIT,
const AT &a=0) : Matrix<General,Ref,Ref,AT>(1,n,ini,a) { }
117 #ifndef FMATVEC_NO_SIZE_CHECK
127 LogicAssert(x.
rows()==1,
"Number of cols() must be 1 in RowVector<Ref,AT>::RowVector(const Matrix<General,Ref,Ref,AT> &x)");
135 RowVector<Ref,AT>& resize(
int n, Noinit) {
136 Matrix<General,Ref,Ref,AT>::resize(1,n,Noinit());
140 RowVector<Ref,AT>& resize(
int n, Init ini=INIT,
const AT &a=0) {
141 Matrix<General,Ref,Ref,AT>::resize(1,n,ini,a);
195 #ifndef FMATVEC_NO_BOUNDS_CHECK
207 #ifndef FMATVEC_NO_BOUNDS_CHECK
218 iterator begin() { assert(lda==1);
return &ele[0]; }
219 iterator end() { assert(lda==1);
return &ele[n*lda]; }
220 const_iterator begin()
const { assert(lda==1);
return &ele[0]; }
221 const_iterator end()
const { assert(lda==1);
return &ele[n*lda]; }
222 const_iterator cbegin() const noexcept { assert(lda==1);
return &ele[0]; }
223 const_iterator cend() const noexcept { assert(lda==1);
return &ele[n*lda]; }
225 const AT& er(
int i)
const {
233 const AT& et(
int i)
const {
238 return tp ? et(i) : er(i);
241 const AT& e(
int i)
const {
242 return tp ? et(i) : er(i);
252 inline RowVector<Ref,AT>& init(
const AT& val);
253 inline RowVector<Ref,AT>& init(Init,
const AT &a=0) {
return init(a); }
254 inline RowVector<Ref,AT>& init(Noinit,
const AT &a=0) {
return *
this; }
268 int inc()
const {
return tp?1:lda;};
316 const Vector<Ref,AT> T()
const {
317 return Vector<Ref,AT>(n,lda,tp?
false:
true,memory,ele);
328 for(
int i=0; i<n; i++)
332 for(
int i=0; i<n; i++)
348 ele = (AT*)memory.get();
350 #ifndef FMATVEC_NO_SIZE_CHECK
351 assert(n == x.
size());
360 template <
class AT>
template<
class Row>
369 ele = (AT*)memory.get();
371 #ifndef FMATVEC_NO_SIZE_CHECK
372 assert(n == x.size());
390 ele = (AT*)memory.get();
433 #ifndef FMATVEC_NO_BOUNDS_CHECK
443 #ifndef FMATVEC_NO_BOUNDS_CHECK
456 for(
int i=0; i<size(); i++)
459 for(
int i=0; i<size(); i++)
464 for(
int i=0; i<size(); i++)
467 for(
int i=0; i<size(); i++)
472 template <
class AT>
template <
class Col>
473 inline void RowVector<Ref,AT>::deepCopy(
const RowVector<Col,AT> &x) {
475 for(
int i=0; i<size(); i++)
478 for(
int i=0; i<size(); i++)
const AT & operator()(int i) const
Element operator.
Definition: row_vector.h:206
AT & operator()(int i)
Element operator.
Definition: row_vector.h:194
This is the basic matrix class for arbitrary matrices.
Definition: fmatvec.h:41
int size() const
Size.
Definition: row_vector.h:260
RowVector(int n, AT *ele)
Regular Constructor.
Definition: row_vector.h:101
int rows() const
Number of rows.
Definition: general_matrix.h:273
int inc() const
Increment.
Definition: row_vector.h:268
This is a rowvector class of general shape in dense storage format.
Definition: row_vector.h:36
RowVector(const RowVector< Ref, AT > &x)
Copy Constructor.
Definition: row_vector.h:152
This is a matrix class for general matrices.
Definition: general_matrix.h:41
std::istream & operator>>(std::istream &is, Matrix< Type, Row, Col, AT > &A)
Matrix input.
Definition: matrix.h:166
RowVector(const char *str)
String Constructor.
Definition: row_vector.h:116
RowVector< Ref, AT > trans(const Vector< Ref, AT > &x)
Transpose of a vector.
Definition: linear_algebra.h:1470
Basic shape class for matrices.
Definition: types.h:100
This is a vector class of general shape in dense storage format.
Definition: vector.h:39
int end() const
Last element.
Definition: range.h:95
RowVector(const Matrix< General, Ref, Ref, AT > &x)
Copy Constructor.
Definition: row_vector.h:126
RowVector()
Standard constructor.
Definition: row_vector.h:87
This is an index class for creating submatrices.
Definition: range.h:44
int start() const
First element.
Definition: range.h:89