Home
last modified time | relevance | path

Searched refs:transpose (Results 1 – 25 of 430) sorted by relevance

12345678910>>...18

/external/guava/guava-tests/test/com/google/common/collect/
DTransposedTableTest.java32 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/test/eigen2/
Deigen2_sparse_product.cpp36 VERIFY_IS_APPROX(m4=m2.transpose()*m3, refMat4=refMat2.transpose()*refMat3); in sparse_product()
37 …VERIFY_IS_APPROX(m4=m2.transpose()*m3.transpose(), refMat4=refMat2.transpose()*refMat3.transpose()… in sparse_product()
38 VERIFY_IS_APPROX(m4=m2*m3.transpose(), refMat4=refMat2*refMat3.transpose()); in sparse_product()
42 VERIFY_IS_APPROX(dm4=m2*refMat3.transpose(), refMat4=refMat2*refMat3.transpose()); in sparse_product()
43 VERIFY_IS_APPROX(dm4=m2.transpose()*refMat3, refMat4=refMat2.transpose()*refMat3); in sparse_product()
44 …VERIFY_IS_APPROX(dm4=m2.transpose()*refMat3.transpose(), refMat4=refMat2.transpose()*refMat3.trans… in sparse_product()
48 VERIFY_IS_APPROX(dm4=refMat2*m3.transpose(), refMat4=refMat2*refMat3.transpose()); in sparse_product()
49 VERIFY_IS_APPROX(dm4=refMat2.transpose()*m3, refMat4=refMat2.transpose()*refMat3); in sparse_product()
50 …VERIFY_IS_APPROX(dm4=refMat2.transpose()*m3.transpose(), refMat4=refMat2.transpose()*refMat3.trans… in sparse_product()
66 VERIFY_IS_APPROX(m3=m2.transpose()*d1, refM3=refM2.transpose()*d1); in sparse_product()
[all …]
Dproduct.h66 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in product()
68 m3 *= m1.transpose() * m2; in product()
69 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product()
70 VERIFY_IS_APPROX(m3, m1.lazy() * (m1.transpose()*m2)); in product()
85 VERIFY_IS_APPROX(v1.transpose(), v1.transpose() * identity); in product()
96 VERIFY(areNotApprox(m1.transpose()*m2,m2.transpose()*m1)); in product()
101 res += (m1 * m2.transpose()).lazy(); in product()
102 VERIFY_IS_APPROX(res, square + m1 * m2.transpose()); in product()
105 VERIFY(areNotApprox(res,square + m2 * m1.transpose())); in product()
108 vcres += (m1.transpose() * v1).lazy(); in product()
[all …]
Deigen2_triangular.cpp45 VERIFY(m2up.transpose().isLowerTriangular()); in triangular()
60 m1.template part<Eigen::UpperTriangular>() = (m2.transpose() * m2).lazy(); in triangular()
61 m3 = m2.transpose() * m2; in triangular()
62 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>().transpose(), m1); in triangular()
66 m1.template part<Eigen::LowerTriangular>() = (m2.transpose() * m2).lazy(); in triangular()
79 VERIFY(m3.transpose().template marked<Eigen::UpperTriangular>() in triangular()
80 .solveTriangular(m3.transpose()).cwise().abs().isIdentity(test_precision<RealScalar>())); in triangular()
83 m3.transpose().template marked<Eigen::UpperTriangular>().solveTriangularInPlace(trm4); in triangular()
88 VERIFY(m3.transpose().template marked<Eigen::LowerTriangular>() in triangular()
89 .solveTriangular(m3.transpose()).cwise().abs().isIdentity(test_precision<RealScalar>())); in triangular()
[all …]
Deigen2_bug_132.cpp17 VectorXd y = A.transpose() * (b-c); // bug 132: infinite recursion in coeffRef in test_eigen2_bug_132()
18 VectorXd z = (b-c).transpose() * A; // bug 132: infinite recursion in coeffRef in test_eigen2_bug_132()
24 VectorXd z = (b-c).transpose() * A.transpose(); in test_eigen2_bug_132()
/external/eigen/test/
Dproduct.h61 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in product()
63 m3 *= m1.transpose() * m2; in product()
64 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product()
65 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product()
77 VERIFY_IS_APPROX(v1.transpose(), v1.transpose() * identity); in product()
88 VERIFY(areNotApprox(m1.transpose()*m2,m2.transpose()*m1)); in product()
93 res.noalias() += m1 * m2.transpose(); in product()
94 VERIFY_IS_APPROX(res, square + m1 * m2.transpose()); in product()
97 VERIFY(areNotApprox(res,square + m2 * m1.transpose())); in product()
100 vcres.noalias() += m1.transpose() * v1; in product()
[all …]
Dsparse_product.cpp19 …VERIFY_IS_APPROX(m4=m2.col(c)*refMat2.col(c1).transpose(), refMat4=refMat2.col(c)*refMat2.col(c1).… in run()
20 …VERIFY_IS_APPROX(m4=refMat2.col(c1)*m2.col(c).transpose(), refMat4=refMat2.col(c1)*refMat2.col(c).… in run()
29 …FY_IS_APPROX(m4=m2.row(r).transpose()*refMat2.col(c1).transpose(), refMat4=refMat2.row(r).transpos… in run()
89 VERIFY_IS_APPROX(m4=m2t.transpose()*m3, refMat4=refMat2t.transpose()*refMat3); in sparse_product()
90 …VERIFY_IS_APPROX(m4=m2t.transpose()*m3t.transpose(), refMat4=refMat2t.transpose()*refMat3t.transpo… in sparse_product()
91 VERIFY_IS_APPROX(m4=m2*m3t.transpose(), refMat4=refMat2*refMat3t.transpose()); in sparse_product()
98 VERIFY_IS_APPROX(m4=(m2t.transpose()*m3).pruned(0), refMat4=refMat2t.transpose()*refMat3); in sparse_product()
99 …VERIFY_IS_APPROX(m4=(m2t.transpose()*m3t.transpose()).pruned(0), refMat4=refMat2t.transpose()*refM… in sparse_product()
100 VERIFY_IS_APPROX(m4=(m2*m3t.transpose()).pruned(0), refMat4=refMat2*refMat3t.transpose()); in sparse_product()
108 VERIFY_IS_APPROX(dm4=m2*refMat3t.transpose(), refMat4=refMat2*refMat3t.transpose()); in sparse_product()
[all …]
Dvectorwiseop.cpp40 VERIFY_RAISES_ASSERT(m2.colwise() += colvec.transpose()); in vectorwiseop_array()
41 VERIFY_RAISES_ASSERT(m1.colwise() + colvec.transpose()); in vectorwiseop_array()
48 VERIFY_RAISES_ASSERT(m2.rowwise() += rowvec.transpose()); in vectorwiseop_array()
49 VERIFY_RAISES_ASSERT(m1.rowwise() + rowvec.transpose()); in vectorwiseop_array()
58 VERIFY_RAISES_ASSERT(m2.colwise() -= colvec.transpose()); in vectorwiseop_array()
59 VERIFY_RAISES_ASSERT(m1.colwise() - colvec.transpose()); in vectorwiseop_array()
66 VERIFY_RAISES_ASSERT(m2.rowwise() -= rowvec.transpose()); in vectorwiseop_array()
67 VERIFY_RAISES_ASSERT(m1.rowwise() - rowvec.transpose()); in vectorwiseop_array()
76 VERIFY_RAISES_ASSERT(m2.colwise() *= colvec.transpose()); in vectorwiseop_array()
77 VERIFY_RAISES_ASSERT(m1.colwise() * colvec.transpose()); in vectorwiseop_array()
[all …]
Dnesting_ops.cpp21 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().sum(), (m.transpose() * m).diagonal().sum() ); in run_nesting_ops()
22 …VERIFY_IS_APPROX( (m.transpose() * m).diagonal().array().abs().sum(), (m.transpose() * m).diagonal… in run_nesting_ops()
24 …VERIFY_IS_APPROX( (m.transpose() * m).array().abs().sum(), (m.transpose() * m).array().abs().sum()… in run_nesting_ops()
Dadjoint.cpp84 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1); in adjoint()
85 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1); in adjoint()
108 VERIFY_IS_APPROX(m3,m1.transpose()); in adjoint()
142 VERIFY_RAISES_ASSERT(a = a.transpose()); in test_adjoint()
143 VERIFY_RAISES_ASSERT(a = a.transpose() + b); in test_adjoint()
144 VERIFY_RAISES_ASSERT(a = b + a.transpose()); in test_adjoint()
145 VERIFY_RAISES_ASSERT(a = a.conjugate().transpose()); in test_adjoint()
151 a.transpose() = a.transpose(); in test_adjoint()
152 a.transpose() += a.transpose(); in test_adjoint()
153 a.transpose() += a.transpose() + b; in test_adjoint()
[all …]
Dproduct_trsolve.cpp23 (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()); \
Dgeo_homogeneous.cpp42 hm0 << m0, ones.transpose(); in homogeneous()
58 VERIFY_IS_APPROX((v0.transpose().rowwise().homogeneous().eval()) * t2, in homogeneous()
59 v0.transpose().rowwise().homogeneous() * t2); in homogeneous()
60 m0.transpose().rowwise().homogeneous().eval(); in homogeneous()
61 VERIFY_IS_APPROX((m0.transpose().rowwise().homogeneous().eval()) * t2, in homogeneous()
62 m0.transpose().rowwise().homogeneous() * t2); in homogeneous()
65 VERIFY_IS_APPROX((v0.transpose().rowwise().homogeneous().eval()) * t3, in homogeneous()
66 v0.transpose().rowwise().homogeneous() * t3); in homogeneous()
67 VERIFY_IS_APPROX((m0.transpose().rowwise().homogeneous().eval()) * t3, in homogeneous()
68 m0.transpose().rowwise().homogeneous() * t3); in homogeneous()
Dproduct_trmv.cpp50 …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()
Dproduct_syrk.cpp104 …((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()
Dproduct_small.cpp21 matAstatic.cwiseProduct(matBstatic.transpose()).sum() ); in product1x1()
28 matAdynamic.cwiseProduct(matBdynamic.transpose()).sum() ); in product1x1()
47 VERIFY_IS_APPROX( (v * v.transpose()) * v, (v * v.transpose()).eval() * v); in test_product_small()
Dtriangular.cpp39 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()
143 VERIFY(m2up.transpose().isLowerTriangular()); in triangular_rect()
Dblock.cpp63 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1)); in block()
140 …_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()
141 …VERIFY_IS_EQUAL( (m1.transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , (m1.row(r1).segment(c1,c2-… in block()
147 …AL( ((m1+m2).block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0)) , ((m1+m2).row(r1).segment(c1,c2-c1+… in block()
148 …VERIFY_IS_EQUAL( ((m1+m2).transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , ((m1+m2).row(r1).segm… in block()
158 dm = m1.block(r1,c1,r2-r1+1,c2-c1+1).row(0).transpose(); in block()
168 dm = m1.block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0); in block()
173 dm = m1.row(r1).segment(c1,c2-c1+1).transpose(); in block()
174 dv = m1.transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0); in block()
227 compare_using_data_and_stride(m1.transpose().block(c1, r1, c2-c1+1, r2-r1+1)); in data_and_stride()
[all …]
/external/ceres-solver/internal/ceres/
Dcorrector_test.cc192 res * res.transpose() * jac); in TEST()
194 g_grad = rho[1] * jac.transpose() * res; in TEST()
195 g_hess = rho[1] * jac.transpose() * jac + in TEST()
196 2.0 * rho[2] * jac.transpose() * res * res.transpose() * jac; in TEST()
203 c_grad = jac.transpose() * res; in TEST()
204 c_hess = jac.transpose() * jac; in TEST()
255 g_grad = rho[1] * jac.transpose() * res; in TEST()
256 g_hess = rho[1] * jac.transpose() * jac + in TEST()
257 2.0 * rho[2] * jac.transpose() * res * res.transpose() * jac; in TEST()
264 c_grad = jac.transpose() * res; in TEST()
[all …]
Dblas.cc52 bool transpose, in SymmetricRankKUpdate() argument
60 char trans = transpose ? 'T' : 'N'; in SymmetricRankKUpdate()
61 int n = transpose ? num_cols : num_rows; in SymmetricRankKUpdate()
62 int k = transpose ? num_rows : num_cols; in SymmetricRankKUpdate()
Dimplicit_schur_complement_test.cc106 lhs_ref.triangularView<Eigen::StrictlyUpper>().transpose(); in ReducedLinearSystemAndSolution()
147 << "column " << i << ". explicit: " << y.transpose() in TestImplicitSchurComplement()
148 << " implicit: " << z.transpose(); in TestImplicitSchurComplement()
156 << "rhs. explicit: " << rhs.transpose() in TestImplicitSchurComplement()
157 << " implicit: " << isc.rhs().transpose(); in TestImplicitSchurComplement()
171 << "explicit: " << reference_solution.transpose() in TestImplicitSchurComplement()
172 << " implicit: " << sol.transpose(); in TestImplicitSchurComplement()
/external/eigen/unsupported/doc/examples/
DPolynomialSolver1.cpp13 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/eigen/doc/snippets/
DHouseholderSequence_HouseholderSequence.cpp6 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;
DMatrixBase_transpose.cpp3 cout << "Here is the transpose of m:" << endl << m.transpose() << endl;
5 << m.transpose()(1,0) << endl;
7 m.transpose()(1,0) = 0;
DSelfAdjointEigenSolver_SelfAdjointEigenSolver.cpp3 Matrix4f A = X + X.transpose();
5 cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
7 cout << "The eigenvalues of A+I are: " << es.eigenvalues().transpose() << endl;
DGeneralizedEigenSolver.cpp5 cout << "The (complex) numerators of the generalzied eigenvalues are: " << ges.alphas().transpose()…
6 cout << "The (real) denominatore of the generalzied eigenvalues are: " << ges.betas().transpose() <…
7 cout << "The (complex) generalzied eigenvalues are (alphas./beta): " << ges.eigenvalues().transpose…

12345678910>>...18