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

  /external/ceres-solver/internal/ceres/
block_random_access_sparse_matrix.h 54 class BlockRandomAccessSparseMatrix : public BlockRandomAccessMatrix {
59 BlockRandomAccessSparseMatrix(const vector<int>& blocks,
64 virtual ~BlockRandomAccessSparseMatrix();
104 CERES_DISALLOW_COPY_AND_ASSIGN(BlockRandomAccessSparseMatrix);
block_random_access_sparse_matrix.cc 47 BlockRandomAccessSparseMatrix::BlockRandomAccessSparseMatrix(
120 BlockRandomAccessSparseMatrix::~BlockRandomAccessSparseMatrix() {
128 CellInfo* BlockRandomAccessSparseMatrix::GetCell(int row_block_id,
150 void BlockRandomAccessSparseMatrix::SetZero() {
block_random_access_sparse_matrix_test.cc 41 TEST(BlockRandomAccessSparseMatrix, GetCell) {
62 BlockRandomAccessSparseMatrix m(blocks, block_pairs);
131 m_.reset(new BlockRandomAccessSparseMatrix(blocks, block_pairs));
142 scoped_ptr<BlockRandomAccessSparseMatrix> m_;
visibility_based_preconditioner.h 65 class BlockRandomAccessSparseMatrix;
189 scoped_ptr<BlockRandomAccessSparseMatrix> m_;
schur_complement_solver.cc 181 // initialize a BlockRandomAccessSparseMatrix object.
247 set_lhs(new BlockRandomAccessSparseMatrix(blocks_, block_pairs));
269 // BlockRandomAccessSparseMatrix. The linear system is solved using
292 down_cast<const BlockRandomAccessSparseMatrix*>(lhs())->matrix());
376 // BlockRandomAccessSparseMatrix. The linear system is solved using
400 down_cast<const BlockRandomAccessSparseMatrix*>(lhs())->matrix());
432 // BlockRandomAccessSparseMatrix. The linear system is solved using
459 down_cast<const BlockRandomAccessSparseMatrix*>(lhs())->matrix());
visibility_based_preconditioner.cc 181 m_.reset(new BlockRandomAccessSparseMatrix(block_size_, block_pairs_));
434 down_cast<BlockRandomAccessSparseMatrix*>(

Completed in 301 milliseconds