| /external/ceres-solver/internal/ceres/ |
| compressed_col_sparse_matrix_utils_test.cc | 264 double solution[4]; local
276 solution);
278 EXPECT_NEAR(solution[j], expected[4 * i + j], 1e-3) << i;
|
| line_search.cc | 334 FunctionSample solution, bracket_low, bracket_high; local
403 &solution,
404 summary) && !solution.value_is_valid) {
414 solution =
415 solution.value_is_valid && solution.value <= bracket_low.value
416 ? solution : bracket_low;
418 summary->optimal_step_size = solution.x;
580 // Returns true iff solution satisfies the strong Wolfe conditions. Otherwise,
582 // reaching max_num_iterations, solution is the step size amongst all thos
[all...] |
| visibility_based_preconditioner.cc | 440 cholmod_dense* solution = CHECK_NOTNULL(ss->Solve(factor_, tmp_rhs_)); local
441 memcpy(y, solution->x, sizeof(*y) * num_rows);
442 ss->Free(solution);
|
| covariance_impl.cc | 62 : solution(NULL),
71 ss.Free(solution);
78 cholmod_dense* solution; member in struct:ceres::internal::__anon1304::PerThreadContext
473 // is given by the solution to the linear system
497 cholmod_dense* solution = ss.Solve(factor, rhs); local
498 double* solution_x = reinterpret_cast<double*>(solution->x);
503 ss.Free(solution);
526 &context->solution,
559 &context->solution,
565 double* solution_x = reinterpret_cast<double*>(context->solution->x)
728 double* solution = workspace.get() + thread_id * num_cols; local
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| SplineMath.java | 116 double[] solution = new double[n]; // returned coefficients local
148 solution[n - 1] = result[n - 1] / system[n - 1][1];
150 solution[i] = (result[i] - system[i][2] * solution[i + 1]) / system[i][1];
152 return solution;
|
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 13 // solving this using a PBQP solver, and mapping the solution back to a
146 /// \brief Given a solved PBQP problem maps this solution back to a register
149 const PBQP::Solution &solution);
470 const PBQP::Solution &solution) {
478 // Iterate over the nodes mapping the PBQP solution to a register
484 unsigned alloc = solution.getSelection(node);
564 // * Map the solution back to a register allocation
604 PBQP::Solution solution local
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/ |
| Spline.java | 352 double[] solution = new double[n]; // returned coefficients local
384 solution[n - 1] = result[n - 1] / system[n - 1][1];
386 solution[i] = (result[i] - system[i][2] * solution[i + 1]) / system[i][1];
388 return solution;
|
| /external/opencv/cvaux/src/ |
| cvlmeds.cpp | 678 double solution[9]; local
747 { /* ----------- computing the solution ----------- */
781 /* ----------- solution = V * W(-1) * U(T) * f ----------- */
787 solution[a] = 0;
791 solution[a] += temp2[a_num + t] * f[t];
801 solution[a] = solution[a - 1];
804 solution[a] = 1;
816 summ += A[a9 + t] * solution[t];
828 F[j] = solution[j]
[all...] |
| /packages/apps/Launcher2/src/com/android/launcher2/ |
| CellLayout.java | [all...] |
| /packages/apps/Launcher3/src/com/android/launcher3/ |
| CellLayout.java | [all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.equinox.p2.director_2.0.3.R36x_v20101117-1018.jar | |
| org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar | |
| org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar | |
| /prebuilts/misc/common/groovy/ |
| groovy-all-1.7.0.jar | |
