1 // This file is part of Eigen, a lightweight C++ template library
2 // for linear algebra.
3 //
4 // Copyright (C) 20013 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 // This unit test cannot be easily written to work with EIGEN_DEFAULT_TO_ROW_MAJOR
11 #ifdef EIGEN_DEFAULT_TO_ROW_MAJOR
12 #undef EIGEN_DEFAULT_TO_ROW_MAJOR
13 #endif
14
15 #define TEST_ENABLE_TEMPORARY_TRACKING
16 #define TEST_CHECK_STATIC_ASSERTIONS
17 #include "main.h"
18
19 // test Ref.h
20
21 // Deal with i387 extended precision
22 #if EIGEN_ARCH_i386 && !(EIGEN_ARCH_x86_64)
23
24 #if EIGEN_COMP_GNUC_STRICT && EIGEN_GNUC_AT_LEAST(4,4)
25 #pragma GCC optimize ("-ffloat-store")
26 #else
27 #undef VERIFY_IS_EQUAL
28 #define VERIFY_IS_EQUAL(X,Y) VERIFY_IS_APPROX(X,Y)
29 #endif
30
31 #endif
32
ref_matrix(const MatrixType & m)33 template<typename MatrixType> void ref_matrix(const MatrixType& m)
34 {
35 typedef typename MatrixType::Scalar Scalar;
36 typedef typename MatrixType::RealScalar RealScalar;
37 typedef Matrix<Scalar,Dynamic,Dynamic,MatrixType::Options> DynMatrixType;
38 typedef Matrix<RealScalar,Dynamic,Dynamic,MatrixType::Options> RealDynMatrixType;
39
40 typedef Ref<MatrixType> RefMat;
41 typedef Ref<DynMatrixType> RefDynMat;
42 typedef Ref<const DynMatrixType> ConstRefDynMat;
43 typedef Ref<RealDynMatrixType , 0, Stride<Dynamic,Dynamic> > RefRealMatWithStride;
44
45 Index rows = m.rows(), cols = m.cols();
46
47 MatrixType m1 = MatrixType::Random(rows, cols),
48 m2 = m1;
49
50 Index i = internal::random<Index>(0,rows-1);
51 Index j = internal::random<Index>(0,cols-1);
52 Index brows = internal::random<Index>(1,rows-i);
53 Index bcols = internal::random<Index>(1,cols-j);
54
55 RefMat rm0 = m1;
56 VERIFY_IS_EQUAL(rm0, m1);
57 RefDynMat rm1 = m1;
58 VERIFY_IS_EQUAL(rm1, m1);
59 RefDynMat rm2 = m1.block(i,j,brows,bcols);
60 VERIFY_IS_EQUAL(rm2, m1.block(i,j,brows,bcols));
61 rm2.setOnes();
62 m2.block(i,j,brows,bcols).setOnes();
63 VERIFY_IS_EQUAL(m1, m2);
64
65 m2.block(i,j,brows,bcols).setRandom();
66 rm2 = m2.block(i,j,brows,bcols);
67 VERIFY_IS_EQUAL(m1, m2);
68
69 ConstRefDynMat rm3 = m1.block(i,j,brows,bcols);
70 m1.block(i,j,brows,bcols) *= 2;
71 m2.block(i,j,brows,bcols) *= 2;
72 VERIFY_IS_EQUAL(rm3, m2.block(i,j,brows,bcols));
73 RefRealMatWithStride rm4 = m1.real();
74 VERIFY_IS_EQUAL(rm4, m2.real());
75 rm4.array() += 1;
76 m2.real().array() += 1;
77 VERIFY_IS_EQUAL(m1, m2);
78 }
79
ref_vector(const VectorType & m)80 template<typename VectorType> void ref_vector(const VectorType& m)
81 {
82 typedef typename VectorType::Scalar Scalar;
83 typedef typename VectorType::RealScalar RealScalar;
84 typedef Matrix<Scalar,Dynamic,1,VectorType::Options> DynMatrixType;
85 typedef Matrix<Scalar,Dynamic,Dynamic,ColMajor> MatrixType;
86 typedef Matrix<RealScalar,Dynamic,1,VectorType::Options> RealDynMatrixType;
87
88 typedef Ref<VectorType> RefMat;
89 typedef Ref<DynMatrixType> RefDynMat;
90 typedef Ref<const DynMatrixType> ConstRefDynMat;
91 typedef Ref<RealDynMatrixType , 0, InnerStride<> > RefRealMatWithStride;
92 typedef Ref<DynMatrixType , 0, InnerStride<> > RefMatWithStride;
93
94 Index size = m.size();
95
96 VectorType v1 = VectorType::Random(size),
97 v2 = v1;
98 MatrixType mat1 = MatrixType::Random(size,size),
99 mat2 = mat1,
100 mat3 = MatrixType::Random(size,size);
101
102 Index i = internal::random<Index>(0,size-1);
103 Index bsize = internal::random<Index>(1,size-i);
104
105 { RefMat rm0 = v1; VERIFY_IS_EQUAL(rm0, v1); }
106 { RefMat rm0 = v1.block(0,0,size,1); VERIFY_IS_EQUAL(rm0, v1); }
107 { RefDynMat rv1 = v1; VERIFY_IS_EQUAL(rv1, v1); }
108 { RefDynMat rv1 = v1.block(0,0,size,1); VERIFY_IS_EQUAL(rv1, v1); }
109 { VERIFY_RAISES_ASSERT( RefMat rm0 = v1.block(0, 0, size, 0); EIGEN_UNUSED_VARIABLE(rm0); ); }
110 if(VectorType::SizeAtCompileTime!=1)
111 { VERIFY_RAISES_ASSERT( RefDynMat rv1 = v1.block(0, 0, size, 0); EIGEN_UNUSED_VARIABLE(rv1); ); }
112
113 RefDynMat rv2 = v1.segment(i,bsize);
114 VERIFY_IS_EQUAL(rv2, v1.segment(i,bsize));
115 rv2.setOnes();
116 v2.segment(i,bsize).setOnes();
117 VERIFY_IS_EQUAL(v1, v2);
118
119 v2.segment(i,bsize).setRandom();
120 rv2 = v2.segment(i,bsize);
121 VERIFY_IS_EQUAL(v1, v2);
122
123 ConstRefDynMat rm3 = v1.segment(i,bsize);
124 v1.segment(i,bsize) *= 2;
125 v2.segment(i,bsize) *= 2;
126 VERIFY_IS_EQUAL(rm3, v2.segment(i,bsize));
127
128 RefRealMatWithStride rm4 = v1.real();
129 VERIFY_IS_EQUAL(rm4, v2.real());
130 rm4.array() += 1;
131 v2.real().array() += 1;
132 VERIFY_IS_EQUAL(v1, v2);
133
134 RefMatWithStride rm5 = mat1.row(i).transpose();
135 VERIFY_IS_EQUAL(rm5, mat1.row(i).transpose());
136 rm5.array() += 1;
137 mat2.row(i).array() += 1;
138 VERIFY_IS_EQUAL(mat1, mat2);
139 rm5.noalias() = rm4.transpose() * mat3;
140 mat2.row(i) = v2.real().transpose() * mat3;
141 VERIFY_IS_APPROX(mat1, mat2);
142 }
143
check_const_correctness(const PlainObjectType &)144 template<typename PlainObjectType> void check_const_correctness(const PlainObjectType&)
145 {
146 // verify that ref-to-const don't have LvalueBit
147 typedef typename internal::add_const<PlainObjectType>::type ConstPlainObjectType;
148 VERIFY( !(internal::traits<Ref<ConstPlainObjectType> >::Flags & LvalueBit) );
149 VERIFY( !(internal::traits<Ref<ConstPlainObjectType, Aligned> >::Flags & LvalueBit) );
150 VERIFY( !(Ref<ConstPlainObjectType>::Flags & LvalueBit) );
151 VERIFY( !(Ref<ConstPlainObjectType, Aligned>::Flags & LvalueBit) );
152 }
153
154 template<typename B>
call_ref_1(Ref<VectorXf> a,const B & b)155 EIGEN_DONT_INLINE void call_ref_1(Ref<VectorXf> a, const B &b) { VERIFY_IS_EQUAL(a,b); }
156 template<typename B>
call_ref_2(const Ref<const VectorXf> & a,const B & b)157 EIGEN_DONT_INLINE void call_ref_2(const Ref<const VectorXf>& a, const B &b) { VERIFY_IS_EQUAL(a,b); }
158 template<typename B>
call_ref_3(Ref<VectorXf,0,InnerStride<>> a,const B & b)159 EIGEN_DONT_INLINE void call_ref_3(Ref<VectorXf,0,InnerStride<> > a, const B &b) { VERIFY_IS_EQUAL(a,b); }
160 template<typename B>
call_ref_4(const Ref<const VectorXf,0,InnerStride<>> & a,const B & b)161 EIGEN_DONT_INLINE void call_ref_4(const Ref<const VectorXf,0,InnerStride<> >& a, const B &b) { VERIFY_IS_EQUAL(a,b); }
162 template<typename B>
call_ref_5(Ref<MatrixXf,0,OuterStride<>> a,const B & b)163 EIGEN_DONT_INLINE void call_ref_5(Ref<MatrixXf,0,OuterStride<> > a, const B &b) { VERIFY_IS_EQUAL(a,b); }
164 template<typename B>
call_ref_6(const Ref<const MatrixXf,0,OuterStride<>> & a,const B & b)165 EIGEN_DONT_INLINE void call_ref_6(const Ref<const MatrixXf,0,OuterStride<> >& a, const B &b) { VERIFY_IS_EQUAL(a,b); }
166 template<typename B>
call_ref_7(Ref<Matrix<float,Dynamic,3>> a,const B & b)167 EIGEN_DONT_INLINE void call_ref_7(Ref<Matrix<float,Dynamic,3> > a, const B &b) { VERIFY_IS_EQUAL(a,b); }
168
call_ref()169 void call_ref()
170 {
171 VectorXcf ca = VectorXcf::Random(10);
172 VectorXf a = VectorXf::Random(10);
173 RowVectorXf b = RowVectorXf::Random(10);
174 MatrixXf A = MatrixXf::Random(10,10);
175 RowVector3f c = RowVector3f::Random();
176 const VectorXf& ac(a);
177 VectorBlock<VectorXf> ab(a,0,3);
178 const VectorBlock<VectorXf> abc(a,0,3);
179
180
181 VERIFY_EVALUATION_COUNT( call_ref_1(a,a), 0);
182 VERIFY_EVALUATION_COUNT( call_ref_1(b,b.transpose()), 0);
183 // call_ref_1(ac,a<c); // does not compile because ac is const
184 VERIFY_EVALUATION_COUNT( call_ref_1(ab,ab), 0);
185 VERIFY_EVALUATION_COUNT( call_ref_1(a.head(4),a.head(4)), 0);
186 VERIFY_EVALUATION_COUNT( call_ref_1(abc,abc), 0);
187 VERIFY_EVALUATION_COUNT( call_ref_1(A.col(3),A.col(3)), 0);
188 // call_ref_1(A.row(3),A.row(3)); // does not compile because innerstride!=1
189 VERIFY_EVALUATION_COUNT( call_ref_3(A.row(3),A.row(3).transpose()), 0);
190 VERIFY_EVALUATION_COUNT( call_ref_4(A.row(3),A.row(3).transpose()), 0);
191 // call_ref_1(a+a, a+a); // does not compile for obvious reason
192
193 MatrixXf tmp = A*A.col(1);
194 VERIFY_EVALUATION_COUNT( call_ref_2(A*A.col(1), tmp), 1); // evaluated into a temp
195 VERIFY_EVALUATION_COUNT( call_ref_2(ac.head(5),ac.head(5)), 0);
196 VERIFY_EVALUATION_COUNT( call_ref_2(ac,ac), 0);
197 VERIFY_EVALUATION_COUNT( call_ref_2(a,a), 0);
198 VERIFY_EVALUATION_COUNT( call_ref_2(ab,ab), 0);
199 VERIFY_EVALUATION_COUNT( call_ref_2(a.head(4),a.head(4)), 0);
200 tmp = a+a;
201 VERIFY_EVALUATION_COUNT( call_ref_2(a+a,tmp), 1); // evaluated into a temp
202 VERIFY_EVALUATION_COUNT( call_ref_2(ca.imag(),ca.imag()), 1); // evaluated into a temp
203
204 VERIFY_EVALUATION_COUNT( call_ref_4(ac.head(5),ac.head(5)), 0);
205 tmp = a+a;
206 VERIFY_EVALUATION_COUNT( call_ref_4(a+a,tmp), 1); // evaluated into a temp
207 VERIFY_EVALUATION_COUNT( call_ref_4(ca.imag(),ca.imag()), 0);
208
209 VERIFY_EVALUATION_COUNT( call_ref_5(a,a), 0);
210 VERIFY_EVALUATION_COUNT( call_ref_5(a.head(3),a.head(3)), 0);
211 VERIFY_EVALUATION_COUNT( call_ref_5(A,A), 0);
212 // call_ref_5(A.transpose(),A.transpose()); // does not compile because storage order does not match
213 VERIFY_EVALUATION_COUNT( call_ref_5(A.block(1,1,2,2),A.block(1,1,2,2)), 0);
214 VERIFY_EVALUATION_COUNT( call_ref_5(b,b), 0); // storage order do not match, but this is a degenerate case that should work
215 VERIFY_EVALUATION_COUNT( call_ref_5(a.row(3),a.row(3)), 0);
216
217 VERIFY_EVALUATION_COUNT( call_ref_6(a,a), 0);
218 VERIFY_EVALUATION_COUNT( call_ref_6(a.head(3),a.head(3)), 0);
219 VERIFY_EVALUATION_COUNT( call_ref_6(A.row(3),A.row(3)), 1); // evaluated into a temp thouth it could be avoided by viewing it as a 1xn matrix
220 tmp = A+A;
221 VERIFY_EVALUATION_COUNT( call_ref_6(A+A,tmp), 1); // evaluated into a temp
222 VERIFY_EVALUATION_COUNT( call_ref_6(A,A), 0);
223 VERIFY_EVALUATION_COUNT( call_ref_6(A.transpose(),A.transpose()), 1); // evaluated into a temp because the storage orders do not match
224 VERIFY_EVALUATION_COUNT( call_ref_6(A.block(1,1,2,2),A.block(1,1,2,2)), 0);
225
226 VERIFY_EVALUATION_COUNT( call_ref_7(c,c), 0);
227 }
228
229 typedef Matrix<double,Dynamic,Dynamic,RowMajor> RowMatrixXd;
test_ref_overload_fun1(Ref<MatrixXd>)230 int test_ref_overload_fun1(Ref<MatrixXd> ) { return 1; }
test_ref_overload_fun1(Ref<RowMatrixXd>)231 int test_ref_overload_fun1(Ref<RowMatrixXd> ) { return 2; }
test_ref_overload_fun1(Ref<MatrixXf>)232 int test_ref_overload_fun1(Ref<MatrixXf> ) { return 3; }
233
test_ref_overload_fun2(Ref<const MatrixXd>)234 int test_ref_overload_fun2(Ref<const MatrixXd> ) { return 4; }
test_ref_overload_fun2(Ref<const MatrixXf>)235 int test_ref_overload_fun2(Ref<const MatrixXf> ) { return 5; }
236
test_ref_ambiguous(const Ref<const ArrayXd> & A,Ref<ArrayXd> B)237 void test_ref_ambiguous(const Ref<const ArrayXd> &A, Ref<ArrayXd> B)
238 {
239 B = A;
240 B = A - A;
241 }
242
243 // See also bug 969
test_ref_overloads()244 void test_ref_overloads()
245 {
246 MatrixXd Ad, Bd;
247 RowMatrixXd rAd, rBd;
248 VERIFY( test_ref_overload_fun1(Ad)==1 );
249 VERIFY( test_ref_overload_fun1(rAd)==2 );
250
251 MatrixXf Af, Bf;
252 VERIFY( test_ref_overload_fun2(Ad)==4 );
253 VERIFY( test_ref_overload_fun2(Ad+Bd)==4 );
254 VERIFY( test_ref_overload_fun2(Af+Bf)==5 );
255
256 ArrayXd A, B;
257 test_ref_ambiguous(A, B);
258 }
259
test_ref_fixed_size_assert()260 void test_ref_fixed_size_assert()
261 {
262 Vector4f v4;
263 VectorXf vx(10);
264 VERIFY_RAISES_STATIC_ASSERT( Ref<Vector3f> y = v4; (void)y; );
265 VERIFY_RAISES_STATIC_ASSERT( Ref<Vector3f> y = vx.head<4>(); (void)y; );
266 VERIFY_RAISES_STATIC_ASSERT( Ref<const Vector3f> y = v4; (void)y; );
267 VERIFY_RAISES_STATIC_ASSERT( Ref<const Vector3f> y = vx.head<4>(); (void)y; );
268 VERIFY_RAISES_STATIC_ASSERT( Ref<const Vector3f> y = 2*v4; (void)y; );
269 }
270
test_ref()271 void test_ref()
272 {
273 for(int i = 0; i < g_repeat; i++) {
274 CALL_SUBTEST_1( ref_vector(Matrix<float, 1, 1>()) );
275 CALL_SUBTEST_1( check_const_correctness(Matrix<float, 1, 1>()) );
276 CALL_SUBTEST_2( ref_vector(Vector4d()) );
277 CALL_SUBTEST_2( check_const_correctness(Matrix4d()) );
278 CALL_SUBTEST_3( ref_vector(Vector4cf()) );
279 CALL_SUBTEST_4( ref_vector(VectorXcf(8)) );
280 CALL_SUBTEST_5( ref_vector(VectorXi(12)) );
281 CALL_SUBTEST_5( check_const_correctness(VectorXi(12)) );
282
283 CALL_SUBTEST_1( ref_matrix(Matrix<float, 1, 1>()) );
284 CALL_SUBTEST_2( ref_matrix(Matrix4d()) );
285 CALL_SUBTEST_1( ref_matrix(Matrix<float,3,5>()) );
286 CALL_SUBTEST_4( ref_matrix(MatrixXcf(internal::random<int>(1,10),internal::random<int>(1,10))) );
287 CALL_SUBTEST_4( ref_matrix(Matrix<std::complex<double>,10,15>()) );
288 CALL_SUBTEST_5( ref_matrix(MatrixXi(internal::random<int>(1,10),internal::random<int>(1,10))) );
289 CALL_SUBTEST_6( call_ref() );
290 }
291
292 CALL_SUBTEST_7( test_ref_overloads() );
293 CALL_SUBTEST_7( test_ref_fixed_size_assert() );
294 }
295