| /external/ceres-solver/internal/ceres/ |
| cgnr_solver.cc | 61 Vector z(A->num_cols());
76 VectorRef(x, A->num_cols()).setZero();
|
| incomplete_lq_factorization.h | 73 // In the row vector dense_row(0:num_cols), drop values smaller than
79 // assumed that scratch is of size matrix->num_cols().
|
| iterative_schur_complement_solver_test.cc | 70 num_cols_ = A_->num_cols();
77 A_->num_cols(),
|
| lapack.h | 66 static int EstimateWorkSizeForQR(int num_rows, int num_cols);
89 int num_cols,
|
| blas.h | 46 int num_cols,
|
| partitioned_matrix_view.h | 106 virtual int num_cols() const = 0;
135 virtual int num_cols() const { return matrix_.num_cols(); } function in class:ceres::internal::PartitionedMatrixView
|
| compressed_row_sparse_matrix.cc | 73 int num_cols,
76 num_cols_ = num_cols;
93 num_cols_ = m.num_cols();
233 CHECK_EQ(m.num_cols(), num_cols_);
278 matrix->num_cols = num_cols_;
418 const int num_cols,
434 new CompressedRowSparseMatrix(num_rows, num_cols, num_nonzeros);
505 return CompressAndFillProgram(m.num_cols(), m.num_cols(), product, program);
|
| evaluator_test_utils.h | 40 int num_cols; member in struct:ceres::internal::ExpectedEvaluation
|
| linear_operator.h | 53 virtual int num_cols() const = 0;
|
| cxsparse.cc | 169 At.m = A->num_cols();
184 tsm_wrapper.n = tsm->num_cols();
|
| levenberg_marquardt_strategy_test.cc | 56 RegularizationCheckingLinearSolver(const int num_cols, const double* diagonal)
57 : num_cols_(num_cols),
|
| numeric_diff_cost_function_test.cc | 152 template<int num_rows, int num_cols>
153 class SizeTestingCostFunction : public SizedCostFunction<num_rows, num_cols> {
|
| preconditioner.h | 123 // LeftMultiply and num_cols are just calls to RightMultiply and
132 virtual int num_cols() const { function in class:ceres::internal::Preconditioner
|
| triplet_sparse_matrix.h | 49 TripletSparseMatrix(int num_rows, int num_cols, int max_num_nonzeros);
65 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::TripletSparseMatrix
|
| suitesparse.cc | 59 triplet.ncol = A->num_cols();
79 triplet.nrow = A->num_cols();
98 m.nrow = A->num_cols();
|
| block_jacobi_preconditioner.h | 64 virtual int num_cols() const { return num_rows_; } function in class:ceres::internal::BlockJacobiPreconditioner
|
| block_random_access_dense_matrix_test.cc | 47 EXPECT_EQ(m.num_cols(), num_rows);
|
| block_random_access_diagonal_matrix_test.cc | 52 EXPECT_EQ(m.num_cols(), num_rows);
|
| block_sparse_matrix.h | 79 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::BlockSparseMatrix
|
| corrector.h | 78 int num_cols,
|
| low_rank_inverse_hessian.h | 92 virtual int num_cols() const { return num_parameters_; } function in class:ceres::internal::LowRankInverseHessian
|
| schur_complement_solver.cc | 77 fill(x, x + A->num_cols(), 0.0);
83 double* reduced_solution = x + A->num_cols() - lhs_->num_cols();
|
| /external/pdfium/core/src/fxcodec/libjpeg/ |
| fpdfapi_jdcolor.c | 130 JDIMENSION num_cols = cinfo->output_width;
local
145 for (col = 0; col < num_cols; col++) {
177 JDIMENSION num_cols = cinfo->output_width;
local
184 for (count = num_cols; count > 0; count--) {
224 JDIMENSION num_cols = cinfo->output_width;
local
229 for (col = 0; col < num_cols; col++) {
255 JDIMENSION num_cols = cinfo->output_width;
local
271 for (col = 0; col < num_cols; col++) {
|
| /external/chromium_org/media/base/ |
| video_util.cc | 178 int num_cols = width; local
217 num_rows = num_cols = height;
221 num_rows = num_cols = width;
250 for (int col = 0; col < num_cols; ++col) {
|
| /external/jpeg/ |
| jcprepct.c | 106 expand_bottom_edge (JSAMPARRAY image_data, JDIMENSION num_cols,
113 1, num_cols);
|
