| /external/chromium_org/tools/gyp/test/subdirectory/ |
| gyptest-top-all.py | 10 directory, and using the generated solution or project file at the top
14 build tools. Specifically, when building the entire "solution", Xcode
17 in a build directory relative to the "solution"--that is, the entry-point
|
| gyptest-top-default.py | 10 directory, and using the generated solution or project file at the top
14 build tools. Specifically, when building the entire "solution", Xcode
17 in a build directory relative to the "solution"--that is, the entry-point
|
| /external/ceres-solver/examples/ |
| denoising.cc | 92 PGMImage<double>* solution) {
102 solution->MutablePixelFromLinearIndex(index));
122 double* pixel = solution->MutablePixel(x + x_delta_indices[i],
138 // solution stays within [0, 255].
139 void SolveProblem(Problem* problem, PGMImage<double>* solution) {
162 // Make the solution stay in [0, 255].
163 for (int x = 0; x < solution->width(); ++x) {
164 for (int y = 0; y < solution->height(); ++y) {
165 *solution->MutablePixel(x, y) =
166 std::min(255.0, std::max(0.0, solution->Pixel(x, y)))
[all...] |
| /external/ceres-solver/internal/ceres/ |
| compressed_col_sparse_matrix_utils.h | 66 // R * solution = rhs
87 // R' * solution = rhs
122 double* solution) {
123 fill(solution, solution + num_cols, 0.0);
124 solution[rhs_nonzero_index] = 1.0 / values[cols[rhs_nonzero_index + 1] - 1];
131 solution[c] -= v * solution[r];
133 solution[c] = solution[c] / values[cols[c + 1] - 1]
[all...] |
| schur_complement_solver.h | 129 virtual bool SolveReducedLinearSystem(double* solution) = 0;
149 virtual bool SolveReducedLinearSystem(double* solution);
163 virtual bool SolveReducedLinearSystem(double* solution);
164 bool SolveReducedLinearSystemUsingSuiteSparse(double* solution);
165 bool SolveReducedLinearSystemUsingCXSparse(double* solution);
|
| 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...] |
| schur_complement_solver.cc | 120 bool DenseSchurComplementSolver::SolveReducedLinearSystem(double* solution) {
133 // the quality of the solution to the solve.
134 VectorRef(solution, num_rows) =
142 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows);
145 solution);
245 bool SparseSchurComplementSolver::SolveReducedLinearSystem(double* solution) {
248 return SolveReducedLinearSystemUsingSuiteSparse(solution);
250 return SolveReducedLinearSystemUsingCXSparse(solution);
266 double* solution) {
321 VectorRef(solution, num_rows
[all...] |
| compressed_row_sparse_matrix.h | 122 void SolveLowerTriangularInPlace(double* solution) const;
123 void SolveLowerTriangularTransposeInPlace(double* solution) const;
|
| implicit_schur_complement_test.cc | 74 Vector* solution) {
108 solution->resize(num_cols_);
109 solution->setZero();
110 VectorRef schur_solution(solution->data() + num_cols_ - num_schur_rows,
114 schur_solution.data(), solution->data());
157 // Reference solution to the f_block.
161 // Backsubstituted solution from the implicit schur solver using the
162 // reference solution to the f_block.
|
| compressed_row_sparse_matrix.cc | 271 double* solution) const {
274 solution[r] -= values_[idx] * solution[cols_[idx]];
276 solution[r] /= values_[rows_[r + 1] - 1];
281 double* solution) const {
283 solution[r] /= values_[rows_[r + 1] - 1];
285 solution[cols_[idx]] -= values_[idx] * solution[r];
|
| covariance_impl.cc | 62 : solution(NULL),
71 ss.Free(solution);
78 cholmod_dense* solution; member in struct:ceres::internal::__anon4017::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...] |
| 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.h | 85 // exact solution, the line search algorithm returns a solution
291 FunctionSample* solution,
|
| /build/core/combo/arch/arm/ |
| armv5te.mk | 6 # and a better solution should be found in the future.
|
| armv7-a.mk | 8 # and a better solution should be found in the future.
|
| /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/chromium_org/chrome_frame/tools/ |
| smoke_test.py | 31 # Solution path.
69 to the builder's solution directory.
85 solution = win32com.client.GetObject(_CHROME_SOLUTION)
86 builder = solution.SolutionBuild
|
| /packages/apps/Launcher2/src/com/android/launcher2/ |
| CellLayout.java | [all...] |
| /packages/apps/Launcher3/src/com/android/launcher3/ |
| CellLayout.java | [all...] |
| /external/chromium_org/tools/gyp/tools/ |
| pretty_sln.py | 53 solution = open(solution_file)
54 for line in solution:
|
| /external/chromium_org/tools/coverity/ |
| coverity.py | 249 option_parser.add_option('', '--solution-file', dest='solution_file',
252 option_parser.add_option('', '--solution-dir', dest='solution_dir',
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/preferences/ |
| AndroidPreferencePage.java | 145 CheckSdkErrorHandler.Solution solution,
153 CheckSdkErrorHandler.Solution 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;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/ |
| AdtPlugin.java | 29 import com.android.ide.eclipse.adt.AdtPlugin.CheckSdkErrorHandler.Solution;
180 public enum Solution {
191 public abstract boolean handleError(Solution solution, String message);
197 public abstract boolean handleWarning(Solution solution, String message);
[all...] |
