| /external/llvm/lib/Analysis/ |
| LazyValueInfo.cpp | 380 void solve();
457 void LazyValueInfoCache::solve() { function in class:LazyValueInfoCache
499 // cache needs updating, i.e. if we have solve a new value or not.
917 solve();
931 solve();
[all...] |
| /external/libvorbis/doc/ |
| 09-helper.tex | 101 integer algorithm to solve for the point directly without calculating
|
| /external/ceres-solver/internal/ceres/ |
| schur_complement_solver.cc | 63 EventLogger event_logger("SchurComplementSolver::Solve");
117 // Solve the system Sx = r, assuming that the matrix S is stored in a
133 // the quality of the solution to the solve.
138 .solve(ConstVectorRef(rhs(), num_rows));
262 // Solve the system Sx = r, assuming that the matrix S is stored in a
317 LOG(WARNING) << "CHOLMOD solve failed.";
335 // Solve the system Sx = r, assuming that the matrix S is stored in a
362 // Solve the linear system.
|
| dogleg_strategy.cc | 116 // regularize the Gauss-Newton solve and that defines the
373 // For any given y, we can solve (2) for x as
444 return -B_i.partialPivLu().solve(subspace_g_);
453 // This function attempts to solve the boundary-constrained subspace problem
526 // If the solve fails, the multiplier to the diagonal is increased
532 // multiplier starts out from the last successful solve.
540 // that we need to solve the normal equations more or less
557 // As in the LevenbergMarquardtStrategy, solve Jy = r instead
561 linear_solver_summary = linear_solver_->Solve(jacobian,
618 // to doing a pure Gauss-Newton solve
[all...] |
| schur_eliminator_impl.h | 267 // Solve call over and over again.
272 .solve(Matrix::Identity(e_block_size, e_block_size));
|
| /external/eigen/Eigen/src/Core/ |
| 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
|
| 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/QR/ |
| HouseholderQR.h | 94 * \param b the right-hand-side of the equation to solve.
110 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::HouseholderQR
|
| ColPivHouseholderQR.h | 107 * \param b the right-hand-side of the equation to solve.
123 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::ColPivHouseholderQR
391 // Note that not doing so does result in solve() sometimes returning inf/nan values
401 // repetitions of the unit test, with the result of solve() filled with large values of the order
|
| FullPivHouseholderQR.h | 119 * \param b the right-hand-side of the equation to solve.
135 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::FullPivHouseholderQR
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 127 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::SimplicialCholeskyBase
131 && "SimplicialCholeskyBase::solve(): invalid number of rows of the right hand side matrix b");
141 solve(const SparseMatrixBase<Rhs>& b) const function in class:Eigen::SimplicialCholeskyBase
145 && "SimplicialCholesky::solve(): invalid number of rows of the right hand side matrix b");
234 tmp.leftCols(actualCols) = derived().solve(tmp.leftCols(actualCols));
790 /* compute numerical values kth row of L (a sparse triangular solve) */
|
| /external/eigen/Eigen/src/LU/ |
| 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
430 /***** Implementation of solve() *****************************************************/
|
| FullPivLU.h | 196 * \param b the right-hand-side of the equation to solve. Can be a vector or a matrix,
210 * \sa TriangularView::solve(), kernel(), inverse()
214 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::FullPivLU
657 /***** Implementation of solve() *****************************************************/
|
| /external/eigen/Eigen/src/SparseCore/ |
| TriangularSolver.h | 186 SparseTriangularView<ExpressionType,Mode>::solve(const MatrixBase<OtherDerived>& other) const function in class:Eigen::SparseTriangularView
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| UmfPackSupport.h | 113 * This class allows to solve for A.X = B sparse linear problems via a LU factorization
206 inline const internal::solve_retval<UmfPackLU, Rhs> solve(const MatrixBase<Rhs>& b) const function in class:Eigen::UmfPackLU
210 && "UmfPackLU::solve(): invalid number of rows of the right hand side matrix b");
219 // inline const internal::sparse_solve_retval<UmfPAckLU, Rhs> solve(const SparseMatrixBase<Rhs>& b) const
223 // && "UmfPAckLU::solve(): invalid number of rows of the right hand side matrix b");
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixExponential.h | 194 result = m_tmp2.partialPivLu().solve(m_tmp1);
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| SVD.h | 62 bool solve(const MatrixBase<OtherDerived> &b, ResultType* result) const;
509 * \sa MatrixBase::svd(), LU::solve(), LLT::solve()
513 bool SVD<MatrixType>::solve(const MatrixBase<OtherDerived> &b, ResultType* result) const
|
| /external/chromium_org/third_party/WebKit/Source/core/svg/ |
| SVGAnimationElement.cpp | 445 return narrowPrecisionToFloat(bezier.solve(percent, solveEpsilon(duration.value())));
|
| /external/iproute2/doc/ |
| api-ip6-flowlabels.tex | 30 The API must solve the following tasks:
92 to solve the first four tasks using
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| HeuristicSolver.h | 29 /// to HeuristicSolver<HImpl>::solve(Graph&).
117 /// \brief Construct a heuristic solver implementation to solve the given
563 // Solve based on existing solved edges.
598 /// <tt>Solution s = HeuristicSolver<H>::solve(g);</tt>
608 static Solution solve(Graph &g) { function in class:PBQP::HeuristicSolver
|
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 85 /// PBQP based allocators solve the register allocation problem by mapping
563 // * Solve the PBQP problem
605 PBQP::HeuristicSolver<PBQP::Heuristics::Briggs>::solve(
|
| /sdk/testapps/gridlayoutTest/v7-gridlayout/libs/ |
| android-support-v7-gridlayout.jar | |
| /frameworks/base/core/java/android/widget/ |
| GridLayout.java | 1602 private void solve(Arc[] arcs, int[] locations) { method in class:GridLayout
[all...] |
| /frameworks/support/v7/gridlayout/src/android/support/v7/widget/ |
| GridLayout.java | 1491 private void solve(Arc[] arcs, int[] locations) { method in class:GridLayout
[all...] |
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 629 * \param b the right-hand-side of the equation to solve.
638 solve(const MatrixBase<Rhs>& b) const function in class:Eigen::JacobiSVD
641 eigen_assert(computeU() && computeV() && "JacobiSVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice).");
[all...] |
