| /external/eigen/test/ |
| D | product.h | 60 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in product()
62 m3 *= m1.transpose() * m2; in product()
63 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product()
64 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product()
76 VERIFY_IS_APPROX(v1.transpose(), v1.transpose() * identity); in product()
87 VERIFY(areNotApprox(m1.transpose()*m2,m2.transpose()*m1)); in product()
92 res.noalias() += m1 * m2.transpose(); in product()
93 VERIFY_IS_APPROX(res, square + m1 * m2.transpose()); in product()
96 VERIFY(areNotApprox(res,square + m2 * m1.transpose())); in product()
99 vcres.noalias() += m1.transpose() * v1; in product()
[all …]
|
| D | sparse_product.cpp | 81 VERIFY_IS_APPROX(m4=m2t.transpose()*m3, refMat4=refMat2t.transpose()*refMat3); in sparse_product()
82 …VERIFY_IS_APPROX(m4=m2t.transpose()*m3t.transpose(), refMat4=refMat2t.transpose()*refMat3t.transpo… in sparse_product()
83 VERIFY_IS_APPROX(m4=m2*m3t.transpose(), refMat4=refMat2*refMat3t.transpose()); in sparse_product()
93 VERIFY_IS_APPROX(m4=(m2t.transpose()*m3).pruned(0), refMat4=refMat2t.transpose()*refMat3); in sparse_product()
94 …VERIFY_IS_APPROX(m4=(m2t.transpose()*m3t.transpose()).pruned(0), refMat4=refMat2t.transpose()*refM… in sparse_product()
95 VERIFY_IS_APPROX(m4=(m2*m3t.transpose()).pruned(0), refMat4=refMat2*refMat3t.transpose()); in sparse_product()
110 VERIFY_IS_EQUAL( (As*As.transpose()).eval().nonZeros(), 4); in sparse_product()
111 VERIFY_IS_EQUAL( (Ad*Ad.transpose()).eval().sparseView().eval().nonZeros(), 2); in sparse_product()
112 VERIFY_IS_EQUAL( (As*As.transpose()).pruned(1e-6).eval().nonZeros(), 2); in sparse_product()
119 VERIFY_IS_APPROX(dm4 =m2t.transpose()*m3, refMat4 =refMat2t.transpose()*refMat3); in sparse_product()
[all …]
|
| D | sparse_ref.cpp | 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()
88 VERIFY_EVALUATION_COUNT( call_ref_2(B.transpose(), B.transpose()), 0); in call_ref()
89 VERIFY_EVALUATION_COUNT( call_ref_3(B.transpose(), B.transpose()), 0); in call_ref()
102 VERIFY_EVALUATION_COUNT( call_ref_1(Br.transpose(), Br.transpose()), 0); in call_ref()
104 VERIFY_EVALUATION_COUNT( call_ref_2(Br.transpose(), Br.transpose()), 0); in call_ref()
114 VERIFY_EVALUATION_COUNT( call_ref_2(vr.transpose(), vr.transpose()), 0); in call_ref()
115 VERIFY_EVALUATION_COUNT( call_ref_2(vr, vr.transpose()), 0); in call_ref()
120 VERIFY_EVALUATION_COUNT( call_ref_4(vr, vr.transpose()), 0); in call_ref()
122 VERIFY_EVALUATION_COUNT( call_ref_5(vr, vr.transpose()), 0); in call_ref()
[all …]
|
| D | vectorwiseop.cpp | 42 VERIFY_RAISES_ASSERT(m2.colwise() += colvec.transpose()); in vectorwiseop_array()
43 VERIFY_RAISES_ASSERT(m1.colwise() + colvec.transpose()); in vectorwiseop_array()
50 VERIFY_RAISES_ASSERT(m2.rowwise() += rowvec.transpose()); in vectorwiseop_array()
51 VERIFY_RAISES_ASSERT(m1.rowwise() + rowvec.transpose()); in vectorwiseop_array()
60 VERIFY_RAISES_ASSERT(m2.colwise() -= colvec.transpose()); in vectorwiseop_array()
61 VERIFY_RAISES_ASSERT(m1.colwise() - colvec.transpose()); in vectorwiseop_array()
68 VERIFY_RAISES_ASSERT(m2.rowwise() -= rowvec.transpose()); in vectorwiseop_array()
69 VERIFY_RAISES_ASSERT(m1.rowwise() - rowvec.transpose()); in vectorwiseop_array()
78 VERIFY_RAISES_ASSERT(m2.colwise() *= colvec.transpose()); in vectorwiseop_array()
79 VERIFY_RAISES_ASSERT(m1.colwise() * colvec.transpose()); in vectorwiseop_array()
[all …]
|
| D | product_extra.cpp | 63 VERIFY_IS_APPROX((s1 * vc2.transpose()) * (-m1.adjoint() * s2), in product_extra()
64 (s1 * vc2.transpose()).eval() * (-m1.adjoint()*s2).eval()); in product_extra()
65 VERIFY_IS_APPROX((s1 * vc2.adjoint()) * (-m1.transpose() * s2), in product_extra()
66 (s1 * vc2.adjoint()).eval() * (-m1.transpose()*s2).eval()); in product_extra()
70 VERIFY_IS_APPROX((-m1.adjoint() * s2) * (s1 * v1.transpose()), in product_extra()
71 (-m1.adjoint()*s2).eval() * (s1 * v1.transpose()).eval()); in product_extra()
72 VERIFY_IS_APPROX((-m1.transpose() * s2) * (s1 * v1.adjoint()), in product_extra()
73 (-m1.transpose()*s2).eval() * (s1 * v1.adjoint()).eval()); in product_extra()
120 VERIFY_IS_APPROX(dNdxy.transpose()*dNdxy*det*wt, det*wt*dNdxy.transpose()*dNdxy); in mat_mat_scalar_scalar_product()
135 VERIFY_IS_APPROX( (res=a*a.transpose()), MatrixType::Zero(rows,rows) ); in zero_sized_objects()
[all …]
|
| D | geo_homogeneous.cpp | 46 hm0 << m0, ones.transpose(); in homogeneous()
64 VERIFY_IS_APPROX((v0.transpose().rowwise().homogeneous().eval()) * t2, in homogeneous()
65 v0.transpose().rowwise().homogeneous() * t2); in homogeneous()
66 VERIFY_IS_APPROX((m0.transpose().rowwise().homogeneous().eval()) * t2, in homogeneous()
67 m0.transpose().rowwise().homogeneous() * t2); in homogeneous()
70 VERIFY_IS_APPROX((v0.transpose().rowwise().homogeneous().eval()) * t3, in homogeneous()
71 v0.transpose().rowwise().homogeneous() * t3); in homogeneous()
72 VERIFY_IS_APPROX((m0.transpose().rowwise().homogeneous().eval()) * t3, in homogeneous()
73 m0.transpose().rowwise().homogeneous() * t3); in homogeneous()
112 …VERIFY_IS_APPROX( (v0.transpose().homogeneous() .lazyProduct( t2 )).hnormalized(), (v0.transpose()… in homogeneous()
[all …]
|
| D | adjoint.cpp | 96 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1); in adjoint()
97 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1); in adjoint()
120 VERIFY_IS_APPROX(m3,m1.transpose()); in adjoint()
130 … block<PacketSize,PacketSize>(i,j)), (m1.template block<PacketSize,PacketSize>(i,j).transpose()) ); in adjoint()
175 VERIFY_RAISES_ASSERT(a = a.transpose()); in test_adjoint()
176 VERIFY_RAISES_ASSERT(a = a.transpose() + b); in test_adjoint()
177 VERIFY_RAISES_ASSERT(a = b + a.transpose()); in test_adjoint()
178 VERIFY_RAISES_ASSERT(a = a.conjugate().transpose()); in test_adjoint()
184 a.transpose() = a.transpose(); in test_adjoint()
185 a.transpose() += a.transpose(); in test_adjoint()
[all …]
|
| D | evaluators.cpp | 116 VERIFY_IS_APPROX_EVALUATOR(w, v.transpose()); // Transpose as rvalue in test_evaluators()
117 VERIFY_IS_APPROX_EVALUATOR(w, v_const.transpose()); in test_evaluators()
119 copy_using_evaluator(w.transpose(), v); // Transpose as lvalue in test_evaluators()
120 VERIFY_IS_APPROX(w,v.transpose().eval()); in test_evaluators()
122 copy_using_evaluator(w.transpose(), v_const); in test_evaluators()
123 VERIFY_IS_APPROX(w,v_const.transpose().eval()); in test_evaluators()
132 VERIFY_IS_APPROX_EVALUATOR(b, a.transpose()); in test_evaluators()
134 VERIFY_IS_APPROX_EVALUATOR(b, a_const.transpose()); in test_evaluators()
145 VERIFY_IS_APPROX_EVALUATOR(w, Vector2d::Zero().transpose()); in test_evaluators()
157 VERIFY_IS_APPROX_EVALUATOR(d, (a + b).transpose()); in test_evaluators()
[all …]
|
| D | product_trsolve.cpp | 23 (TRI).transpose().template solveInPlace<OnTheRight>(XB.transpose()); \
24 VERIFY_IS_APPROX((XB).transpose() * (TRI).transpose().toDenseMatrix(), ref.transpose()); \
26 (XB).transpose() = (TRI).transpose().template solve<OnTheRight>(XB.transpose()); \
27 VERIFY_IS_APPROX((XB).transpose() * (TRI).transpose().toDenseMatrix(), ref.transpose()); \
|
| D | product_notemporary.cpp | 46 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()).transpose(), 1); 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()
55 VERIFY_EVALUATION_COUNT( m3 = m3 + (m1 * m2.adjoint()).transpose(), 1); in product_notemporary()
56 VERIFY_EVALUATION_COUNT( m3.noalias() = m3 + m1 * m2.transpose(), 0); 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()
59 VERIFY_EVALUATION_COUNT( m3.noalias() = m3 - m1 * m2.transpose(), 0); in product_notemporary()
60 VERIFY_EVALUATION_COUNT( m3.noalias() += m3 - m1 * m2.transpose(), 0); in product_notemporary()
61 VERIFY_EVALUATION_COUNT( m3.noalias() -= m3 - m1 * m2.transpose(), 0); in product_notemporary()
[all …]
|
| D | nesting_ops.cpp | 42 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().sum(), (m.transpose() * m).diagonal().sum() ); in run_nesting_ops_1()
43 …VERIFY_IS_APPROX( (m.transpose() * m).diagonal().array().abs().sum(), (m.transpose() * m).diagonal… in run_nesting_ops_1()
45 …VERIFY_IS_APPROX( (m.transpose() * m).array().abs().sum(), (m.transpose() * m).array().abs().sum()… in run_nesting_ops_1()
83 VERIFY( verify_eval_type<1>(m1*m1.transpose(), m2) ); in run_nesting_ops_2()
84 VERIFY( verify_eval_type<1>(m1*(m1+m1).transpose(), m2) ); in run_nesting_ops_2()
85 VERIFY( verify_eval_type<2>(m1*m1.transpose(), m2) ); in run_nesting_ops_2()
|
| D | product_trmv.cpp | 50 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1,… in trmv()
52 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1,… in trmv()
54 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitLower>() *… in trmv()
56 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitUpper>() *… in trmv()
67 …VERIFY((v1.transpose() * m3).isApprox(v1.transpose() * m1.template triangularView<Eigen::Lower>(),… in trmv()
|
| D | product_syrk.cpp | 104 …((s1 * m1.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Low… in syrk()
107 …((s1 * m1.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Low… in syrk()
109 …PROX((m2.template triangularView<Lower>() += s1 * m3.row(c).transpose() * m1.row(c).transpose().ad… in syrk()
110 …((s1 * m3.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Low… in syrk()
112 …ROX((rm2.template triangularView<Lower>() += s1 * m3.row(c).transpose() * m1.row(c).transpose().ad… in syrk()
113 …((s1 * m3.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Low… in syrk()
|
| D | triangular.cpp | 39 VERIFY(m2up.transpose().isLowerTriangular()); in triangular_square()
54 m1.template triangularView<Upper>() = m2.transpose() + m2; in triangular_square()
55 m3 = m2.transpose() + m2; in triangular_square()
56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1); in triangular_square()
60 m1.template triangularView<Lower>() = m2.transpose() + m2; in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square()
93 m1.transpose().template triangularView<Eigen::Upper>().solveInPlace(trm4); in triangular_square()
99 m3.transpose().template triangularView<Eigen::Lower>().solveInPlace(trm4); in triangular_square()
158 VERIFY(m2up.transpose().isLowerTriangular()); in triangular_rect()
|
| D | inplace_decomposition.cpp | 52 VERIFY_IS_APPROX( A0.transpose() * A0 * (x = dec.solve(b)), A0.transpose() * b ); in inplace()
63 VERIFY_IS_NOT_APPROX( A0.transpose() * A0 * (x = dec.solve(b)), A0.transpose() * b ); in inplace()
77 VERIFY_IS_APPROX( A0.transpose() * A0 * (x = dec.solve(b)), A0.transpose() * b ); in inplace()
|
| D | block.cpp | 63 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1)); in block()
148 …_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0)) , (m1.row(r1).segment(c1,c2-c1+1))… in block()
149 …VERIFY_IS_EQUAL( (m1.transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , (m1.row(r1).segment(c1,c2-… in block()
155 …OX( ((m1+m2).block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0)) , ((m1+m2).row(r1).segment(c1,c2-c1+… in block()
156 …VERIFY_IS_APPROX( ((m1+m2).transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , ((m1+m2).row(r1).seg… in block()
166 dm = m1.block(r1,c1,r2-r1+1,c2-c1+1).row(0).transpose(); in block()
176 dm = m1.block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0); in block()
181 dm = m1.row(r1).segment(c1,c2-c1+1).transpose(); in block()
182 dv = m1.transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0); in block()
248 compare_using_data_and_stride(m1.transpose().block(c1, r1, c2-c1+1, r2-r1+1)); in data_and_stride()
[all …]
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | TransposedTableTest.java | 32 Table<String, Integer, Character> table = Tables.transpose(original); in create()
40 assertSame(original, Tables.transpose(Tables.transpose(original))); in testTransposeTransposed()
45 Table<String, Integer, Character> transpose = Tables.transpose(original); in testPutOriginalModifiesTranspose() local
47 assertEquals((Character) 'a', transpose.get("foo", 1)); in testPutOriginalModifiesTranspose()
52 Table<String, Integer, Character> transpose = Tables.transpose(original); in testPutTransposeModifiesOriginal() local
53 transpose.put("foo", 1, 'a'); in testPutTransposeModifiesOriginal()
59 Table<String, Integer, Character> transpose = Tables.transpose(original); in testTransposedViews() local
61 assertSame(original.columnKeySet(), transpose.rowKeySet()); in testTransposedViews()
62 assertSame(original.rowKeySet(), transpose.columnKeySet()); in testTransposedViews()
63 assertSame(original.columnMap(), transpose.rowMap()); in testTransposedViews()
[all …]
|
| /external/eigen/doc/snippets/ |
| D | DenseBase_LinSpacedInt.cpp | 2 cout << VectorXi::LinSpaced(8,1,4).transpose() << endl;
3 cout << VectorXi::LinSpaced(8,1,8).transpose() << endl;
4 cout << VectorXi::LinSpaced(8,1,15).transpose() << endl;
6 cout << VectorXi::LinSpaced(8,1,7).transpose() << endl;
7 cout << VectorXi::LinSpaced(8,1,9).transpose() << endl;
8 cout << VectorXi::LinSpaced(8,1,16).transpose() << endl;
|
| D | MatrixBase_hnormalized.cpp | 3 cout << "v = " << v.transpose() << "]^T" << endl;
4 cout << "v.hnormalized() = " << v.hnormalized().transpose() << "]^T" << endl;
5 cout << "P*v = " << (P*v).transpose() << "]^T" << endl;
6 cout << "(P*v).hnormalized() = " << (P*v).hnormalized().transpose() << "]^T" << endl;
|
| D | MatrixBase_homogeneous.cpp | 3 cout << "v = [" << v.transpose() << "]^T" << endl;
4 cout << "h.homogeneous() = [" << v.homogeneous().transpose() << "]^T" << endl;
5 cout << "(P * v.homogeneous()) = [" << (P * v.homogeneous()).transpose() << "]^T" << …
6 …ous()).hnormalized() = [" << (P * v.homogeneous()).eval().hnormalized().transpose() << "]^T" << en…
|
| D | HouseholderSequence_HouseholderSequence.cpp | 6 cout << "The first Householder vector is: v_0 = " << v0.transpose() << endl;
8 cout << "The second Householder vector is: v_1 = " << v1.transpose() << endl;
10 cout << "The third Householder vector is: v_2 = " << v2.transpose() << endl;
13 cout << "The Householder coefficients are: h = " << h.transpose() << endl;
|
| D | MatrixBase_transpose.cpp | 3 cout << "Here is the transpose of m:" << endl << m.transpose() << endl;
5 << m.transpose()(1,0) << endl;
7 m.transpose()(1,0) = 0;
|
| /external/eigen/unsupported/doc/examples/ |
| D | PolynomialSolver1.cpp | 13 cout << "Roots: " << roots.transpose() << endl; in main()
18 cout << "Complex roots: " << psolve.roots().transpose() << endl; in main()
23 cout << "Real roots: " << mapRR.transpose() << endl; in main()
31 cout << "Hard case polynomial defined by floats: " << hardCase_polynomial.transpose() << endl; in main()
33 cout << "Complex roots: " << psolvef.roots().transpose() << endl; in main()
36 …cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl <… in main()
41 cout << "Complex roots: " << psolve6d.roots().transpose() << endl; in main()
47 …cout << "Norms of the evaluations of the polynomial at the roots: " << evals.transpose() << endl <… in main()
|
| /external/skia/src/core/ |
| D | Sk4x4f.h | 22 void transpose(Sk4f* x, Sk4f* y, Sk4f* z, Sk4f* w) const { in transpose() function
29 void transpose( float[16]) const;
30 void transpose(uint8_t[16]) const;
59 inline void Sk4x4f::transpose(float fs[16]) const { in transpose() function
61 this->transpose(&x,&y,&z,&w); in transpose()
68 inline void Sk4x4f::transpose(uint8_t bs[16]) const { in transpose() function
100 inline void Sk4x4f::transpose(float fs[16]) const { in transpose() function
105 inline void Sk4x4f::transpose(uint8_t bs[16]) const { in transpose() function
137 inline void Sk4x4f::transpose(float fs[16]) const { in transpose() function
139 this->transpose(&x,&y,&z,&w); in transpose()
[all …]
|
| /external/mesa3d/src/mesa/main/ |
| D | uniforms.c | 340 _mesa_UniformMatrix2fvARB(GLint location, GLsizei count, GLboolean transpose, in _mesa_UniformMatrix2fvARB() argument
345 2, 2, location, count, transpose, value); in _mesa_UniformMatrix2fvARB()
349 _mesa_UniformMatrix3fvARB(GLint location, GLsizei count, GLboolean transpose, in _mesa_UniformMatrix3fvARB() argument
354 3, 3, location, count, transpose, value); in _mesa_UniformMatrix3fvARB()
358 _mesa_UniformMatrix4fvARB(GLint location, GLsizei count, GLboolean transpose, in _mesa_UniformMatrix4fvARB() argument
363 4, 4, location, count, transpose, value); in _mesa_UniformMatrix4fvARB()
371 _mesa_UniformMatrix2x3fv(GLint location, GLsizei count, GLboolean transpose, in _mesa_UniformMatrix2x3fv() argument
376 2, 3, location, count, transpose, value); in _mesa_UniformMatrix2x3fv()
380 _mesa_UniformMatrix3x2fv(GLint location, GLsizei count, GLboolean transpose, in _mesa_UniformMatrix3x2fv() argument
385 3, 2, location, count, transpose, value); in _mesa_UniformMatrix3x2fv()
[all …]
|