| /external/ceres-solver/internal/ceres/ |
| iterative_schur_complement_solver_test.cc | 70 num_cols_ = A_->num_cols();
89 Vector reference_solution(num_cols_);
93 options.max_num_iterations = num_cols_;
96 Vector isc_sol(num_cols_);
110 int num_cols_; member in class:ceres::internal::IterativeSchurComplementSolverTest
|
| triplet_sparse_matrix.cc | 47 num_cols_(0),
60 num_cols_(num_cols),
76 num_cols_(orig.num_cols_),
115 num_cols_ = rhs.num_cols_;
126 (cols_[i] < 0) || (cols_[i] >= num_cols_))
196 VectorRef(x, num_cols_).setZero();
210 dense_matrix->resize(num_rows_, num_cols_);
224 tsm_proto->set_num_cols(num_cols_);
[all...] |
| block_sparse_matrix.h | 119 virtual int num_cols() const { return num_cols_; }
133 int num_cols_; member in class:ceres::internal::BlockSparseMatrix
|
| compressed_row_sparse_matrix.h | 98 virtual int num_cols() const { return num_cols_; }
132 int num_cols_; member in class:ceres::internal::CompressedRowSparseMatrix
|
| triplet_sparse_matrix.h | 73 virtual int num_cols() const { return num_cols_; }
87 // the same number of columns as num_cols_.
121 int num_cols_; member in class:ceres::internal::TripletSparseMatrix
|
| 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
|
| compressed_row_sparse_matrix.cc | 74 num_cols_ = num_cols;
77 VLOG(1) << "# of rows: " << num_rows_ << " # of columns: " << num_cols_
95 num_cols_ = m.num_cols();
108 VLOG(1) << "# of rows: " << num_rows_ << " # of columns: " << num_cols_
147 num_cols_ = proto.num_cols();
175 num_cols_ = num_rows;
225 fill(x, x + num_cols_, 0.0);
241 dense_matrix->resize(num_rows_, num_cols_);
260 proto->set_num_cols(num_cols_);
286 CHECK_EQ(m.num_cols(), num_cols_);
[all...] |
| 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
|
| block_sparse_matrix.cc | 50 num_cols_(0),
58 num_cols_ += block_structure_->cols[i].size;
76 CHECK_GE(num_cols_, 0);
94 num_cols_ = proto.num_cols();
157 VectorRef(x, num_cols_).setZero();
192 dense_matrix->resize(num_rows_, num_cols_);
216 matrix->Resize(num_rows_, num_cols_);
253 proto->set_num_cols(num_cols_);
|
| 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_);
|
| visibility_based_preconditioner_test.cc | 79 num_cols_ = A_->num_cols();
96 VectorRef(D_.get(), num_cols_).setConstant(10.0);
224 int num_cols_; member in class:ceres::internal::VisibilityBasedPreconditionerTest
|
