| /external/ceres-solver/internal/ceres/ |
| H A D | triplet_sparse_matrix.cc | 46 num_cols_(0),
59 num_cols_(num_cols),
75 num_cols_(orig.num_cols_),
88 num_cols_ = rhs.num_cols_;
99 (cols_[i] < 0) || (cols_[i] >= num_cols_))
169 VectorRef(x, num_cols_).setZero();
183 dense_matrix->resize(num_rows_, num_cols_);
192 CHECK_EQ(B.num_cols(), num_cols_);
[all...] |
| H A D | iterative_schur_complement_solver_test.cc | 70 num_cols_ = A_->num_cols();
89 Vector reference_solution(num_cols_);
94 options.max_num_iterations = num_cols_;
98 Vector isc_sol(num_cols_);
112 int num_cols_; member in class:ceres::internal::IterativeSchurComplementSolverTest
|
| H A D | block_sparse_matrix.h | 79 virtual int num_cols() const { return num_cols_; }
89 int num_cols_; member in class:ceres::internal::BlockSparseMatrix
|
| H A D | compressed_row_sparse_matrix.h | 90 virtual int num_cols() const { return num_cols_; }
120 void set_num_cols(const int num_cols) { num_cols_ = num_cols; }
133 int num_cols_; member in class:ceres::internal::CompressedRowSparseMatrix
|
| H A D | triplet_sparse_matrix.h | 65 virtual int num_cols() const { return num_cols_; }
79 // the same number of columns as num_cols_.
113 int num_cols_; member in class:ceres::internal::TripletSparseMatrix
|
| H A D | implicit_schur_complement_test.cc | 66 num_cols_ = A_->num_cols();
108 solution->resize(num_cols_);
110 VectorRef schur_solution(solution->data() + num_cols_ - num_schur_rows,
163 Vector sol(num_cols_);
176 int num_cols_; member in class:ceres::internal::ImplicitSchurComplementTest
|
| H A D | compressed_row_sparse_matrix.cc | 75 num_cols_ = num_cols;
82 << " # of columns: " << num_cols_
92 num_cols_ = m.num_cols();
109 << " # of columns: " << num_cols_
138 num_cols_ = num_rows;
186 fill(x, x + num_cols_, 0.0);
202 dense_matrix->resize(num_rows_, num_cols_);
221 CHECK_EQ(m.num_cols(), num_cols_);
259 matrix->num_cols = num_cols_;
333 new CompressedRowSparseMatrix(num_cols_, num_rows
[all...] |
| H A D | levenberg_marquardt_strategy_test.cc | 57 : num_cols_(num_cols),
70 for (int i = 0; i < num_cols_; ++i) {
77 const int num_cols_; member in class:ceres::internal::RegularizationCheckingLinearSolver
|
| H A D | block_sparse_matrix.cc | 50 num_cols_(0),
58 num_cols_ += block_structure_->cols[i].size;
76 CHECK_GE(num_cols_, 0);
130 VectorRef(x, num_cols_).setZero();
165 dense_matrix->resize(num_rows_, num_cols_);
189 matrix->Resize(num_rows_, num_cols_);
|
| H A D | partitioned_matrix_view_test.cc | 57 num_cols_ = A_->num_cols();
63 int num_cols_; member in class:ceres::internal::PartitionedMatrixViewTest
73 EXPECT_EQ(m.num_col_blocks_f(), num_cols_ - num_eliminate_blocks_);
75 EXPECT_EQ(m.num_cols_f(), num_cols_ - num_eliminate_blocks_);
|