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

  /external/ceres-solver/internal/ceres/
triplet_sparse_matrix_test.cc 55 m.mutable_rows()[0] = 0;
59 m.mutable_rows()[1] = 1;
88 m.mutable_rows()[0] = 10;
91 m.mutable_rows()[0] = 1;
103 orig.mutable_rows()[0] = 0;
107 orig.mutable_rows()[1] = 1;
131 orig.mutable_rows()[0] = 0;
135 orig.mutable_rows()[1] = 1;
141 cpy.mutable_rows()[0] = 0;
145 cpy.mutable_rows()[1] = 2
    [all...]
dynamic_compressed_row_sparse_matrix.cc 87 mutable_rows()[i] = index_into_values_and_cols;
99 mutable_rows()[num_rows()] = index_into_values_and_cols;
block_random_access_diagonal_matrix.cc 67 int* rows = tsm_->mutable_rows();
compressed_row_sparse_matrix.h 110 int* mutable_rows() { return &rows_[0]; } function in class:ceres::internal::CompressedRowSparseMatrix
triplet_sparse_matrix.h 93 int* mutable_rows() { return rows_.get(); } function in class:ceres::internal::TripletSparseMatrix
symmetric_linear_solver_test.cc 91 int* Ai = A->mutable_rows();
incomplete_lq_factorization.cc 119 int* rows = matrix->mutable_rows();
185 int* l_rows = l->mutable_rows();
189 int* q_rows = q.mutable_rows();
incomplete_lq_factorization_test.cc 59 matrix.mutable_rows()[0] = 0;
60 matrix.mutable_rows()[1] = 1;
84 int* rows = matrix.mutable_rows();
suitesparse.cc 62 triplet.i = reinterpret_cast<void*>(A->mutable_rows());
84 triplet.j = reinterpret_cast<void*>(A->mutable_rows());
102 m.p = reinterpret_cast<void*>(A->mutable_rows());
block_random_access_sparse_matrix.cc 81 int* rows = tsm_->mutable_rows();
cxsparse.cc 173 At.p = A->mutable_rows();
186 tsm_wrapper.i = tsm->mutable_rows();
dynamic_compressed_row_sparse_matrix_test.cc 100 std::copy(rows.begin(), rows.end(), tsm->mutable_rows());
compressed_row_sparse_matrix.cc 329 int* rows = matrix->mutable_rows();
361 int* transpose_rows = transpose->mutable_rows();
436 int* crsm_rows = matrix->mutable_rows();
compressed_row_sparse_matrix_test.cc 283 int* rows = matrix_->mutable_rows();
350 int* rows = matrix.mutable_rows();
466 std::copy(rows.begin(), rows.end(), tsm.mutable_rows());
linear_least_squares_problems.cc 93 int* Ai = A->mutable_rows();
192 int* rows = A->mutable_rows();
program.cc 392 int* rows = tsm->mutable_rows();
411 rows = tsm->mutable_rows();
program_test.cc 272 int* rows = expected_block_sparse_jacobian.mutable_rows();
369 int* rows = expected_block_sparse_jacobian.mutable_rows();
compressed_col_sparse_matrix_utils_test.cc 134 int* rows = tsm.mutable_rows();
compressed_row_jacobian_writer.cc 114 int* rows = jacobian->mutable_rows();
sparse_normal_cholesky_solver.cc 177 outer_product_->mutable_rows(),
triplet_sparse_matrix.cc 248 m->mutable_rows()[i] = i;
block_sparse_matrix.cc 203 matrix->mutable_rows()[jac_pos] = row_block_pos + r;
schur_complement_solver.cc 475 crsm.mutable_rows(),
covariance_impl.cc 322 int* rows = covariance_matrix_->mutable_rows();

Completed in 766 milliseconds