// This file is part of Eigen, a lightweight C++ template library // for linear algebra. // // Copyright (C) 2013 Hauke Heibel // // 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" #include "AnnoyingScalar.h" #include "SafeScalar.h" #include using DenseStorageD3x3 = Eigen::DenseStorage; static_assert(std::is_trivially_move_constructible::value, "DenseStorage not trivially_move_constructible"); static_assert(std::is_trivially_move_assignable::value, "DenseStorage not trivially_move_assignable"); #if !defined(EIGEN_DENSE_STORAGE_CTOR_PLUGIN) static_assert(std::is_trivially_copy_constructible::value, "DenseStorage not trivially_copy_constructible"); static_assert(std::is_trivially_copy_assignable::value, "DenseStorage not trivially_copy_assignable"); static_assert(std::is_trivially_copyable::value, "DenseStorage not trivially_copyable"); #endif template void dense_storage_copy(int rows, int cols) { typedef DenseStorage DenseStorageType; const int size = rows * cols; DenseStorageType reference(size, rows, cols); T* raw_reference = reference.data(); for (int i = 0; i < size; ++i) raw_reference[i] = static_cast(i); DenseStorageType copied_reference(reference); const T* raw_copied_reference = copied_reference.data(); for (int i = 0; i < size; ++i) VERIFY_IS_EQUAL(raw_reference[i], raw_copied_reference[i]); } template void dense_storage_assignment(int rows, int cols) { typedef DenseStorage DenseStorageType; const int size = rows * cols; DenseStorageType reference(size, rows, cols); T* raw_reference = reference.data(); for (int i = 0; i < size; ++i) raw_reference[i] = static_cast(i); DenseStorageType copied_reference; copied_reference = reference; const T* raw_copied_reference = copied_reference.data(); for (int i = 0; i < size; ++i) VERIFY_IS_EQUAL(raw_reference[i], raw_copied_reference[i]); } template void dense_storage_swap(int rows0, int cols0, int rows1, int cols1) { typedef DenseStorage DenseStorageType; const int size0 = rows0 * cols0; DenseStorageType a(size0, rows0, cols0); for (int i = 0; i < size0; ++i) { a.data()[i] = static_cast(i); } const int size1 = rows1 * cols1; DenseStorageType b(size1, rows1, cols1); for (int i = 0; i < size1; ++i) { b.data()[i] = static_cast(-i); } a.swap(b); for (int i = 0; i < size0; ++i) { VERIFY_IS_EQUAL(b.data()[i], static_cast(i)); } for (int i = 0; i < size1; ++i) { VERIFY_IS_EQUAL(a.data()[i], static_cast(-i)); } } template void dense_storage_alignment() { struct alignas(Alignment) Empty1 {}; VERIFY_IS_EQUAL(std::alignment_of::value, Alignment); struct EIGEN_ALIGN_TO_BOUNDARY(Alignment) Empty2 {}; VERIFY_IS_EQUAL(std::alignment_of::value, Alignment); struct Nested1 { EIGEN_ALIGN_TO_BOUNDARY(Alignment) T data[Size]; }; VERIFY_IS_EQUAL(std::alignment_of::value, Alignment); VERIFY_IS_EQUAL((std::alignment_of >::value), Alignment); const std::size_t default_alignment = internal::compute_default_alignment::value; if (default_alignment > 0) { VERIFY_IS_EQUAL((std::alignment_of >::value), default_alignment); VERIFY_IS_EQUAL((std::alignment_of >::value), default_alignment); struct Nested2 { Matrix mat; }; VERIFY_IS_EQUAL(std::alignment_of::value, default_alignment); } } template void dense_storage_tests() { // Dynamic Storage. dense_storage_copy(4, 3); dense_storage_copy(4, 3); dense_storage_copy(4, 3); // Fixed Storage. dense_storage_copy(4, 3); dense_storage_copy(4, 3); dense_storage_copy(4, 3); dense_storage_copy(4, 3); // Fixed Storage with Uninitialized Elements. dense_storage_copy(4, 3); dense_storage_copy(4, 3); dense_storage_copy(4, 3); // Dynamic Storage. dense_storage_assignment(4, 3); dense_storage_assignment(4, 3); dense_storage_assignment(4, 3); // Fixed Storage. dense_storage_assignment(4, 3); dense_storage_assignment(4, 3); dense_storage_assignment(4, 3); dense_storage_assignment(4, 3); // Fixed Storage with Uninitialized Elements. dense_storage_assignment(4, 3); dense_storage_assignment(4, 3); dense_storage_assignment(4, 3); // Dynamic Storage. dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 2, 1); dense_storage_swap(2, 1, 4, 3); dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 2, 3); dense_storage_swap(2, 3, 4, 3); dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 4, 1); dense_storage_swap(4, 1, 4, 3); // Fixed Storage. dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 2, 1); dense_storage_swap(2, 1, 4, 3); dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 4, 1); dense_storage_swap(4, 1, 4, 3); dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 2, 3); dense_storage_swap(2, 3, 4, 3); // Fixed Storage with Uninitialized Elements. dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 2, 1); dense_storage_swap(2, 1, 4, 3); dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 4, 1); dense_storage_swap(4, 1, 4, 3); dense_storage_swap(4, 3, 4, 3); dense_storage_swap(4, 3, 2, 3); dense_storage_swap(2, 3, 4, 3); dense_storage_alignment(); dense_storage_alignment(); dense_storage_alignment(); dense_storage_alignment(); } EIGEN_DECLARE_TEST(dense_storage) { dense_storage_tests(); dense_storage_tests(); dense_storage_tests >(); dense_storage_tests(); }