HomeSort by relevance Sort by last modified time
    Searched refs:num_cols (Results 26 - 50 of 67) sorted by null

12 3

  /external/jpeg/
jdcolor.c 148 JDIMENSION num_cols = cinfo->output_width; local
163 for (col = 0; col < num_cols; col++) {
189 JDIMENSION num_cols = cinfo->output_width; local
204 for (col = 0; col < num_cols; col++) {
230 JDIMENSION num_cols = cinfo->output_width; local
258 num_cols--;
260 for (col = 0; col < (num_cols>>1); col++) {
279 if (num_cols&1) {
302 JDIMENSION num_cols = cinfo->output_width; local
330 num_cols--
378 JDIMENSION num_cols = cinfo->output_width; local
404 JDIMENSION num_cols = cinfo->output_width; local
456 JDIMENSION num_cols = cinfo->output_width; local
516 JDIMENSION num_cols = cinfo->output_width; local
563 JDIMENSION num_cols = cinfo->output_width; local
584 JDIMENSION num_cols = cinfo->output_width; local
605 JDIMENSION num_cols = cinfo->output_width; local
643 JDIMENSION num_cols = cinfo->output_width; local
698 JDIMENSION num_cols = cinfo->output_width; local
    [all...]
jutils.c 119 int num_rows, JDIMENSION num_cols)
123 * The source and destination arrays must be at least as wide as num_cols.
128 register size_t count = (size_t) (num_cols * SIZEOF(JSAMPLE));
143 for (count = num_cols; count > 0; count--)
jccolor.c 142 JDIMENSION num_cols = cinfo->image_width; local
150 for (col = 0; col < num_cols; col++) {
198 JDIMENSION num_cols = cinfo->image_width; local
204 for (col = 0; col < num_cols; col++) {
237 JDIMENSION num_cols = cinfo->image_width; local
246 for (col = 0; col < num_cols; col++) {
289 JDIMENSION num_cols = cinfo->image_width; local
296 for (col = 0; col < num_cols; col++) {
350 JDIMENSION num_cols = cinfo->image_width; local
353 if (1 == num_rows && 3 == nc && num_cols > 0)
    [all...]
  /external/qemu/distrib/jpeg-6b/
jdcolor.c 148 JDIMENSION num_cols = cinfo->output_width; local
163 for (col = 0; col < num_cols; col++) {
189 JDIMENSION num_cols = cinfo->output_width; local
204 for (col = 0; col < num_cols; col++) {
230 JDIMENSION num_cols = cinfo->output_width; local
258 num_cols--;
260 for (col = 0; col < (num_cols>>1); col++) {
279 if (num_cols&1) {
302 JDIMENSION num_cols = cinfo->output_width; local
330 num_cols--
378 JDIMENSION num_cols = cinfo->output_width; local
404 JDIMENSION num_cols = cinfo->output_width; local
456 JDIMENSION num_cols = cinfo->output_width; local
516 JDIMENSION num_cols = cinfo->output_width; local
563 JDIMENSION num_cols = cinfo->output_width; local
584 JDIMENSION num_cols = cinfo->output_width; local
605 JDIMENSION num_cols = cinfo->output_width; local
643 JDIMENSION num_cols = cinfo->output_width; local
698 JDIMENSION num_cols = cinfo->output_width; local
    [all...]
jutils.c 119 int num_rows, JDIMENSION num_cols)
123 * The source and destination arrays must be at least as wide as num_cols.
128 register size_t count = (size_t) (num_cols * SIZEOF(JSAMPLE));
143 for (count = num_cols; count > 0; count--)
jccolor.c 142 JDIMENSION num_cols = cinfo->image_width; local
150 for (col = 0; col < num_cols; col++) {
189 JDIMENSION num_cols = cinfo->image_width; local
197 for (col = 0; col < num_cols; col++) {
235 JDIMENSION num_cols = cinfo->image_width; local
243 for (col = 0; col < num_cols; col++) {
291 JDIMENSION num_cols = cinfo->image_width; local
297 for (col = 0; col < num_cols; col++) {
330 JDIMENSION num_cols = cinfo->image_width; local
339 for (col = 0; col < num_cols; col++)
382 JDIMENSION num_cols = cinfo->image_width; local
443 JDIMENSION num_cols = cinfo->image_width; local
    [all...]
  /external/ceres-solver/internal/ceres/
partitioned_matrix_view_test.cc 57 num_cols_ = A_->num_cols();
76 EXPECT_EQ(m.num_cols(), A_->num_cols());
87 Vector x2(m.num_cols());
112 Vector x2 = Vector::Zero(m.num_cols());
141 Vector y = Vector::Zero(m.num_cols());
149 for (int i = 0; i < m.num_cols(); ++i) {
165 EXPECT_EQ(block_diagonal_ee->num_cols(), 2);
182 EXPECT_EQ(block_diagonal_ff->num_cols(), 3);
unsymmetric_linear_solver_test.cc 71 Vector x_unregularized(A_->num_cols());
72 Vector x_regularized(A_->num_cols());
101 for (int i = 0; i < A_->num_cols(); ++i) {
106 for (int i = 0; i < A_->num_cols(); ++i) {
linear_least_squares_problems.cc 252 int num_cols = 5; local
256 num_cols,
257 num_rows * num_cols);
259 problem->D.reset(new double[num_cols]);
343 for (int i = 0; i < num_cols; ++i) {
357 int num_cols = 5; local
362 problem->D.reset(new double[num_cols]);
366 scoped_array<double> values(new double[num_rows * num_cols]);
368 for (int c = 0; c < num_cols; ++c) {
459 for (int i = 0; i < num_cols; ++i)
491 int num_cols = 2; local
    [all...]
compressed_row_sparse_matrix.h 68 // num_rows, num_cols and max_num_nonzeros.
76 int num_cols,
98 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::CompressedRowSparseMatrix
triplet_sparse_matrix.h 51 TripletSparseMatrix(int num_rows, int num_cols, int max_num_nonzeros);
73 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::TripletSparseMatrix
triplet_sparse_matrix_test.cc 43 EXPECT_EQ(m.num_cols(), 0);
52 EXPECT_EQ(m.num_cols(), 5);
116 EXPECT_EQ(cpy.num_cols(), 5);
162 EXPECT_EQ(cpy.num_cols(), 5);
207 EXPECT_EQ(m.num_cols(), 5);
260 EXPECT_EQ(m.num_cols(), 20);
290 EXPECT_EQ(m->num_cols(), 10);
312 EXPECT_EQ(m.num_cols(), 6);
339 ASSERT_EQ(n.num_cols(), 5);
implicit_schur_complement.h 131 virtual int num_cols() const { return A_->num_cols_f(); } function in class:ceres::internal::ImplicitSchurComplement
cxsparse.cc 96 At.m = A->num_cols();
111 tsm_wrapper.n = tsm->num_cols();
iterative_schur_complement_solver_test.cc 70 num_cols_ = A_->num_cols();
77 A_->num_cols(),
visibility_based_preconditioner.h 178 // LeftMultiply and num_cols are just calls to RightMultiply and
186 virtual int num_cols() const { return num_rows(); } function in class:ceres::internal::VisibilityBasedPreconditioner
263 virtual int num_cols() const { return -1; } function in class:ceres::internal::VisibilityBasedPreconditioner
visibility_test.cc 54 int num_cols = 6; local
97 bs.cols.resize(num_cols);
101 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
134 int num_cols = 6; local
173 bs.cols.resize(num_cols);
177 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
compressed_row_sparse_matrix.cc 71 int num_cols,
74 num_cols_ = num_cols;
95 num_cols_ = m.num_cols();
147 num_cols_ = proto.num_cols();
286 CHECK_EQ(m.num_cols(), num_cols_);
342 matrix->num_cols = num_cols();
triplet_sparse_matrix.cc 57 int num_cols,
60 num_cols_(num_cols),
68 CHECK_GE(num_cols, 0);
100 Resize(proto.num_rows(), proto.num_cols());
235 CHECK_EQ(B.num_cols(), num_cols_);
253 num_cols_ = num_cols_ + B.num_cols();
levenberg_marquardt_strategy_test.cc 56 RegularizationCheckingLinearSolver(const int num_cols, const double* diagonal)
57 : num_cols_(num_cols),
block_sparse_matrix.h 119 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::BlockSparseMatrix
evaluator_test.cc 95 int num_cols; member in struct:ceres::internal::ExpectedEvaluation
193 ASSERT_EQ(expected_num_cols, jacobian->num_cols());
226 expected.num_cols,
640 ASSERT_EQ(2, jacobian->num_cols());
739 m.resize(input.num_rows, input.num_cols);
806 EXPECT_EQ(jacobian.num_cols, expected_num_cols);
829 expected.num_cols,
846 expected.num_cols,
schur_complement_solver.cc 77 fill(x, x + A->num_cols(), 0.0);
85 double* reduced_solution = x + A->num_cols() - lhs_->num_cols();
suitesparse.cc 44 triplet.ncol = A->num_cols();
64 triplet.nrow = A->num_cols();
83 m->nrow = A->num_cols();
block_random_access_dense_matrix_test.cc 47 EXPECT_EQ(m.num_cols(), num_rows);

Completed in 1057 milliseconds

12 3