| /external/ceres-solver/internal/ceres/ |
| conditioned_cost_function.cc | 56 wrapped_cost_function_->parameter_block_sizes();
63 CHECK_EQ(1, conditioners[i]->parameter_block_sizes().size());
64 CHECK_EQ(1, conditioners[i]->parameter_block_sizes()[0]);
114 i < wrapped_cost_function_->parameter_block_sizes().size();
118 wrapped_cost_function_->parameter_block_sizes()[i];
|
| normal_prior.cc | 54 ConstVectorRef p(parameters[0], parameter_block_sizes()[0]);
61 MatrixRef(jacobians[0], num_residuals(), parameter_block_sizes()[0]) = A_;
|
| cost_function_to_functor_test.cc | 45 const vector<int32>& parameter_block_sizes = local
46 cost_function.parameter_block_sizes();
48 actual_cost_function.parameter_block_sizes();
49 EXPECT_EQ(parameter_block_sizes.size(),
53 for (int i = 0; i < parameter_block_sizes.size(); ++i) {
54 EXPECT_EQ(parameter_block_sizes[i], actual_parameter_block_sizes[i]);
55 num_parameters += parameter_block_sizes[i];
71 new double*[parameter_block_sizes.size()]);
73 new double*[parameter_block_sizes.size()]);
75 new double*[parameter_block_sizes.size()])
[all...] |
| c_api.cc | 72 int* parameter_block_sizes)
77 mutable_parameter_block_sizes()->push_back(parameter_block_sizes[i]);
149 int* parameter_block_sizes,
158 parameter_block_sizes);
|
| gradient_checker_test.cc | 78 for (int u = 0; u < parameter_block_sizes()[j]; ++u) {
91 for (int u = 0; u < parameter_block_sizes()[j]; ++u) {
131 for (int u = 0; u < parameter_block_sizes()[j]; ++u) {
144 for (int u = 0; u < parameter_block_sizes()[j]; ++u) {
|
| residual_block.h | 117 return cost_function_->parameter_block_sizes().size();
|
| conditioned_cost_function_test.cc | 100 EXPECT_EQ(difference_cost_function->parameter_block_sizes(),
101 conditioned_cost_function.parameter_block_sizes());
|
| gradient_checking_cost_function.cc | 96 const vector<int32>& parameter_block_sizes = local
97 function->parameter_block_sizes();
98 for (int i = 0; i < parameter_block_sizes.size(); ++i) {
99 finite_diff_cost_function->AddParameterBlock(parameter_block_sizes[i]);
101 *mutable_parameter_block_sizes() = parameter_block_sizes;
120 const vector<int32>& block_sizes = function_->parameter_block_sizes();
|
| residual_block_test.cc | 66 parameter_block_sizes()[k]);
191 parameter_block_sizes()[k]);
|
| problem_impl.cc | 244 cost_function->parameter_block_sizes().size());
247 const vector<int32>& parameter_block_sizes = local
248 cost_function->parameter_block_sizes();
251 CHECK_EQ(parameter_block_sizes.size(), parameter_blocks.size())
278 parameter_block_sizes[i]);
285 CHECK_EQ(cost_function->parameter_block_sizes()[i],
288 << " of size " << cost_function->parameter_block_sizes()[i]
[all...] |
| evaluator_test.cc | 68 for (int k = 0; k < Base::parameter_block_sizes().size(); ++k) {
84 Base::parameter_block_sizes()[k]);
85 for (int j = 0; j < Base::parameter_block_sizes()[k]; ++j) {
|
| residual_block.cc | 60 cost_function->parameter_block_sizes().size()]),
|
| gradient_checking_cost_function_test.cc | 94 for (int u = 0; u < parameter_block_sizes()[j]; ++u) {
107 for (int u = 0; u < parameter_block_sizes()[j]; ++u) {
|
| /external/ceres-solver/include/ceres/ |
| dynamic_autodiff_cost_function.h | 117 const int num_parameter_blocks = parameter_block_sizes().size();
118 const int num_parameters = std::accumulate(parameter_block_sizes().begin(),
119 parameter_block_sizes().end(),
142 const int parameter_block_size = parameter_block_sizes()[i];
192 for (int j = 0; j < parameter_block_sizes()[i];
222 for (int j = 0; j < parameter_block_sizes()[i];
230 jacobians[i][k * parameter_block_sizes()[i] + j] =
|
| cost_function.h | 86 // parameter_block_sizes, i.e. jacobians[i], is an
119 const vector<int32>& parameter_block_sizes() const { function in class:ceres::CostFunction
|
| cost_function_to_functor.h | 130 const vector<int32>& parameter_block_sizes = local
131 cost_function->parameter_block_sizes();
135 CHECK_EQ(parameter_block_sizes.size(), num_parameter_blocks);
137 CHECK_EQ(N0, parameter_block_sizes[0]);
138 if (parameter_block_sizes.size() > 1) CHECK_EQ(N1, parameter_block_sizes[1]); // NOLINT
139 if (parameter_block_sizes.size() > 2) CHECK_EQ(N2, parameter_block_sizes[2]); // NOLINT
140 if (parameter_block_sizes.size() > 3) CHECK_EQ(N3, parameter_block_sizes[3]); // NOLIN
682 const vector<int32>& parameter_block_sizes = local
[all...] |
| c_api.h | 133 int* parameter_block_sizes,
|
| dynamic_numeric_diff_cost_function.h | 107 const vector<int32>& block_sizes = parameter_block_sizes();
|
| gradient_checker.h | 76 // term->parameter_block_sizes().size(), and each matrix is the
122 const vector<int32>& block_sizes = term->parameter_block_sizes();
|
