/external/ceres-solver/include/ceres/ |
H A D | crs_matrix.h | 43 CRSMatrix() : num_rows(0), num_cols(0) {} 45 int num_rows; member in struct:ceres::CRSMatrix 51 // rows is a num_rows + 1 sized array that points into the cols and
|
/external/ceres-solver/internal/ceres/ |
H A D | blas.cc | 49 void BLAS::SymmetricRankKUpdate(int num_rows, argument 61 int n = transpose ? num_cols : num_rows; 62 int k = transpose ? num_rows : num_cols;
|
H A D | evaluator_test_utils.h | 39 int num_rows; member in struct:ceres::internal::ExpectedEvaluation
|
H A D | block_jacobi_preconditioner.h | 63 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockJacobiPreconditioner
|
H A D | block_random_access_dense_matrix.h | 48 // num_rows x num_cols. 78 // structure, num_rows() = num_cols(). 79 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockRandomAccessDenseMatrix
|
H A D | block_random_access_dense_matrix_test.cc | 44 const int num_rows = 3 + 4 + 5; local 46 EXPECT_EQ(m.num_rows(), num_rows); 47 EXPECT_EQ(m.num_cols(), num_rows); 76 const int num_rows = 3 + 4 + 5; local 104 int pos = row_idx * num_rows + col_idx;
|
H A D | block_random_access_diagonal_matrix.h | 73 // Since the matrix is square, num_rows() == num_cols(). 74 virtual int num_rows() const { return tsm_->num_rows(); } function in class:ceres::internal::BlockRandomAccessDiagonalMatrix
|
H A D | block_random_access_diagonal_matrix_test.cc | 47 const int num_rows = 3 + 4 + 5; local 51 EXPECT_EQ(m.num_rows(), num_rows); 52 EXPECT_EQ(m.num_cols(), num_rows);
|
H A D | block_sparse_matrix.h | 78 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockSparseMatrix
|
H A D | corrector.cc | 112 void Corrector::CorrectResiduals(const int num_rows, double* residuals) { argument 115 VectorRef(residuals, num_rows) *= residual_scaling_; 118 void Corrector::CorrectJacobian(const int num_rows, argument 127 VectorRef(jacobian, num_rows * num_cols) *= sqrt_rho1_; 145 for (int r = 0; r < num_rows; ++r) { 149 for (int r = 0; r < num_rows; ++r) {
|
H A D | dense_qr_solver.cc | 71 const int num_rows = A->num_rows(); local 94 rhs_.head(num_rows) = ConstVectorRef(b, num_rows); 129 const int num_rows = A->num_rows(); local 140 num_rows + ((per_solve_options.D != NULL) ? num_cols : 0); 145 rhs_.head(num_rows) = ConstVectorRef(b, num_rows);
|
H A D | lapack.cc | 70 int num_rows, 79 int n = num_rows; 115 int LAPACK::EstimateWorkSizeForQR(int num_rows, int num_cols) { argument 126 &num_rows, 130 &num_rows, 132 &num_rows, 148 int num_rows, 160 int m = num_rows; 163 int lda = num_rows; 164 int ldb = num_rows; 69 SolveInPlaceUsingCholesky( int num_rows, const double* in_lhs, double* rhs_and_solution, string* message) argument 147 SolveInPlaceUsingQR( int num_rows, int num_cols, const double* in_lhs, int work_size, double* work, double* rhs_and_solution, string* message) argument [all...] |
H A D | block_random_access_sparse_matrix.h | 78 // Since the matrix is square, num_rows() == num_cols(). 79 virtual int num_rows() const { return tsm_->num_rows(); } function in class:ceres::internal::BlockRandomAccessSparseMatrix
|
H A D | cgnr_linear_operator.h | 83 : A_(A), D_(D), z_(new double[A.num_rows()]) { 88 std::fill(z_.get(), z_.get() + A_.num_rows(), 0.0); 108 virtual int num_rows() const { return A_.num_cols(); } function in class:ceres::internal::CgnrLinearOperator
|
H A D | dense_normal_cholesky_solver.cc | 71 const int num_rows = A->num_rows(); local 88 Vector rhs = Aref.transpose() * ConstVectorRef(b, num_rows); 136 BLAS::SymmetricRankKUpdate(A->num_rows(), 152 A->matrix().transpose() * ConstVectorRef(b, A->num_rows());
|
H A D | dense_sparse_matrix_test.cc | 49 EXPECT_EQ(a->num_rows(), b->num_rows()); 52 int num_rows = a->num_rows(); local 59 Vector y_a = Vector::Zero(num_rows); 60 Vector y_b = Vector::Zero(num_rows); 80 num_rows = tsm->num_rows(); 84 int num_rows; member in class:ceres::internal::DenseSparseMatrixTest 100 Vector b1 = Vector::Zero(num_rows); [all...] |
H A D | dynamic_compressed_row_sparse_matrix.cc | 38 int num_rows, 41 : CompressedRowSparseMatrix(num_rows, 44 dynamic_cols_.resize(num_rows); 45 dynamic_values_.resize(num_rows); 52 CHECK_LT(row, num_rows()); 60 int num_rows) { 61 for (int r = 0; r < num_rows; ++r) { 64 CHECK_LT(i, this->num_rows()); 86 for (int i = 0; i < num_rows(); ++i) { 99 mutable_rows()[num_rows()] 37 DynamicCompressedRowSparseMatrix( int num_rows, int num_cols, int initial_max_num_nonzeros) argument 59 ClearRows(int row_start, int num_rows) argument [all...] |
H A D | low_rank_inverse_hessian.h | 91 virtual int num_rows() const { return num_parameters_; } function in class:ceres::internal::LowRankInverseHessian
|
H A D | partitioned_matrix_view.h | 105 virtual int num_rows() const = 0; 134 virtual int num_rows() const { return matrix_.num_rows(); } function in class:ceres::internal::PartitionedMatrixView
|
H A D | preconditioner.cc | 68 int SparseMatrixPreconditionerWrapper::num_rows() const { function in class:ceres::internal::SparseMatrixPreconditionerWrapper 69 return matrix_->num_rows();
|
H A D | block_random_access_sparse_matrix_test.cc | 46 const int num_rows = 3 + 4 + 5; local 63 EXPECT_EQ(m.num_rows(), num_rows); 64 EXPECT_EQ(m.num_cols(), num_rows);
|
H A D | compressed_row_sparse_matrix.h | 63 // num_rows, num_cols and max_num_nonzeros. 70 CompressedRowSparseMatrix(int num_rows, 74 // Build a square sparse diagonal matrix with num_rows rows and 76 CompressedRowSparseMatrix(const double* diagonal, int num_rows); 89 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::CompressedRowSparseMatrix 96 // num_rows -= delta_rows 122 void set_num_rows(const int num_rows) { num_rows_ = num_rows; } argument
|
H A D | dense_sparse_matrix.cc | 42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols) argument 45 m_.resize(num_rows, num_cols); 49 DenseSparseMatrix::DenseSparseMatrix(int num_rows, argument 56 m_.resize(num_rows + num_cols, num_cols); 58 m_.resize(num_rows, num_cols); 64 : m_(Eigen::MatrixXd::Zero(m.num_rows(), m.num_cols())), 88 VectorRef(y, num_rows()) += matrix() * ConstVectorRef(x, num_cols()); 93 matrix().transpose() * ConstVectorRef(x, num_rows()); 105 *dense_matrix = m_.block(0, 0, num_rows(), num_cols()); 129 int DenseSparseMatrix::num_rows() cons function in class:ceres::internal::DenseSparseMatrix [all...] |
H A D | implicit_schur_complement.cc | 76 tmp_rows_.resize(A_->num_rows()); 172 const int num_rows = A_->num_rows(); local 179 tmp_rows_ = ConstVectorRef(b_, num_rows) - tmp_rows_; 217 tmp_rows_ = ConstVectorRef(b_, A_->num_rows()) - tmp_rows_;
|
/external/jpeg/ |
H A D | jsimd_neon.c | 39 JSAMPARRAY output_buf, int num_rows)); 43 JSAMPARRAY output_buf, int num_rows)); 63 JSAMPARRAY output_buf, int num_rows) 70 input_row, output_buf, num_rows); 76 JSAMPARRAY output_buf, int num_rows) 83 input_row, output_buf, num_rows); 61 jsimd_ycc_rgba8888_convert(j_decompress_ptr cinfo, JSAMPIMAGE input_buf, JDIMENSION input_row, JSAMPARRAY output_buf, int num_rows) argument 74 jsimd_ycc_rgb565_convert(j_decompress_ptr cinfo, JSAMPIMAGE input_buf, JDIMENSION input_row, JSAMPARRAY output_buf, int num_rows) argument
|