HomeSort by relevance Sort by last modified time
    Searched refs:row_blocks (Results 1 - 11 of 11) sorted by null

  /external/ceres-solver/internal/ceres/
compressed_col_sparse_matrix_utils.cc 43 const vector<int>& row_blocks,
49 const int num_row_blocks = row_blocks.size();
55 cursor += row_blocks[i];
compressed_col_sparse_matrix_utils_test.cc 87 int FillBlock(const vector<int>& row_blocks,
95 row_pos += row_blocks[i];
104 for (int r = 0; r < row_blocks[row_block_id]; ++r) {
128 vector<int> row_blocks; local
129 row_blocks.push_back(1);
130 row_blocks.push_back(2);
131 row_blocks.push_back(2);
140 offset += FillBlock(row_blocks, col_blocks, \
177 row_blocks,
cxsparse.h 108 const vector<int>& row_blocks,
compressed_row_jacobian_writer.cc 146 vector<int>& row_blocks = *(jacobian->mutable_row_blocks()); local
147 row_blocks.resize(residual_blocks.size());
149 row_blocks[i] = residual_blocks[i]->NumResiduals();
suitesparse.cc 146 const vector<int>& row_blocks,
149 if (!BlockAMDOrdering(A, row_blocks, col_blocks, &ordering)) {
195 const vector<int>& row_blocks,
198 const int num_row_blocks = row_blocks.size();
208 row_blocks,
232 BlockOrderingToScalarOrdering(row_blocks, block_ordering, ordering);
suitesparse.h 145 const vector<int>& row_blocks,
201 // column blocks are given by row_blocks, and col_blocks
207 const vector<int>& row_blocks,
compressed_row_sparse_matrix.h 112 const vector<int>& row_blocks() const { return row_blocks_; } function in class:ceres::internal::CompressedRowSparseMatrix
cxsparse.cc 104 const vector<int>& row_blocks,
106 const int num_row_blocks = row_blocks.size();
113 row_blocks,
132 BlockOrderingToScalarOrdering(row_blocks, block_ordering, &scalar_ordering);
compressed_col_sparse_matrix_utils.h 52 const vector<int>& row_blocks,
sparse_normal_cholesky_solver.cc 206 A->row_blocks()));
compressed_row_sparse_matrix_test.cc 196 EXPECT_EQ(blocks, matrix->row_blocks());

Completed in 99 milliseconds