OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:block_sizes
(Results
1 - 3
of
3
) sorted by null
/external/ceres-solver/internal/ceres/
runtime_numeric_diff_cost_function.cc
160
const vector<int16>&
block_sizes
= function_->parameter_block_sizes();
local
161
CHECK(!
block_sizes
.empty());
164
int parameters_size = accumulate(
block_sizes
.begin(),
block_sizes
.end(), 0);
166
vector<double*> parameters_references_copy(
block_sizes
.size());
168
for (int block = 1; block <
block_sizes
.size(); ++block) {
170
+
block_sizes
[block - 1];
174
for (int block = 0; block <
block_sizes
.size(); ++block) {
177
block_sizes
[block] * sizeof(*parameters[block]));
180
for (int block = 0; block <
block_sizes
.size(); ++block)
[
all
...]
gradient_checking_cost_function.cc
110
const vector<int16>&
block_sizes
= function_->parameter_block_sizes();
local
111
vector<Matrix> term_jacobians(
block_sizes
.size());
112
vector<Matrix> finite_difference_jacobians(
block_sizes
.size());
113
vector<double*> term_jacobian_pointers(
block_sizes
.size());
114
vector<double*> finite_difference_jacobian_pointers(
block_sizes
.size());
115
for (int i = 0; i <
block_sizes
.size(); i++) {
116
term_jacobians[i].resize(num_residuals,
block_sizes
[i]);
118
finite_difference_jacobians[i].resize(num_residuals,
block_sizes
[i]);
144
for (int k = 0; k <
block_sizes
.size(); k++) {
/external/ceres-solver/include/ceres/
gradient_checker.h
122
const vector<int16>&
block_sizes
= term->parameter_block_sizes();
local
123
const int num_blocks =
block_sizes
.size();
128
CHECK_EQ(N0,
block_sizes
[0]);
134
CHECK_EQ(N1,
block_sizes
[1]);
140
CHECK_EQ(N2,
block_sizes
[2]);
146
CHECK_EQ(N3,
block_sizes
[3]);
152
CHECK_EQ(N4,
block_sizes
[4]);
167
results->term_jacobians[i].resize(num_residuals,
block_sizes
[i]);
170
num_residuals,
block_sizes
[i]);
Completed in 54 milliseconds