From f0238cfb6997c4acfc2bd200de7295f3fa36968f Mon Sep 17 00:00:00 2001 From: Stanislaw Halik Date: Sun, 3 Mar 2019 21:09:10 +0100 Subject: don't index Eigen --- eigen/test/mapstride.cpp | 234 ----------------------------------------------- 1 file changed, 234 deletions(-) delete mode 100644 eigen/test/mapstride.cpp (limited to 'eigen/test/mapstride.cpp') diff --git a/eigen/test/mapstride.cpp b/eigen/test/mapstride.cpp deleted file mode 100644 index d785148..0000000 --- a/eigen/test/mapstride.cpp +++ /dev/null @@ -1,234 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Benoit Jacob -// -// 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" - -template void map_class_vector(const VectorType& m) -{ - typedef typename VectorType::Scalar Scalar; - - Index size = m.size(); - - VectorType v = VectorType::Random(size); - - Index arraysize = 3*size; - - Scalar* a_array = internal::aligned_new(arraysize+1); - Scalar* array = a_array; - if(Alignment!=Aligned) - array = (Scalar*)(internal::IntPtr(a_array) + (internal::packet_traits::AlignedOnScalar?sizeof(Scalar):sizeof(typename NumTraits::Real))); - - { - Map > map(array, size); - map = v; - for(int i = 0; i < size; ++i) - { - VERIFY(array[3*i] == v[i]); - VERIFY(map[i] == v[i]); - } - } - - { - Map > map(array, size, InnerStride(2)); - map = v; - for(int i = 0; i < size; ++i) - { - VERIFY(array[2*i] == v[i]); - VERIFY(map[i] == v[i]); - } - } - - internal::aligned_delete(a_array, arraysize+1); -} - -template void map_class_matrix(const MatrixType& _m) -{ - typedef typename MatrixType::Scalar Scalar; - - Index rows = _m.rows(), cols = _m.cols(); - - MatrixType m = MatrixType::Random(rows,cols); - Scalar s1 = internal::random(); - - Index arraysize = 4*(rows+4)*(cols+4); - - Scalar* a_array1 = internal::aligned_new(arraysize+1); - Scalar* array1 = a_array1; - if(Alignment!=Aligned) - array1 = (Scalar*)(internal::IntPtr(a_array1) + (internal::packet_traits::AlignedOnScalar?sizeof(Scalar):sizeof(typename NumTraits::Real))); - - Scalar a_array2[256]; - Scalar* array2 = a_array2; - if(Alignment!=Aligned) - array2 = (Scalar*)(internal::IntPtr(a_array2) + (internal::packet_traits::AlignedOnScalar?sizeof(Scalar):sizeof(typename NumTraits::Real))); - else - array2 = (Scalar*)(((internal::UIntPtr(a_array2)+EIGEN_MAX_ALIGN_BYTES-1)/EIGEN_MAX_ALIGN_BYTES)*EIGEN_MAX_ALIGN_BYTES); - Index maxsize2 = a_array2 - array2 + 256; - - // test no inner stride and some dynamic outer stride - for(int k=0; k<2; ++k) - { - if(k==1 && (m.innerSize()+1)*m.outerSize() > maxsize2) - break; - Scalar* array = (k==0 ? array1 : array2); - - Map > map(array, rows, cols, OuterStride(m.innerSize()+1)); - map = m; - VERIFY(map.outerStride() == map.innerSize()+1); - for(int i = 0; i < m.outerSize(); ++i) - for(int j = 0; j < m.innerSize(); ++j) - { - VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j)); - VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j)); - } - VERIFY_IS_APPROX(s1*map,s1*m); - map *= s1; - VERIFY_IS_APPROX(map,s1*m); - } - - // test no inner stride and an outer stride of +4. This is quite important as for fixed-size matrices, - // this allows to hit the special case where it's vectorizable. - for(int k=0; k<2; ++k) - { - if(k==1 && (m.innerSize()+4)*m.outerSize() > maxsize2) - break; - Scalar* array = (k==0 ? array1 : array2); - - enum { - InnerSize = MatrixType::InnerSizeAtCompileTime, - OuterStrideAtCompileTime = InnerSize==Dynamic ? Dynamic : InnerSize+4 - }; - Map > - map(array, rows, cols, OuterStride(m.innerSize()+4)); - map = m; - VERIFY(map.outerStride() == map.innerSize()+4); - for(int i = 0; i < m.outerSize(); ++i) - for(int j = 0; j < m.innerSize(); ++j) - { - VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j)); - VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j)); - } - VERIFY_IS_APPROX(s1*map,s1*m); - map *= s1; - VERIFY_IS_APPROX(map,s1*m); - } - - // test both inner stride and outer stride - for(int k=0; k<2; ++k) - { - if(k==1 && (2*m.innerSize()+1)*(m.outerSize()*2) > maxsize2) - break; - Scalar* array = (k==0 ? array1 : array2); - - Map > map(array, rows, cols, Stride(2*m.innerSize()+1, 2)); - map = m; - VERIFY(map.outerStride() == 2*map.innerSize()+1); - VERIFY(map.innerStride() == 2); - for(int i = 0; i < m.outerSize(); ++i) - for(int j = 0; j < m.innerSize(); ++j) - { - VERIFY(array[map.outerStride()*i+map.innerStride()*j] == m.coeffByOuterInner(i,j)); - VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j)); - } - VERIFY_IS_APPROX(s1*map,s1*m); - map *= s1; - VERIFY_IS_APPROX(map,s1*m); - } - - // test inner stride and no outer stride - for(int k=0; k<2; ++k) - { - if(k==1 && (m.innerSize()*2)*m.outerSize() > maxsize2) - break; - Scalar* array = (k==0 ? array1 : array2); - - Map > map(array, rows, cols, InnerStride(2)); - map = m; - VERIFY(map.outerStride() == map.innerSize()*2); - for(int i = 0; i < m.outerSize(); ++i) - for(int j = 0; j < m.innerSize(); ++j) - { - VERIFY(array[map.innerSize()*i*2+j*2] == m.coeffByOuterInner(i,j)); - VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j)); - } - VERIFY_IS_APPROX(s1*map,s1*m); - map *= s1; - VERIFY_IS_APPROX(map,s1*m); - } - - internal::aligned_delete(a_array1, arraysize+1); -} - -// Additional tests for inner-stride but no outer-stride -template -void bug1453() -{ - const int data[] = {0,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}; - typedef Matrix RowMatrixXi; - typedef Matrix ColMatrix23i; - typedef Matrix ColMatrix32i; - typedef Matrix RowMatrix23i; - typedef Matrix RowMatrix32i; - - VERIFY_IS_APPROX(MatrixXi::Map(data, 2, 3, InnerStride<2>()), MatrixXi::Map(data, 2, 3, Stride<4,2>())); - VERIFY_IS_APPROX(MatrixXi::Map(data, 2, 3, InnerStride<>(2)), MatrixXi::Map(data, 2, 3, Stride<4,2>())); - VERIFY_IS_APPROX(MatrixXi::Map(data, 3, 2, InnerStride<2>()), MatrixXi::Map(data, 3, 2, Stride<6,2>())); - VERIFY_IS_APPROX(MatrixXi::Map(data, 3, 2, InnerStride<>(2)), MatrixXi::Map(data, 3, 2, Stride<6,2>())); - - VERIFY_IS_APPROX(RowMatrixXi::Map(data, 2, 3, InnerStride<2>()), RowMatrixXi::Map(data, 2, 3, Stride<6,2>())); - VERIFY_IS_APPROX(RowMatrixXi::Map(data, 2, 3, InnerStride<>(2)), RowMatrixXi::Map(data, 2, 3, Stride<6,2>())); - VERIFY_IS_APPROX(RowMatrixXi::Map(data, 3, 2, InnerStride<2>()), RowMatrixXi::Map(data, 3, 2, Stride<4,2>())); - VERIFY_IS_APPROX(RowMatrixXi::Map(data, 3, 2, InnerStride<>(2)), RowMatrixXi::Map(data, 3, 2, Stride<4,2>())); - - VERIFY_IS_APPROX(ColMatrix23i::Map(data, InnerStride<2>()), MatrixXi::Map(data, 2, 3, Stride<4,2>())); - VERIFY_IS_APPROX(ColMatrix23i::Map(data, InnerStride<>(2)), MatrixXi::Map(data, 2, 3, Stride<4,2>())); - VERIFY_IS_APPROX(ColMatrix32i::Map(data, InnerStride<2>()), MatrixXi::Map(data, 3, 2, Stride<6,2>())); - VERIFY_IS_APPROX(ColMatrix32i::Map(data, InnerStride<>(2)), MatrixXi::Map(data, 3, 2, Stride<6,2>())); - - VERIFY_IS_APPROX(RowMatrix23i::Map(data, InnerStride<2>()), RowMatrixXi::Map(data, 2, 3, Stride<6,2>())); - VERIFY_IS_APPROX(RowMatrix23i::Map(data, InnerStride<>(2)), RowMatrixXi::Map(data, 2, 3, Stride<6,2>())); - VERIFY_IS_APPROX(RowMatrix32i::Map(data, InnerStride<2>()), RowMatrixXi::Map(data, 3, 2, Stride<4,2>())); - VERIFY_IS_APPROX(RowMatrix32i::Map(data, InnerStride<>(2)), RowMatrixXi::Map(data, 3, 2, Stride<4,2>())); -} - -void test_mapstride() -{ - for(int i = 0; i < g_repeat; i++) { - int maxn = 30; - CALL_SUBTEST_1( map_class_vector(Matrix()) ); - CALL_SUBTEST_1( map_class_vector(Matrix()) ); - CALL_SUBTEST_2( map_class_vector(Vector4d()) ); - CALL_SUBTEST_2( map_class_vector(Vector4d()) ); - CALL_SUBTEST_3( map_class_vector(RowVector4f()) ); - CALL_SUBTEST_3( map_class_vector(RowVector4f()) ); - CALL_SUBTEST_4( map_class_vector(VectorXcf(internal::random(1,maxn))) ); - CALL_SUBTEST_4( map_class_vector(VectorXcf(internal::random(1,maxn))) ); - CALL_SUBTEST_5( map_class_vector(VectorXi(internal::random(1,maxn))) ); - CALL_SUBTEST_5( map_class_vector(VectorXi(internal::random(1,maxn))) ); - - CALL_SUBTEST_1( map_class_matrix(Matrix()) ); - CALL_SUBTEST_1( map_class_matrix(Matrix()) ); - CALL_SUBTEST_2( map_class_matrix(Matrix4d()) ); - CALL_SUBTEST_2( map_class_matrix(Matrix4d()) ); - CALL_SUBTEST_3( map_class_matrix(Matrix()) ); - CALL_SUBTEST_3( map_class_matrix(Matrix()) ); - CALL_SUBTEST_3( map_class_matrix(Matrix()) ); - CALL_SUBTEST_3( map_class_matrix(Matrix()) ); - CALL_SUBTEST_4( map_class_matrix(MatrixXcf(internal::random(1,maxn),internal::random(1,maxn))) ); - CALL_SUBTEST_4( map_class_matrix(MatrixXcf(internal::random(1,maxn),internal::random(1,maxn))) ); - CALL_SUBTEST_5( map_class_matrix(MatrixXi(internal::random(1,maxn),internal::random(1,maxn))) ); - CALL_SUBTEST_5( map_class_matrix(MatrixXi(internal::random(1,maxn),internal::random(1,maxn))) ); - CALL_SUBTEST_6( map_class_matrix(MatrixXcd(internal::random(1,maxn),internal::random(1,maxn))) ); - CALL_SUBTEST_6( map_class_matrix(MatrixXcd(internal::random(1,maxn),internal::random(1,maxn))) ); - - CALL_SUBTEST_5( bug1453<0>() ); - - TEST_SET_BUT_UNUSED_VARIABLE(maxn); - } -} -- cgit v1.2.3