cart-elc

Source code for CART-ELC
git clone git://git.laack.co/cart-elc.git
Log | Files | Refs | README | LICENSE

commainitializer.cpp (3150B)

      1 // This file is part of Eigen, a lightweight C++ template library
      2 // for linear algebra.
      3 //
      4 // Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
      5 //
      6 // This Source Code Form is subject to the terms of the Mozilla
      7 // Public License v. 2.0. If a copy of the MPL was not distributed
      8 // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
      9 
     10 #include "main.h"
     11 
     12 
     13 template<int M1, int M2, int N1, int N2>
     14 void test_blocks()
     15 {
     16   Matrix<int, M1+M2, N1+N2> m_fixed;
     17   MatrixXi m_dynamic(M1+M2, N1+N2);
     18 
     19   Matrix<int, M1, N1> mat11; mat11.setRandom();
     20   Matrix<int, M1, N2> mat12; mat12.setRandom();
     21   Matrix<int, M2, N1> mat21; mat21.setRandom();
     22   Matrix<int, M2, N2> mat22; mat22.setRandom();
     23 
     24   MatrixXi matx11 = mat11, matx12 = mat12, matx21 = mat21, matx22 = mat22;
     25 
     26   {
     27     VERIFY_IS_EQUAL((m_fixed << mat11, mat12, mat21, matx22).finished(), (m_dynamic << mat11, matx12, mat21, matx22).finished());
     28     VERIFY_IS_EQUAL((m_fixed.template topLeftCorner<M1,N1>()), mat11);
     29     VERIFY_IS_EQUAL((m_fixed.template topRightCorner<M1,N2>()), mat12);
     30     VERIFY_IS_EQUAL((m_fixed.template bottomLeftCorner<M2,N1>()), mat21);
     31     VERIFY_IS_EQUAL((m_fixed.template bottomRightCorner<M2,N2>()), mat22);
     32     VERIFY_IS_EQUAL((m_fixed << mat12, mat11, matx21, mat22).finished(), (m_dynamic << mat12, matx11, matx21, mat22).finished());
     33   }
     34 
     35   if(N1 > 0)
     36   {
     37     if(M1 > 0)
     38     {
     39       VERIFY_RAISES_ASSERT((m_fixed << mat11, mat12, mat11, mat21, mat22));
     40     }
     41     if(M2 > 0)
     42     {
     43       VERIFY_RAISES_ASSERT((m_fixed << mat11, mat12, mat21, mat21, mat22));
     44     }
     45   }
     46   else
     47   {
     48     // allow insertion of zero-column blocks:
     49     VERIFY_IS_EQUAL((m_fixed << mat11, mat12, mat11, mat11, mat21, mat21, mat22).finished(), (m_dynamic << mat12, mat22).finished());
     50   }
     51   if(M1 != M2)
     52   {
     53     VERIFY_RAISES_ASSERT((m_fixed << mat11, mat21, mat12, mat22));
     54   }
     55 }
     56 
     57 
     58 template<int depth, int N=0>
     59 struct test_block_recursion
     60 {
     61   static void run()
     62   {
     63     test_block_recursion<depth-1, N>::run();
     64     test_block_recursion<depth-1, N + (1 << (depth-1))>::run();
     65   }
     66 };
     67 
     68 template<int N>
     69 struct test_block_recursion<0,N>
     70 {
     71   static void run() {
     72     test_blocks<(N>>6)&3, (N>>4)&3, (N>>2)&3, N & 3>();
     73   }
     74 };
     75 
     76 void test_basics() {
     77   Matrix3d m3;
     78   Matrix4d m4;
     79 
     80   VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) );
     81   
     82   #ifndef _MSC_VER
     83   VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) );
     84   #endif
     85 
     86   double data[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
     87   Matrix3d ref = Map<Matrix<double,3,3,RowMajor> >(data);
     88 
     89   m3 = Matrix3d::Random();
     90   m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9;
     91   VERIFY_IS_APPROX(m3, ref );
     92 
     93   Vector3d vec[3];
     94   vec[0] << 1, 4, 7;
     95   vec[1] << 2, 5, 8;
     96   vec[2] << 3, 6, 9;
     97   m3 = Matrix3d::Random();
     98   m3 << vec[0], vec[1], vec[2];
     99   VERIFY_IS_APPROX(m3, ref);
    100 
    101   vec[0] << 1, 2, 3;
    102   vec[1] << 4, 5, 6;
    103   vec[2] << 7, 8, 9;
    104   m3 = Matrix3d::Random();
    105   m3 << vec[0].transpose(),
    106         4, 5, 6,
    107         vec[2].transpose();
    108   VERIFY_IS_APPROX(m3, ref);
    109 }
    110 
    111 EIGEN_DECLARE_TEST(commainitializer)
    112 {
    113 
    114   CALL_SUBTEST_1(test_basics());
    115 
    116   // recursively test all block-sizes from 0 to 3:
    117   CALL_SUBTEST_2(test_block_recursion<8>::run());
    118 }