HomeSort by relevance Sort by last modified time
    Searched refs:num_rows (Results 51 - 75 of 186) sorted by null

1 23 4 5 6 7 8

  /external/ceres-solver/internal/ceres/
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...]
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...]
compressed_row_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 row_blocks->resize(num_rows);
92 int num_rows; member in class:ceres::internal::CompressedRowSparseMatrixTest
461 const int num_rows = std::accumulate(row_blocks.begin(), row_blocks.end(), 0); local
    [all...]
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);
low_rank_inverse_hessian.h 91 virtual int num_rows() const { return num_parameters_; } function in class:ceres::internal::LowRankInverseHessian
schur_jacobi_preconditioner.h 90 virtual int num_rows() const;
incomplete_lq_factorization_test.cc 45 EXPECT_EQ(expected.num_rows(), actual.num_rows());
47 for (int i = 0; i < expected.num_rows(); ++i) {
137 EXPECT_EQ(matrix.num_rows(), 1);
145 EXPECT_EQ(matrix.num_rows(), 2);
155 EXPECT_EQ(matrix.num_rows(), 3);
169 EXPECT_EQ(matrix.num_rows(), 4);
185 EXPECT_EQ(matrix.num_rows(), 5);
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_;
visibility_based_preconditioner.cc 114 m_->num_rows(),
115 m_->num_rows()));
345 const int num_rows = m_->num_rows(); local
346 CHECK_GT(num_rows, 0);
356 Vector rhs = Vector::Zero(m_->num_rows());
357 Vector b = Vector::Zero(A.num_rows());
464 const int num_rows = m_->num_rows(); local
465 memcpy(CHECK_NOTNULL(tmp_rhs_)->x, x, m_->num_rows() * sizeof(*x))
474 int VisibilityBasedPreconditioner::num_rows() const { function in class:ceres::internal::VisibilityBasedPreconditioner
    [all...]
block_sparse_matrix.h 78 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockSparseMatrix
covariance_impl.cc 269 int num_rows = 0; local
275 parameter_block_to_row_index_[parameter_block] = num_rows;
276 num_rows += parameter_block_size;
320 new CompressedRowSparseMatrix(num_rows, num_rows, num_nonzeros));
375 rows[num_rows] = cursor;
416 const int num_rows = jacobian.num_rows; local
432 for (int r = 0; r < num_rows; ++r) {
448 cholmod_jacobian.nrow = num_rows;
640 const int num_rows = covariance_matrix_->num_rows(); local
    [all...]
implicit_schur_complement.h 130 virtual int num_rows() const { return A_->num_cols_f(); } function in class:ceres::internal::ImplicitSchurComplement
  /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...]
filters.h 37 int row, int num_rows, uint8_t* data);
47 // The reconstruction will be done for 'num_rows' rows starting from 'row'
  /external/webp/src/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...]
filters.h 37 int row, int num_rows, uint8_t* data);
47 // The reconstruction will be done for 'num_rows' rows starting from 'row'
  /external/chromium_org/third_party/libjpeg_turbo/
jccolext.c 33 JDIMENSION output_row, int num_rows)
43 while (--num_rows >= 0) {
90 JDIMENSION output_row, int num_rows)
100 while (--num_rows >= 0) {
127 JDIMENSION output_row, int num_rows)
134 while (--num_rows >= 0) {
jdmerge.c 259 JDIMENSION num_rows; /* number of rows returned to caller */ local
265 num_rows = 1;
269 num_rows = 2;
271 if (num_rows > upsample->rows_to_go)
272 num_rows = upsample->rows_to_go;
275 if (num_rows > out_rows_avail)
276 num_rows = out_rows_avail;
279 if (num_rows > 1) {
290 *out_row_ctr += num_rows;
291 upsample->rows_to_go -= num_rows;
    [all...]
jsimd.h 47 JDIMENSION output_row, int num_rows));
51 JDIMENSION output_row, int num_rows));
55 JSAMPARRAY output_buf, int num_rows));
  /external/libhevc/decoder/
ihevcd_fmt_conv.c 391 WORD32 num_rows, num_cols, src_strd, dst_strd; local
398 num_rows = ht;
404 for(i = 0; i < num_rows; i++)
415 num_rows = ht >> 1;
421 for(i = 0; i < num_rows; i++)
490 WORD32 num_rows, num_cols, src_strd, dst_strd; local
497 num_rows = ht;
503 for(i = 0; i < num_rows; i++)
514 num_rows = ht >> 1;
520 for(i = 0; i < num_rows; i++
603 WORD32 num_rows, num_cols, src_strd, dst_strd; local
    [all...]
  /external/libhevc/decoder/x86/
ihevcd_fmt_conv_ssse3_intr.c 63 WORD32 num_rows, num_cols, src_strd, dst_strd, cols, rows; local
75 num_rows = ht;
80 for(i = 0; i < num_rows; i++)
118 num_rows = ht >> 1;
130 for(i = 0; i < (num_rows >> 2); i++)
208 rows = num_rows & 0x3;
244 pu1_u_dst -= (num_rows * dst_strd);
245 pu1_v_dst -= (num_rows * dst_strd);
254 for(i = 0; i < num_rows; i++)
  /external/pdfium/core/src/fxcodec/libjpeg/
fpdfapi_jdcolor.c 123 JSAMPARRAY output_buf, int num_rows)
139 while (--num_rows >= 0) {
172 JSAMPARRAY output_buf, int num_rows)
180 while (--num_rows >= 0) {
204 JSAMPARRAY output_buf, int num_rows)
207 num_rows, cinfo->output_width);
220 JSAMPARRAY output_buf, int num_rows)
226 while (--num_rows >= 0) {
248 JSAMPARRAY output_buf, int num_rows)
264 while (--num_rows >= 0) {
    [all...]
  /external/jpeg/
jdcolor.c 143 JSAMPARRAY output_buf, int num_rows)
159 while (--num_rows >= 0) {
184 JSAMPARRAY output_buf, int num_rows)
200 while (--num_rows >= 0) {
225 JSAMPARRAY output_buf, int num_rows)
241 while (--num_rows >= 0) {
297 JSAMPARRAY output_buf, int num_rows)
314 while (--num_rows >= 0) {
375 JSAMPARRAY output_buf, int num_rows)
383 while (--num_rows >= 0)
    [all...]
  /external/qemu/distrib/jpeg-6b/
jdcolor.c 141 JSAMPARRAY output_buf, int num_rows)
157 while (--num_rows >= 0) {
182 JSAMPARRAY output_buf, int num_rows)
198 while (--num_rows >= 0) {
223 JSAMPARRAY output_buf, int num_rows)
239 while (--num_rows >= 0) {
295 JSAMPARRAY output_buf, int num_rows)
312 while (--num_rows >= 0) {
373 JSAMPARRAY output_buf, int num_rows)
381 while (--num_rows >= 0)
    [all...]

Completed in 180 milliseconds

1 23 4 5 6 7 8