// This file is part of Eigen, a lightweight C++ template library // for linear algebra. Eigen itself is part of the KDE project. // // Copyright (C) 2006-2008 Benoit Jacob // // 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 . #include "main.h" namespace Eigen { template void submatrices(const MatrixType& m) { /* this test covers the following files: Row.h Column.h Block.h Minor.h DiagonalCoeffs.h */ typedef typename MatrixType::Scalar Scalar; typedef Matrix VectorType; typedef Matrix RowVectorType; int rows = m.rows(); int cols = m.cols(); MatrixType m1 = MatrixType::random(rows, cols), m2 = MatrixType::random(rows, cols), m3(rows, cols), mzero = MatrixType::zero(rows, cols), identity = Matrix ::identity(rows, rows), square = Matrix ::random(rows, rows); VectorType v1 = VectorType::random(rows), v2 = VectorType::random(rows), v3 = VectorType::random(rows), vzero = VectorType::zero(rows); Scalar s1 = ei_random(); int r1 = ei_random(0,rows-1); int r2 = ei_random(r1,rows-1); int c1 = ei_random(0,cols-1); int c2 = ei_random(c1,cols-1); //check row() and col() VERIFY_IS_APPROX(m1.col(c1).transpose(), m1.transpose().row(c1)); VERIFY_IS_APPROX(square.row(r1).dot(m1.col(c1)), square.lazyProduct(m1.conjugate())(r1,c1)); //check operator(), both constant and non-constant, on row() and col() m1.row(r1) += s1 * m1.row(r2); m1.col(c1) += s1 * m1.col(c2); //check block() Matrix b1(1,1); b1(0,0) = m1(r1,c1); RowVectorType br1(m1.block(r1,0,1,cols)); VectorType bc1(m1.block(0,c1,rows,1)); VERIFY_IS_APPROX(b1, m1.block(r1,c1,1,1)); VERIFY_IS_APPROX(m1.row(r1), br1); VERIFY_IS_APPROX(m1.col(c1), bc1); //check operator(), both constant and non-constant, on block() m1.block(r1,c1,r2-r1+1,c2-c1+1) = s1 * m2.block(0, 0, r2-r1+1,c2-c1+1); m1.block(r1,c1,r2-r1+1,c2-c1+1)(r2-r1,c2-c1) = m2.block(0, 0, r2-r1+1,c2-c1+1)(0,0); //check minor() if(rows > 1 && cols > 1) { Matrix mi = m1.minor(0,0).eval(); VERIFY_IS_APPROX(mi, m1.block(1,1,rows-1,cols-1)); mi = m1.minor(r1,c1); VERIFY_IS_APPROX(mi.transpose(), m1.transpose().minor(c1,r1)); //check operator(), both constant and non-constant, on minor() m1.minor(r1,c1)(0,0) = m1.minor(0,0)(0,0); } //check diagonal() VERIFY_IS_APPROX(m1.diagonal(), m1.transpose().diagonal()); m2.diagonal() = 2 * m1.diagonal(); m2.diagonal()[0] *= 3; VERIFY_IS_APPROX(m2.diagonal()[0], static_cast(6) * m1.diagonal()[0]); } void EigenTest::testSubmatrices() { for(int i = 0; i < m_repeat; i++) { submatrices(Matrix()); submatrices(Matrix4d()); submatrices(MatrixXcf(3, 3)); submatrices(MatrixXi(8, 12)); submatrices(MatrixXcd(20, 20)); // test fixed block() separately as it is a template method so doesn't support // being called as a member of a class that is itself a template parameter // (at least as of g++ 4.2) Matrix m = Matrix::random(); float s = ei_random(); // test fixed block() as lvalue m.block<2,5>(1,1) *= s; // test operator() on fixed block() both as constant and non-constant m.block<2,5>(1,1)(0, 3) = m.block<2,5>(1,1)(1,2); // check that fixed block() and block() agree MatrixXf b = m.block<3,2>(3,3); VERIFY_IS_APPROX(b, m.block(3,3,3,2)); } } } // namespace Eigen