/external/eigen/test/ |
D | product_notemporary.cpp | 45 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); in product_notemporary() 46 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()).transpose(), 1); in product_notemporary() 47 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); in product_notemporary() 49 VERIFY_EVALUATION_COUNT( m3 = s1 * (m1 * m2.transpose()), 1); in product_notemporary() 51 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0); in product_notemporary() 53 VERIFY_EVALUATION_COUNT( m3 = m3 + (m1 * m2.adjoint()), 1); in product_notemporary() 54 VERIFY_EVALUATION_COUNT( m3 = m3 - (m1 * m2.adjoint()), 1); in product_notemporary() 56 VERIFY_EVALUATION_COUNT( m3 = m3 + (m1 * m2.adjoint()).transpose(), 1); in product_notemporary() 57 VERIFY_EVALUATION_COUNT( m3.noalias() = m3 + m1 * m2.transpose(), 0); in product_notemporary() 58 VERIFY_EVALUATION_COUNT( m3.noalias() += m3 + m1 * m2.transpose(), 0); in product_notemporary() [all …]
|
D | sparse_ref.cpp | 27 #define VERIFY_EVALUATION_COUNT(XPR,N) {\ macro 76 VERIFY_EVALUATION_COUNT( call_ref_1(A, A), 0); in call_ref() 78 VERIFY_EVALUATION_COUNT( call_ref_2(A, A), 0); in call_ref() 79 VERIFY_EVALUATION_COUNT( call_ref_3(A, A), 0); in call_ref() 80 VERIFY_EVALUATION_COUNT( call_ref_2(A.transpose(), A.transpose()), 1); in call_ref() 81 VERIFY_EVALUATION_COUNT( call_ref_3(A.transpose(), A.transpose()), 1); in call_ref() 82 VERIFY_EVALUATION_COUNT( call_ref_2(Ac,Ac), 0); in call_ref() 83 VERIFY_EVALUATION_COUNT( call_ref_3(Ac,Ac), 0); in call_ref() 84 VERIFY_EVALUATION_COUNT( call_ref_2(A+A,2*Ac), 1); in call_ref() 85 VERIFY_EVALUATION_COUNT( call_ref_3(A+A,2*Ac), 1); in call_ref() [all …]
|
D | ref.cpp | 179 VERIFY_EVALUATION_COUNT( call_ref_1(a,a), 0); in call_ref() 180 VERIFY_EVALUATION_COUNT( call_ref_1(b,b.transpose()), 0); in call_ref() 182 VERIFY_EVALUATION_COUNT( call_ref_1(ab,ab), 0); in call_ref() 183 VERIFY_EVALUATION_COUNT( call_ref_1(a.head(4),a.head(4)), 0); in call_ref() 184 VERIFY_EVALUATION_COUNT( call_ref_1(abc,abc), 0); in call_ref() 185 VERIFY_EVALUATION_COUNT( call_ref_1(A.col(3),A.col(3)), 0); in call_ref() 187 VERIFY_EVALUATION_COUNT( call_ref_3(A.row(3),A.row(3).transpose()), 0); in call_ref() 188 VERIFY_EVALUATION_COUNT( call_ref_4(A.row(3),A.row(3).transpose()), 0); in call_ref() 192 VERIFY_EVALUATION_COUNT( call_ref_2(A*A.col(1), tmp), 1); // evaluated into a temp in call_ref() 193 VERIFY_EVALUATION_COUNT( call_ref_2(ac.head(5),ac.head(5)), 0); in call_ref() [all …]
|
D | nesting_ops.cpp | 58 VERIFY_EVALUATION_COUNT( use_n_times<1>(m1 + m1*m1), 1 ); in run_nesting_ops_2() 59 VERIFY_EVALUATION_COUNT( use_n_times<10>(m1 + m1*m1), 1 ); in run_nesting_ops_2() 61 …VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 ); in run_nesting_ops_2() 62 …VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 … in run_nesting_ops_2() 64 …VERIFY_EVALUATION_COUNT( use_n_times<1>(Scalar(2)*m1.template triangularView<Lower>().solve(m1.col… in run_nesting_ops_2() 65 …VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.col… in run_nesting_ops_2() 66 …VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.co… in run_nesting_ops_2()
|
D | constructor.cpp | 31 VERIFY_EVALUATION_COUNT( MatrixType m1(m0), 1); in ctor_init1() 32 VERIFY_EVALUATION_COUNT( MatrixType m2(m0+m0), 1); in ctor_init1() 33 VERIFY_EVALUATION_COUNT( MatrixType m2(m0.block(0,0,rows,cols)) , 1); in ctor_init1() 36 VERIFY_EVALUATION_COUNT( MatrixType m3(wrapper) , 1); in ctor_init1()
|
D | permutationmatrices.cpp | 40 …VERIFY_EVALUATION_COUNT(m_permuted = lp * m_original * rp, 1); // 1 temp for sub expression "lp * … in permutationmatrices() 52 VERIFY_EVALUATION_COUNT(m_permuted = lp * m_permuted * rp, 1); in permutationmatrices() 77 …VERIFY_EVALUATION_COUNT(m_permuted.noalias()= lp.inverse() * m_permuted, 1); // 1 temp to allocate… in permutationmatrices() 81 …VERIFY_EVALUATION_COUNT(m_permuted.noalias() = m_permuted * rp.inverse(), 1); // 1 temp to allocat… in permutationmatrices() 85 VERIFY_EVALUATION_COUNT(m_permuted.noalias() = lp * m_permuted, 1); // 1 temp to allocate the mask in permutationmatrices() 89 VERIFY_EVALUATION_COUNT(m_permuted.noalias() = m_permuted * rp, 1); // 1 temp to allocate the mask in permutationmatrices()
|
D | vectorwiseop.cpp | 234 VERIFY_EVALUATION_COUNT( tmp = (m1 * m1.transpose()).colwise().sum(), 1); in vectorwiseop_matrix() 239 …VERIFY_EVALUATION_COUNT( m2 = (m1.rowwise() - m1.colwise().sum()/RealScalar(m1.rows())), (MatrixTy… in vectorwiseop_matrix()
|
D | redux.cpp | 73 …VERIFY_EVALUATION_COUNT( (m1.matrix()*m1.matrix().transpose()).sum(), (MatrixType::IsVectorAtCompi… in matrixRedux() 76 …VERIFY_EVALUATION_COUNT( ((m1.matrix()*m1.matrix().transpose())+m2).sum(),(MatrixType::IsVectorAtC… in matrixRedux()
|
D | sparse_product.cpp | 21 #define VERIFY_EVALUATION_COUNT(XPR,N) {\ macro 100 …VERIFY_EVALUATION_COUNT(m4 = m2*m3, 3); // 1 temp for the result + 2 for transposing and get a sor… in sparse_product() 101 VERIFY_EVALUATION_COUNT(m4 = (m2*m3).pruned(0), 1); in sparse_product() 102 VERIFY_EVALUATION_COUNT(m4 = (m2*m3).eval().pruned(0), 4); in sparse_product()
|
D | cholesky.cpp | 200 VERIFY_EVALUATION_COUNT(matX = ldltlo.solve(matX), 0); in cholesky() 205 VERIFY_EVALUATION_COUNT(matX = ldltup.solve(matX), 0); in cholesky()
|
D | main.h | 93 #define VERIFY_EVALUATION_COUNT(XPR,N) {\ macro
|