HomeSort by relevance Sort by last modified time
    Searched full:max_num_nonzeros (Results 1 - 10 of 10) sorted by null

  /external/ceres-solver/internal/ceres/
triplet_sparse_matrix_test.cc 44 EXPECT_EQ(m.max_num_nonzeros(), 0);
53 EXPECT_EQ(m.max_num_nonzeros(), 4);
73 EXPECT_EQ(m.max_num_nonzeros(), 50);
76 EXPECT_EQ(m.max_num_nonzeros(), 50); // The space is already reserved.
117 EXPECT_EQ(cpy.max_num_nonzeros(), 4);
163 EXPECT_EQ(cpy.max_num_nonzeros(), 4);
triplet_sparse_matrix.h 49 TripletSparseMatrix(int num_rows, int num_cols, int max_num_nonzeros);
71 // Increase max_num_nonzeros and correspondingly increase the size
90 int max_num_nonzeros() const { return max_num_nonzeros_; } function in class:ceres::internal::TripletSparseMatrix
triplet_sparse_matrix.cc 57 int max_num_nonzeros)
60 max_num_nonzeros_(max_num_nonzeros),
68 CHECK_GE(max_num_nonzeros, 0);
compressed_row_sparse_matrix.h 63 // num_rows, num_cols and max_num_nonzeros.
72 int max_num_nonzeros);
block_random_access_diagonal_matrix_test.cc 89 EXPECT_EQ(tsm->max_num_nonzeros(), num_nonzeros);
dynamic_compressed_row_jacobian_writer.cc 48 // Initialize `jacobian` with zero number of `max_num_nonzeros`.
compressed_row_sparse_matrix.cc 74 int max_num_nonzeros) {
78 cols_.resize(max_num_nonzeros, 0);
79 values_.resize(max_num_nonzeros, 0.0);
84 << " max_num_nonzeros: " << cols_.size()
97 values_.resize(m.max_num_nonzeros(), 0.0);
111 << " max_num_nonzeros: " << cols_.size()
suitesparse.cc 60 triplet.nzmax = A->max_num_nonzeros();
80 triplet.nzmax = A->max_num_nonzeros();
block_random_access_sparse_matrix_test.cc 93 EXPECT_EQ(tsm->max_num_nonzeros(), num_nonzeros);
program.cc 408 if (num_nonzeros >= tsm->max_num_nonzeros()) {

Completed in 190 milliseconds