| /external/ceres-solver/internal/ceres/ |
| parameter_block_ordering.cc | 51 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
54 for (int i = 0; i < parameter_blocks.size(); ++i) {
55 ParameterBlock* parameter_block = parameter_blocks[i];
67 const vector<ParameterBlock*> parameter_blocks = program.parameter_blocks(); local
72 while (num_covered < parameter_blocks.size()) {
89 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
90 for (int i = 0; i < parameter_blocks.size(); ++i)
101 ParameterBlock* const* parameter_blocks = local
[all...] |
| parameter_block_ordering_test.cc | 85 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
92 EXPECT_TRUE(vertices.find(parameter_blocks[i]) != vertices.end());
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]);
98 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end());
99 EXPECT_TRUE(neighbors.find(parameter_blocks[3]) != neighbors.end());
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]);
105 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end());
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]);
111 EXPECT_TRUE(neighbors.find(parameter_blocks[0]) != neighbors.end())
139 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
[all...] |
| residual_block.h | 69 const vector<ParameterBlock*>& parameter_blocks);
100 ParameterBlock* const* parameter_blocks() const { function in class:ceres::internal::ResidualBlock
|
| block_jacobian_writer.cc | 74 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
102 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
152 const vector<ParameterBlock*>& parameter_blocks = local
153 program_->parameter_blocks();
156 bs->cols.resize(parameter_blocks.size());
157 for (int i = 0, cursor = 0; i < parameter_blocks.size(); ++i) {
158 CHECK_NE(parameter_blocks[i]->index(), -1);
159 CHECK(!parameter_blocks[i]->IsConstant());
160 bs->cols[i].size = parameter_blocks[i]->LocalSize();
182 if (residual_block->parameter_blocks()[j]->index() != -1)
[all...] |
| compressed_row_jacobian_writer.cc | 57 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
89 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
117 program_->parameter_blocks()[parameter_indices[j]];
138 const vector<ParameterBlock*>& parameter_blocks = program_->parameter_blocks(); local
140 col_blocks.resize(parameter_blocks.size());
141 for (int i = 0; i < parameter_blocks.size(); ++i) {
142 col_blocks[i] = parameter_blocks[i]->LocalSize();
178 residual_block->parameter_blocks()[j];
193 program_->parameter_blocks()[evaluated_jacobian_blocks[i].first]
[all...] |
| residual_block_utils_test.cc | 49 vector<ParameterBlock*> parameter_blocks; local
50 parameter_blocks.push_back(¶meter_block);
54 parameter_blocks);
|
| block_evaluate_preparer.cc | 69 if (!residual_block->parameter_blocks()[j]->IsConstant()) {
|
| program.h | 61 const vector<ParameterBlock*>& parameter_blocks() const;
89 // from a ParameterBlock* to an index in the parameter_blocks() vector. For
93 // parameter_blocks()[p->index()] == p
|
| gradient_checking_cost_function.cc | 252 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); local
253 for (int i = 0; i < parameter_blocks.size(); ++i) {
254 ParameterBlock* parameter_block = parameter_blocks[i];
278 vector<double*> parameter_blocks; local
280 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
281 parameter_blocks.push_back(parameter_block->mutable_user_state());
300 parameter_blocks);
|
| residual_block_utils.cc | 58 const int parameter_block_size = block.parameter_blocks()[i]->Size();
109 const int parameter_block_size = block.parameter_blocks()[i]->Size();
145 const int parameter_block_size = block.parameter_blocks()[i]->Size();
|
| scratch_evaluate_preparer.cc | 67 residual_block->parameter_blocks()[j];
|
| problem_impl.cc | 80 vector<ParameterBlock*>* parameter_blocks) {
120 parameter_blocks->push_back(new_parameter_block);
175 const vector<double*>& parameter_blocks) {
177 CHECK_EQ(parameter_blocks.size(),
183 CHECK_EQ(parameter_block_sizes.size(), parameter_blocks.size())
188 vector<double*> sorted_parameter_blocks(parameter_blocks);
195 for (int i = 0; i < parameter_blocks.size(); ++i) {
196 blocks += internal::StringPrintf(" %p ", parameter_blocks[i]);
205 vector<ParameterBlock*> parameter_block_ptrs(parameter_blocks.size());
206 for (int i = 0; i < parameter_blocks.size(); ++i)
[all...] |
| coordinate_descent_minimizer.cc | 89 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
90 for (int i = 0; i < parameter_blocks.size(); ++i) {
91 if (!ordering.IsMember(parameter_blocks[i]->mutable_user_state())) {
92 parameter_blocks_.push_back(parameter_blocks[i]);
105 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
|
| residual_block_test.cc | 101 EXPECT_EQ(parameters[0], residual_block.parameter_blocks()[0]);
102 EXPECT_EQ(parameters[1], residual_block.parameter_blocks()[1]);
103 EXPECT_EQ(parameters[2], residual_block.parameter_blocks()[2]);
240 EXPECT_EQ(parameters[0], residual_block.parameter_blocks()[0]);
241 EXPECT_EQ(parameters[1], residual_block.parameter_blocks()[1]);
242 EXPECT_EQ(parameters[2], residual_block.parameter_blocks()[2]);
|
| solver_impl.cc | 422 if (reduced_program->parameter_blocks().size() < 2) {
523 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
524 for (vector<ParameterBlock*>::const_iterator it = parameter_blocks.begin();
525 it != parameter_blocks.end();
559 ParameterBlock* const* parameter_blocks = (*it)->parameter_blocks(); local
564 parameter_blocks[i]->mutable_user_state());
580 vector<ParameterBlock*>* parameter_blocks = local
592 for (int i = 0; i < parameter_blocks->size(); ++i)
638 vector<ParameterBlock*>* parameter_blocks = local
902 vector<ParameterBlock*>* parameter_blocks = local
[all...] |
| program.cc | 58 const vector<ParameterBlock*>& Program::parameter_blocks() const { function in class:ceres::internal::Program
128 residual_block->parameter_blocks()[j]->set_index(-1);
194 residual_block->parameter_blocks()[j]->LocalSize();
|
| residual_block.cc | 52 const vector<ParameterBlock*>& parameter_blocks)
58 std::copy(parameter_blocks.begin(),
59 parameter_blocks.end(),
|
| dense_jacobian_writer.h | 84 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
|
| gradient_checking_cost_function_test.cc | 388 for (int i = 0; i < program.parameter_blocks().size(); ++i) {
390 program.parameter_blocks()[i],
391 gradient_checking_program.parameter_blocks()[i]);
410 original_residual_block->parameter_blocks()[j],
411 new_residual_block->parameter_blocks()[j]);
|
| solver_impl_test.cc | 427 const vector<ParameterBlock*>& parameter_blocks = local
428 reduced_program->parameter_blocks();
434 EXPECT_EQ(reduced_program->parameter_blocks().size(), 2);
442 EXPECT_NE(parameter_blocks[i]->mutable_user_state(), &z);
490 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); local
492 EXPECT_EQ(parameter_blocks.size(), 3);
493 EXPECT_EQ(parameter_blocks[0]->user_state(), &x);
494 EXPECT_EQ(parameter_blocks[1]->user_state(), &z);
495 EXPECT_EQ(parameter_blocks[2]->user_state(), &y)
[all...] |
| problem.cc | 49 const vector<double*>& parameter_blocks) {
52 parameter_blocks);
|
| problem_impl.h | 74 const vector<double*>& parameter_blocks);
|
| evaluator_test.cc | 510 vector<ParameterBlock*>* parameter_blocks = local
516 ParameterBlock* parameter_block_z = parameter_blocks->back();
517 parameter_blocks->pop_back();
552 parameter_blocks->push_back(parameter_block_z);
|
| program_evaluator.h | 214 residual_block->parameter_blocks()[j];
|
| /external/ceres-solver/include/ceres/ |
| problem.h | 149 // the sizes of the parameter blocks listed in parameter_blocks. The
185 const vector<double*>& parameter_blocks);
263 // parameter_blocks().size() and parameter_block_sizes().size().
|
