| /external/chromium_org/third_party/WebKit/Source/platform/animation/ |
| D | UnitBezierTest.cpp | 38 EXPECT_EQ(0.875, bezier.solve(0.5, 0.005)); in TEST()
44 EXPECT_EQ(1.625, bezier.solve(0.5, 0.005)); in TEST()
50 EXPECT_EQ(-0.625, bezier.solve(0.5, 0.005)); in TEST()
56 EXPECT_EQ(0.0, bezier.solve(0.0, 0.005)); in TEST()
57 EXPECT_EQ(1.0, bezier.solve(1.0, 0.005)); in TEST()
63 EXPECT_EQ(0.0, bezier.solve(-1.0, 0.005)); in TEST()
64 EXPECT_EQ(1.0, bezier.solve(2.0, 0.005)); in TEST()
70 EXPECT_EQ(0.0, bezier.solve(-1.0, 1.0)); in TEST()
71 EXPECT_EQ(1.0, bezier.solve(2.0, 1.0)); in TEST()
|
| /external/eigen/test/ |
| D | sparse_solvers.cpp | 53 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2), in sparse_solvers()
54 m2.template triangularView<Lower>().solve(vec3)); in sparse_solvers()
58 VERIFY_IS_APPROX(refMat2.template triangularView<Upper>().solve(vec2), in sparse_solvers()
59 m2.template triangularView<Upper>().solve(vec3)); in sparse_solvers()
60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
61 m2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2), in sparse_solvers()
67 mm2.conjugate().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2), in sparse_solvers()
73 m2.transpose().template triangularView<Upper>().solve(vec3)); in sparse_solvers()
[all …]
|
| D | cholesky.cpp | 96 vecX = chollo.solve(vecB); in cholesky()
98 matX = chollo.solve(matB); in cholesky()
104 vecX = cholup.solve(vecB); in cholesky()
106 matX = cholup.solve(matB); in cholesky()
133 vecX = ldltlo.solve(vecB); in cholesky()
135 matX = ldltlo.solve(matB); in cholesky()
140 vecX = ldltup.solve(vecB); in cholesky()
142 matX = ldltup.solve(matB); in cholesky()
156 VERIFY_EVALUATION_COUNT(matX = ldltlo.solve(matX), 0); in cholesky()
157 VERIFY_IS_APPROX(matX, ldltlo.solve(matB).eval()); in cholesky()
[all …]
|
| D | nomalloc.cpp | 126 X = LLT.solve(B); in ctms_decompositions()
127 x = LLT.solve(b); in ctms_decompositions()
129 X = LDLT.solve(B); in ctms_decompositions()
130 x = LDLT.solve(b); in ctms_decompositions()
142 X = ppLU.solve(B); in ctms_decompositions()
143 x = ppLU.solve(b); in ctms_decompositions()
145 X = fpLU.solve(B); in ctms_decompositions()
146 x = fpLU.solve(b); in ctms_decompositions()
150 X = hQR.solve(B); in ctms_decompositions()
151 x = hQR.solve(b); in ctms_decompositions()
[all …]
|
| D | triangular.cpp | 73 …VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), large… in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps)); in triangular_square()
79 …VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), l… in triangular_square()
83 …VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), large… in triangular_square()
85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square()
87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps)); in triangular_square()
89 …VERIFY(m2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(m2)), l… in triangular_square()
104 VERIFY(m2.isApprox(m3 * (m1.template triangularView<UnitUpper>().solve(m2)), largerEps)); in triangular_square()
|
| D | qr_colpivoting.cpp | 44 m2 = qr.solve(m3); in qr()
69 m2 = qr.solve(m3); in qr_fixedsize()
92 m2 = qr.solve(m3); in qr_invertible()
112 VERIFY_RAISES_ASSERT(qr.solve(tmp)) in qr_verify_assert()
|
| D | jacobisvd.cpp | 87 SolutionType x = svd.solve(rhs); in jacobisvd_solve()
159 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in jacobisvd_verify_assert()
167 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in jacobisvd_verify_assert()
174 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in jacobisvd_verify_assert()
179 VERIFY_RAISES_ASSERT(svd.solve(rhs)) in jacobisvd_verify_assert()
203 VERIFY_IS_APPROX(m.jacobiSvd(ComputeFullU|ComputeFullV).solve(m), m); in jacobisvd_method()
|
| D | lu.cpp | 94 m2.block(0,0,m2.rows(),m2.cols()) = lu.solve(m3); in lu_non_invertible()
124 m2 = lu.solve(m3); in lu_invertible()
157 VERIFY_RAISES_ASSERT(lu.solve(tmp)) in lu_verify_assert()
169 VERIFY_RAISES_ASSERT(plu.solve(tmp)) in lu_verify_assert()
|
| D | qr.cpp | 50 m2 = qr.solve(m3); in qr_fixedsize()
73 m2 = qr.solve(m3); in qr_invertible()
93 VERIFY_RAISES_ASSERT(qr.solve(tmp)) in qr_verify_assert()
|
| D | qr_fullpivoting.cpp | 48 m2 = qr.solve(m3); in qr()
75 m2 = qr.solve(m3); in qr_invertible()
95 VERIFY_RAISES_ASSERT(qr.solve(tmp)) in qr_verify_assert()
|
| D | sparse_solver.h | 19 DenseRhs refX = dA.lu().solve(db); in check_sparse_solving()
31 x = solver.solve(b); in check_sparse_solving()
51 x = solver.solve(b); in check_sparse_solving()
66 x.block(0,0,x.rows(),x.cols()) = solver.solve(b.block(0,0,b.rows(),b.cols())); in check_sparse_solving()
88 x = solver.solve(b); in check_sparse_solving_real_cases()
|
| /external/eigen/test/eigen2/ |
| D | eigen2_cholesky.cpp | 54 symm.llt().solve(vecB, &vecX); in cholesky()
73 ldlt.solve(vecB, &vecX); in cholesky()
75 ldlt.solve(matB, &matX); in cholesky()
83 chol.solve(vecB, &vecX); in cholesky()
85 chol.solve(matB, &matX); in cholesky()
|
| D | eigen2_sparse_solvers.cpp | 83 refMat2.llt().solve(b, &refX); in sparse_solvers()
127 refMat2.ldlt().solve(b, &refX); in sparse_solvers()
148 refLu.solve(b, &refX); in sparse_solvers()
161 if (slu.solve(b,&x)) { in sparse_solvers()
177 if (slu.solve(b,&x)) { in sparse_solvers()
|
| D | eigen2_lu.cpp | 69 lu.solve(m3, &m2); in lu_non_invertible()
103 lu.solve(m3, &m2); in lu_invertible()
107 VERIFY(lu.solve(m3, &m2)); in lu_invertible()
|
| /external/eigen/doc/snippets/ |
| D | Tutorial_solve_reuse_decomposition.cpp | 7 x = luOfA.solve(b);
11 x = luOfA.solve(b);
|
| /external/eigen/doc/examples/ |
| D | TutorialLinAlgComputeTwice.cpp | 17 cout << "The solution is:\n" << llt.solve(b) << endl; in main()
22 cout << "The solution is now:\n" << llt.solve(b) << endl; in main()
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| D | LU.h | 52 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const in solve() function
54 *result = static_cast<const Base*>(this)->solve(b); in solve()
61 solve(MatrixType::Identity(this->rows(), this->cols()), result); in computeInverse()
|
| D | QR.h | 30 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const in solve() function
32 *result = static_cast<const Base*>(this)->solve(b); in solve()
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| D | MatrixLogarithm.h | 254 .template triangularView<Upper>().solve(TminusI); in computePade3()
270 .template triangularView<Upper>().solve(TminusI); in computePade4()
288 .template triangularView<Upper>().solve(TminusI); in computePade5()
306 .template triangularView<Upper>().solve(TminusI); in computePade6()
326 .template triangularView<Upper>().solve(TminusI); in computePade7()
346 .template triangularView<Upper>().solve(TminusI); in computePade8()
368 .template triangularView<Upper>().solve(TminusI); in computePade9()
390 .template triangularView<Upper>().solve(TminusI); in computePade10()
414 .template triangularView<Upper>().solve(TminusI); in computePade11()
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | IncompleteLU.h | 76 x = m_lu.template triangularView<UnitLower>().solve(b); in _solve()
77 x = m_lu.template triangularView<Upper>().solve(x); in _solve()
81 solve(const MatrixBase<Rhs>& b) const in solve() function
|
| /external/llvm/test/Transforms/Inline/ |
| D | callgraph-update.ll | 3 declare void @solve()
12 call void @solve()
|
| /external/eigen/doc/ |
| D | A05_PortingFrom2To3.dox | 219 <tr><td>\code A.lu().solve(B,&X);\endcode</td>
220 <td>\code X = A.lu().solve(B);
221 X = A.fullPivLu().solve(B);\endcode</td>
223 <tr><td>\code A.llt().solve(B,&X);\endcode</td>
224 <td>\code X = A.llt().solve(B);
225 X = A.selfadjointView<Lower>.llt().solve(B);
226 X = A.selfadjointView<Upper>.llt().solve(B);\endcode</td>
231 <td>\code B = A.llt().solve(B);
232 B = A.selfadjointView<Lower>.llt().solve(B);
233 B = A.selfadjointView<Upper>.llt().solve(B);\endcode</td>
[all …]
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | IterativeSolverBase.h | 167 solve(const MatrixBase<Rhs>& b) const in solve() function
181 solve(const SparseMatrixBase<Rhs>& b) const in solve() function
209 tx = derived().solve(tb); in _solve_sparse()
|
| /external/eigen/unsupported/test/ |
| D | mpreal_support.cpp | 39 X = S.selfadjointView<Lower>().llt().solve(B); in test_mpreal_support()
43 X = A.lu().solve(B); in test_mpreal_support()
|
| /external/ceres-solver/internal/ceres/ |
| D | schur_eliminator_test.cc | 116 .solve(Matrix::Identity(block_size, block_size)); in ComputeReferenceSolution()
124 sol_expected = H.llt().solve(g); in ComputeReferenceSolution()
164 .solve(rhs); in EliminateSolveAndCompare()
|