/external/ceres-solver/internal/ceres/ |
D | residual_block_utils.cc | 52 const int num_residuals = block.NumResiduals(); in InvalidateEvaluation() local 55 InvalidateArray(num_residuals, residuals); in InvalidateEvaluation() 59 InvalidateArray(num_residuals * parameter_block_size, jacobians[i]); in InvalidateEvaluation() 91 const int num_residuals = block.NumResiduals(); in EvaluationToString() local 96 num_parameter_blocks, num_residuals); in EvaluationToString() 107 AppendArrayToString(num_residuals, residuals, &result); in EvaluationToString() 118 for (int k = 0; k < num_residuals; ++k) { in EvaluationToString() 139 const int num_residuals = block.NumResiduals(); in IsEvaluationValid() local 141 if (!IsArrayValid(num_residuals, residuals)) { in IsEvaluationValid() 148 if (!IsArrayValid(num_residuals * parameter_block_size, jacobians[i])) { in IsEvaluationValid()
|
D | residual_block.cc | 73 const int num_residuals = cost_function_->num_residuals(); in Evaluate() local 90 scratch += num_residuals * parameter_block->Size(); in Evaluate() 134 double squared_norm = VectorRef(residuals, num_residuals).squaredNorm(); in Evaluate() 147 num_residuals, in Evaluate() 152 jacobians[i], 0, 0, num_residuals, parameter_block->LocalSize()); in Evaluate() 182 correct.CorrectJacobian(num_residuals, in Evaluate() 192 correct.CorrectResiduals(num_residuals, residuals); in Evaluate()
|
D | compressed_row_jacobian_writer.cc | 54 const int num_residuals = residual_block->NumResiduals(); in CreateJacobian() local 59 num_jacobian_nonzeros += num_residuals * parameter_block->LocalSize(); in CreateJacobian() 106 const int num_residuals = residual_block->NumResiduals(); in CreateJacobian() local 107 for (int j = 0; j < num_residuals; ++j) { in CreateJacobian() 120 for (int r = 0; r < num_residuals; ++r) { in CreateJacobian() 131 row_pos += num_residuals; in CreateJacobian() 168 const int num_residuals = residual_block->NumResiduals(); in Write() local 199 for (int r = 0; r < num_residuals; ++r) { in Write()
|
D | cost_function_to_functor_test.cc | 42 EXPECT_EQ(cost_function.num_residuals(), in ExpectCostFunctionsAreEqual() 43 actual_cost_function.num_residuals()); in ExpectCostFunctionsAreEqual() 44 const int num_residuals = cost_function.num_residuals(); in ExpectCostFunctionsAreEqual() local 63 scoped_array<double> residuals(new double[num_residuals]); in ExpectCostFunctionsAreEqual() 64 scoped_array<double> jacobians(new double[num_parameters * num_residuals]); in ExpectCostFunctionsAreEqual() 66 scoped_array<double> actual_residuals(new double[num_residuals]); in ExpectCostFunctionsAreEqual() 68 (new double[num_parameters * num_residuals]); in ExpectCostFunctionsAreEqual() 80 jacobian_blocks[i] = jacobians.get() + num_parameters * num_residuals; in ExpectCostFunctionsAreEqual() 82 actual_jacobians.get() + num_parameters * num_residuals; in ExpectCostFunctionsAreEqual() 90 for (int i = 0; i < num_residuals; ++i) { in ExpectCostFunctionsAreEqual() [all …]
|
D | conditioned_cost_function.cc | 54 set_num_residuals(wrapped_cost_function_->num_residuals()); in ConditionedCostFunction() 59 CHECK_EQ(wrapped_cost_function_->num_residuals(), conditioners_.size()); in ConditionedCostFunction() 60 for (int i = 0; i < wrapped_cost_function_->num_residuals(); i++) { in ConditionedCostFunction() 62 CHECK_EQ(1, conditioners[i]->num_residuals()); in ConditionedCostFunction() 86 for (int r = 0; r < wrapped_cost_function_->num_residuals(); r++) { in Evaluate()
|
D | runtime_numeric_diff_cost_function.cc | 64 int num_residuals = function->num_residuals(); in EvaluateJacobianForParameterBlock() local 67 num_residuals, in EvaluateJacobianForParameterBlock() 96 ResidualVector residuals(num_residuals); in EvaluateJacobianForParameterBlock() 122 Map<const ResidualVector>(residuals_at_eval_point, num_residuals); in EvaluateJacobianForParameterBlock() 141 set_num_residuals(function->num_residuals()); in RuntimeNumericDiffCostFunction()
|
D | gradient_checking_cost_function_test.cc | 267 UnaryCostFunction(int num_residuals, int16 parameter_block_size) { in UnaryCostFunction() argument 268 set_num_residuals(num_residuals); in UnaryCostFunction() 276 for (int i = 0; i < num_residuals(); ++i) { in Evaluate() 286 BinaryCostFunction(int num_residuals, in BinaryCostFunction() argument 289 set_num_residuals(num_residuals); in BinaryCostFunction() 297 for (int i = 0; i < num_residuals(); ++i) { in Evaluate() 307 TernaryCostFunction(int num_residuals, in TernaryCostFunction() argument 311 set_num_residuals(num_residuals); in TernaryCostFunction() 320 for (int i = 0; i < num_residuals(); ++i) { in Evaluate()
|
D | c_api.cc | 70 int num_residuals, in CallbackCostFunction() argument 75 set_num_residuals(num_residuals); in CallbackCostFunction() 147 int num_residuals, in ceres_problem_add_residual_block() argument 156 num_residuals, in ceres_problem_add_residual_block()
|
D | dense_jacobian_writer.h | 80 int num_residuals = residual_block->NumResiduals(); in Write() local 93 num_residuals, in Write() 99 num_residuals, in Write()
|
D | residual_block_test.cc | 45 TernaryCostFunction(int num_residuals, in TernaryCostFunction() argument 49 set_num_residuals(num_residuals); in TernaryCostFunction() 58 for (int i = 0; i < num_residuals(); ++i) { in Evaluate() 65 num_residuals(), in Evaluate() 173 for (int i = 0; i < num_residuals(); ++i) { in Evaluate() 190 num_residuals(), in Evaluate()
|
D | gradient_checking_cost_function.cc | 94 set_num_residuals(function->num_residuals()); in GradientCheckingCostFunction() 107 int num_residuals = function_->num_residuals(); in Evaluate() local 116 term_jacobians[i].resize(num_residuals, block_sizes[i]); in Evaluate() 118 finite_difference_jacobians[i].resize(num_residuals, block_sizes[i]); in Evaluate()
|
D | covariance_test.cc | 127 UnaryCostFunction(const int num_residuals, in UnaryCostFunction() argument 130 : jacobian_(jacobian, jacobian + num_residuals * parameter_block_size) { in UnaryCostFunction() 131 set_num_residuals(num_residuals); in UnaryCostFunction() 138 for (int i = 0; i < num_residuals(); ++i) { in Evaluate() 160 BinaryCostFunction(const int num_residuals, in BinaryCostFunction() argument 166 jacobian1 + num_residuals * parameter_block1_size), in BinaryCostFunction() 168 jacobian2 + num_residuals * parameter_block2_size) { in BinaryCostFunction() 169 set_num_residuals(num_residuals); in BinaryCostFunction() 177 for (int i = 0; i < num_residuals(); ++i) { in Evaluate()
|
D | block_jacobian_writer.cc | 69 const int num_residuals = residual_block->NumResiduals(); in BuildJacobianLayout() local 79 f_block_pos += num_residuals * parameter_block->LocalSize(); in BuildJacobianLayout() 97 const int num_residuals = residual_block->NumResiduals(); in BuildJacobianLayout() local 108 num_residuals * parameter_block->LocalSize(); in BuildJacobianLayout()
|
D | normal_prior.cc | 55 VectorRef r(residuals, num_residuals()); in Evaluate() 61 MatrixRef(jacobians[0], num_residuals(), parameter_block_sizes()[0]) = A_; in Evaluate()
|
D | scratch_evaluate_preparer.cc | 63 int num_residuals = residual_block->NumResiduals(); in Prepare() local 72 jacobian_block_cursor += num_residuals * parameter_block->LocalSize(); in Prepare()
|
D | autodiff_test.cc | 343 for (int i = 0; i < num_residuals; ++i) { in operator ()() 349 int num_residuals; member 364 for (int num_residuals = 1; num_residuals < kMaxResiduals; ++num_residuals) { in TEST() local 366 functor.num_residuals = num_residuals; in TEST() 370 functor, parameters, num_residuals, residuals, jacobians))); in TEST() 373 for (int i = 0; i < num_residuals; ++i) { in TEST()
|
D | program_evaluator.h | 227 int num_residuals = residual_block->NumResiduals(); in Evaluate() local 238 num_residuals, in Evaluate() 321 const int num_residuals = residual_blocks[i]->NumResiduals(); in BuildResidualLayout() local 323 residual_pos += num_residuals; in BuildResidualLayout()
|
D | program.cc | 152 int num_residuals = 0; in NumResiduals() local 154 num_residuals += residual_blocks_[i]->NumResiduals(); in NumResiduals() 156 return num_residuals; in NumResiduals()
|
D | conditioned_cost_function_test.cc | 98 EXPECT_EQ(difference_cost_function->num_residuals(), in TEST() 99 conditioned_cost_function.num_residuals()); in TEST()
|
D | evaluator_test.cc | 63 for (int i = 0; i < Base::num_residuals(); ++i) { in Evaluate() 82 Base::num_residuals(), in Evaluate() 119 int num_residuals = expected_num_rows; in EvaluateAndCompare() local 124 Vector residuals(num_residuals); in EvaluateAndCompare()
|
D | solver.cc | 107 num_residuals(-1), in Summary() 175 num_residuals); in FullReport() 189 num_residuals, num_residuals_reduced); in FullReport()
|
/external/ceres-solver/include/ceres/ |
D | dynamic_autodiff_cost_function.h | 89 void SetNumResiduals(int num_residuals) { in SetNumResiduals() argument 90 set_num_residuals(num_residuals); in SetNumResiduals() 96 CHECK_GT(num_residuals(), 0) in Evaluate() 123 vector<Jet<double, Stride> > output_jets(num_residuals()); in Evaluate() 228 for (int k = 0; k < num_residuals(); ++k) { in Evaluate() 245 for (int k = 0; k < num_residuals(); ++k) { in Evaluate()
|
D | cost_function.h | 122 int num_residuals() const { in num_residuals() function 131 void set_num_residuals(int num_residuals) { in set_num_residuals() argument 132 num_residuals_ = num_residuals; in set_num_residuals()
|
D | gradient_checker.h | 120 CHECK_EQ(M, term->num_residuals()); in Probe() 121 const int num_residuals = M; in Probe() local 167 results->term_jacobians[i].resize(num_residuals, block_sizes[i]); in Probe() 170 num_residuals, block_sizes[i]); in Probe() 174 results->cost.resize(num_residuals, 1); in Probe()
|
D | autodiff_cost_function.h | 182 AutoDiffCostFunction(CostFunctor* functor, int num_residuals) in AutoDiffCostFunction() argument 187 ::set_num_residuals(num_residuals); in AutoDiffCostFunction() 210 ::num_residuals(), in Evaluate()
|