| /external/eigen/doc/snippets/ |
| TopicAliasing_mult3.cpp | 3 matA.noalias() = matA * matA;
|
| MatrixBase_noalias.cpp | 2 c.noalias() = a * b; // this computes the product directly to c
|
| TopicAliasing_mult2.cpp | 9 matB.noalias() = matA * matA;
|
| /external/eigen/test/ |
| product_notemporary.cpp | 61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0);
63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0);
65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0);
66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1);
67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0);
68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0);
69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1.transpose() * m2), 0);
71 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)).adjoint() ), 0);
72 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() -= s1 * m1.block(r0,c0,r1,c1) * m2.block(c0,r0,c1,r1) ), 0);
75 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() = s1 * m1.block(r0,c0,r1,c1) * (s1*m2).block(c0,r0,c1,r1) ), 1)
[all...] |
| nomalloc.cpp | 57 m2.col(0).noalias() = m1 * m1.col(0);
58 m2.col(0).noalias() -= m1.adjoint() * m1.col(0);
59 m2.col(0).noalias() -= m1 * m1.row(0).adjoint();
60 m2.col(0).noalias() -= m1.adjoint() * m1.row(0).adjoint();
62 m2.row(0).noalias() = m1.row(0) * m1;
63 m2.row(0).noalias() -= m1.row(0) * m1.adjoint();
64 m2.row(0).noalias() -= m1.col(0).adjoint() * m1;
65 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint();
68 m2.col(0).noalias() = m1.template triangularView<Upper>() * m1.col(0);
69 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.col(0)
[all...] |
| product_trmm.cpp | 43 VERIFY_IS_APPROX( ge_xs.noalias() = mat.template triangularView<Mode>() * ge_right, tri * ge_right);
44 VERIFY_IS_APPROX( ge_sx.noalias() = ge_left * mat.template triangularView<Mode>(), ge_left * tri);
46 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.transpose()), s1*triTr.conjugate() * (s2*ge_left.transpose()));
47 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.transpose() * mat.adjoint().template triangularView<Mode>(), ge_right.transpose() * triTr.conjugate());
49 VERIFY_IS_APPROX( ge_xs.noalias() = (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()), s1*triTr.conjugate() * (s2*ge_left.adjoint()));
50 VERIFY_IS_APPROX( ge_sx.noalias() = ge_right.adjoint() * mat.adjoint().template triangularView<Mode>(), ge_right.adjoint() * triTr.conjugate());
53 VERIFY_IS_APPROX( (ge_xs_save + s1*triTr.conjugate() * (s2*ge_left.adjoint())).eval(), ge_xs.noalias() += (s1*mat.adjoint()).template triangularView<Mode>() * (s2*ge_left.adjoint()) );
56 VERIFY_IS_APPROX( ge_sx_save - (ge_right.adjoint() * (-s1 * triTr).conjugate()).eval(), ge_sx.noalias() -= (ge_right.adjoint() * (-s1 * mat).adjoint().template triangularView<Mode>()).eval());
|
| product_extra.cpp | 41 VERIFY_IS_APPROX(m3.noalias() = m1 * m2.adjoint(), m1 * m2.adjoint().eval());
42 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * square.adjoint(), m1.adjoint().eval() * square.adjoint().eval());
43 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * m2, m1.adjoint().eval() * m2);
44 VERIFY_IS_APPROX(m3.noalias() = (s1 * m1.adjoint()) * m2, (s1 * m1.adjoint()).eval() * m2);
45 VERIFY_IS_APPROX(m3.noalias() = ((s1 * m1).adjoint()) * m2, (numext::conj(s1) * m1.adjoint()).eval() * m2);
46 VERIFY_IS_APPROX(m3.noalias() = (- m1.adjoint() * s1) * (s3 * m2), (- m1.adjoint() * s1).eval() * (s3 * m2).eval());
47 VERIFY_IS_APPROX(m3.noalias() = (s2 * m1.adjoint() * s1) * m2, (s2 * m1.adjoint() * s1).eval() * m2);
48 VERIFY_IS_APPROX(m3.noalias() = (-m1*s2) * s1*m2.adjoint(), (-m1*s2).eval() * (s1*m2.adjoint()).eval());
157 r1.segment(o,m).noalias() = M * v1;
159 r2.segment(o,n).noalias() = v2 * M
[all...] |
| product.h | 93 res.noalias() += m1 * m2.transpose();
100 vcres.noalias() += m1.transpose() * v1;
105 res.noalias() -= m1 * m2.transpose();
112 vcres.noalias() -= m1.transpose() * v1;
129 res2.noalias() += m1.transpose() * m2;
136 VERIFY_IS_APPROX(res.col(r).noalias() = square.adjoint() * square.col(r), (square.adjoint() * square.col(r)).eval());
137 VERIFY_IS_APPROX(res.col(r).noalias() = square * square.col(r), (square * square.col(r)).eval());
|
| basicstuff.cpp | 117 sm2.col(i).noalias() = sm1.row(i);
122 sm2.col(i).noalias() += sm1.row(i);
127 sm2.col(i).noalias() -= sm1.row(i);
|
| /external/eigen/Eigen/src/Householder/ |
| Householder.h | 125 tmp.noalias() = essential.adjoint() * bottom;
128 bottom.noalias() -= tau * essential * tmp;
162 tmp.noalias() = right * essential.conjugate();
165 right.noalias() -= tau * tmp * essential.transpose();
|
| BlockHouseholder.h | 34 triFactor.col(i).head(i).noalias() = -hCoeffs(i) * vectors.block(i, 0, rs, i).adjoint()
37 // FIXME add .noalias() once the triangular product can work inplace
59 // FIXME add .noalias() once the triangular product can work inplace
61 mat.noalias() -= V * tmp;
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixExponential.h | 198 m_tmp1.noalias() = A * A;
200 m_U.noalias() = A * m_tmp2;
209 m_tmp1.noalias() = A2 * A2;
211 m_U.noalias() = A * m_tmp2;
221 m_tmp1.noalias() = A4 * A2;
223 m_U.noalias() = A * m_tmp2;
235 m_tmp1.noalias() = A6 * A2;
237 m_U.noalias() = A * m_tmp2;
249 m_tmp1.noalias() = A4 * A2;
251 m_tmp2.noalias() = m_tmp1 * m_V
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| Umeyama.h | 146 Rt.block(0,0,m,m).noalias() = svd.matrixU()*svd.matrixV().transpose();
149 Rt.block(0,0,m,m).noalias() = svd.matrixU() * S.asDiagonal() * svd.matrixV().transpose();
153 Rt.block(0,0,m,m).noalias() = svd.matrixU() * S.asDiagonal() * svd.matrixV().transpose();
163 Rt.col(m).head(m).noalias() -= c*Rt.topLeftCorner(m,m)*src_mean;
169 Rt.col(m).head(m).noalias() -= Rt.topLeftCorner(m,m)*src_mean;
|
| Transform.h | 441 res.linear().noalias() = a*b.linear();
442 res.translation().noalias() = a*b.translation();
788 linearExt().noalias() = (linearExt() * other.asDiagonal());
[all...] |
| /external/eigen/bench/ |
| bench_gemm.cpp | 95 cr.noalias() += ar * br;
96 cr.noalias() -= ai * bi;
97 ci.noalias() += ar * bi;
98 ci.noalias() += ai * br;
103 cr.noalias() += a * br;
104 ci.noalias() += a * bi;
109 cr.noalias() += ar * b;
110 ci.noalias() += ai * b;
116 c.noalias() += a * b;
182 r.noalias() += a * b
[all...] |
| spmv.cpp | 109 SPMV_BENCH(res.noalias() += sm * dv; )
112 SPMV_BENCH(res.noalias() += sm.transpose() * dv; )
|
| product_threshold.cpp | 41 c.noalias() += typename ProductReturnType<Lhs,Rhs,Mode>::Type(a,b);
|
| /external/ceres-solver/internal/ceres/ |
| small_blas.h | 147 block.noalias() += Aref * Bref;
149 block.noalias() -= Aref * Bref;
151 block.noalias() = Aref * Bref;
207 block.noalias() += Aref.transpose() * Bref;
209 block.noalias() -= Aref.transpose() * Bref;
211 block.noalias() = Aref.transpose() * Bref;
286 // lazyProduct works better than .noalias() for matrix-vector
337 // lazyProduct works better than .noalias() for matrix-vector
|
| block_jacobi_preconditioner.cc | 87 col_block_size).noalias() += m.transpose() * m;
|
| /external/eigen/bench/btl/libs/eigen3/ |
| eigen3_interface.hh | 88 X.noalias() = A*B;
92 X.noalias() = A.transpose()*B.transpose();
96 // X.noalias() = A.transpose()*A;
105 X.noalias() = A*B;
109 X.noalias() = (A.template selfadjointView<Lower>() * B);
174 X.noalias() = (A.transpose()*B);
202 X.noalias() = L.template triangularView<Lower>() * B;
|
| /external/clang/test/Parser/ |
| MicrosoftExtensions.c | 8 __declspec(safebuffers) __declspec(noalias) __declspec(restrict) void * __cdecl xxx(void *_Memory); /* expected-warning{{__declspec attribute 'safebuffers' is not supported}} expected-warning{{__declspec attribute 'noalias' is not supported}} expected-warning{{__declspec attribute 'restrict' is not supported}} */
|
| /external/eigen/Eigen/src/Core/ |
| NoAlias.h | 15 /** \class NoAlias
25 * It is the return type of MatrixBase::noalias()
28 * \sa MatrixBase::noalias()
31 class NoAlias
35 NoAlias(ExpressionType& expression) : m_expression(expression) {}
101 * More precisely, noalias() allows to bypass the EvalBeforeAssignBit flag.
103 * expressions have this flag. Therefore, noalias() is only usefull when
106 * Here are some examples where noalias is usefull:
108 * D.noalias() = A * B;
109 * D.noalias() += A.transpose() * B
127 NoAlias<Derived,MatrixBase> MatrixBase<Derived>::noalias() function in class:Eigen::MatrixBase
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BiCGSTAB.h | 87 v.noalias() = mat * y;
93 t.noalias() = mat * z;
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| MINRES.h | 89 v_new.noalias() = mat*w - beta*v_old; // compute v_new
113 p.noalias()=(w-r2*p_old-r3*p_oold) /r1; // IS NOALIAS REQUIRED?
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 278 lu.bottomRightCorner(rrows,rcols).noalias() -= lu.col(k).tail(rrows) * lu.row(k).tail(rcols);
364 A22.noalias() -= A21 * A12;
|
