// This file is part of Eigen, a lightweight C++ template library // for linear algebra. // // Copyright (C) 2006-2010 Benoit Jacob <jacob.benoit.1@gmail.com> // // This Source Code Form is subject to the terms of the Mozilla // Public License v. 2.0. If a copy of the MPL was not distributed // with this file, You can obtain one at http://mozilla.org/MPL/2.0/. #define EIGEN_NO_STATIC_ASSERT // otherwise we fail at compile time on unused paths #include "main.h" template <typename MatrixType, typename Index, typename Scalar>typename Eigen::internal::enable_if<!NumTraits<typename MatrixType::Scalar>::IsComplex,typename MatrixType::Scalar>::typeconst MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) {// check cwise-Functions: ock(r1,c1,r2-r1+1,c2-c1+1));ock(r1,c1,r2-r1+1,c2-c1+1));return Scalar(0);template <typename MatrixType, typename Index, typename Scalar>typename Eigen::internal::enable_if<NumTraits<typename MatrixType::Scalar>::IsComplex,typename MatrixType::Scalar>::typeconst MatrixType &, Index, Index, Index, Index, const Scalar&) {return Scalar(0);// Check at compile-time that T1==T2, and at runtime-time that a==b template <typename T1,typename T2>typename internal::enable_if<internal::is_same<T1,T2>::value,bool >::typeconst T1& a, const T2& b)return a.isApprox(b);template <typename MatrixType> void block(const MatrixType& m)typedef typename MatrixType::Scalar Scalar;typedef typename MatrixType::RealScalar RealScalar;typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;typedef Matrix<Scalar, 1, MatrixType::ColsAtCompileTime> RowVectorType;typedef Matrix<Scalar, Dynamic, Dynamic, MatrixType::IsRowMajor?RowMajor:ColMajor> DynamicMatrixType;typedef Matrix<Scalar, Dynamic, 1> DynamicVectorType;//check row() and col() //check operator(), both constant and non-constant, on row() and col() // check nested block xpr on lhs //check block() //check operator(), both constant and non-constant, on block() const Index BlockRows = 2;const Index BlockCols = 5;if (rows>=5 && cols>=8)// test fixed block() as lvalue template block<BlockRows,BlockCols>(1,1) *= s1;// test operator() on fixed block() both as constant and non-constant template block<BlockRows,BlockCols>(1,1)(0, 3) = m1.template block<2,5>(1,1)(1,2);// check that fixed block() and block() agree template block<BlockRows,BlockCols>(3,3);// same tests with mixed fixed/dynamic size template block<BlockRows,Dynamic>(1,1,BlockRows,BlockCols) *= s1;template block<BlockRows,Dynamic>(1,1,BlockRows,BlockCols)(0,3) = m1.template block<2,5>(1,1)(1,2);template block<Dynamic,BlockCols>(3,3,2,5);lockRows),fix<Dynamic>(BlockCols))));template block<BlockRows,Dynamic>(1,1,BlockRows,BlockCols), m1.block(1,1,fix<BlockRows>,BlockCols)));template block<BlockRows,BlockCols>(1,1,BlockRows,BlockCols), m1.block(1,1,fix<BlockRows>(),fix<BlockCols>)));template block<BlockRows,BlockCols>(1,1,BlockRows,BlockCols), m1.block(1,1,fix<BlockRows>,fix<BlockCols>(BlockCols))));if (rows>2)// test sub vectors template head<2>(), v1.block(0,0,2,1));template head<2>(), v1.head(2));template head<2>(), v1.segment(0,2));template head<2>(), v1.template segment<2>(0));template tail<2>(), v1.block(i,0,2,1));template tail<2>(), v1.tail(2));template tail<2>(), v1.segment(i,2));template tail<2>(), v1.template segment<2>(i));template segment<2>(i));// stress some basic stuffs with block matrices // check that linear acccessors works on blocks if ((MatrixType::Flags&RowMajorBit)==0)else // now test some block-inside-of-block. // expressions with direct access c2)) , (m1.block(r2,c2,rows-r2,cols-c2)) );c2-c1+1)) );r2-r1+1)) );.segment(c1,c2-c1+1)).transpose() );.segment(c1,c2-c1+1)).transpose() );// expressions without direct access ,cols-c2)) , ((m1+m2).block(r2,c2,rows-r2,cols-c2)) );segment(c1,c2-c1+1)) );ow(r1).segment(c1,c2-c1+1)) );segment(r1,r2-r1+1)) );m2).row(r1).segment(c1,c2-c1+1)).transpose() );m2).row(r1).segment(c1,c2-c1+1)).transpose() );template block<Dynamic,1>(r1,c1,r2-r1+1,1)) , ((m1+m2).eval().col(c1).eval().segment(r1,r2-r1+1)) );template block<1,Dynamic>(r1,c1,1,c2-c1+1)) , ((m1+m2).eval().row(r1).eval().segment(c1,c2-c1+1)) );template block<1,Dynamic>(c1,r1,1,r2-r1+1)) , ((m1+m2).eval().col(c1).eval().segment(r1,r2-r1+1)).transpose() );1) );1) );ment(c1,c2-c1+1).eval() );rse().eval().segment(r1,r2-r1+1).eval() );Rows(c1,c2-c1+1) );Cols(r1,r2-r1+1) );// evaluation into plain matrices from expressions with direct access (stress MapBase) template block<Dynamic,1>(1,0,0,1)), m1.block(1,0,0,1));template block<1,Dynamic>(0,1,1,0)), m1.block(0,1,1,0));template block<Dynamic,1>(1,0,0,1)), m1.block(1,0,0,1));template block<1,Dynamic>(0,1,1,0)), m1.block(0,1,1,0));if (rows>=2 && cols>=2)template subVector<Horizontal>(r1), m1.row(r1) );template subVector<Horizontal>(r1), (m1+m1).row(r1) );template subVector<Vertical>(c1), m1.col(c1) );template subVector<Vertical>(c1), (m1+m1).col(c1) );template subVectors<Horizontal>(), m1.rows() );template subVectors<Vertical>(), m1.cols() );if (rows>=2 || cols>=2) {int (m1.middleCols(0,0).IsRowMajor), int (m1.IsRowMajor) );int (m1.middleRows(0,0).IsRowMajor), int (m1.IsRowMajor) );template <typename MatrixType>void compare_using_data_and_stride(const MatrixType& m)const typename MatrixType::Scalar* data = m.data();for (int j=0;j<cols;++j)for (int i=0;i<rows;++i)if (!MatrixType::IsVectorAtCompileTime)for (int j=0;j<cols;++j)for (int i=0;i<rows;++i)if (MatrixType::IsVectorAtCompileTime)int ((&m.coeff(1))-(&m.coeff(0))));for (int i=0;i<size;++i)template <typename MatrixType>void data_and_stride(const MatrixType& m)for (int i = 0; i < g_repeat; i++) {float , 1, 1>()) );float , 1, Dynamic>(internal::random(2,50))) );float , Dynamic, 1>(internal::random(2,50))) );int ,Dynamic,Dynamic,RowMajor>(internal::random(2,50), internal::random(2,50))) );float ,Dynamic,4>(3, 4)) );#ifndef EIGEN_DEFAULT_TO_ROW_MAJOR5,50))) );int ,Dynamic,Dynamic,RowMajor>(internal::random(5,50), internal::random(5,50))) );#endif quality 90%
¤ Dauer der Verarbeitung: 0.15 Sekunden
(vorverarbeitet)
¤ *© Formatika GbR, Deutschland
