GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-06-04 18:54:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix gcc 4.4 compilation issue

Browse Source
This commit is contained in:
Gael Guennebaud 2015-10-30 08:44:37 +01:00
parent 6a02c2a85d
commit 213bd0253a
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
test/sparse_permutations.cpp
View File

@ -76,34 +76,34 @@ template<int OtherStorage, typename SparseMatrixType> void sparse_permutations(c
randomPermutationVector(pi, cols); randomPermutationVector(pi, cols);
p.indices() = pi; p.indices() = pi;
VERIFY( is_sorted( eval(mat*p) )); VERIFY( is_sorted( ::eval(mat*p) ));
VERIFY( is_sorted( res = mat*p )); VERIFY( is_sorted( res = mat*p ));
VERIFY_TRANSPOSITION_COUNT( eval(mat*p), 0); VERIFY_TRANSPOSITION_COUNT( ::eval(mat*p), 0);
//VERIFY_TRANSPOSITION_COUNT( res = mat*p, IsRowMajor ? 1 : 0 ); //VERIFY_TRANSPOSITION_COUNT( res = mat*p, IsRowMajor ? 1 : 0 );
res_d = mat_d*p; res_d = mat_d*p;
VERIFY(res.isApprox(res_d) && "mat*p"); VERIFY(res.isApprox(res_d) && "mat*p");
VERIFY( is_sorted( eval(p*mat) )); VERIFY( is_sorted( ::eval(p*mat) ));
VERIFY( is_sorted( res = p*mat )); VERIFY( is_sorted( res = p*mat ));
VERIFY_TRANSPOSITION_COUNT( eval(p*mat), 0); VERIFY_TRANSPOSITION_COUNT( ::eval(p*mat), 0);
res_d = p*mat_d; res_d = p*mat_d;
VERIFY(res.isApprox(res_d) && "p*mat"); VERIFY(res.isApprox(res_d) && "p*mat");
VERIFY( is_sorted( (mat*p).eval() )); VERIFY( is_sorted( (mat*p).eval() ));
VERIFY( is_sorted( res = mat*p.inverse() )); VERIFY( is_sorted( res = mat*p.inverse() ));
VERIFY_TRANSPOSITION_COUNT( eval(mat*p.inverse()), 0); VERIFY_TRANSPOSITION_COUNT( ::eval(mat*p.inverse()), 0);
res_d = mat*p.inverse(); res_d = mat*p.inverse();
VERIFY(res.isApprox(res_d) && "mat*inv(p)"); VERIFY(res.isApprox(res_d) && "mat*inv(p)");
VERIFY( is_sorted( (p*mat+p*mat).eval() )); VERIFY( is_sorted( (p*mat+p*mat).eval() ));
VERIFY( is_sorted( res = p.inverse()*mat )); VERIFY( is_sorted( res = p.inverse()*mat ));
VERIFY_TRANSPOSITION_COUNT( eval(p.inverse()*mat), 0); VERIFY_TRANSPOSITION_COUNT( ::eval(p.inverse()*mat), 0);
res_d = p.inverse()*mat_d; res_d = p.inverse()*mat_d;
VERIFY(res.isApprox(res_d) && "inv(p)*mat"); VERIFY(res.isApprox(res_d) && "inv(p)*mat");
VERIFY( is_sorted( (p * mat * p.inverse()).eval() )); VERIFY( is_sorted( (p * mat * p.inverse()).eval() ));
VERIFY( is_sorted( res = mat.twistedBy(p) )); VERIFY( is_sorted( res = mat.twistedBy(p) ));
VERIFY_TRANSPOSITION_COUNT( eval(p * mat * p.inverse()), 0); VERIFY_TRANSPOSITION_COUNT( ::eval(p * mat * p.inverse()), 0);
res_d = (p * mat_d) * p.inverse(); res_d = (p * mat_d) * p.inverse();
VERIFY(res.isApprox(res_d) && "p*mat*inv(p)"); VERIFY(res.isApprox(res_d) && "p*mat*inv(p)");