| /external/ceres-solver/internal/ceres/ |
| dense_sparse_matrix.cc | 42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols)
45 m_.resize(num_rows, num_cols);
49 DenseSparseMatrix::DenseSparseMatrix(int num_rows,
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() const function in class:ceres::internal::DenseSparseMatrix
[all...] |
| incomplete_lq_factorization.cc | 122 int num_nonzeros = rows[matrix->num_rows()];
125 matrix->set_num_rows(matrix->num_rows() + 1);
126 rows[matrix->num_rows()] = num_nonzeros;
159 matrix->set_num_rows(matrix->num_rows() + 1);
160 rows[matrix->num_rows()] = num_nonzeros;
170 const int num_rows = matrix.num_rows(); local
177 new CompressedRowSparseMatrix(num_rows,
178 num_rows,
179 l_level_of_fill * num_rows);
[all...] |
| 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_sparse_matrix_test.cc | 57 CHECK_EQ(A_->num_rows(), B_->num_rows());
72 Vector y_a = Vector::Zero(A_->num_rows());
73 Vector y_b = Vector::Zero(A_->num_rows());
86 for (int i = 0; i < A_->num_rows(); ++i) {
87 Vector x = Vector::Zero(A_->num_rows());
|
| partitioned_matrix_view_test.cc | 58 num_rows_ = A_->num_rows();
77 EXPECT_EQ(m.num_rows(), A_->num_rows());
94 Vector y1 = Vector::Zero(m.num_rows());
97 Vector y2 = Vector::Zero(m.num_rows());
100 for (int i = 0; i < m.num_rows(); ++i) {
119 Vector y1 = Vector::Zero(m.num_rows());
122 Vector y2 = Vector::Zero(m.num_rows());
125 for (int i = 0; i < m.num_rows(); ++i) {
136 Vector x = Vector::Zero(m.num_rows());
[all...] |
| block_random_access_crs_matrix.h | 76 // Since the matrix is square, num_rows() == num_cols().
77 virtual int num_rows() const { return crsm_->num_rows(); } function in class:ceres::internal::BlockRandomAccessCRSMatrix
|
| 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
|
| partitioned_matrix_view.h | 103 int num_rows() const { return matrix_.num_rows(); } function in class:ceres::internal::PartitionedMatrixView
|
| block_jacobi_preconditioner.h | 63 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockJacobiPreconditioner
|
| 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
|
| low_rank_inverse_hessian.h | 89 virtual int num_rows() const { return num_parameters_; } function in class:ceres::internal::LowRankInverseHessian
|
| preconditioner.h | 114 // num_rows respectively. Update() must be called before
121 virtual int num_rows() const = 0;
123 return num_rows();
157 virtual int num_rows() const;
|
| triplet_sparse_matrix.h | 49 TripletSparseMatrix(int num_rows, int num_cols, int max_num_nonzeros);
64 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::TripletSparseMatrix
102 // Build a sparse diagonal matrix of size num_rows x num_rows from
106 int num_rows);
|
| dense_normal_cholesky_solver.cc | 71 const int num_rows = A->num_rows(); local
88 Vector rhs = Aref.transpose() * ConstVectorRef(b, num_rows);
126 BLAS::SymmetricRankKUpdate(A->num_rows(),
142 A->matrix().transpose() * ConstVectorRef(b, A->num_rows());
|
| triplet_sparse_matrix.cc | 55 TripletSparseMatrix::TripletSparseMatrix(int num_rows,
58 : num_rows_(num_rows),
66 CHECK_GE(num_rows, 0);
199 num_rows_ = num_rows_ + B.num_rows();
203 CHECK_EQ(B.num_rows(), num_rows_);
244 const double* values, int num_rows) {
246 new TripletSparseMatrix(num_rows, num_rows, num_rows);
247 for (int i = 0; i < num_rows; ++i)
[all...] |
| covariance_impl.cc | 61 explicit PerThreadContext(int num_rows)
67 rhs = ss.CreateDenseVector(NULL, num_rows, num_rows);
283 int num_rows = 0; local
289 parameter_block_to_row_index_[parameter_block] = num_rows;
290 num_rows += parameter_block_size;
334 new CompressedRowSparseMatrix(num_rows, num_rows, num_nonzeros));
389 rows[num_rows] = cursor;
429 cholmod_jacobian_view.ncol = jacobian.num_rows;
467 const int num_rows = covariance_matrix_->num_rows(); local
605 const int num_rows = jacobian.num_rows; local
829 const int num_rows = covariance_matrix_->num_rows(); local
[all...] |
| linear_least_squares_problems.cc | 181 int num_rows = 6; local
185 TripletSparseMatrix* A = new TripletSparseMatrix(num_rows,
187 num_rows * num_cols);
188 problem->b.reset(new double[num_rows]);
277 for (int i = 0; i < num_rows; ++i) {
286 int num_rows = 6; local
291 problem->b.reset(new double[num_rows]);
296 scoped_array<double> values(new double[num_rows * num_cols]);
393 for (int i = 0; i < num_rows; ++i) {
420 int num_rows = 5 local
[all...] |
| block_random_access_crs_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);
|
| 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);
|
| schur_jacobi_preconditioner.h | 90 virtual int num_rows() const;
|
| /external/jpeg/ |
| jsimd_neon.c | 40 JSAMPARRAY output_buf, int num_rows));
44 JSAMPARRAY output_buf, int num_rows));
64 JSAMPARRAY output_buf, int num_rows)
71 input_row, output_buf, num_rows);
77 JSAMPARRAY output_buf, int num_rows)
84 input_row, output_buf, num_rows);
|
| jsimd_neon.h | 70 JSAMPARRAY output_buf, int num_rows);
75 JSAMPARRAY output_buf, int num_rows);
|
| /external/chromium_org/third_party/angle_dx11/tests/compiler_tests/ |
| VariablePacker_test.cpp | 40 int num_rows = VariablePacker::GetNumRows(type); local
48 int num_vars = kMaxRows / num_rows;
59 num_vars = kMaxRows / num_rows *
|
| /external/chromium_org/third_party/libwebp/dec/ |
| alpha.c | 91 int row, int num_rows) {
95 if (row < 0 || num_rows < 0 || row + num_rows > height) {
|
| /external/webp/src/dec/ |
| alpha.c | 91 int row, int num_rows) {
95 if (row < 0 || num_rows < 0 || row + num_rows > height) {
|
