blob: f412d1aed7f99a2ace0ee33045b079c8cd9de1cc [file] [log] [blame]
Gael Guennebaud0be89a42009-03-05 10:25:22 +00001// This file is part of Eigen, a lightweight C++ template library
Benoit Jacob6347b1d2009-05-22 20:25:33 +02002// for linear algebra.
Gael Guennebaud0be89a42009-03-05 10:25:22 +00003//
Gael Guennebaud28e64b02010-06-24 23:21:58 +02004// Copyright (C) 2009 Gael Guennebaud <gael.guennebaud@inria.fr>
Gael Guennebaud0be89a42009-03-05 10:25:22 +00005//
Benoit Jacob69124cf2012-07-13 14:42:47 -04006// 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/.
Gael Guennebaud0be89a42009-03-05 10:25:22 +00009
10#include "main.h"
Gael Guennebaud0be89a42009-03-05 10:25:22 +000011
12template<typename MatrixType> void replicate(const MatrixType& m)
13{
14 /* this test covers the following files:
15 Replicate.cpp
16 */
Hauke Heibelf1679c72010-06-20 17:37:56 +020017 typedef typename MatrixType::Index Index;
Gael Guennebaud0be89a42009-03-05 10:25:22 +000018 typedef typename MatrixType::Scalar Scalar;
Gael Guennebaud0be89a42009-03-05 10:25:22 +000019 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
20 typedef Matrix<Scalar, Dynamic, Dynamic> MatrixX;
21 typedef Matrix<Scalar, Dynamic, 1> VectorX;
22
Hauke Heibelf1679c72010-06-20 17:37:56 +020023 Index rows = m.rows();
24 Index cols = m.cols();
Gael Guennebaud0be89a42009-03-05 10:25:22 +000025
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols);
Gael Guennebaud14430942009-10-13 09:23:09 +020028
Gael Guennebaud0be89a42009-03-05 10:25:22 +000029 VectorType v1 = VectorType::Random(rows);
Gael Guennebaud14430942009-10-13 09:23:09 +020030
Gael Guennebaud0be89a42009-03-05 10:25:22 +000031 MatrixX x1, x2;
32 VectorX vx1;
33
Benoit Jacob47160402010-10-25 10:15:22 -040034 int f1 = internal::random<int>(1,10),
35 f2 = internal::random<int>(1,10);
Gael Guennebaud0be89a42009-03-05 10:25:22 +000036
37 x1.resize(rows*f1,cols*f2);
38 for(int j=0; j<f2; j++)
39 for(int i=0; i<f1; i++)
40 x1.block(i*rows,j*cols,rows,cols) = m1;
41 VERIFY_IS_APPROX(x1, m1.replicate(f1,f2));
Gael Guennebaud14430942009-10-13 09:23:09 +020042
Gael Guennebaud0be89a42009-03-05 10:25:22 +000043 x2.resize(2*rows,3*cols);
44 x2 << m2, m2, m2,
45 m2, m2, m2;
46 VERIFY_IS_APPROX(x2, (m2.template replicate<2,3>()));
Gael Guennebaud14430942009-10-13 09:23:09 +020047
Gael Guennebaud0be89a42009-03-05 10:25:22 +000048 x2.resize(rows,f1);
49 for (int j=0; j<f1; ++j)
50 x2.col(j) = v1;
51 VERIFY_IS_APPROX(x2, v1.rowwise().replicate(f1));
Gael Guennebaud14430942009-10-13 09:23:09 +020052
Gael Guennebaud0be89a42009-03-05 10:25:22 +000053 vx1.resize(rows*f2);
54 for (int j=0; j<f2; ++j)
55 vx1.segment(j*rows,rows) = v1;
56 VERIFY_IS_APPROX(vx1, v1.colwise().replicate(f2));
57}
58
59void test_array_replicate()
60{
61 for(int i = 0; i < g_repeat; i++) {
Benoit Jacob2840ac72009-10-28 18:19:29 -040062 CALL_SUBTEST_1( replicate(Matrix<float, 1, 1>()) );
63 CALL_SUBTEST_2( replicate(Vector2f()) );
64 CALL_SUBTEST_3( replicate(Vector3d()) );
65 CALL_SUBTEST_4( replicate(Vector4f()) );
66 CALL_SUBTEST_5( replicate(VectorXf(16)) );
67 CALL_SUBTEST_6( replicate(VectorXcd(10)) );
Gael Guennebaud0be89a42009-03-05 10:25:22 +000068 }
69}