devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Clang-format tests, examples, libraries, benchmarks, etc.

Browse Source
This commit is contained in:
Antonio Sánchez
2023-12-05 21:22:55 +00:00
committed by Rasmus Munk Larsen
parent 3252ecc7a4
commit 46e9cdb7fe
876 changed files with 33453 additions and 37795 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
test/bandmatrix.cpp
View File

@@ -9,63 +9,58 @@
#include "main.h"
template<typename MatrixType> void bandmatrix(const MatrixType& _m)
{
template <typename MatrixType>
void bandmatrix(const MatrixType& _m) {
typedef typename MatrixType::Scalar Scalar;
typedef typename NumTraits<Scalar>::Real RealScalar;
typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrixType;
typedef Matrix<Scalar, Dynamic, Dynamic> DenseMatrixType;
Index rows = _m.rows();
Index cols = _m.cols();
Index supers = _m.supers();
Index subs = _m.subs();
MatrixType m(rows,cols,supers,subs);
MatrixType m(rows, cols, supers, subs);
DenseMatrixType dm1(rows,cols);
DenseMatrixType dm1(rows, cols);
dm1.setZero();
m.diagonal().setConstant(123);
dm1.diagonal().setConstant(123);
for (int i=1; i<=m.supers();++i)
{
for (int i = 1; i <= m.supers(); ++i) {
m.diagonal(i).setConstant(static_cast<RealScalar>(i));
dm1.diagonal(i).setConstant(static_cast<RealScalar>(i));
}
for (int i=1; i<=m.subs();++i)
{
for (int i = 1; i <= m.subs(); ++i) {
m.diagonal(-i).setConstant(-static_cast<RealScalar>(i));
dm1.diagonal(-i).setConstant(-static_cast<RealScalar>(i));
}
//std::cerr << m.m_data << "\n\n" << m.toDense() << "\n\n" << dm1 << "\n\n\n\n";
VERIFY_IS_APPROX(dm1,m.toDenseMatrix());
// std::cerr << m.m_data << "\n\n" << m.toDense() << "\n\n" << dm1 << "\n\n\n\n";
VERIFY_IS_APPROX(dm1, m.toDenseMatrix());
for (int i=0; i<cols; ++i)
{
m.col(i).setConstant(static_cast<RealScalar>(i+1));
dm1.col(i).setConstant(static_cast<RealScalar>(i+1));
for (int i = 0; i < cols; ++i) {
m.col(i).setConstant(static_cast<RealScalar>(i + 1));
dm1.col(i).setConstant(static_cast<RealScalar>(i + 1));
}
Index d = (std::min)(rows,cols);
Index a = std::max<Index>(0,cols-d-supers);
Index b = std::max<Index>(0,rows-d-subs);
if(a>0) dm1.block(0,d+supers,rows,a).setZero();
dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero();
if(b>0) dm1.block(d+subs,0,b,cols).setZero();
//std::cerr << m.m_data << "\n\n" << m.toDense() << "\n\n" << dm1 << "\n\n";
VERIFY_IS_APPROX(dm1,m.toDenseMatrix());
Index d = (std::min)(rows, cols);
Index a = std::max<Index>(0, cols - d - supers);
Index b = std::max<Index>(0, rows - d - subs);
if (a > 0) dm1.block(0, d + supers, rows, a).setZero();
dm1.block(0, supers + 1, cols - supers - 1 - a, cols - supers - 1 - a).template triangularView<Upper>().setZero();
dm1.block(subs + 1, 0, rows - subs - 1 - b, rows - subs - 1 - b).template triangularView<Lower>().setZero();
if (b > 0) dm1.block(d + subs, 0, b, cols).setZero();
// std::cerr << m.m_data << "\n\n" << m.toDense() << "\n\n" << dm1 << "\n\n";
VERIFY_IS_APPROX(dm1, m.toDenseMatrix());
}
using Eigen::internal::BandMatrix;
EIGEN_DECLARE_TEST(bandmatrix)
{
for(int i = 0; i < 10*g_repeat ; i++) {
Index rows = internal::random<Index>(1,10);
Index cols = internal::random<Index>(1,10);
Index sups = internal::random<Index>(0,cols-1);
Index subs = internal::random<Index>(0,rows-1);
CALL_SUBTEST(bandmatrix(BandMatrix<float>(rows,cols,sups,subs)) );
EIGEN_DECLARE_TEST(bandmatrix) {
for (int i = 0; i < 10 * g_repeat; i++) {
Index rows = internal::random<Index>(1, 10);
Index cols = internal::random<Index>(1, 10);
Index sups = internal::random<Index>(0, cols - 1);
Index subs = internal::random<Index>(0, rows - 1);
CALL_SUBTEST(bandmatrix(BandMatrix<float>(rows, cols, sups, subs)));
}
}