| /external/ceres-solver/internal/ceres/ |
| D | triplet_sparse_matrix.cc | 46 num_cols_(0), in TripletSparseMatrix()
59 num_cols_(num_cols), in TripletSparseMatrix()
75 num_cols_(orig.num_cols_), in TripletSparseMatrix()
88 num_cols_ = rhs.num_cols_; in operator =()
99 (cols_[i] < 0) || (cols_[i] >= num_cols_)) in AllTripletsWithinBounds()
169 VectorRef(x, num_cols_).setZero(); in SquaredColumnNorm()
183 dense_matrix->resize(num_rows_, num_cols_); in ToDenseMatrix()
192 CHECK_EQ(B.num_cols(), num_cols_); in AppendRows()
207 cols_.get()[num_nonzeros_] = B.cols()[i] + num_cols_; in AppendCols()
210 num_cols_ = num_cols_ + B.num_cols(); in AppendCols()
[all …]
|
| D | iterative_schur_complement_solver_test.cc | 70 num_cols_ = A_->num_cols(); in SetUpProblem()
89 Vector reference_solution(num_cols_); in TestSolver()
94 options.max_num_iterations = num_cols_; in TestSolver()
98 Vector isc_sol(num_cols_); in TestSolver()
112 int num_cols_; member in ceres::internal::IterativeSchurComplementSolverTest
|
| D | implicit_schur_complement_test.cc | 66 num_cols_ = A_->num_cols(); in SetUp()
108 solution->resize(num_cols_); in ReducedLinearSystemAndSolution()
110 VectorRef schur_solution(solution->data() + num_cols_ - num_schur_rows, in ReducedLinearSystemAndSolution()
166 Vector sol(num_cols_); in TestImplicitSchurComplement()
179 int num_cols_; member in ceres::internal::ImplicitSchurComplementTest
|
| D | compressed_row_sparse_matrix.h | 90 virtual int num_cols() const { return num_cols_; } in num_cols()
123 void set_num_cols(const int num_cols) { num_cols_ = num_cols; } in set_num_cols()
162 int num_cols_; variable
|
| D | compressed_row_sparse_matrix.cc | 76 num_cols_ = num_cols; in CompressedRowSparseMatrix()
83 << " # of columns: " << num_cols_ in CompressedRowSparseMatrix()
93 num_cols_ = m.num_cols(); in CompressedRowSparseMatrix()
110 << " # of columns: " << num_cols_ in CompressedRowSparseMatrix()
139 num_cols_ = num_rows; in CompressedRowSparseMatrix()
187 fill(x, x + num_cols_, 0.0); in SquaredColumnNorm()
203 dense_matrix->resize(num_rows_, num_cols_); in ToDenseMatrix()
233 CHECK_EQ(m.num_cols(), num_cols_); in AppendRows()
278 matrix->num_cols = num_cols_; in ToCRSMatrix()
359 new CompressedRowSparseMatrix(num_cols_, num_rows_, num_nonzeros()); in Transpose()
|
| D | block_sparse_matrix.cc | 50 num_cols_(0), in BlockSparseMatrix()
58 num_cols_ += block_structure_->cols[i].size; in BlockSparseMatrix()
76 CHECK_GE(num_cols_, 0); in BlockSparseMatrix()
130 VectorRef(x, num_cols_).setZero(); in SquaredColumnNorm()
165 dense_matrix->resize(num_rows_, num_cols_); in ToDenseMatrix()
189 matrix->Resize(num_rows_, num_cols_); in ToTripletSparseMatrix()
|
| D | partitioned_matrix_view_test.cc | 58 num_cols_ = A_->num_cols(); in SetUp()
69 int num_cols_; member in ceres::internal::PartitionedMatrixViewTest
77 EXPECT_EQ(pmv_->num_col_blocks_f(), num_cols_ - num_eliminate_blocks_); in TEST_F()
79 EXPECT_EQ(pmv_->num_cols_f(), num_cols_ - num_eliminate_blocks_); in TEST_F()
|
| D | levenberg_marquardt_strategy_test.cc | 57 : num_cols_(num_cols), in RegularizationCheckingLinearSolver()
70 for (int i = 0; i < num_cols_; ++i) { in SolveImpl()
77 const int num_cols_; member in ceres::internal::RegularizationCheckingLinearSolver
|
| D | block_sparse_matrix.h | 79 virtual int num_cols() const { return num_cols_; } in num_cols()
89 int num_cols_; variable
|
| D | triplet_sparse_matrix.h | 65 virtual int num_cols() const { return num_cols_; } in num_cols()
113 int num_cols_; variable
|