| /external/ceres-solver/internal/ceres/ |
| lapack.h | 51 static int SolveInPlaceUsingCholesky(int num_rows,
58 static int EstimateWorkSizeForQR(int num_rows, int num_cols);
77 static int SolveUsingQR(int num_rows,
|
| corrector.h | 69 void CorrectResiduals(int num_rows, double* residuals);
77 void CorrectJacobian(int num_rows,
|
| blas.h | 45 static void SymmetricRankKUpdate(int num_rows,
|
| linear_operator.h | 52 virtual int num_rows() const = 0;
|
| preconditioner.cc | 58 int SparseMatrixPreconditionerWrapper::num_rows() const { function in class:ceres::internal::SparseMatrixPreconditionerWrapper
59 return matrix_->num_rows();
|
| lapack.cc | 66 int LAPACK::SolveInPlaceUsingCholesky(int num_rows,
74 int n = num_rows;
94 int LAPACK::EstimateWorkSizeForQR(int num_rows, int num_cols) {
105 &num_rows,
109 &num_rows,
111 &num_rows,
121 int LAPACK::SolveUsingQR(int num_rows,
132 int m = num_rows;
135 int lda = num_rows;
136 int ldb = num_rows;
[all...] |
| blas.cc | 48 void BLAS::SymmetricRankKUpdate(int num_rows,
60 int n = transpose ? num_cols : num_rows;
61 int k = transpose ? num_rows : num_cols;
|
| 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...] |
| evaluator_test_utils.h | 39 int num_rows; member in struct:ceres::internal::ExpectedEvaluation
|
| 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...] |
| compressed_row_sparse_matrix.cc | 71 CompressedRowSparseMatrix::CompressedRowSparseMatrix(int num_rows,
74 num_rows_ = num_rows;
76 rows_.resize(num_rows + 1, 0);
91 num_rows_ = m.num_rows();
134 int num_rows) {
137 num_rows_ = num_rows;
138 num_cols_ = num_rows;
139 rows_.resize(num_rows + 1);
140 cols_.resize(num_rows);
141 values_.resize(num_rows);
150 CHECK_EQ(num_nonzeros(), num_rows); local
293 int num_rows = 0; local
[all...] |
| dense_qr_solver.cc | 70 const int num_rows = A->num_rows(); local
93 rhs_.head(num_rows) = ConstVectorRef(b, num_rows);
131 const int num_rows = A->num_rows(); local
142 num_rows + ((per_solve_options.D != NULL) ? num_cols : 0);
147 rhs_.head(num_rows) = ConstVectorRef(b, num_rows);
|
| 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
119 void set_num_rows(const int num_rows) { num_rows_ = num_rows; }
|
| corrector.cc | 104 void Corrector::CorrectResiduals(int num_rows, double* residuals) {
107 for (int r = 0; r < num_rows; ++r) {
112 void Corrector::CorrectJacobian(int num_rows,
132 for (int r = 0; r < num_rows; ++r) {
136 for (int r = 0; r < num_rows; ++r) {
|
| 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
|
| 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;
|
| schur_complement_solver.cc | 114 set_rhs(new double[lhs()->num_rows()]);
123 const int num_rows = m->num_rows(); local
127 if (num_rows == 0) {
134 VectorRef(solution, num_rows) =
135 ConstMatrixRef(m->values(), num_rows, num_rows)
138 .solve(ConstVectorRef(rhs(), num_rows));
142 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows);
271 const int num_rows = tsm->num_rows(); local
345 const int num_rows = tsm->num_rows(); local
[all...] |
| compressed_row_sparse_matrix_test.cc | 46 EXPECT_EQ(a->num_rows(), b->num_rows());
49 int num_rows = a->num_rows(); local
56 Vector y_a = Vector::Zero(num_rows);
57 Vector y_b = Vector::Zero(num_rows);
77 num_rows = tsm->num_rows();
81 int num_rows; member in class:ceres::internal::CompressedRowSparseMatrixTest
93 for (int i = 0; i < num_rows; ++i)
[all...] |
| block_random_access_matrix.h | 125 virtual int num_rows() const = 0;
|
| sparse_matrix.h | 99 virtual int num_rows() const = 0;
|
| schur_jacobi_preconditioner.cc | 96 const int num_rows = m_->num_rows(); local
97 CHECK_GT(num_rows, 0);
107 Vector rhs = Vector::Zero(m_->num_rows());
108 Vector b = Vector::Zero(A.num_rows());
140 int SchurJacobiPreconditioner::num_rows() const { function in class:ceres::internal::SchurJacobiPreconditioner
141 return m_->num_rows();
|
| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 42 CRSMatrix() : num_rows(0), num_cols(0) {}
44 int num_rows; member in struct:ceres::CRSMatrix
50 // rows is a num_rows + 1 sized array that points into the cols and
|
| /external/ceres-solver/include/ceres/internal/ |
| 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/jpeg/ |
| 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_rows local
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| 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_rows local
[all...] |
