/external/ceres-solver/internal/ceres/ |
H A D | dynamic_compressed_row_finalizer.h | 41 void operator()(SparseMatrix* base_jacobian, int num_parameters) { argument 44 jacobian->Finalize(num_parameters);
|
H A D | line_search_direction.h | 45 : num_parameters(0), 53 int num_parameters; member in struct:ceres::internal::LineSearchDirection::Options
|
H A D | line_search_minimizer.h | 49 State(int num_parameters, argument
|
H A D | 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); 112 !IsArrayValid(num_parameters, step)) { 116 VectorRef(step, num_parameters) *= -1.0;
|
H A D | low_rank_inverse_hessian.cc | 76 int num_parameters, 79 : num_parameters_(num_parameters), 83 delta_x_history_(num_parameters, max_num_corrections), 84 delta_gradient_history_(num_parameters, max_num_corrections), 75 LowRankInverseHessian( int num_parameters, int max_num_corrections, bool use_approximate_eigenvalue_scaling) argument
|
H A D | line_search_minimizer.cc | 107 const int num_parameters = evaluator->NumParameters(); local 114 VectorRef x(parameters, num_parameters); 116 State current_state(num_parameters, num_effective_parameters); 117 State previous_state(num_parameters, num_effective_parameters); 120 Vector x_plus_delta(num_parameters); 166 line_search_direction_options.num_parameters = num_effective_parameters;
|
H A D | residual_block.cc | 204 int num_parameters = NumParameterBlocks(); local 206 for (int i = 0; i < num_parameters; ++i) {
|
H A D | 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_residual [all...] |
H A D | evaluator_test.cc | 145 int num_parameters = expected_num_cols; local 152 Vector gradient(num_parameters);
|
H A D | line_search_direction.cc | 101 LBFGS(const int num_parameters, argument 104 : low_rank_inverse_hessian_(num_parameters, 147 BFGS(const int num_parameters, argument 149 : num_parameters_(num_parameters), 161 inverse_hessian_ = Matrix::Identity(num_parameters, num_parameters); 263 // Efficient O(num_parameters^2) BFGS update [2]. 356 options.num_parameters, 363 options.num_parameters,
|
H A D | program_evaluator.h | 104 void operator()(SparseMatrix* jacobian, int num_parameters) {} argument 256 const int num_parameters = program_->NumEffectiveParameters(); local 261 VectorRef(gradient, num_parameters).setZero(); 266 VectorRef(gradient, num_parameters) += 267 VectorRef(evaluate_scratch_[i].gradient.get(), num_parameters); 272 // `num_parameters` is passed to the finalizer so that additional 277 f(jacobian, num_parameters); 314 int num_parameters) { 317 gradient.reset(new double[num_parameters]); 318 VectorRef(gradient.get(), num_parameters) 311 Init(int max_parameters_per_residual_block, int max_scratch_doubles_needed_for_evaluate, int max_residuals_per_residual_block, int num_parameters) argument 355 int num_parameters = program.NumEffectiveParameters(); local [all...] |
H A D | trust_region_minimizer.cc | 150 const int num_parameters = evaluator->NumParameters(); local 157 Vector x_plus_delta(num_parameters); 162 Vector projected_gradient_step(num_parameters); 178 VectorRef x_min(parameters, num_parameters);
|
H A D | program.cc | 445 int num_parameters = 0; local 447 num_parameters += parameter_blocks_[i]->Size(); 449 return num_parameters; 453 int num_parameters = 0; local 455 num_parameters += parameter_blocks_[i]->LocalSize(); 457 return num_parameters; 476 int num_parameters = residual_block->NumParameterBlocks(); local 477 for (int j = 0; j < num_parameters; ++j) {
|
/external/chromium_org/content/browser/android/java/ |
H A D | gin_java_bound_object_delegate.cc | 29 size_t num_parameters) { 30 return object_->FindMethod(method_name, num_parameters); 27 FindMethod( const std::string& method_name, size_t num_parameters) argument
|
H A D | gin_java_bound_object.cc | 94 size_t num_parameters) { 109 if (iter->second->num_parameters() == num_parameters) { 92 FindMethod( const std::string& method_name, size_t num_parameters) argument
|
H A D | java_method.cc | 80 size_t JavaMethod::num_parameters() const { function in class:content::JavaMethod
|
/external/ceres-solver/examples/ |
H A D | bal_problem.h | 72 int num_parameters() const { return num_parameters_; } function in class:ceres::examples::BALProblem
|
H A D | nist.cc | 238 int num_parameters() const { return initial_parameters_.cols(); } function in class:ceres::examples::NISTProblem 406 template <typename Model, int num_residuals, int num_parameters> 411 CHECK_EQ(num_parameters, nist_problem.num_parameters()); 428 new ceres::AutoDiffCostFunction<Model, num_residuals, num_parameters>( 443 for (int i = 0; i < num_parameters; ++i) {
|
/external/ceres-solver/include/ceres/ |
H A D | dynamic_autodiff_cost_function.h | 118 const int num_parameters = std::accumulate(parameter_block_sizes().begin(), local 123 vector<Jet<double, Stride> > input_jets(num_parameters);
|
H A D | solver.h | 815 int num_parameters; member in struct:ceres::Solver::Summary 819 // from num_parameters if a parameter block is associated with a
|
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | simplified-graph-builder.cc | 25 void SimplifiedGraphBuilder::Begin(int num_parameters) { argument 27 Node* start = graph()->NewNode(common()->Start(num_parameters));
|
/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | 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/ |
H A D | 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/chromium_org/v8/src/compiler/ |
H A D | graph-unittest.cc | 34 GraphTest::GraphTest(int num_parameters) : common_(zone()), graph_(zone()) { argument 35 graph()->SetStart(graph()->NewNode(common()->Start(num_parameters)));
|
/external/chromium_org/v8/src/ |
H A D | compiler.cc | 239 int CompilationInfo::num_parameters() const { function in class:v8::internal::CompilationInfo 244 return scope()->num_parameters(); 362 if ((scope->num_parameters() + 1) > parameter_limit) { 368 scope->num_parameters() + 1 + scope->num_stack_slots() > locals_limit) {
|