/external/chromium_org/third_party/WebKit/Source/platform/animation/ |
H A D | UnitBezier.h | 140 double solve(double x, double epsilon) function in struct:blink::UnitBezier
|
/external/chromium_org/third_party/android_platform/webview/ |
H A D | frameworks.jar | META-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ... |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.sat4j.core_2.2.0.v20100429.jar | ... public void log (java.lang.String) protected void solve (org.sat4j.specs.IProblem) throws org. ... |
/external/eigen/Eigen/src/Cholesky/ |
H A D | LDLT.h | 171 * This function also supports in-place solves using the syntax <tt>x = decompositionObject.solve(x)</tt> . 186 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::LDLT 190 && "LDLT::solve(): invalid number of rows of the right hand side matrix b"); 196 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::LDLT 198 *result = this->solve(b); 532 /** \internal use x = ldlt_object.solve(x); 534 * This is the \em in-place version of solve(). 543 * \sa LDLT::solve(), MatrixBase::ldlt() 552 bAndX = this->solve(bAndX);
|
H A D | LLT.h | 32 * While the Cholesky decomposition is particularly useful to solve selfadjoint problems like D^*D x = b, 122 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::LLT 126 && "LLT::solve(): invalid number of rows of the right hand side matrix b"); 132 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::LLT 134 *result = this->solve(b); 435 /** \internal use x = llt_object.solve(x); 437 * This is the \em in-place version of solve(). 446 * \sa LLT::solve(), MatrixBase::llt()
|
/external/eigen/Eigen/src/CholmodSupport/ |
H A D | CholmodSupport.h | 225 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::CholmodBase 229 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b"); 239 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::CholmodBase 243 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b"); 369 * This class allows to solve for A.X = B sparse linear problems via a simplicial LL^T Cholesky factorization 416 * This class allows to solve for A.X = B sparse linear problems via a simplicial LDL^T Cholesky factorization 461 * This class allows to solve for A.X = B sparse linear problems via a supernodal LL^T Cholesky factorization 506 * This class allows to solve for A.X = B sparse linear problems via a LL^T or LDL^T Cholesky factorization
|
/external/eigen/Eigen/src/Core/ |
H A D | SolveTriangular.h | 165 /** "in-place" version of TriangularView::solve() where the result is written in \a other 170 * See TriangularView:solve() for the details. 216 TriangularView<Derived,Mode>::solve(const MatrixBase<Other>& other) const function in class:Eigen::TriangularView
|
H A D | TriangularMatrix.h | 330 solve(const MatrixBase<Other>& other) const; 337 solve(const MatrixBase<Other>& other) const function in class:Eigen::TriangularView 338 { return solve<OnTheLeft>(other); }
|
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | LU.h | 52 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::LU 54 *result = static_cast<const Base*>(this)->solve(b); 61 solve(MatrixType::Identity(this->rows(), this->cols()), result);
|
H A D | QR.h | 30 bool solve(const MatrixBase<OtherDerived>& b, ResultType *result) const function in class:Eigen::QR 32 *result = static_cast<const Base*>(this)->solve(b);
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | BasicPreconditioners.h | 18 * This class allows to approximately solve for A.x = b problems assuming A is a diagonal matrix. 90 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::DiagonalPreconditioner 94 && "DiagonalPreconditioner::solve(): invalid number of rows of the right hand side matrix b"); 144 inline const Rhs& solve(const Rhs& b) const { return b; } function in class:Eigen::IdentityPreconditioner
|
H A D | IncompleteLUT.h | 164 x = m_lu.template triangularView<UnitLower>().solve(x); 165 x = m_lu.template triangularView<Upper>().solve(x); 170 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::IncompleteLUT 174 && "IncompleteLUT::solve(): invalid number of rows of the right hand side matrix b");
|
H A D | IterativeSolverBase.h | 148 /** \returns the number of iterations performed during the last solve */ 155 /** \returns the tolerance error reached during the last solve */ 167 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::IterativeSolverBase 171 && "IterativeSolverBase::solve(): invalid number of rows of the right hand side matrix b"); 181 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::IterativeSolverBase 185 && "IterativeSolverBase::solve(): invalid number of rows of the right hand side matrix b"); 209 tx = derived().solve(tb);
|
/external/eigen/Eigen/src/LU/ |
H A D | FullPivLU.h | 197 * \param b the right-hand-side of the equation to solve. Can be a vector or a matrix, 211 * \sa TriangularView::solve(), kernel(), inverse() 215 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::FullPivLU 664 /***** Implementation of solve() *****************************************************/
|
H A D | PartialPivLU.h | 117 * \param b the right-hand-side of the equation to solve. Can be a vector or a matrix, 129 * \sa TriangularView::solve(), inverse(), computeInverse() 133 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::PartialPivLU 433 /***** Implementation of solve() *****************************************************/
|
/external/eigen/Eigen/src/PaStiXSupport/ |
H A D | PaStiXSupport.h | 18 * This class is used to solve the linear systems A.X = B via the PaStix library. 149 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::PastixBase 153 && "PastixBase::solve(): invalid number of rows of the right hand side matrix b"); 171 * The statistics related to the different phases of factorization and solve are saved here as well 189 * The statistics related to the different phases of factorization and solve are saved here as well 229 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::PastixBase 233 && "PastixBase::solve(): invalid number of rows of the right hand side matrix b"); 415 * This class is used to solve the linear systems A.X = B with a supernodal LU 530 * This class is used to solve the linear systems A.X = B via a LL^T supernodal Cholesky factorization 611 * This class is used to solve th [all...] |
/external/eigen/Eigen/src/PardisoSupport/ |
H A D | PardisoSupport.h | 175 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::PardisoImpl 179 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b"); 189 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::PardisoImpl 193 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b"); 375 // Pardiso cannot solve in-place 396 * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization 418 using Base::solve; 446 * This class allows to solve for A.X = B sparse linear problems via a LL^T Cholesky factorization 472 using Base::solve; 505 * This class allows to solve fo [all...] |
/external/eigen/Eigen/src/QR/ |
H A D | ColPivHouseholderQR.h | 126 * \param b the right-hand-side of the equation to solve. 142 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::ColPivHouseholderQR 459 // Note that not doing so does result in solve() sometimes returning inf/nan values 469 // repetitions of the unit test, with the result of solve() filled with large values of the order
|
H A D | FullPivHouseholderQR.h | 132 * \param b the right-hand-side of the equation to solve. 149 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::FullPivHouseholderQR
|
H A D | HouseholderQR.h | 106 * \param b the right-hand-side of the equation to solve. 122 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::HouseholderQR
|
/external/eigen/Eigen/src/SPQRSupport/ |
H A D | SuiteSparseQRSupport.h | 40 * of sparse matrices. The result is then used to solve linear leasts_square systems. 135 inline const internal::solve_retval<SPQR, Rhs> solve(const MatrixBase<Rhs>& B) const function in class:Eigen::SPQR 139 && "SPQR::solve(): invalid number of rows of the right hand side matrix B"); 154 y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView<Upper>().solve(y.topRows(rk));
|
/external/eigen/Eigen/src/SVD/ |
H A D | JacobiSVD.h | 654 * \param b the right-hand-side of the equation to solve. 663 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::JacobiSVD 666 eigen_assert(computeU() && computeV() && "JacobiSVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice)."); 694 /** Allows to prescribe a threshold to be used by certain methods, such as rank() and solve(),
|
/external/eigen/Eigen/src/SparseCholesky/ |
H A D | SimplicialCholesky.h | 88 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::SimplicialCholeskyBase 92 && "SimplicialCholeskyBase::solve(): invalid number of rows of the right hand side matrix b"); 102 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::SimplicialCholeskyBase 106 && "SimplicialCholesky::solve(): invalid number of rows of the right hand side matrix b");
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | TriangularSolver.h | 186 SparseTriangularView<ExpressionType,Mode>::solve(const MatrixBase<OtherDerived>& other) const function in class:Eigen::SparseTriangularView
|
/external/eigen/Eigen/src/SparseLU/ |
H A D | SparseLU.h | 53 * //Use the factors to solve the linear system 54 * x = solver.solve(b); 129 * The only operation available with this expression is the triangular solve 139 * The only operation available with this expression is the triangular solve 173 * \warning the destination matrix X in X = this->solve(B) must be colmun-major. 178 inline const internal::solve_retval<SparseLU, Rhs> solve(const MatrixBase<Rhs>& B) const function in class:Eigen::SparseLU 182 && "SparseLU::solve(): invalid number of rows of the right hand side matrix B"); 191 inline const internal::sparse_solve_retval<SparseLU, Rhs> solve(const SparseMatrixBase<Rhs>& B) const function in class:Eigen::SparseLU 195 && "SparseLU::solve(): invalid number of rows of the right hand side matrix B"); 446 * and division by zero will occur if it is used to solve [all...] |