| /external/ceres-solver/internal/ceres/ |
| detect_structure.cc | 42 int* f_block_size) {
46 *f_block_size = 0;
80 if (*f_block_size == 0) {
83 *f_block_size = bs.cols[f_block_id].size;
85 } else if (*f_block_size != Eigen::Dynamic) {
87 if (*f_block_size != bs.cols[row.cells[c].block_id].size) {
89 << "changed from " << *f_block_size << " to "
91 *f_block_size = Eigen::Dynamic;
99 *f_block_size == Eigen::Dynamic);
110 << *f_block_size << ">." local
[all...] |
| preconditioner.h | 57 f_block_size(Eigen::Dynamic) {
96 int f_block_size; member in struct:ceres::internal::Preconditioner::Options
|
| linear_solver.h | 108 f_block_size(Eigen::Dynamic) {
165 int f_block_size; member in struct:ceres::internal::LinearSolver::Options
|
| schur_eliminator_impl.h | 159 // f_block_size, which is always less than buffer_size_, so we just
343 const int f_block_size = bs->cols[f_block_id].size; local
347 values + row.cells[c].position, row.block.size, f_block_size,
479 const int f_block_size = bs->cols[f_block_id].size; local
485 values + row.cells[c].position, row.block.size, f_block_size,
486 buffer_ptr, 0, 0, e_block_size, f_block_size);
|
