| /external/ceres-solver/internal/ceres/ |
| normal_prior_test.cc | 59 for (int num_cols = 1; num_cols < 5; ++num_cols) {
60 Vector b(num_cols);
63 Matrix A(num_rows, num_cols);
66 double * x = new double[num_cols];
67 for (int i = 0; i < num_cols; ++i)
70 double * jacobian = new double[num_rows * num_cols];
78 (residuals - A * (VectorRef(x, num_cols) - b)).squaredNorm();
82 MatrixRef J(jacobian, num_rows, num_cols);
[all...] |
| dense_sparse_matrix_test.cc | 50 EXPECT_EQ(a->num_cols(), b->num_cols());
53 int num_cols = a->num_cols(); local
55 for (int i = 0; i < num_cols; ++i) {
56 Vector x = Vector::Zero(num_cols);
81 num_cols = tsm->num_cols();
85 int num_cols; member in class:ceres::internal::DenseSparseMatrixTest
96 Vector a(num_cols);
[all...] |
| dynamic_compressed_row_sparse_matrix_test.cc | 49 num_cols = 4;
56 expected_num_nonzeros = num_rows * num_cols - min(num_rows, num_cols);
62 num_cols,
71 dense.resize(num_rows, num_cols);
74 for (int i = 0; i < (num_rows * num_cols); ++i) {
75 const int r = i / num_cols, c = i % num_cols;
87 for (int i = 0; i < (num_rows * num_cols); ++i) {
88 const int r = i / num_cols, c = i % num_cols
161 int num_cols; member in class:ceres::internal::DynamicCompressedRowSparseMatrixTest
[all...] |
| dense_normal_cholesky_solver.cc | 72 const int num_cols = A->num_cols(); local
75 Matrix lhs(num_cols, num_cols);
91 ConstVectorRef D(per_solve_options.D, num_cols);
110 VectorRef(x, num_cols) = llt.solve(rhs);
128 const int num_cols = A->num_cols(); local
129 Matrix lhs(num_cols, num_cols);
[all...] |
| dense_sparse_matrix.cc | 42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols)
45 m_.resize(num_rows, num_cols);
50 int num_cols,
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());
92 VectorRef(y, num_cols()) +=
97 VectorRef(x, num_cols()) = m_.colwise().squaredNorm()
136 int DenseSparseMatrix::num_cols() const { function in class:ceres::internal::DenseSparseMatrix
[all...] |
| block_sparse_matrix_test.cc | 58 CHECK_EQ(A_->num_cols(), B_->num_cols());
74 for (int i = 0; i < A_->num_cols(); ++i) {
75 Vector x = Vector::Zero(A_->num_cols());
84 Vector y_a = Vector::Zero(A_->num_cols());
85 Vector y_b = Vector::Zero(A_->num_cols());
96 Vector y_a = Vector::Zero(A_->num_cols());
97 Vector y_b = Vector::Zero(A_->num_cols());
|
| block_random_access_diagonal_matrix.cc | 52 int num_cols = 0; local
56 col_layout.push_back(num_cols);
57 num_cols += blocks_[i];
61 VLOG(1) << "Matrix Size [" << num_cols
62 << "," << num_cols
65 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros));
|
| compressed_row_sparse_matrix_test.cc | 50 EXPECT_EQ(a->num_cols(), b->num_cols());
53 int num_cols = a->num_cols(); local
55 for (int i = 0; i < num_cols; ++i) {
56 Vector x = Vector::Zero(num_cols);
81 num_cols = tsm->num_cols();
88 col_blocks->resize(num_cols);
93 int num_cols; member in class:ceres::internal::CompressedRowSparseMatrixTest
462 const int num_cols = std::accumulate(col_blocks.begin(), col_blocks.end(), 0); local
[all...] |
| partitioned_matrix_view_test.cc | 58 num_cols_ = A_->num_cols();
80 EXPECT_EQ(pmv_->num_cols(), A_->num_cols());
86 Vector x2(pmv_->num_cols());
106 Vector x2 = Vector::Zero(pmv_->num_cols());
130 Vector y = Vector::Zero(pmv_->num_cols());
138 for (int i = 0; i < pmv_->num_cols(); ++i) {
151 EXPECT_EQ(block_diagonal_ee->num_cols(), 2);
165 EXPECT_EQ(block_diagonal_ff->num_cols(), 3);
|
| schur_complement_solver_test.cc | 58 num_cols = A->num_cols();
62 x.reset(new double[num_cols]);
63 sol.reset(new double[num_cols]);
64 sol_d.reset(new double[num_cols]);
72 A->num_cols(),
116 for (int i = 0; i < num_cols; ++i) {
120 for (int i = 0; i < num_cols; ++i) {
127 int num_cols; member in class:ceres::internal::SchurComplementSolverTest
|
| linear_least_squares_problems.cc | 182 int num_cols = 5; local
186 num_cols,
187 num_rows * num_cols);
189 problem->D.reset(new double[num_cols]);
273 for (int i = 0; i < num_cols; ++i) {
287 int num_cols = 5; local
292 problem->D.reset(new double[num_cols]);
296 scoped_array<double> values(new double[num_rows * num_cols]);
298 for (int c = 0; c < num_cols; ++c) {
389 for (int i = 0; i < num_cols; ++i)
421 int num_cols = 2; local
[all...] |
| schur_eliminator_test.cc | 139 const int num_cols = A->num_cols(); local
159 MatrixRef lhs_ref(lhs.mutable_values(), lhs.num_rows(), lhs.num_cols());
167 Vector sol(num_cols);
198 Vector zero(A->num_cols());
201 ComputeReferenceSolution(VectorRef(zero.data(), A->num_cols()));
202 EliminateSolveAndCompare(VectorRef(zero.data(), A->num_cols()), true, 1e-14);
203 EliminateSolveAndCompare(VectorRef(zero.data(), A->num_cols()), false, 1e-14);
205 ComputeReferenceSolution(VectorRef(D.get(), A->num_cols()));
206 EliminateSolveAndCompare(VectorRef(D.get(), A->num_cols()), true, 1e-14)
[all...] |
| compressed_col_sparse_matrix_utils.h | 70 void SolveUpperTriangularInPlace(IntegerType num_cols,
75 for (IntegerType c = num_cols - 1; c >= 0; --c) {
91 void SolveUpperTriangularTransposeInPlace(IntegerType num_cols,
96 for (IntegerType c = 0; c < num_cols; ++c) {
117 void SolveRTRWithSparseRHS(IntegerType num_cols,
123 fill(solution, solution + num_cols, 0.0);
126 for (IntegerType c = rhs_nonzero_index + 1; c < num_cols; ++c) {
136 SolveUpperTriangularInPlace(num_cols, rows, cols, values, solution);
|
| dense_qr_solver.cc | 72 const int num_cols = A->num_cols(); local
115 VectorRef(x, num_cols) = rhs_.head(num_cols);
130 const int num_cols = A->num_cols(); local
140 num_rows + ((per_solve_options.D != NULL) ? num_cols : 0);
149 VectorRef(x, num_cols) = A->matrix().householderQr().solve(rhs_);
|
| block_random_access_sparse_matrix.cc | 56 int num_cols = 0; local
59 col_layout.push_back(num_cols);
60 num_cols += blocks_[i];
75 VLOG(1) << "Matrix Size [" << num_cols
76 << "," << num_cols
79 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros));
|
| unsymmetric_linear_solver_test.cc | 65 Vector x_unregularized(A_->num_cols());
66 Vector x_regularized(A_->num_cols());
80 for (int i = 0; i < A_->num_cols(); ++i) {
109 for (int i = 0; i < A_->num_cols(); ++i) {
112 << ConstVectorRef(sol_unregularized_.get(), A_->num_cols()).transpose()
118 for (int i = 0; i < A_->num_cols(); ++i) {
121 << ConstVectorRef(sol_regularized_.get(), A_->num_cols()).transpose()
|
| conjugate_gradients_solver.cc | 74 CHECK_EQ(A->num_rows(), A->num_cols());
81 const int num_cols = A->num_cols(); local
82 VectorRef xref(x, num_cols);
83 ConstVectorRef bref(b, num_cols);
93 Vector r(num_cols);
94 Vector p(num_cols);
95 Vector z(num_cols);
96 Vector tmp(num_cols);
|
| blas.cc | 50 int num_cols,
61 int n = transpose ? num_cols : num_rows;
62 int k = transpose ? num_rows : num_cols;
|
| corrector.cc | 119 const int num_cols,
127 VectorRef(jacobian, num_rows * num_cols) *= sqrt_rho1_;
143 for (int c = 0; c < num_cols; ++c) {
146 r_transpose_j += jacobian[r * num_cols + c] * residuals[r];
150 jacobian[r * num_cols + c] = sqrt_rho1_ *
151 (jacobian[r * num_cols + c] -
|
| sparse_normal_cholesky_solver.cc | 84 const int num_cols = A->num_cols(); local
85 VectorRef(x, num_cols).setZero();
97 per_solve_options.D, num_cols));
119 A->DeleteRows(num_cols);
327 const int num_cols = A->num_cols();
362 cholmod_dense* rhs = ss_.CreateDenseVector(rhs_and_solution, num_cols, num_cols);
368 memcpy(rhs_and_solution, solution->x, num_cols * sizeof(*rhs_and_solution))
[all...] |
| /development/tools/yuv420sp2rgb/ |
| debug.c | 5 #define NUM_COLS (32)
21 if (i && !(i % NUM_COLS)) {
35 if (i && (i % NUM_COLS)) fputs("\n", s);
|
| /external/jpeg/ |
| jdcolor.c | 150 JDIMENSION num_cols = cinfo->output_width; local
165 for (col = 0; col < num_cols; col++) {
191 JDIMENSION num_cols = cinfo->output_width; local
206 for (col = 0; col < num_cols; col++) {
232 JDIMENSION num_cols = cinfo->output_width; local
260 num_cols--;
262 for (col = 0; col < (num_cols>>1); col++) {
281 if (num_cols&1) {
304 JDIMENSION num_cols = cinfo->output_width; local
332 num_cols--
380 JDIMENSION num_cols = cinfo->output_width; local
406 JDIMENSION num_cols = cinfo->output_width; local
458 JDIMENSION num_cols = cinfo->output_width; local
518 JDIMENSION num_cols = cinfo->output_width; local
565 JDIMENSION num_cols = cinfo->output_width; local
586 JDIMENSION num_cols = cinfo->output_width; local
607 JDIMENSION num_cols = cinfo->output_width; local
645 JDIMENSION num_cols = cinfo->output_width; local
700 JDIMENSION num_cols = cinfo->output_width; local
[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...] |
| /external/libhevc/decoder/x86/ |
| ihevcd_fmt_conv_ssse3_intr.c | 63 WORD32 num_rows, num_cols, src_strd, dst_strd, cols, rows; local
76 num_cols = wd;
82 memcpy(pu1_dst, pu1_src, num_cols);
119 num_cols = wd >> 1;
126 if(num_cols > 15)
128 cols = num_cols >> 4;
246 num_cols &= 0x0F;
248 if(num_cols)
256 for(j = 0; j < num_cols; j++)
|
| /external/ceres-solver/include/ceres/internal/ |
| eigen.h | 65 template <int num_rows = Eigen::Dynamic, int num_cols = Eigen::Dynamic>
67 typedef Eigen::Matrix <double, num_rows, num_cols, Eigen::RowMajor>
71 Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> >
83 const Eigen::Matrix<double, num_rows, num_cols, Eigen::RowMajor> >
|
