/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 | lapack.h | 58 int num_rows, 66 static int EstimateWorkSizeForQR(int num_rows, int num_cols); 88 int num_rows,
|
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 | corrector.h | 69 void CorrectResiduals(int num_rows, double* residuals); 77 void CorrectJacobian(int num_rows,
|
H A D | dynamic_compressed_row_sparse_matrix.h | 66 DynamicCompressedRowSparseMatrix(int num_rows, 80 // and proceeding for `num_rows`. 81 void ClearRows(int row_start, int 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 | 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 | normal_prior_test.cc | 58 for (int num_rows = 1; num_rows < 5; ++num_rows) { 63 Matrix A(num_rows, num_cols); 70 double * jacobian = new double[num_rows * num_cols]; 71 Vector residuals(num_rows); 82 MatrixRef J(jacobian, num_rows, num_cols); 95 for (int num_rows = 1; num_rows < 5; ++num_rows) { [all...] |
H A D | blas.h | 45 static void SymmetricRankKUpdate(int num_rows,
|
H A D | dynamic_compressed_row_sparse_matrix_test.cc | 48 num_rows = 7; 56 expected_num_nonzeros = num_rows * num_cols - min(num_rows, num_cols); 61 dcrsm.reset(new DynamicCompressedRowSparseMatrix(num_rows, 71 dense.resize(num_rows, num_cols); 74 for (int i = 0; i < (num_rows * num_cols); ++i) { 87 for (int i = 0; i < (num_rows * num_cols); ++i) { 97 tsm.reset(new TripletSparseMatrix(num_rows, 116 for (int r = 0; r < num_rows; ++r) { 127 EXPECT_EQ(dcrsm->num_rows(), num_row 160 int num_rows; member in class:ceres::internal::DynamicCompressedRowSparseMatrixTest [all...] |
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_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 | 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 | dense_sparse_matrix.h | 54 DenseSparseMatrix(int num_rows, int num_cols); 55 DenseSparseMatrix(int num_rows, int num_cols, bool reserve_diagonal); 67 virtual int num_rows() const;
|
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 | schur_complement_solver.cc | 111 set_rhs(new double[lhs()->num_rows()]); 126 const int num_rows = m->num_rows(); local 130 if (num_rows == 0) { 138 ConstMatrixRef(m->values(), num_rows, num_rows) 148 VectorRef(solution, num_rows) = llt.solve(ConstVectorRef(rhs(), num_rows)); 150 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows); [all...] |
H A D | evaluator_test_utils.h | 39 int num_rows; member in struct:ceres::internal::ExpectedEvaluation
|
H A D | linear_operator.h | 52 virtual int num_rows() const = 0;
|
H A D | schur_jacobi_preconditioner.cc | 86 const int num_rows = m_->num_rows(); local 87 CHECK_GT(num_rows, 0); 97 Vector rhs = Vector::Zero(m_->num_rows()); 98 Vector b = Vector::Zero(A.num_rows()); 130 int SchurJacobiPreconditioner::num_rows() const { function in class:ceres::internal::SchurJacobiPreconditioner 131 return m_->num_rows();
|
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...] |
/external/ceres-solver/include/ceres/internal/ |
H A D | eigen.h | 65 template <int num_rows = Eigen::Dynamic, int num_cols = Eigen::Dynamic> 67 typedef Eigen::Matrix <double, num_rows, num_cols, Eigen::RowMajor> 71 Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> > 74 typedef Eigen::Matrix <double, num_rows, 1> 78 Eigen::Matrix<double, num_rows, 1> > 83 const Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> > 87 const Eigen::Matrix<double, num_rows, 1> >
|
/external/chromium_org/third_party/libjpeg_turbo/ |
H A D | jdpostct.c | 133 JDIMENSION num_rows, max_rows; local 140 num_rows = 0; 143 post->buffer, &num_rows, max_rows); 146 post->buffer, output_buf + *out_row_ctr, (int) num_rows); 147 *out_row_ctr += num_rows; 165 JDIMENSION old_next_row, num_rows; local 183 num_rows = post->next_row - old_next_row; 185 (JSAMPARRAY) NULL, (int) num_rows); 186 *out_row_ctr += num_rows; 209 JDIMENSION num_rows, max_row local [all...] |
/external/jpeg/ |
H A D | jdpostct.c | 133 JDIMENSION num_rows, max_rows; local 140 num_rows = 0; 143 post->buffer, &num_rows, max_rows); 146 post->buffer, output_buf + *out_row_ctr, (int) num_rows); 147 *out_row_ctr += num_rows; 165 JDIMENSION old_next_row, num_rows; local 183 num_rows = post->next_row - old_next_row; 185 (JSAMPARRAY) NULL, (int) num_rows); 186 *out_row_ctr += num_rows; 209 JDIMENSION num_rows, max_row local [all...] |
/external/pdfium/core/src/fxcodec/libjpeg/ |
H A D | fpdfapi_jdpostct.c | 134 JDIMENSION num_rows, max_rows;
local 141 num_rows = 0;
144 post->buffer, &num_rows, max_rows);
147 post->buffer, output_buf + *out_row_ctr, (int) num_rows);
148 *out_row_ctr += num_rows;
166 JDIMENSION old_next_row, num_rows;
local 184 num_rows = post->next_row - old_next_row;
186 (JSAMPARRAY) NULL, (int) num_rows);
187 *out_row_ctr += num_rows;
210 JDIMENSION num_rows, max_row local [all...] |
/external/qemu/distrib/jpeg-6b/ |
H A D | jdpostct.c | 133 JDIMENSION num_rows, max_rows; local 140 num_rows = 0; 143 post->buffer, &num_rows, max_rows); 146 post->buffer, output_buf + *out_row_ctr, (int) num_rows); 147 *out_row_ctr += num_rows; 165 JDIMENSION old_next_row, num_rows; local 183 num_rows = post->next_row - old_next_row; 185 (JSAMPARRAY) NULL, (int) num_rows); 186 *out_row_ctr += num_rows; 209 JDIMENSION num_rows, max_row local [all...] |