| /external/ceres-solver/internal/ceres/ |
| H A D | block_jacobian_writer.cc | 60 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
67 for (int i = 0; i < residual_blocks.size(); ++i) {
68 ResidualBlock* residual_block = residual_blocks[i];
95 for (int i = 0; i < residual_blocks.size(); ++i) {
96 const ResidualBlock* residual_block = residual_blocks[i];
166 const vector<ResidualBlock*>& residual_blocks = local
167 program_->residual_blocks();
169 bs->rows.resize(residual_blocks.size());
170 for (int i = 0; i < residual_blocks
[all...] |
| H A D | reorder_program_test.cc | 87 const vector<ResidualBlock*>& residual_blocks = local
88 problem.program().residual_blocks();
96 expected_residual_blocks.push_back(residual_blocks[4]);
97 expected_residual_blocks.push_back(residual_blocks[1]);
98 expected_residual_blocks.push_back(residual_blocks[0]);
99 expected_residual_blocks.push_back(residual_blocks[5]);
100 expected_residual_blocks.push_back(residual_blocks[2]);
101 expected_residual_blocks.push_back(residual_blocks[3]);
111 EXPECT_EQ(residual_blocks.size(), expected_residual_blocks.size());
113 EXPECT_EQ(residual_blocks[
[all...] |
| H A D | compressed_row_jacobian_writer.cc | 53 const vector<ResidualBlock*>& residual_blocks = local
54 program->residual_blocks();
56 row_blocks.resize(residual_blocks.size());
57 for (int i = 0; i < residual_blocks.size(); ++i) {
58 row_blocks[i] = residual_blocks[i]->NumResiduals();
67 program->residual_blocks()[residual_id];
82 const vector<ResidualBlock*>& residual_blocks = local
83 program_->residual_blocks();
90 for (int i = 0; i < residual_blocks.size(); ++i) {
91 ResidualBlock* residual_block = residual_blocks[
[all...] |
| H A D | parameter_block_ordering.cc | 123 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
124 for (int i = 0; i < residual_blocks.size(); ++i) {
125 const ResidualBlock* residual_block = residual_blocks[i];
|
| H A D | reorder_program.cc | 191 vector<ResidualBlock*>* residual_blocks = program->mutable_residual_blocks(); local
192 vector<int> min_position_per_residual(residual_blocks->size());
193 for (int i = 0; i < residual_blocks->size(); ++i) {
194 ResidualBlock* residual_block = (*residual_blocks)[i];
208 CHECK_EQ(offsets.back(), residual_blocks->size())
226 (*residual_blocks).size(), static_cast<ResidualBlock*>(NULL));
227 for (int i = 0; i < residual_blocks->size(); ++i) {
238 reordered_residual_blocks[offsets[bucket]] = (*residual_blocks)[i];
|
| H A D | program_evaluator.h | 190 const ResidualBlock* residual_block = program_->residual_blocks()[i];
336 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
339 for (int i = 0; i < residual_blocks.size(); ++i) {
340 const int num_residuals = residual_blocks[i]->NumResiduals();
|
| H A D | problem_test.cc | 389 return problem->program().residual_blocks()[block];
400 find(problem->program().residual_blocks().begin(),
401 problem->program().residual_blocks().end(),
402 residual_block) != problem->program().residual_blocks().end();
885 vector<ResidualBlockId> residual_blocks; local
886 problem.GetResidualBlocks(&residual_blocks);
887 ExpectVectorContainsUnordered(expected_residual_blocks, residual_blocks);
945 vector<ResidualBlockId> residual_blocks; local
961 &residual_blocks);
964 residual_blocks);
[all...] |
| H A D | coordinate_descent_minimizer.cc | 100 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
101 for (int i = 0; i < residual_blocks.size(); ++i) {
102 ResidualBlock* residual_block = residual_blocks[i];
|
| H A D | dense_jacobian_writer.h | 78 program_->residual_blocks()[residual_id];
|
| H A D | dynamic_compressed_row_jacobian_writer.cc | 72 program_->residual_blocks()[residual_id];
|
| H A D | gradient_checking_cost_function.cc | 279 const vector<ResidualBlock*>& residual_blocks = program->residual_blocks(); local
280 for (int i = 0; i < residual_blocks.size(); ++i) {
281 ResidualBlock* residual_block = residual_blocks[i];
|
| H A D | problem.cc | 243 vector<ResidualBlockId>* residual_blocks) const {
244 problem_impl_->GetResidualBlocks(residual_blocks);
256 vector<ResidualBlockId>* residual_blocks) const {
258 residual_blocks);
|
| H A D | program.h | 64 const vector<ResidualBlock*>& residual_blocks() const;
|
| H A D | problem_impl.cc | 522 CHECK(std::find(program_->residual_blocks().begin(),
523 program_->residual_blocks().end(),
524 residual_block) != program_->residual_blocks().end())
616 ((evaluate_options.residual_blocks.size() > 0)
617 ? evaluate_options.residual_blocks : program_->residual_blocks());
810 vector<ResidualBlockId>* residual_blocks) const {
811 CHECK_NOTNULL(residual_blocks);
812 *residual_blocks = program().residual_blocks();
[all...] |
| H A D | problem_impl.h | 154 void GetResidualBlocks(vector<ResidualBlockId>* residual_blocks) const;
162 vector<ResidualBlockId>* residual_blocks) const;
|
| H A D | solver_impl.h | 115 const vector<ResidualBlock*>& residual_blocks);
|
| H A D | gradient_checking_cost_function_test.cc | 394 for (int i = 0; i < program.residual_blocks().size(); ++i) {
397 program.residual_blocks()[i];
399 gradient_checking_program.residual_blocks()[i];
|
| H A D | solver_impl.cc | 625 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
628 if (!IsParameterBlockSetIndependent(e_blocks, residual_blocks)) {
640 const vector<ResidualBlock*>& residual_blocks) {
645 for (vector<ResidualBlock*>::const_iterator it = residual_blocks.begin();
646 it != residual_blocks.end();
638 IsParameterBlockSetIndependent( const set<double*>& parameter_block_ptrs, const vector<ResidualBlock*>& residual_blocks) argument
|
| H A D | program.cc | 64 const vector<ResidualBlock*>& Program::residual_blocks() const { function in class:ceres::internal::Program
|
| H A D | program_test.cc | 225 ResidualBlock *expected_removed_block = problem.program().residual_blocks()[0];
|
| /external/ceres-solver/include/ceres/ |
| H A D | problem.h | 338 // residual_blocks().size().
361 // Fills the passed residual_blocks vector with pointers to the
363 // residual_blocks.size() == NumResidualBlocks.
364 void GetResidualBlocks(vector<ResidualBlockId>* residual_blocks) const;
379 vector<ResidualBlockId>* residual_blocks) const;
406 // jacobian are ordered. If residual_blocks is empty, then it is
413 vector<ResidualBlockId> residual_blocks; member in struct:ceres::Problem::EvaluateOptions
|