/external/ceres-solver/internal/ceres/ |
line_search_direction.h | 47 : num_parameters(0), 55 int num_parameters; member in struct:ceres::internal::LineSearchDirection::Options
|
levenberg_marquardt_strategy.cc | 74 const int num_parameters = jacobian->num_cols(); local 76 if (diagonal_.rows() != num_parameters) { 77 diagonal_.resize(num_parameters, 1); 81 for (int i = 0; i < num_parameters; ++i) { 101 InvalidateArray(num_parameters, step); 109 !IsArrayValid(num_parameters, step)) { 113 VectorRef(step, num_parameters) *= -1.0;
|
program.cc | 160 int num_parameters = 0; local 162 num_parameters += parameter_blocks_[i]->Size(); 164 return num_parameters; 168 int num_parameters = 0; local 170 num_parameters += parameter_blocks_[i]->LocalSize(); 172 return num_parameters; 191 int num_parameters = residual_block->NumParameterBlocks(); local 192 for (int j = 0; j < num_parameters; ++j) {
|
line_search_minimizer.h | 51 State(int num_parameters,
|
low_rank_inverse_hessian.cc | 39 int num_parameters, 42 : num_parameters_(num_parameters), 47 delta_x_history_(num_parameters, max_num_corrections), 48 delta_gradient_history_(num_parameters, max_num_corrections),
|
low_rank_inverse_hessian.h | 62 // num_parameters is the row/column size of the Hessian. 69 // 2 * max_num_corrections * num_parameters + max_num_corrections 71 LowRankInverseHessian(int num_parameters,
|
cost_function_to_functor_test.cc | 52 int num_parameters = 0; local 55 num_parameters += parameter_block_sizes[i]; 58 scoped_array<double> parameters(new double[num_parameters]); 59 for (int i = 0; i < num_parameters; ++i) { 64 scoped_array<double> jacobians(new double[num_parameters * num_residuals]); 68 (new double[num_parameters * num_residuals]); 77 num_parameters = 0; 79 parameter_blocks[i] = parameters.get() + num_parameters; 80 jacobian_blocks[i] = jacobians.get() + num_parameters * num_residuals; 82 actual_jacobians.get() + num_parameters * num_residuals [all...] |
program_evaluator.h | 249 int num_parameters = program_->NumEffectiveParameters(); local 251 VectorRef(gradient, num_parameters).setZero(); 256 VectorRef(gradient, num_parameters) += 257 VectorRef(evaluate_scratch_[i].gradient.get(), num_parameters); 295 int num_parameters) { 298 gradient.reset(new double[num_parameters]); 299 VectorRef(gradient.get(), num_parameters).setZero(); 336 int num_parameters = program.NumEffectiveParameters(); local 343 num_parameters);
|
line_search_direction.cc | 103 LBFGS(const int num_parameters, 106 : low_rank_inverse_hessian_(num_parameters, 148 BFGS(const int num_parameters, 150 : num_parameters_(num_parameters), 162 inverse_hessian_ = Matrix::Identity(num_parameters, num_parameters); 222 // Efficient O(num_parameters^2) BFGS update [2]. 315 options.num_parameters, 322 options.num_parameters,
|
solver.cc | 104 num_parameters(-1), 167 StringAppendF(&report, "Parameters % 10d\n", num_parameters); 168 if (num_effective_parameters != num_parameters) { 169 StringAppendF(&report, "Effective parameters% 10d\n", num_parameters); 181 num_parameters, num_parameters_reduced);
|
line_search_minimizer.cc | 97 const int num_parameters = evaluator->NumParameters(); local 104 VectorRef x(parameters, num_parameters); 106 State current_state(num_parameters, num_effective_parameters); 107 State previous_state(num_parameters, num_effective_parameters); 110 Vector x_plus_delta(num_parameters); 158 line_search_direction_options.num_parameters = num_effective_parameters;
|
residual_block.cc | 204 int num_parameters = NumParameterBlocks(); local 206 for (int i = 0; i < num_parameters; ++i) {
|
trust_region_minimizer.cc | 93 const int num_parameters = evaluator->NumParameters(); local 97 VectorRef x_min(parameters, num_parameters); 104 Vector x_plus_delta(num_parameters);
|
evaluator_test.cc | 120 int num_parameters = expected_num_cols; local 127 Vector gradient(num_parameters);
|
/external/chromium_org/third_party/mesa/src/src/glsl/ |
opt_function_inlining.cpp | 103 int num_parameters; local 109 num_parameters = 0; 111 num_parameters++; 113 parameters = new ir_variable *[num_parameters]; 121 for (i = 0; i < num_parameters; i++) { 177 for (i = 0; i < num_parameters; i++) { 200 for (i = 0; i < num_parameters; i++) {
|
/external/mesa3d/src/glsl/ |
opt_function_inlining.cpp | 103 int num_parameters; local 109 num_parameters = 0; 111 num_parameters++; 113 parameters = new ir_variable *[num_parameters]; 121 for (i = 0; i < num_parameters; i++) { 177 for (i = 0; i < num_parameters; i++) { 200 for (i = 0; i < num_parameters; i++) {
|
/external/ceres-solver/examples/ |
bal_problem.h | 72 int num_parameters() const { return num_parameters_; } function in class:ceres::examples::BALProblem
|
nist.cc | 246 int num_parameters() const { return initial_parameters_.cols(); } function in class:ceres::examples::NISTProblem 414 template <typename Model, int num_residuals, int num_parameters> 419 CHECK_EQ(num_parameters, nist_problem.num_parameters()); 436 new ceres::AutoDiffCostFunction<Model, num_residuals, num_parameters>( 451 for (int i = 0; i < num_parameters; ++i) {
|
/external/chromium_org/content/browser/renderer_host/java/ |
java_method.h | 25 size_t num_parameters() const;
|
java_method.cc | 113 size_t JavaMethod::num_parameters() const { function in class:content::JavaMethod
|
/external/ceres-solver/include/ceres/ |
dynamic_autodiff_cost_function.h | 117 const int num_parameters = std::accumulate(parameter_block_sizes().begin(), local 122 vector<Jet<double, Stride> > input_jets(num_parameters);
|
solver.h | 763 int num_parameters; member in struct:ceres::Solver::Summary [all...] |
/external/chromium_org/v8/src/ |
lithium.cc | 375 int result = index - info()->scope()->num_parameters() - 1; 384 return (1 + info()->scope()->num_parameters() - index) *
|
/external/v8/src/ |
scopeinfo.cc | 72 const int parameter_count = scope->num_parameters(); 143 ASSERT(scope->num_parameters() == scope_info->ParameterCount());
|
scopes.h | 329 int num_parameters() const { return params_.length(); } function in class:v8::internal::Scope
|