File size: 5,714 Bytes
7873319 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2019 David Tellenbach <david.tellenbach@tellnotes.org>
//
// 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/.
#include "main.h"
#define VERIFY_IMPLICIT_CONVERSION_3(DIAGTYPE, V0, V1, V2) \
DIAGTYPE d(V0, V1, V2); \
DIAGTYPE::DenseMatrixType Dense = d.toDenseMatrix(); \
VERIFY_IS_APPROX(Dense(0, 0), (Scalar)V0); \
VERIFY_IS_APPROX(Dense(1, 1), (Scalar)V1); \
VERIFY_IS_APPROX(Dense(2, 2), (Scalar)V2);
#define VERIFY_IMPLICIT_CONVERSION_4(DIAGTYPE, V0, V1, V2, V3) \
DIAGTYPE d(V0, V1, V2, V3); \
DIAGTYPE::DenseMatrixType Dense = d.toDenseMatrix(); \
VERIFY_IS_APPROX(Dense(0, 0), (Scalar)V0); \
VERIFY_IS_APPROX(Dense(1, 1), (Scalar)V1); \
VERIFY_IS_APPROX(Dense(2, 2), (Scalar)V2); \
VERIFY_IS_APPROX(Dense(3, 3), (Scalar)V3);
#define VERIFY_IMPLICIT_CONVERSION_5(DIAGTYPE, V0, V1, V2, V3, V4) \
DIAGTYPE d(V0, V1, V2, V3, V4); \
DIAGTYPE::DenseMatrixType Dense = d.toDenseMatrix(); \
VERIFY_IS_APPROX(Dense(0, 0), (Scalar)V0); \
VERIFY_IS_APPROX(Dense(1, 1), (Scalar)V1); \
VERIFY_IS_APPROX(Dense(2, 2), (Scalar)V2); \
VERIFY_IS_APPROX(Dense(3, 3), (Scalar)V3); \
VERIFY_IS_APPROX(Dense(4, 4), (Scalar)V4);
template<typename Scalar>
void constructorTest()
{
typedef DiagonalMatrix<Scalar, 0> DiagonalMatrix0;
typedef DiagonalMatrix<Scalar, 3> DiagonalMatrix3;
typedef DiagonalMatrix<Scalar, 4> DiagonalMatrix4;
typedef DiagonalMatrix<Scalar, Dynamic> DiagonalMatrixX;
Scalar raw[7];
for (int k = 0; k < 7; ++k) raw[k] = internal::random<Scalar>();
// Fixed-sized matrices
{
DiagonalMatrix0 a {{}};
VERIFY(a.rows() == 0);
VERIFY(a.cols() == 0);
typename DiagonalMatrix0::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
{
DiagonalMatrix3 a {{raw[0], raw[1], raw[2]}};
VERIFY(a.rows() == 3);
VERIFY(a.cols() == 3);
typename DiagonalMatrix3::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
{
DiagonalMatrix4 a {{raw[0], raw[1], raw[2], raw[3]}};
VERIFY(a.rows() == 4);
VERIFY(a.cols() == 4);
typename DiagonalMatrix4::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
// dynamically sized matrices
{
DiagonalMatrixX a{{}};
VERIFY(a.rows() == 0);
VERIFY(a.rows() == 0);
typename DiagonalMatrixX::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
{
DiagonalMatrixX a{{raw[0], raw[1], raw[2], raw[3], raw[4], raw[5], raw[6]}};
VERIFY(a.rows() == 7);
VERIFY(a.rows() == 7);
typename DiagonalMatrixX::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
}
template<>
void constructorTest<float>()
{
typedef float Scalar;
typedef DiagonalMatrix<Scalar, 0> DiagonalMatrix0;
typedef DiagonalMatrix<Scalar, 3> DiagonalMatrix3;
typedef DiagonalMatrix<Scalar, 4> DiagonalMatrix4;
typedef DiagonalMatrix<Scalar, 5> DiagonalMatrix5;
typedef DiagonalMatrix<Scalar, Dynamic> DiagonalMatrixX;
Scalar raw[7];
for (int k = 0; k < 7; ++k) raw[k] = internal::random<Scalar>();
// Fixed-sized matrices
{
DiagonalMatrix0 a {{}};
VERIFY(a.rows() == 0);
VERIFY(a.cols() == 0);
typename DiagonalMatrix0::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
{
DiagonalMatrix3 a {{raw[0], raw[1], raw[2]}};
VERIFY(a.rows() == 3);
VERIFY(a.cols() == 3);
typename DiagonalMatrix3::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
{
DiagonalMatrix4 a {{raw[0], raw[1], raw[2], raw[3]}};
VERIFY(a.rows() == 4);
VERIFY(a.cols() == 4);
typename DiagonalMatrix4::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
// dynamically sized matrices
{
DiagonalMatrixX a{{}};
VERIFY(a.rows() == 0);
VERIFY(a.rows() == 0);
typename DiagonalMatrixX::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
{
DiagonalMatrixX a{{raw[0], raw[1], raw[2], raw[3], raw[4], raw[5], raw[6]}};
VERIFY(a.rows() == 7);
VERIFY(a.rows() == 7);
typename DiagonalMatrixX::DenseMatrixType m = a.toDenseMatrix();
for (Index k = 0; k < a.rows(); ++k) VERIFY(m(k, k) == raw[k]);
}
{ VERIFY_IMPLICIT_CONVERSION_3(DiagonalMatrix3, 1.2647, 2.56f, -3); }
{ VERIFY_IMPLICIT_CONVERSION_4(DiagonalMatrix4, 1.2647, 2.56f, -3, 3.23f); }
{ VERIFY_IMPLICIT_CONVERSION_5(DiagonalMatrix5, 1.2647, 2.56f, -3, 3.23f, 2); }
}
EIGEN_DECLARE_TEST(diagonal_matrix_variadic_ctor)
{
CALL_SUBTEST_2(constructorTest<unsigned char>());
CALL_SUBTEST_2(constructorTest<float>());
CALL_SUBTEST_2(constructorTest<Index>());
CALL_SUBTEST_2(constructorTest<int>());
CALL_SUBTEST_2(constructorTest<long int>());
CALL_SUBTEST_2(constructorTest<std::ptrdiff_t>());
CALL_SUBTEST_2(constructorTest<std::complex<double>>());
}
|