25 #include "var_general_matrix.h"
39 template <
class AT>
class Vector<
Var,AT> :
public Matrix<General,Var,Fixed<1>,AT> {
46 typedef const AT* const_iterator;
48 typedef AT value_type;
70 Vector(
int m, Init ini=INIT,
const AT &a=0) : Matrix<General,Var,Fixed<1>,AT>(m,ini,a) { }
101 template<
class Type,
class Row,
class Col>
102 explicit Vector(
const Matrix<Type,Row,Col,AT> &A) : Matrix<General,Var,Fixed<1>,AT>(A) {
105 Vector<Var,AT>& resize() {
106 Matrix<General,Var,Fixed<1>,AT>::resize();
110 Vector<Var,AT>& resize(
int m, Noinit) {
111 Matrix<General,Var,Fixed<1>,AT>::resize(m,Noinit());
115 Vector<Var,AT>& resize(
int m, Init ini=INIT,
const AT &a=0) {
116 Matrix<General,Var,Fixed<1>,AT>::resize(m,ini,a);
126 inline Vector<Var,AT>& operator=(
const Vector<Var,AT> &x);
129 inline Vector<Var,AT>& operator=(
const Vector<Row,AT> &x);
138 inline Vector<Var,AT>& operator<<(const Vector<Row,AT> &x);
152 #ifndef FMATVEC_NO_BOUNDS_CHECK
166 #ifndef FMATVEC_NO_BOUNDS_CHECK
174 iterator begin() {
return &ele[0]; }
175 iterator end() {
return &ele[M]; }
176 const_iterator begin()
const {
return &ele[0]; }
177 const_iterator end()
const {
return &ele[M]; }
178 const_iterator cbegin() const noexcept {
return &ele[0]; }
179 const_iterator cend() const noexcept {
return &ele[M]; }
189 const AT&
e(
int i)
const {
202 inline Vector<Var,AT>& init(Noinit,
const AT& a=0) {
return *
this; }
216 int inc()
const {
return 1;};
224 inline operator std::vector<AT>()
const;
230 inline Vector(std::vector<AT> v);
245 for(
int i=0; i<M; i++)
258 #ifndef FMATVEC_NO_SIZE_CHECK
259 assert(M == x.
size());
268 template <
class AT>
template<
class Row>
276 #ifndef FMATVEC_NO_SIZE_CHECK
277 assert(M == x.size());
286 template <
class AT>
template<
class Row>
303 for(
int i=0; i<M; i++)
310 std::vector<AT> ret(size());
311 if(size()>0) memcpy(&ret[0], &
operator()(0),
sizeof(AT)*size());
317 if(size()>0) memcpy(&
operator()(0), &v[0],
sizeof(AT)*size());
322 #ifndef FMATVEC_NO_BOUNDS_CHECK
327 for(
int i=0; i<x.size(); i++)
328 x.e(i) = e(I.
start()+i);
333 template <
class AT>
template <
class Row>
334 inline void Vector<Var,AT>::set(
const Range<Var,Var> &I,
const Vector<Row,AT> &x) {
335 #ifndef FMATVEC_NO_BOUNDS_CHECK
336 assert(I.end()<size());
337 assert(I.size()==x.size());
340 for(
int i=I.start(), ii=0; i<=I.end(); i++, ii++)
344 template <
class AT>
template <
class Row>
345 inline void Vector<Var,AT>::add(
const Range<Var,Var> &I,
const Vector<Row,AT> &x) {
346 #ifndef FMATVEC_NO_BOUNDS_CHECK
347 assert(I.end()<size());
348 assert(I.size()==x.size());
351 for(
int i=I.start(), ii=0; i<=I.end(); i++, ii++)
357 template <
class AT>
template <
class Row>
358 inline void Vector<Var,AT>::deepCopy(
const Vector<Row,AT> &x) {
359 for(
int i=0; i<M; i++)
Vector()
Standard constructor.
Definition: var_vector.h:64
This is the basic matrix class for arbitrary matrices.
Definition: fmatvec.h:41
This is a vector class of general shape in dense storage format.
Definition: var_vector.h:39
Vector(const char *str)
String Constructor.
Definition: var_vector.h:84
const AT & operator()(int i) const
Element operator.
Definition: var_vector.h:164
int inc() const
Increment.
Definition: var_vector.h:216
const AT & e(int i) const
Element operator.
Definition: var_vector.h:189
Basic shape class for matrices.
Definition: types.h:100
int size() const
Size.
Definition: var_vector.h:208
Vector(const Vector< Var, AT > &x)
Copy Constructor.
Definition: var_vector.h:94
int end() const
Last element.
Definition: range.h:95
AT & operator()(int i)
Element operator.
Definition: var_vector.h:150
This is an index class for creating submatrices.
Definition: range.h:44
This is a vector class of general shape in dense storage format.
Definition: var_row_vector.h:39
int start() const
First element.
Definition: range.h:89