| /external/ceres-solver/include/ceres/ |
| 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/ |
| block_jacobi_preconditioner.h | 63 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockJacobiPreconditioner
|
| evaluator_test_utils.h | 39 int num_rows; member in struct:ceres::internal::ExpectedEvaluation
|
| 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
|
| 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;
|
| 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
|
| 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);
|
| 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
|
| block_sparse_matrix.h | 78 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockSparseMatrix
|
| 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_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());
|
| 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);
|
| preconditioner.cc | 68 int SparseMatrixPreconditionerWrapper::num_rows() const { function in class:ceres::internal::SparseMatrixPreconditionerWrapper
69 return matrix_->num_rows();
|
| 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();
|
| 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...] |
| 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_;
|
| low_rank_inverse_hessian.h | 91 virtual int num_rows() const { return num_parameters_; } function in class:ceres::internal::LowRankInverseHessian
|
| 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
|
| schur_complement_solver_test.cc | 59 num_rows = A->num_rows();
71 TripletSparseMatrix triplet_A(A->num_rows(),
126 int num_rows; member in class:ceres::internal::SchurComplementSolverTest
|
| 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);
|
| /external/webrtc/webrtc/modules/audio_processing/beamformer/ |
| complex_matrix.h | 30 ComplexMatrix(size_t num_rows, size_t num_columns)
31 : Matrix<complex<T> >(num_rows, num_columns) {}
33 ComplexMatrix(const complex<T>* data, size_t num_rows, size_t num_columns)
34 : Matrix<complex<T> >(data, num_rows, num_columns) {}
39 size_t size = this->num_rows() * this->num_columns();
54 size_t num_rows = this->num_rows(); local
56 this->SetNumColumns(num_rows);
62 RTC_CHECK_EQ(operand.num_rows(), this->num_columns());
63 RTC_CHECK_EQ(operand.num_columns(), this->num_rows());
[all...] |
| /art/compiler/debug/dwarf/ |
| dwarf_test.cc | 256 size_t num_rows = 0; local
267 num_rows++;
275 EXPECT_LT(opcodes.data()->size(), num_rows * 3);
|
| /external/libjpeg-turbo/ |
| jdpostct.c | 132 JDIMENSION num_rows, max_rows; local
139 num_rows = 0;
142 post->buffer, &num_rows, max_rows);
145 post->buffer, output_buf + *out_row_ctr, (int) num_rows);
146 *out_row_ctr += num_rows;
164 JDIMENSION old_next_row, num_rows; local
182 num_rows = post->next_row - old_next_row;
184 (JSAMPARRAY) NULL, (int) num_rows);
185 *out_row_ctr += num_rows;
208 JDIMENSION num_rows, max_rows local
[all...] |
| /external/opencv3/3rdparty/libjpeg/ |
| 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/pdfium/third_party/libjpeg/ |
| fpdfapi_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...] |
