Searched refs:max_num_nonzeros (Results 1 – 9 of 9) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | triplet_sparse_matrix_test.cc | 44 EXPECT_EQ(m.max_num_nonzeros(), 0); in TEST()
53 EXPECT_EQ(m.max_num_nonzeros(), 4); in TEST()
73 EXPECT_EQ(m.max_num_nonzeros(), 50); in TEST()
76 EXPECT_EQ(m.max_num_nonzeros(), 50); // The space is already reserved. in TEST()
117 EXPECT_EQ(cpy.max_num_nonzeros(), 4); in TEST()
163 EXPECT_EQ(cpy.max_num_nonzeros(), 4); in TEST()
|
| D | triplet_sparse_matrix.h | 49 TripletSparseMatrix(int num_rows, int num_cols, int max_num_nonzeros);
90 int max_num_nonzeros() const { return max_num_nonzeros_; } in max_num_nonzeros() function
|
| D | triplet_sparse_matrix.cc | 57 int max_num_nonzeros) in TripletSparseMatrix() argument
60 max_num_nonzeros_(max_num_nonzeros), in TripletSparseMatrix()
68 CHECK_GE(max_num_nonzeros, 0); in TripletSparseMatrix()
|
| D | compressed_row_sparse_matrix.cc | 74 int max_num_nonzeros) { in CompressedRowSparseMatrix() argument
78 cols_.resize(max_num_nonzeros, 0); in CompressedRowSparseMatrix()
79 values_.resize(max_num_nonzeros, 0.0); in CompressedRowSparseMatrix()
97 values_.resize(m.max_num_nonzeros(), 0.0); in CompressedRowSparseMatrix()
|
| D | suitesparse.cc | 60 triplet.nzmax = A->max_num_nonzeros(); in CreateSparseMatrix()
80 triplet.nzmax = A->max_num_nonzeros(); in CreateSparseMatrixTranspose()
|
| D | block_random_access_diagonal_matrix_test.cc | 89 EXPECT_EQ(tsm->max_num_nonzeros(), num_nonzeros); in TEST()
|
| D | compressed_row_sparse_matrix.h | 72 int max_num_nonzeros);
|
| D | block_random_access_sparse_matrix_test.cc | 93 EXPECT_EQ(tsm->max_num_nonzeros(), num_nonzeros); in TEST()
|
| D | program.cc | 408 if (num_nonzeros >= tsm->max_num_nonzeros()) { in CreateJacobianBlockSparsityTranspose()
|