| /external/ceres-solver/internal/ceres/ |
| triplet_sparse_matrix.h | 46 class TripletSparseMatrix : public SparseMatrix {
48 TripletSparseMatrix();
49 TripletSparseMatrix(int num_rows, int num_cols, int max_num_nonzeros);
50 explicit TripletSparseMatrix(const TripletSparseMatrix& orig);
52 TripletSparseMatrix& operator=(const TripletSparseMatrix& rhs);
54 ~TripletSparseMatrix();
80 void AppendRows(const TripletSparseMatrix& B);
84 void AppendCols(const TripletSparseMatrix& B)
[all...] |
| triplet_sparse_matrix.cc | 44 TripletSparseMatrix::TripletSparseMatrix()
53 TripletSparseMatrix::~TripletSparseMatrix() {}
55 TripletSparseMatrix::TripletSparseMatrix(int num_rows,
72 TripletSparseMatrix::TripletSparseMatrix(const TripletSparseMatrix& orig)
85 TripletSparseMatrix& TripletSparseMatrix::operator=
[all...] |
| block_random_access_diagonal_matrix.h | 78 const TripletSparseMatrix* matrix() const { return tsm_.get(); }
79 TripletSparseMatrix* mutable_matrix() { return tsm_.get(); }
87 scoped_ptr<TripletSparseMatrix> tsm_;
|
| block_random_access_sparse_matrix.h | 51 // BlockRandomAccessMatrix. Internally a TripletSparseMatrix is used
83 const TripletSparseMatrix* matrix() const { return tsm_.get(); }
84 TripletSparseMatrix* mutable_matrix() { return tsm_.get(); }
101 scoped_ptr<TripletSparseMatrix> tsm_;
|
| triplet_sparse_matrix_test.cc | 39 TEST(TripletSparseMatrix, DefaultConstructorReturnsEmptyObject) {
40 TripletSparseMatrix m;
47 TEST(TripletSparseMatrix, SimpleConstructorAndBasicOperations) {
49 TripletSparseMatrix m(2, 5, 4);
101 TEST(TripletSparseMatrix, CopyConstructor) {
102 TripletSparseMatrix orig(2, 5, 4);
112 TripletSparseMatrix cpy(orig);
129 TEST(TripletSparseMatrix, AssignmentOperator) {
130 TripletSparseMatrix orig(2, 5, 4);
140 TripletSparseMatrix cpy(3, 50, 40)
[all...] |
| block_sparse_matrix.h | 46 class TripletSparseMatrix;
84 void ToTripletSparseMatrix(TripletSparseMatrix* matrix) const;
|
| cxsparse.h | 46 class TripletSparseMatrix;
73 cs_di* CreateSparseMatrix(TripletSparseMatrix* A);
|
| dense_sparse_matrix.h | 45 class TripletSparseMatrix;
49 // Build a matrix with the same content as the TripletSparseMatrix
51 explicit DenseSparseMatrix(const TripletSparseMatrix& m);
|
| symmetric_linear_solver_test.cc | 51 scoped_ptr<TripletSparseMatrix>
52 A(TripletSparseMatrix::CreateSparseDiagonalMatrix(diagonal, 3));
84 scoped_ptr<TripletSparseMatrix> A(new TripletSparseMatrix(3, 3, 9));
|
| compressed_row_sparse_matrix.h | 47 class TripletSparseMatrix;
51 // Build a matrix with the same content as the TripletSparseMatrix
52 // m. TripletSparseMatrix objects are easier to construct
57 explicit CompressedRowSparseMatrix(const TripletSparseMatrix& m);
68 // constructing a TripletSparseMatrix, which leads to more than
|
| program.h | 45 class TripletSparseMatrix;
125 // Create a TripletSparseMatrix which contains the zero-one
130 TripletSparseMatrix* CreateJacobianBlockSparsityTranspose() const;
|
| suitesparse.h | 77 class TripletSparseMatrix;
92 cholmod_sparse* CreateSparseMatrix(TripletSparseMatrix* A);
96 cholmod_sparse* CreateSparseMatrixTranspose(TripletSparseMatrix* A);
|
| reorder_program.cc | 76 const TripletSparseMatrix& tsm_block_jacobian_transpose,
87 const_cast<TripletSparseMatrix*>(&tsm_block_jacobian_transpose));
111 const TripletSparseMatrix& tsm_block_jacobian_transpose,
124 const_cast<TripletSparseMatrix*>(&tsm_block_jacobian_transpose));
289 scoped_ptr<TripletSparseMatrix> tsm_block_jacobian_transpose(
404 scoped_ptr<TripletSparseMatrix> tsm_block_jacobian_transpose(
|
| block_sparse_matrix_test.cc | 55 B_.reset(down_cast<TripletSparseMatrix*>(problem->A.release()));
63 scoped_ptr<TripletSparseMatrix> B_;
|
| block_random_access_diagonal_matrix.cc | 65 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros));
|
| solver_impl.h | 49 class TripletSparseMatrix;
|
| schur_complement_solver.cc | 290 TripletSparseMatrix* tsm =
291 const_cast<TripletSparseMatrix*>(
397 // Extract the TripletSparseMatrix that is used for actually storing S.
398 TripletSparseMatrix* tsm =
399 const_cast<TripletSparseMatrix*>(
456 // Extract the TripletSparseMatrix that is used for actually storing S.
457 TripletSparseMatrix* tsm =
458 const_cast<TripletSparseMatrix*>(
|
| dense_sparse_matrix_test.cc | 77 tsm.reset(down_cast<TripletSparseMatrix*>(problem->A.release()));
87 scoped_ptr<TripletSparseMatrix> tsm;
|
| dynamic_compressed_row_sparse_matrix_test.cc | 97 tsm.reset(new TripletSparseMatrix(num_rows,
168 scoped_ptr<TripletSparseMatrix> tsm;
|
| block_random_access_diagonal_matrix_test.cc | 87 const TripletSparseMatrix* tsm = m.matrix();
|
| iterative_schur_complement_solver_test.cc | 76 TripletSparseMatrix triplet_A(A_->num_rows(),
|
| block_random_access_sparse_matrix.cc | 65 // TripletSparseMatrix.
79 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros));
|
| block_random_access_sparse_matrix_test.cc | 91 const TripletSparseMatrix* tsm = m.matrix();
|
| linear_least_squares_problems.cc | 86 TripletSparseMatrix* A = new TripletSparseMatrix(3, 2, 6);
176 // The following two functions create a TripletSparseMatrix and a
179 // TripletSparseMatrix version.
185 TripletSparseMatrix* A = new TripletSparseMatrix(num_rows,
|
| linear_solver.h | 312 // need low level access to the TripletSparseMatrix implementing the
355 typedef TypedLinearSolver<TripletSparseMatrix> TripletSparseMatrixSolver; // NOLINT
|
