mirror of
https://gitlab.com/libeigen/eigen.git
synced 2025-02-05 17:50:26 +08:00
83 lines
2.7 KiB
C++
83 lines
2.7 KiB
C++
// This file is part of Eigen, a lightweight C++ template library
|
|
// for linear algebra. Eigen itself is part of the KDE project.
|
|
//
|
|
// Copyright (C) 2008 Gael Guennebaud <g.gael@free.fr>
|
|
//
|
|
// Eigen is free software; you can redistribute it and/or
|
|
// modify it under the terms of the GNU Lesser General Public
|
|
// License as published by the Free Software Foundation; either
|
|
// version 3 of the License, or (at your option) any later version.
|
|
//
|
|
// Alternatively, you can redistribute it and/or
|
|
// modify it under the terms of the GNU General Public License as
|
|
// published by the Free Software Foundation; either version 2 of
|
|
// the License, or (at your option) any later version.
|
|
//
|
|
// Eigen is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
// License and a copy of the GNU General Public License along with
|
|
// Eigen. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#include "main.h"
|
|
#include <Eigen/StdVector>
|
|
|
|
template<typename MatrixType>
|
|
void check_stdvector(const MatrixType& m)
|
|
{
|
|
int rows = m.rows();
|
|
int cols = m.cols();
|
|
MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
|
|
std::vector<MatrixType> v(10, MatrixType(rows,cols)), w(20, y);
|
|
v[5] = x;
|
|
w[6] = v[5];
|
|
VERIFY_IS_APPROX(w[6], v[5]);
|
|
v = w;
|
|
for(int i = 0; i < 20; i++)
|
|
{
|
|
VERIFY_IS_APPROX(w[i], v[i]);
|
|
}
|
|
|
|
v.resize(21);
|
|
v[20].set(x);
|
|
VERIFY_IS_APPROX(v[20], x);
|
|
v.resize(22,y);
|
|
VERIFY_IS_APPROX(v[21], y);
|
|
v.push_back(x);
|
|
VERIFY_IS_APPROX(v[22], x);
|
|
VERIFY((size_t)&(v[22]) == (size_t)&(v[21]) + sizeof(MatrixType));
|
|
|
|
// do a lot of push_back such that the vector gets internally resized
|
|
// (with memory reallocation)
|
|
MatrixType* ref = &w[0];
|
|
for(int i=0; i<30 | ((ref==&w[0]) && i<300); ++i)
|
|
v.push_back(w[i%w.size()]);
|
|
for(int i=23; i<v.size(); ++i)
|
|
{
|
|
VERIFY(v[i]==w[(i-23)%w.size()]);
|
|
}
|
|
}
|
|
|
|
void test_stdvector()
|
|
{
|
|
// some non vectorizable fixed sizes
|
|
CALL_SUBTEST(check_stdvector(Vector2f()));
|
|
CALL_SUBTEST(check_stdvector(Matrix3f()));
|
|
CALL_SUBTEST(check_stdvector(Matrix3d()));
|
|
|
|
// some vectorizable fixed sizes
|
|
CALL_SUBTEST(check_stdvector(Matrix2f()));
|
|
CALL_SUBTEST(check_stdvector(Vector4f()));
|
|
CALL_SUBTEST(check_stdvector(Matrix4f()));
|
|
CALL_SUBTEST(check_stdvector(Matrix4d()));
|
|
|
|
// some dynamic sizes
|
|
CALL_SUBTEST(check_stdvector(MatrixXd(1,1)));
|
|
CALL_SUBTEST(check_stdvector(VectorXd(20)));
|
|
CALL_SUBTEST(check_stdvector(RowVectorXf(20)));
|
|
CALL_SUBTEST(check_stdvector(MatrixXcf(10,10)));
|
|
}
|