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/sparse_permutations.cpp | 236 ------------------------------------- 1 file changed, 236 deletions(-) delete mode 100644 eigen/test/sparse_permutations.cpp (limited to 'eigen/test/sparse_permutations.cpp') diff --git a/eigen/test/sparse_permutations.cpp b/eigen/test/sparse_permutations.cpp deleted file mode 100644 index b82ccef..0000000 --- a/eigen/test/sparse_permutations.cpp +++ /dev/null @@ -1,236 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2011-2015 Gael Guennebaud -// -// 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/. - - -static long int nb_transposed_copies; -#define EIGEN_SPARSE_TRANSPOSED_COPY_PLUGIN {nb_transposed_copies++;} -#define VERIFY_TRANSPOSITION_COUNT(XPR,N) {\ - nb_transposed_copies = 0; \ - XPR; \ - if(nb_transposed_copies!=N) std::cerr << "nb_transposed_copies == " << nb_transposed_copies << "\n"; \ - VERIFY( (#XPR) && nb_transposed_copies==N ); \ - } - -#include "sparse.h" - -template -bool is_sorted(const T& mat) { - for(Index k = 0; k=it.index()) - return false; - prev = it.index(); - } - } - return true; -} - -template -typename internal::nested_eval::type eval(const T &xpr) -{ - VERIFY( int(internal::nested_eval::type::Flags&RowMajorBit) == int(internal::evaluator::Flags&RowMajorBit) ); - return xpr; -} - -template void sparse_permutations(const SparseMatrixType& ref) -{ - const Index rows = ref.rows(); - const Index cols = ref.cols(); - typedef typename SparseMatrixType::Scalar Scalar; - typedef typename SparseMatrixType::StorageIndex StorageIndex; - typedef SparseMatrix OtherSparseMatrixType; - typedef Matrix DenseMatrix; - typedef Matrix VectorI; -// bool IsRowMajor1 = SparseMatrixType::IsRowMajor; -// bool IsRowMajor2 = OtherSparseMatrixType::IsRowMajor; - - double density = (std::max)(8./(rows*cols), 0.01); - - SparseMatrixType mat(rows, cols), up(rows,cols), lo(rows,cols); - OtherSparseMatrixType res; - DenseMatrix mat_d = DenseMatrix::Zero(rows, cols), up_sym_d, lo_sym_d, res_d; - - initSparse(density, mat_d, mat, 0); - - up = mat.template triangularView(); - lo = mat.template triangularView(); - - up_sym_d = mat_d.template selfadjointView(); - lo_sym_d = mat_d.template selfadjointView(); - - VERIFY_IS_APPROX(mat, mat_d); - VERIFY_IS_APPROX(up, DenseMatrix(mat_d.template triangularView())); - VERIFY_IS_APPROX(lo, DenseMatrix(mat_d.template triangularView())); - - PermutationMatrix p, p_null; - VectorI pi; - randomPermutationVector(pi, cols); - p.indices() = pi; - - VERIFY( is_sorted( ::eval(mat*p) )); - VERIFY( is_sorted( res = mat*p )); - VERIFY_TRANSPOSITION_COUNT( ::eval(mat*p), 0); - //VERIFY_TRANSPOSITION_COUNT( res = mat*p, IsRowMajor ? 1 : 0 ); - res_d = mat_d*p; - VERIFY(res.isApprox(res_d) && "mat*p"); - - VERIFY( is_sorted( ::eval(p*mat) )); - VERIFY( is_sorted( res = p*mat )); - VERIFY_TRANSPOSITION_COUNT( ::eval(p*mat), 0); - res_d = p*mat_d; - VERIFY(res.isApprox(res_d) && "p*mat"); - - VERIFY( is_sorted( (mat*p).eval() )); - VERIFY( is_sorted( res = mat*p.inverse() )); - VERIFY_TRANSPOSITION_COUNT( ::eval(mat*p.inverse()), 0); - res_d = mat*p.inverse(); - VERIFY(res.isApprox(res_d) && "mat*inv(p)"); - - VERIFY( is_sorted( (p*mat+p*mat).eval() )); - VERIFY( is_sorted( res = p.inverse()*mat )); - VERIFY_TRANSPOSITION_COUNT( ::eval(p.inverse()*mat), 0); - res_d = p.inverse()*mat_d; - VERIFY(res.isApprox(res_d) && "inv(p)*mat"); - - VERIFY( is_sorted( (p * mat * p.inverse()).eval() )); - VERIFY( is_sorted( res = mat.twistedBy(p) )); - VERIFY_TRANSPOSITION_COUNT( ::eval(p * mat * p.inverse()), 0); - res_d = (p * mat_d) * p.inverse(); - VERIFY(res.isApprox(res_d) && "p*mat*inv(p)"); - - - VERIFY( is_sorted( res = mat.template selfadjointView().twistedBy(p_null) )); - res_d = up_sym_d; - VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); - - VERIFY( is_sorted( res = mat.template selfadjointView().twistedBy(p_null) )); - res_d = lo_sym_d; - VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full"); - - - VERIFY( is_sorted( res = up.template selfadjointView().twistedBy(p_null) )); - res_d = up_sym_d; - VERIFY(res.isApprox(res_d) && "upper selfadjoint to full"); - - VERIFY( is_sorted( res = lo.template selfadjointView().twistedBy(p_null) )); - res_d = lo_sym_d; - VERIFY(res.isApprox(res_d) && "lower selfadjoint full"); - - - VERIFY( is_sorted( res = mat.template selfadjointView() )); - res_d = up_sym_d; - VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); - - VERIFY( is_sorted( res = mat.template selfadjointView() )); - res_d = lo_sym_d; - VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full"); - - VERIFY( is_sorted( res = up.template selfadjointView() )); - res_d = up_sym_d; - VERIFY(res.isApprox(res_d) && "upper selfadjoint to full"); - - VERIFY( is_sorted( res = lo.template selfadjointView() )); - res_d = lo_sym_d; - VERIFY(res.isApprox(res_d) && "lower selfadjoint full"); - - - res.template selfadjointView() = mat.template selfadjointView(); - res_d = up_sym_d.template triangularView(); - VERIFY(res.isApprox(res_d) && "full selfadjoint upper to upper"); - - res.template selfadjointView() = mat.template selfadjointView(); - res_d = up_sym_d.template triangularView(); - VERIFY(res.isApprox(res_d) && "full selfadjoint upper to lower"); - - res.template selfadjointView() = mat.template selfadjointView(); - res_d = lo_sym_d.template triangularView(); - VERIFY(res.isApprox(res_d) && "full selfadjoint lower to upper"); - - res.template selfadjointView() = mat.template selfadjointView(); - res_d = lo_sym_d.template triangularView(); - VERIFY(res.isApprox(res_d) && "full selfadjoint lower to lower"); - - - - res.template selfadjointView() = mat.template selfadjointView().twistedBy(p); - res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView(); - VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to upper"); - - res.template selfadjointView() = mat.template selfadjointView().twistedBy(p); - res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView(); - VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to upper"); - - res.template selfadjointView() = mat.template selfadjointView().twistedBy(p); - res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView(); - VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to lower"); - - res.template selfadjointView() = mat.template selfadjointView().twistedBy(p); - res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView(); - VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to lower"); - - - res.template selfadjointView() = up.template selfadjointView().twistedBy(p); - res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView(); - VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to upper"); - - res.template selfadjointView() = lo.template selfadjointView().twistedBy(p); - res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView(); - VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to upper"); - - res.template selfadjointView() = lo.template selfadjointView().twistedBy(p); - res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView(); - VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to lower"); - - res.template selfadjointView() = up.template selfadjointView().twistedBy(p); - res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView(); - VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to lower"); - - - VERIFY( is_sorted( res = mat.template selfadjointView().twistedBy(p) )); - res_d = (p * up_sym_d) * p.inverse(); - VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to full"); - - VERIFY( is_sorted( res = mat.template selfadjointView().twistedBy(p) )); - res_d = (p * lo_sym_d) * p.inverse(); - VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to full"); - - VERIFY( is_sorted( res = up.template selfadjointView().twistedBy(p) )); - res_d = (p * up_sym_d) * p.inverse(); - VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to full"); - - VERIFY( is_sorted( res = lo.template selfadjointView().twistedBy(p) )); - res_d = (p * lo_sym_d) * p.inverse(); - VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to full"); -} - -template void sparse_permutations_all(int size) -{ - CALL_SUBTEST(( sparse_permutations(SparseMatrix(size,size)) )); - CALL_SUBTEST(( sparse_permutations(SparseMatrix(size,size)) )); - CALL_SUBTEST(( sparse_permutations(SparseMatrix(size,size)) )); - CALL_SUBTEST(( sparse_permutations(SparseMatrix(size,size)) )); -} - -void test_sparse_permutations() -{ - for(int i = 0; i < g_repeat; i++) { - int s = Eigen::internal::random(1,50); - CALL_SUBTEST_1(( sparse_permutations_all(s) )); - CALL_SUBTEST_2(( sparse_permutations_all >(s) )); - } - - VERIFY((internal::is_same,OnTheRight,false,SparseShape>::ReturnType, - internal::nested_eval,PermutationMatrix,AliasFreeProduct>,1>::type>::value)); - - VERIFY((internal::is_same,OnTheLeft,false,SparseShape>::ReturnType, - internal::nested_eval,SparseMatrix,AliasFreeProduct>,1>::type>::value)); -} -- cgit v1.2.3