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

  /external/ceres-solver/internal/ceres/
triplet_sparse_matrix_test.cc 56 m.mutable_cols()[0] = 1;
60 m.mutable_cols()[1] = 4;
92 m.mutable_cols()[0] = 100;
104 orig.mutable_cols()[0] = 1;
108 orig.mutable_cols()[1] = 4;
132 orig.mutable_cols()[0] = 1;
136 orig.mutable_cols()[1] = 4;
142 cpy.mutable_cols()[0] = 10;
146 cpy.mutable_cols()[1] = 23;
150 cpy.mutable_cols()[0] = 10
    [all...]
block_random_access_diagonal_matrix.cc 68 int* cols = tsm_->mutable_cols();
compressed_row_sparse_matrix.h 107 int* mutable_cols() { return &cols_[0]; } function in class:ceres::internal::CompressedRowSparseMatrix
dynamic_compressed_row_sparse_matrix.cc 90 memcpy(mutable_cols() + index_into_values_and_cols,
triplet_sparse_matrix.h 94 int* mutable_cols() { return cols_.get(); } function in class:ceres::internal::TripletSparseMatrix
symmetric_linear_solver_test.cc 92 int* Aj = A->mutable_cols();
incomplete_lq_factorization.cc 120 int* cols = matrix->mutable_cols();
186 int* l_cols = l->mutable_cols();
190 int* q_cols = q.mutable_cols();
suitesparse.cc 63 triplet.j = reinterpret_cast<void*>(A->mutable_cols());
85 triplet.i = reinterpret_cast<void*>(A->mutable_cols());
103 m.i = reinterpret_cast<void*>(A->mutable_cols());
block_random_access_sparse_matrix.cc 82 int* cols = tsm_->mutable_cols();
cxsparse.cc 174 At.i = A->mutable_cols();
185 tsm_wrapper.p = tsm->mutable_cols();
incomplete_lq_factorization_test.cc 61 matrix.mutable_cols()[0] = 0;
85 int* cols = matrix.mutable_cols();
dynamic_compressed_row_sparse_matrix_test.cc 101 std::copy(cols.begin(), cols.end(), tsm->mutable_cols());
compressed_row_sparse_matrix.cc 330 int* cols = matrix->mutable_cols();
362 int* transpose_cols = transpose->mutable_cols();
438 int* crsm_cols = matrix->mutable_cols();
compressed_row_sparse_matrix_test.cc 284 int* cols = matrix_->mutable_cols();
351 int* cols = matrix.mutable_cols();
467 std::copy(cols.begin(), cols.end(), tsm.mutable_cols());
linear_least_squares_problems.cc 94 int* Aj = A->mutable_cols();
193 int* cols = A->mutable_cols();
program.cc 393 int* cols = tsm->mutable_cols();
412 cols = tsm->mutable_cols();
program_test.cc 273 int* cols = expected_block_sparse_jacobian.mutable_cols();
370 int* cols = expected_block_sparse_jacobian.mutable_cols();
compressed_col_sparse_matrix_utils_test.cc 135 int* cols = tsm.mutable_cols();
compressed_row_jacobian_writer.cc 115 int* cols = jacobian->mutable_cols();
sparse_normal_cholesky_solver.cc 178 outer_product_->mutable_cols(),
triplet_sparse_matrix.cc 249 m->mutable_cols()[i] = i;
block_sparse_matrix.cc 204 matrix->mutable_cols()[jac_pos] = col_block_pos + c;
schur_complement_solver.cc 476 crsm.mutable_cols(),
covariance_impl.cc 323 int* cols = covariance_matrix_->mutable_cols();

Completed in 155 milliseconds