| /external/ceres-solver/examples/ |
| D | denoising.cc | 92 PGMImage<double>* solution) { in CreateProblem() argument
102 solution->MutablePixelFromLinearIndex(index)); in CreateProblem()
122 double* pixel = solution->MutablePixel(x + x_delta_indices[i], in CreateProblem()
139 void SolveProblem(Problem* problem, PGMImage<double>* solution) { in SolveProblem() argument
163 for (int x = 0; x < solution->width(); ++x) { in SolveProblem()
164 for (int y = 0; y < solution->height(); ++y) { in SolveProblem()
165 *solution->MutablePixel(x, y) = in SolveProblem()
166 std::min(255.0, std::max(0.0, solution->Pixel(x, y))); in SolveProblem()
206 PGMImage<double> solution(image.width(), image.height()); in main() local
207 solution.Set(0.0); in main()
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | line_search.cc | 346 FunctionSample solution, bracket_low, bracket_high; in Search() local
418 &solution, in Search()
419 summary) && !solution.value_is_valid) { in Search()
429 solution = in Search()
430 solution.value_is_valid && solution.value <= bracket_low.value in Search()
431 ? solution : bracket_low; in Search()
433 summary->optimal_step_size = solution.x; in Search()
644 FunctionSample* solution, in ZoomPhase() argument
695 solution->value_is_valid = false; in ZoomPhase()
707 *solution = bracket_low; in ZoomPhase()
[all …]
|
| D | compressed_col_sparse_matrix_utils.h | 122 double* solution) { in SolveRTRWithSparseRHS() argument
123 fill(solution, solution + num_cols, 0.0); in SolveRTRWithSparseRHS()
124 solution[rhs_nonzero_index] = 1.0 / values[cols[rhs_nonzero_index + 1] - 1]; in SolveRTRWithSparseRHS()
131 solution[c] -= v * solution[r]; in SolveRTRWithSparseRHS()
133 solution[c] = solution[c] / values[cols[c + 1] - 1]; in SolveRTRWithSparseRHS()
136 SolveUpperTriangularInPlace(num_cols, rows, cols, values, solution); in SolveRTRWithSparseRHS()
|
| D | schur_complement_solver.cc | 118 DenseSchurComplementSolver::SolveReducedLinearSystem(double* solution) { in SolveReducedLinearSystem() argument
148 VectorRef(solution, num_rows) = llt.solve(ConstVectorRef(rhs(), num_rows)); in SolveReducedLinearSystem()
150 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows); in SolveReducedLinearSystem()
154 solution, in SolveReducedLinearSystem()
252 SparseSchurComplementSolver::SolveReducedLinearSystem(double* solution) { in SolveReducedLinearSystem() argument
255 return SolveReducedLinearSystemUsingSuiteSparse(solution); in SolveReducedLinearSystem()
257 return SolveReducedLinearSystemUsingCXSparse(solution); in SolveReducedLinearSystem()
259 return SolveReducedLinearSystemUsingEigen(solution); in SolveReducedLinearSystem()
273 double* solution) { in SolveReducedLinearSystemUsingSuiteSparse() argument
368 VectorRef(solution, num_rows) in SolveReducedLinearSystemUsingSuiteSparse()
[all …]
|
| D | schur_complement_solver.h | 136 double* solution) = 0;
157 double* solution);
171 double* solution);
173 double* solution);
175 double* solution);
177 double* solution);
|
| D | implicit_schur_complement_test.cc | 74 Vector* solution) { in ReducedLinearSystemAndSolution() argument
108 solution->resize(num_cols_); in ReducedLinearSystemAndSolution()
109 solution->setZero(); in ReducedLinearSystemAndSolution()
110 VectorRef schur_solution(solution->data() + num_cols_ - num_schur_rows, in ReducedLinearSystemAndSolution()
114 schur_solution.data(), solution->data()); in ReducedLinearSystemAndSolution()
|
| D | compressed_row_sparse_matrix.cc | 297 double* solution) const { in SolveLowerTriangularInPlace()
300 solution[r] -= values_[idx] * solution[cols_[idx]]; in SolveLowerTriangularInPlace()
302 solution[r] /= values_[rows_[r + 1] - 1]; in SolveLowerTriangularInPlace()
307 double* solution) const { in SolveLowerTriangularTransposeInPlace()
309 solution[r] /= values_[rows_[r + 1] - 1]; in SolveLowerTriangularTransposeInPlace()
311 solution[cols_[idx]] -= values_[idx] * solution[r]; in SolveLowerTriangularTransposeInPlace()
|
| D | sparse_normal_cholesky_solver.cc | 363 cholmod_dense* solution = ss_.Solve(factor_, rhs, &summary.message); in SolveImplUsingSuiteSparse()
367 if (solution != NULL) { in SolveImplUsingSuiteSparse()
368 memcpy(rhs_and_solution, solution->x, num_cols * sizeof(*rhs_and_solution)); in SolveImplUsingSuiteSparse()
369 ss_.Free(solution); in SolveImplUsingSuiteSparse()
|
| D | compressed_row_sparse_matrix.h | 125 void SolveLowerTriangularInPlace(double* solution) const;
126 void SolveLowerTriangularTransposeInPlace(double* solution) const;
|
| D | compressed_col_sparse_matrix_utils_test.cc | 264 double solution[4]; in TEST_F() local
276 solution); in TEST_F()
278 EXPECT_NEAR(solution[j], expected[4 * i + j], 1e-3) << i; in TEST_F()
|
| D | covariance_impl.cc | 539 double* solution = workspace.get() + thread_id * num_cols; in ComputeCovarianceValuesUsingSuiteSparseQR() local
546 solution); in ComputeCovarianceValuesUsingSuiteSparseQR()
549 values[idx] = solution[inverse_permutation[c]]; in ComputeCovarianceValuesUsingSuiteSparseQR()
728 double* solution = workspace.get() + thread_id * num_cols; in ComputeCovarianceValuesUsingEigenSparseQR() local
735 solution); in ComputeCovarianceValuesUsingEigenSparseQR()
741 values[idx] = solution[inverse_permutation.indices().coeff(c)]; in ComputeCovarianceValuesUsingEigenSparseQR()
|
| D | visibility_based_preconditioner.cc | 468 cholmod_dense* solution = in RightMultiply() local
470 memcpy(y, solution->x, sizeof(*y) * num_rows); in RightMultiply()
471 ss->Free(solution); in RightMultiply()
|
| /external/eigen/doc/ |
| D | WrongStackAlignment.dox | 25 \section sec_sol1 Local solution
27 A local solution is to mark such a function with this attribute:
35 …a macro which you leave empty on other platforms. The advantage of this solution is that you can f…
40 A global solution is to edit your project so that when compiling with GCC on Windows, you pass this…
46 Another global solution is to pass this option to gcc:
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2001-04-16-DynamicCompilation.txt | 7 providing a solution to these two goals will yield an excellent solution
30 On a social level, static compilation is a very shortsighted solution to
44 solution to these problems. Its design allows the large body of platform
|
| /external/v8/tools/visual_studio/ |
| D | README.txt | 2 Studio/Visual C++ Express solution has been retired. If a Visual
3 Studio project/solution is needed there is the option of using GYP to
|
| /external/ceres-solver/docs/source/ |
| D | bibliography.rst | 14 .. [Brown] D. C. Brown, **A solution to the general problem of
23 solution of the trust region problem by minimization over
57 .. [Levenberg] K. Levenberg, **A method for the solution of certain
76 numerical solution of partial differential equations**, Springer
|
| D | features.rst | 41 memory budgets, and solution quality requiremnts, different
48 computational cost in all of these methods is the solution of a
58 accuracy solution is required cheaply, Ceres offers a number of
71 the solution by evaluating all or part of the covariance
|
| /external/libpng/projects/vstudio/ |
| D | readme.txt | 19 with this 'solution'. Please read and edit zlib.props first. You will
58 This solution includes limited support for debug versions of libpng. You
59 do not need these unless your own solution itself uses debug builds (it is
|
| /external/lldb/source/ |
| D | CMakeLists.txt | 207 # FIXME: implement svn/git revision and repository parsing solution on Windows. There is an SVN-only
208 # revision parsing solution in tools/clang/lib/Basic/CMakelists.txt.
|
| /external/valgrind/docs/internals/ |
| D | arm_thumb_notes_gdbserver.txt | 77 * use the debug info : this solution was discarded as often debug
78 info does not allow a 100% correct solution. debug info is acceptable
87 * the final solution implemented was to add a Delta fied in IstMark.
|
| /external/clang/tools/clang-format-vs/ |
| D | README.txt | 15 CMake once, it can be built manually from the ClangFormat.sln solution in Visual
|
| /external/opencv/cvaux/src/ |
| D | cvlmeds.cpp | 678 double solution[9]; in icvAnalyticPoints8() local
787 solution[a] = 0; in icvAnalyticPoints8()
791 solution[a] += temp2[a_num + t] * f[t]; in icvAnalyticPoints8()
801 solution[a] = solution[a - 1]; in icvAnalyticPoints8()
804 solution[a] = 1; in icvAnalyticPoints8()
816 summ += A[a9 + t] * solution[t]; in icvAnalyticPoints8()
828 F[j] = solution[j]; in icvAnalyticPoints8()
|
| /external/libxml2/win32/VC10/ |
| D | README.vc10 | 11 1) To use, load the libxml2.sln solution file into visual studio
|
| /external/nanopb-c/examples/using_double_on_avr/ |
| D | README.txt | 9 This directory contains a solution to this problem. It uses uint64_t
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ARM/ |
| D | 2012-06-15-lsr-noaddrmode.ll | 12 ;The chosen solution requires 4 regs, with addrec cost 1, plus 3 base adds, plus 2 setup cost:
25 ;The chosen solution requires 4 regs, with addrec cost 1, plus 1 base add, plus 2 setup cost:
|