| /external/dng_sdk/source/ |
| dng_tone_curve.cpp | 121 void dng_tone_curve::Solve (dng_spline_solver &solver) const
134 solver.Solve ();
|
| dng_spline.cpp | 64 void dng_spline_solver::Solve ()
|
| /external/ceres-solver/internal/ceres/ |
| conjugate_gradients_solver.cc | 66 LinearSolver::Summary ConjugateGradientsSolver::Solve(
197 // solve the Newton step. This particular convergence test comes
|
| coordinate_descent_minimizer.cc | 181 Solve(&inner_program,
202 // Solve the optimization problem for one parameter block.
203 void CoordinateDescentMinimizer::Solve(Program* program,
|
| solver.cc | 269 << ", prevent bisection (0.5) scaling, continuing with solve regardless.";
312 void Solver::Solve(const Solver::Options& options,
326 internal::SolverImpl::Solve(options, problem_impl, summary);
331 void Solve(const Solver::Options& options,
335 solver.Solve(options, problem, summary);
343 message("ceres::Solve was not called."),
406 "Ceres Solver v" CERES_VERSION_STRING " Solve Report\n"
|
| solver_impl.cc | 184 void SolverImpl::Solve(const Solver::Options& options,
423 "LinearSolver::Solve",
[all...] |
| suitesparse.cc | 312 cholmod_dense* SuiteSparse::Solve(cholmod_factor* L,
|
| linear_solver.h | 83 // information across solves. This means that calling Solve on the
90 // a particular Solve call.
168 // Options for the Solve method.
178 // that can solve rectangular linear systems.
181 // and a vector b, the linear solver will solve for
212 // of solving Ax = b, we solve the linear system AM^{-1} y = b
246 // solve the Newton step. This particular convergence test comes
261 // Summary of a call to the Solve method. We should move away from
287 // Solve Ax = b.
288 virtual Summary Solve(LinearOperator* A
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Dynamics/ |
| b2Island.cpp | 183 void b2Island::Solve(b2Profile* profile, const b2TimeStep& step, const b2Vec2& gravity, bool allowSleep)
258 // Solve velocity constraints
307 // Solve position constraints
408 // Solve position constraints.
461 // Solve velocity constraints.
|
| b2World.cpp | 385 // Find islands, integrate and solve constraints, solve position constraints
386 void b2World::Solve(const b2TimeStep& step)
531 island.Solve(&profile, step, m_gravity, m_allowSleep);
536 // Post solve cleanup.
576 // Find TOI contacts and solve them.
598 // Find TOI events and solve them.
934 // Integrate velocities, solve velocity constraints, and integrate positions.
938 Solve(step);
939 m_profile.solve = timer.GetMilliseconds()
[all...] |
| /external/llvm/lib/Analysis/ |
| SparsePropagation.cpp | 293 void SparseSolver::Solve(Function &F) {
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Common/ |
| b2Math.h | 241 /// Solve A * x = b, where b is a column vector. This is more efficient
243 b2Vec2 Solve(const b2Vec2& b) const
282 /// Solve A * x = b, where b is a column vector. This is more efficient
286 /// Solve A * x = b, where b is a column vector. This is more efficient
287 /// than computing the inverse in one-shot cases. Solve only the upper
|
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 256 /// Solve - Solve for constants and executable blocks.
258 void Solve();
262 /// However, this is not a safe assumption. After we solve dataflow, this
[all...] |
| LoopStrengthReduce.cpp | 85 /// conceivably solve, so it should not affect generated code, but catches the
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| btSoftBody.cpp | [all...] |
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/com/badlogic/gdx/physics/bullet/softbody/ |
| btSoftBody.java | [all...] |
