/external/ceres-solver/internal/ceres/ |
H A D | schur_ordering.cc | 52 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local 55 for (int i = 0; i < parameter_blocks.size(); ++i) { 56 ParameterBlock* parameter_block = parameter_blocks[i]; 68 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local 69 for (int i = 0; i < parameter_blocks.size(); ++i) { 70 ParameterBlock* parameter_block = parameter_blocks[i]; 80 ParameterBlock* const* parameter_blocks = local 81 residual_block->parameter_blocks(); [all...] |
H A D | parameter_block_ordering.cc | 50 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local 52 for (int i = 0; i < parameter_blocks.size(); ++i) { 53 if (vertices.count(parameter_blocks[i]) > 0) { 54 ordering->push_back(parameter_blocks[i]); 61 for (int i = 0; i < parameter_blocks.size(); ++i) { 62 ParameterBlock* parameter_block = parameter_blocks[i]; 77 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local 80 for (int i = 0; i < parameter_blocks 93 const vector<ParameterBlock*> parameter_blocks = program.parameter_blocks(); local 115 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local 127 ParameterBlock* const* parameter_blocks = local [all...] |
H A D | 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[ 139 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local [all...] |
H A D | schur_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[ 139 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local [all...] |
H A D | 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()[ [all...] |
H A D | 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 = local 139 program_->parameter_blocks(); 141 col_blocks.resize(parameter_blocks.size()); 142 for (int i = 0; i < parameter_blocks.size(); ++i) { 143 col_blocks[i] = parameter_blocks[i]->LocalSize(); 179 residual_block->parameter_blocks()[j]; 194 program_->parameter_blocks()[evaluated_jacobian_block [all...] |
H A D | residual_block.h | 74 const vector<ParameterBlock*>& parameter_blocks, 111 ParameterBlock* const* parameter_blocks() const { function in class:ceres::internal::ResidualBlock
|
H A D | residual_block_utils_test.cc | 49 vector<ParameterBlock*> parameter_blocks; local 50 parameter_blocks.push_back(¶meter_block); 54 parameter_blocks,
|
H A D | problem_impl.cc | 221 const vector<double*>& parameter_blocks) { 223 CHECK_EQ(parameter_blocks.size(), 231 CHECK_EQ(parameter_block_sizes.size(), parameter_blocks.size()) 236 vector<double*> sorted_parameter_blocks(parameter_blocks); 243 for (int i = 0; i < parameter_blocks.size(); ++i) { 244 blocks += StringPrintf(" %p ", parameter_blocks[i]); 254 vector<ParameterBlock*> parameter_block_ptrs(parameter_blocks.size()); 255 for (int i = 0; i < parameter_blocks.size(); ++i) { 257 InternalAddParameterBlock(parameter_blocks[i], 282 for (int i = 0; i < parameter_blocks 218 AddResidualBlock( CostFunction* cost_function, LossFunction* loss_function, const vector<double*>& parameter_blocks) argument 558 vector<ParameterBlock*>& parameter_blocks = local [all...] |
H A D | block_evaluate_preparer.cc | 69 if (!residual_block->parameter_blocks()[j]->IsConstant()) {
|
H A D | 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);
|
H A D | solver_impl.cc | 540 if (reduced_program->parameter_blocks().size() < 2) { 918 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local 919 for (vector<ParameterBlock*>::const_iterator it = parameter_blocks.begin(); 920 it != parameter_blocks.end(); 955 ParameterBlock* const* parameter_blocks = (*it)->parameter_blocks(); local 960 parameter_blocks[i]->mutable_user_state()); 976 vector<ParameterBlock*>* parameter_blocks = local 988 for (int i = 0; i < parameter_blocks 1037 vector<ParameterBlock*>* parameter_blocks = local 1505 vector<ParameterBlock*>* parameter_blocks = local 1552 ParameterBlock* const* parameter_blocks = local 1631 vector<ParameterBlock*>& parameter_blocks = local 1690 vector<ParameterBlock*>& parameter_blocks = local [all...] |
H A D | residual_block_utils.cc | 58 const int parameter_block_size = block.parameter_blocks()[i]->Size(); 111 const int parameter_block_size = block.parameter_blocks()[i]->Size(); 147 const int parameter_block_size = block.parameter_blocks()[i]->Size();
|
H A D | dynamic_autodiff_cost_function_test.cc | 85 vector<double*> parameter_blocks(2); 86 parameter_blocks[0] = ¶m_block_0[0]; 87 parameter_blocks[1] = ¶m_block_1[0]; 88 EXPECT_TRUE(cost_function.Evaluate(¶meter_blocks[0], 115 vector<double*> parameter_blocks(2); 116 parameter_blocks[0] = ¶m_block_0[0]; 117 parameter_blocks[1] = ¶m_block_1[0]; 128 EXPECT_TRUE(cost_function.Evaluate(parameter_blocks.data(), 182 vector<double*> parameter_blocks(2); 183 parameter_blocks[ [all...] |
H A D | 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
|
H A D | scratch_evaluate_preparer.cc | 67 residual_block->parameter_blocks()[j];
|
H A D | 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];
|
H A D | 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]);
|
H A D | problem_test.cc | 142 "parameter_blocks.size()"); 386 return problem->program().parameter_blocks()[block]; 521 vector<double*> parameter_blocks; local 522 problem.GetParameterBlocks(¶meter_blocks); 523 EXPECT_EQ(parameter_blocks.size(), 2); 524 EXPECT_NE(parameter_blocks[0], parameter_blocks[1]); 525 EXPECT_TRUE(parameter_blocks[0] == x || parameter_blocks[0] == y); 526 EXPECT_TRUE(parameter_blocks[ [all...] |
H A D | 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();
|
H A D | residual_block.cc | 54 const vector<ParameterBlock*>& parameter_blocks, 62 std::copy(parameter_blocks.begin(), 63 parameter_blocks.end(), 52 ResidualBlock(const CostFunction* cost_function, const LossFunction* loss_function, const vector<ParameterBlock*>& parameter_blocks, int index) argument
|
H A D | cost_function_to_functor_test.cc | 70 scoped_array<double*> parameter_blocks( 79 parameter_blocks[i] = parameters.get() + num_parameters; 86 EXPECT_TRUE(cost_function.Evaluate(parameter_blocks.get(), 88 EXPECT_TRUE(actual_cost_function.Evaluate(parameter_blocks.get(), 96 EXPECT_TRUE(cost_function.Evaluate(parameter_blocks.get(), 99 EXPECT_TRUE(actual_cost_function.Evaluate(parameter_blocks.get(),
|
H A D | c_api.cc | 166 std::vector<double*> parameter_blocks(parameters, 171 parameter_blocks));
|
/external/ceres-solver/include/ceres/ |
H A D | cost_function_to_functor.h | 181 internal::FixedArray<const double*> parameter_blocks(2); 182 parameter_blocks[0] = x0; 183 parameter_blocks[1] = x1; 184 return cost_function_->Evaluate(parameter_blocks.get(), residuals, NULL); 201 internal::FixedArray<const double*> parameter_blocks(3); 202 parameter_blocks[0] = x0; 203 parameter_blocks[1] = x1; 204 parameter_blocks[2] = x2; 205 return cost_function_->Evaluate(parameter_blocks.get(), residuals, NULL); 223 internal::FixedArray<const double*> parameter_blocks( [all...] |
H A D | problem.h | 175 // the sizes of the parameter blocks listed in parameter_blocks. The 211 const vector<double*>& parameter_blocks); 316 // parameter_blocks().size() and parameter_block_sizes().size(). 339 // Fills the passed parameter_blocks vector with pointers to the 342 void GetParameterBlocks(vector<double*>* parameter_blocks) const; 354 // jacobian matrix. If parameter_blocks is empty, then it is 365 vector<double*> parameter_blocks; member in struct:ceres::Problem::EvaluateOptions
|