| /external/ceres-solver/internal/ceres/ |
| sparse_matrix.h | 99 virtual int num_rows() const = 0;
|
| 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.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...] |
| compressed_row_sparse_matrix.cc | 72 CompressedRowSparseMatrix::CompressedRowSparseMatrix(int num_rows,
75 num_rows_ = num_rows;
77 rows_.resize(num_rows + 1, 0);
92 num_rows_ = m.num_rows();
135 int num_rows) {
138 num_rows_ = num_rows;
139 num_cols_ = num_rows;
140 rows_.resize(num_rows + 1);
141 cols_.resize(num_rows);
142 values_.resize(num_rows);
151 CHECK_EQ(num_nonzeros(), num_rows); local
223 int num_rows = 0; local
319 int num_rows = 0; local
[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 | 59 num_rows_ = A_->num_rows();
81 EXPECT_EQ(pmv_->num_rows(), A_->num_rows());
93 Vector y1 = Vector::Zero(pmv_->num_rows());
96 Vector y2 = Vector::Zero(pmv_->num_rows());
99 for (int i = 0; i < pmv_->num_rows(); ++i) {
113 Vector y1 = Vector::Zero(pmv_->num_rows());
116 Vector y2 = Vector::Zero(pmv_->num_rows());
119 for (int i = 0; i < pmv_->num_rows(); ++i) {
125 Vector x = Vector::Zero(pmv_->num_rows());
[all...] |
| 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_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
|
| 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);
|
| 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
|
| preconditioner.h | 124 // num_rows respectively. Update() must be called before
131 virtual int num_rows() const = 0;
133 return num_rows();
167 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);
136 BLAS::SymmetricRankKUpdate(A->num_rows(),
152 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...] |
| /external/chromium_org/third_party/libwebp/dec/ |
| alpha.c | 84 // Decodes, unfilters and dequantizes *at least* 'num_rows' rows of alpha
88 static int ALPHDecode(VP8Decoder* const dec, int row, int num_rows) {
96 const size_t num_pixels = num_rows * width;
102 if (!VP8LDecodeAlphaImageStream(alph_dec, row + num_rows)) {
108 unfilter_func(width, height, width, row, num_rows, output);
111 if (row + num_rows == dec->pic_hdr_.height_) {
121 int row, int num_rows) {
125 if (row < 0 || num_rows <= 0 || row + num_rows > height) {
144 num_rows = height; // decode everything in one pas
[all...] |
| /external/chromium_org/third_party/libjpeg_turbo/simd/ |
| jsimd.h | 157 JDIMENSION output_row, int num_rows));
161 JDIMENSION output_row, int num_rows));
165 JDIMENSION output_row, int num_rows));
169 JDIMENSION output_row, int num_rows));
173 JDIMENSION output_row, int num_rows));
177 JDIMENSION output_row, int num_rows));
181 JDIMENSION output_row, int num_rows));
186 JDIMENSION output_row, int num_rows));
190 JDIMENSION output_row, int num_rows));
194 JDIMENSION output_row, int num_rows));
[all...] |
| /external/chromium_org/third_party/libjpeg_turbo/ |
| jdcolext.c | 32 JSAMPARRAY output_buf, int num_rows)
48 while (--num_rows >= 0) {
85 JSAMPARRAY output_buf, int num_rows)
91 while (--num_rows >= 0) {
116 JSAMPARRAY output_buf, int num_rows)
123 while (--num_rows >= 0) {
|
| jdcolor.c | 254 JSAMPARRAY output_buf, int num_rows)
259 num_rows);
264 num_rows);
268 num_rows);
273 num_rows);
278 num_rows);
283 num_rows);
287 num_rows);
327 JSAMPARRAY output_buf, int num_rows)
337 while (--num_rows >= 0)
[all...] |
| jccolor.c | 234 JDIMENSION output_row, int num_rows)
239 num_rows);
244 num_rows);
248 num_rows);
253 num_rows);
258 num_rows);
263 num_rows);
267 num_rows);
283 JDIMENSION output_row, int num_rows)
288 num_rows);
[all...] |
| /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/libwebp/utils/ |
| filters.c | 28 assert(row >= 0 && num_rows > 0 && row + num_rows <= height); \
46 int row, int num_rows,
50 const int last_row = row + num_rows;
84 int num_rows, uint8_t* data) {
85 DoHorizontalFilter(data, width, height, stride, row, num_rows, 1, data);
93 int row, int num_rows,
97 const int last_row = row + num_rows;
132 int num_rows, uint8_t* data) {
133 DoVerticalFilter(data, width, height, stride, row, num_rows, 1, data)
[all...] |
