2007-10-14 00:56:24 +08:00
|
|
|
// This file is part of Eigen, a lightweight C++ template library
|
|
|
|
// for linear algebra. Eigen itself is part of the KDE project.
|
|
|
|
//
|
2008-01-07 17:34:21 +08:00
|
|
|
// Copyright (C) 2006-2008 Benoit Jacob <jacob@math.jussieu.fr>
|
2007-10-14 00:56:24 +08:00
|
|
|
//
|
|
|
|
// Eigen is free software; 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 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 General Public License for more
|
|
|
|
// details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU General Public License along
|
|
|
|
// with Eigen; if not, write to the Free Software Foundation, Inc., 51
|
|
|
|
// Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
//
|
|
|
|
// As a special exception, if other files instantiate templates or use macros
|
|
|
|
// or functions from this file, or you compile this file and link it
|
|
|
|
// with other works to produce a work based on this file, this file does not
|
|
|
|
// by itself cause the resulting work to be covered by the GNU General Public
|
|
|
|
// License. This exception does not invalidate any other reasons why a work
|
|
|
|
// based on this file might be covered by the GNU General Public License.
|
|
|
|
|
|
|
|
#include "main.h"
|
|
|
|
|
2007-12-03 02:32:59 +08:00
|
|
|
namespace Eigen {
|
|
|
|
|
2007-10-14 00:56:24 +08:00
|
|
|
template<typename MatrixType> void basicStuff(const MatrixType& m)
|
|
|
|
{
|
|
|
|
typedef typename MatrixType::Scalar Scalar;
|
2008-01-07 00:35:21 +08:00
|
|
|
typedef Matrix<Scalar, MatrixType::Traits::RowsAtCompileTime, 1> VectorType;
|
2007-12-26 01:20:58 +08:00
|
|
|
|
2007-10-14 00:56:24 +08:00
|
|
|
int rows = m.rows();
|
|
|
|
int cols = m.cols();
|
|
|
|
|
2007-11-26 16:47:07 +08:00
|
|
|
// this test relies a lot on Random.h, and there's not much more that we can do
|
|
|
|
// to test it, hence I consider that we will have tested Random.h
|
2007-10-14 00:56:24 +08:00
|
|
|
MatrixType m1 = MatrixType::random(rows, cols),
|
|
|
|
m2 = MatrixType::random(rows, cols),
|
2007-11-26 16:47:07 +08:00
|
|
|
m3(rows, cols),
|
2007-10-14 17:18:18 +08:00
|
|
|
mzero = MatrixType::zero(rows, cols),
|
2008-01-07 00:35:21 +08:00
|
|
|
identity = Matrix<Scalar, MatrixType::Traits::RowsAtCompileTime, MatrixType::Traits::RowsAtCompileTime>
|
2007-10-14 18:01:25 +08:00
|
|
|
::identity(rows),
|
2008-01-07 00:35:21 +08:00
|
|
|
square = Matrix<Scalar, MatrixType::Traits::RowsAtCompileTime, MatrixType::Traits::RowsAtCompileTime>
|
2007-10-14 17:18:18 +08:00
|
|
|
::random(rows, rows);
|
|
|
|
VectorType v1 = VectorType::random(rows),
|
|
|
|
v2 = VectorType::random(rows),
|
|
|
|
vzero = VectorType::zero(rows);
|
2007-10-14 00:56:24 +08:00
|
|
|
|
2007-12-13 01:48:20 +08:00
|
|
|
int r = random<int>(0, rows-1),
|
|
|
|
c = random<int>(0, cols-1);
|
|
|
|
|
2007-12-03 18:23:08 +08:00
|
|
|
VERIFY_IS_APPROX( v1, v1);
|
|
|
|
VERIFY_IS_NOT_APPROX( v1, 2*v1);
|
|
|
|
VERIFY_IS_MUCH_SMALLER_THAN( vzero, v1);
|
2007-12-03 02:32:59 +08:00
|
|
|
if(NumTraits<Scalar>::HasFloatingPoint)
|
2007-12-03 18:23:08 +08:00
|
|
|
VERIFY_IS_MUCH_SMALLER_THAN( vzero, v1.norm());
|
|
|
|
VERIFY_IS_NOT_MUCH_SMALLER_THAN(v1, v1);
|
|
|
|
VERIFY_IS_APPROX( vzero, v1-v1);
|
|
|
|
VERIFY_IS_APPROX( m1, m1);
|
|
|
|
VERIFY_IS_NOT_APPROX( m1, 2*m1);
|
|
|
|
VERIFY_IS_MUCH_SMALLER_THAN( mzero, m1);
|
|
|
|
VERIFY_IS_NOT_MUCH_SMALLER_THAN(m1, m1);
|
|
|
|
VERIFY_IS_APPROX( mzero, m1-m1);
|
2007-10-14 00:56:24 +08:00
|
|
|
|
2007-12-13 01:48:20 +08:00
|
|
|
// always test operator() on each read-only expression class,
|
|
|
|
// in order to check const-qualifiers.
|
|
|
|
// indeed, if an expression class (here Zero) is meant to be read-only,
|
|
|
|
// hence has no _write() method, the corresponding MatrixBase method (here zero())
|
|
|
|
// should return a const-qualified object so that it is the const-qualified
|
|
|
|
// operator() that gets called, which in turn calls _read().
|
2007-12-16 02:16:30 +08:00
|
|
|
VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::zero(rows,cols)(r,c), static_cast<Scalar>(1));
|
2007-12-13 01:48:20 +08:00
|
|
|
|
2007-12-26 01:20:58 +08:00
|
|
|
// now test copying a row-vector into a (column-)vector and conversely.
|
|
|
|
square.col(r) = square.row(r).eval();
|
2008-01-07 00:35:21 +08:00
|
|
|
Matrix<Scalar, 1, MatrixType::Traits::RowsAtCompileTime> rv(rows);
|
|
|
|
Matrix<Scalar, MatrixType::Traits::RowsAtCompileTime, 1> cv(rows);
|
2007-12-26 01:20:58 +08:00
|
|
|
rv = square.col(r);
|
|
|
|
cv = square.row(r);
|
|
|
|
VERIFY_IS_APPROX(rv, cv.transpose());
|
2007-10-14 00:56:24 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void EigenTest::testBasicStuff()
|
|
|
|
{
|
2007-12-11 18:07:18 +08:00
|
|
|
for(int i = 0; i < m_repeat; i++) {
|
2007-12-03 16:35:23 +08:00
|
|
|
basicStuff(Matrix<float, 1, 1>());
|
2007-12-05 15:22:22 +08:00
|
|
|
basicStuff(Matrix4d());
|
2007-12-03 16:35:23 +08:00
|
|
|
basicStuff(MatrixXcf(3, 3));
|
|
|
|
basicStuff(MatrixXi(8, 12));
|
2007-12-05 15:22:22 +08:00
|
|
|
basicStuff(MatrixXcd(20, 20));
|
2007-12-03 16:35:23 +08:00
|
|
|
}
|
2007-10-14 00:56:24 +08:00
|
|
|
}
|
2007-12-03 02:32:59 +08:00
|
|
|
|
|
|
|
} // namespace Eigen
|