Home
last modified time | relevance | path

Searched refs:num_cols (Results 1 – 25 of 65) sorted by relevance

123

/external/ceres-solver/internal/ceres/
Dnormal_prior_test.cc59 for (int num_cols = 1; num_cols < 5; ++num_cols) { in TEST() local
60 Vector b(num_cols); in TEST()
63 Matrix A(num_rows, num_cols); in TEST()
66 double * x = new double[num_cols]; in TEST()
67 for (int i = 0; i < num_cols; ++i) in TEST()
70 double * jacobian = new double[num_rows * num_cols]; in TEST()
78 (residuals - A * (VectorRef(x, num_cols) - b)).squaredNorm(); in TEST()
82 MatrixRef J(jacobian, num_rows, num_cols); in TEST()
96 for (int num_cols = 1; num_cols < 5; ++num_cols) { in TEST() local
97 Vector b(num_cols); in TEST()
[all …]
Ddense_sparse_matrix_test.cc50 EXPECT_EQ(a->num_cols(), b->num_cols()); in CompareMatrices()
53 int num_cols = a->num_cols(); in CompareMatrices() local
55 for (int i = 0; i < num_cols; ++i) { in CompareMatrices()
56 Vector x = Vector::Zero(num_cols); in CompareMatrices()
81 num_cols = tsm->num_cols(); in SetUp()
85 int num_cols; member in ceres::internal::DenseSparseMatrixTest
96 Vector a(num_cols); in TEST_F()
97 for (int i = 0; i < num_cols; i++) { in TEST_F()
114 Vector b1 = Vector::Zero(num_cols); in TEST_F()
115 Vector b2 = Vector::Zero(num_cols); in TEST_F()
[all …]
Dcompressed_row_sparse_matrix_test.cc47 EXPECT_EQ(a->num_cols(), b->num_cols()); in CompareMatrices()
50 int num_cols = a->num_cols(); in CompareMatrices() local
52 for (int i = 0; i < num_cols; ++i) { in CompareMatrices()
53 Vector x = Vector::Zero(num_cols); in CompareMatrices()
78 num_cols = tsm->num_cols(); in SetUp()
82 int num_cols; member in ceres::internal::CompressedRowSparseMatrixTest
97 Vector b1 = Vector::Zero(num_cols); in TEST_F()
98 Vector b2 = Vector::Zero(num_cols); in TEST_F()
108 Vector b1 = Vector::Zero(num_cols); in TEST_F()
109 Vector b2 = Vector::Zero(num_cols); in TEST_F()
[all …]
Dsparse_normal_cholesky_solver.cc108 const int num_cols = A->num_cols(); in SolveImplUsingCXSparse() local
109 Vector Atb = Vector::Zero(num_cols); in SolveImplUsingCXSparse()
115 CompressedRowSparseMatrix D(per_solve_options.D, num_cols); in SolveImplUsingCXSparse()
119 VectorRef(x, num_cols).setZero(); in SolveImplUsingCXSparse()
136 A->DeleteRows(num_cols); in SolveImplUsingCXSparse()
173 const int num_cols = A->num_cols(); in SolveImplUsingSuiteSparse() local
176 Vector Atb = Vector::Zero(num_cols); in SolveImplUsingSuiteSparse()
182 CompressedRowSparseMatrix D(per_solve_options.D, num_cols); in SolveImplUsingSuiteSparse()
186 VectorRef(x, num_cols).setZero(); in SolveImplUsingSuiteSparse()
191 cholmod_dense* rhs = ss_.CreateDenseVector(Atb.data(), num_cols, num_cols); in SolveImplUsingSuiteSparse()
[all …]
Ddense_sparse_matrix.cc42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols) in DenseSparseMatrix() argument
46 m_.resize(num_rows, num_cols); in DenseSparseMatrix()
50 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols, bool reserve_diagonal) in DenseSparseMatrix() argument
55 m_.resize(num_rows + num_cols, num_cols); in DenseSparseMatrix()
57 m_.resize(num_rows, num_cols); in DenseSparseMatrix()
63 : m_(Eigen::MatrixXd::Zero(m.num_rows(), m.num_cols())), in DenseSparseMatrix()
86 outer_proto.dense_matrix().num_cols())), in DenseSparseMatrix()
103 VectorRef(y, num_rows()) += matrix() * ConstVectorRef(x, num_cols()); in RightMultiply()
107 VectorRef(y, num_cols()) += in LeftMultiply()
112 VectorRef(x, num_cols()) = m_.colwise().squaredNorm(); in SquaredColumnNorm()
[all …]
Dschur_eliminator_test.cc146 const int num_cols = A->num_cols(); in EliminateSolveAndCompare() local
166 MatrixRef lhs_ref(lhs.mutable_values(), lhs.num_rows(), lhs.num_cols()); in EliminateSolveAndCompare()
174 Vector sol(num_cols); in EliminateSolveAndCompare()
205 Vector zero(A->num_cols()); in TEST_F()
208 ComputeReferenceSolution(VectorRef(zero.data(), A->num_cols())); in TEST_F()
209 EliminateSolveAndCompare(VectorRef(zero.data(), A->num_cols()), true, 1e-14); in TEST_F()
210 EliminateSolveAndCompare(VectorRef(zero.data(), A->num_cols()), false, 1e-14); in TEST_F()
212 ComputeReferenceSolution(VectorRef(D.get(), A->num_cols())); in TEST_F()
213 EliminateSolveAndCompare(VectorRef(D.get(), A->num_cols()), true, 1e-14); in TEST_F()
214 EliminateSolveAndCompare(VectorRef(D.get(), A->num_cols()), false, 1e-14); in TEST_F()
[all …]
Ddense_normal_cholesky_solver.cc55 const int num_cols = A->num_cols(); in SolveImpl() local
58 Matrix lhs(num_cols, num_cols); in SolveImpl()
72 ConstVectorRef D(per_solve_options.D, num_cols); in SolveImpl()
76 VectorRef(x, num_cols) = in SolveImpl()
Dschur_complement_solver_test.cc58 num_cols = A->num_cols(); in SetUpFromProblemId()
62 x.reset(new double[num_cols]); in SetUpFromProblemId()
63 sol.reset(new double[num_cols]); in SetUpFromProblemId()
64 sol_d.reset(new double[num_cols]); in SetUpFromProblemId()
72 A->num_cols(), in SetUpFromProblemId()
118 for (int i = 0; i < num_cols; ++i) { in ComputeAndCompareSolutions()
122 for (int i = 0; i < num_cols; ++i) { in ComputeAndCompareSolutions()
129 int num_cols; member in ceres::internal::SchurComplementSolverTest
Dconjugate_gradients_solver.cc76 CHECK_EQ(A->num_rows(), A->num_cols()); in Solve()
82 int num_cols = A->num_cols(); in Solve() local
83 VectorRef xref(x, num_cols); in Solve()
84 ConstVectorRef bref(b, num_cols); in Solve()
93 Vector r(num_cols); in Solve()
94 Vector p(num_cols); in Solve()
95 Vector z(num_cols); in Solve()
96 Vector tmp(num_cols); in Solve()
Dblock_sparse_matrix_test.cc59 CHECK_EQ(A_->num_cols(), B_->num_cols()); in SetUp()
75 for (int i = 0; i < A_->num_cols(); ++i) { in TEST_F()
76 Vector x = Vector::Zero(A_->num_cols()); in TEST_F()
85 Vector y_a = Vector::Zero(A_->num_cols()); in TEST_F()
86 Vector y_b = Vector::Zero(A_->num_cols()); in TEST_F()
97 Vector y_a = Vector::Zero(A_->num_cols()); in TEST_F()
98 Vector y_b = Vector::Zero(A_->num_cols()); in TEST_F()
Dlinear_least_squares_problems.cc252 int num_cols = 5; in LinearLeastSquaresProblem1() local
256 num_cols, in LinearLeastSquaresProblem1()
257 num_rows * num_cols); in LinearLeastSquaresProblem1()
259 problem->D.reset(new double[num_cols]); in LinearLeastSquaresProblem1()
343 for (int i = 0; i < num_cols; ++i) { in LinearLeastSquaresProblem1()
357 int num_cols = 5; in LinearLeastSquaresProblem2() local
362 problem->D.reset(new double[num_cols]); in LinearLeastSquaresProblem2()
366 scoped_array<double> values(new double[num_rows * num_cols]); in LinearLeastSquaresProblem2()
368 for (int c = 0; c < num_cols; ++c) { in LinearLeastSquaresProblem2()
459 for (int i = 0; i < num_cols; ++i) { in LinearLeastSquaresProblem2()
[all …]
Ddense_qr_solver.cc54 const int num_cols = A->num_cols(); in SolveImpl() local
56 << num_rows << " x " << num_cols << " system."; in SolveImpl()
65 const int augmented_num_rows = num_rows + ((per_solve_options.D != NULL) ? num_cols : 0); in SolveImpl()
73 VectorRef(x, num_cols) = A->matrix().colPivHouseholderQr().solve(rhs_); in SolveImpl()
Dblock_random_access_sparse_matrix.cc56 int num_cols = 0; in BlockRandomAccessSparseMatrix() local
59 col_layout.push_back(num_cols); in BlockRandomAccessSparseMatrix()
60 num_cols += blocks_[i]; in BlockRandomAccessSparseMatrix()
75 VLOG(1) << "Matrix Size [" << num_cols in BlockRandomAccessSparseMatrix()
76 << "," << num_cols in BlockRandomAccessSparseMatrix()
79 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros)); in BlockRandomAccessSparseMatrix()
Dpartitioned_matrix_view_test.cc57 num_cols_ = A_->num_cols(); in SetUp()
76 EXPECT_EQ(m.num_cols(), A_->num_cols()); in TEST_F()
87 Vector x2(m.num_cols()); in TEST_F()
112 Vector x2 = Vector::Zero(m.num_cols()); in TEST_F()
141 Vector y = Vector::Zero(m.num_cols()); in TEST_F()
149 for (int i = 0; i < m.num_cols(); ++i) { in TEST_F()
165 EXPECT_EQ(block_diagonal_ee->num_cols(), 2); in TEST_F()
182 EXPECT_EQ(block_diagonal_ff->num_cols(), 3); in TEST_F()
Dimplicit_schur_complement.cc130 ConstVectorRef Dref(D_ + A_->num_cols_e(), num_cols()); in RightMultiply()
131 VectorRef(y, num_cols()) = in RightMultiply()
133 ConstVectorRef(x, num_cols()).array()).matrix(); in RightMultiply()
135 VectorRef(y, num_cols()).setZero(); in RightMultiply()
174 const int num_cols = A_->num_cols(); in BackSubstitute() local
189 VectorRef(y, num_cols).setZero(); in BackSubstitute()
Dcgnr_linear_operator.h98 int n = A_.num_cols(); in RightMultiply()
108 virtual int num_rows() const { return A_.num_cols(); } in num_rows()
109 virtual int num_cols() const { return A_.num_cols(); } in num_cols() function
Dtriplet_sparse_matrix_test.cc43 EXPECT_EQ(m.num_cols(), 0); in TEST()
52 EXPECT_EQ(m.num_cols(), 5); in TEST()
116 EXPECT_EQ(cpy.num_cols(), 5); in TEST()
162 EXPECT_EQ(cpy.num_cols(), 5); in TEST()
207 EXPECT_EQ(m.num_cols(), 5); in TEST()
260 EXPECT_EQ(m.num_cols(), 20); in TEST()
290 EXPECT_EQ(m->num_cols(), 10); in TEST()
312 EXPECT_EQ(m.num_cols(), 6); in TEST()
339 ASSERT_EQ(n.num_cols(), 5); in TEST()
Dvisibility_test.cc54 int num_cols = 6; in TEST() local
97 bs.cols.resize(num_cols); in TEST()
101 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks); in TEST()
134 int num_cols = 6; in TEST() local
173 bs.cols.resize(num_cols); in TEST()
177 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks); in TEST()
Dunsymmetric_linear_solver_test.cc71 Vector x_unregularized(A_->num_cols()); in TestSolver()
72 Vector x_regularized(A_->num_cols()); in TestSolver()
101 for (int i = 0; i < A_->num_cols(); ++i) { in TestSolver()
106 for (int i = 0; i < A_->num_cols(); ++i) { in TestSolver()
Dcgnr_solver.cc53 scoped_array<double> z(new double[A->num_cols()]); in Solve()
54 std::fill(z.get(), z.get() + A->num_cols(), 0.0); in Solve()
70 std::fill(x, x + A->num_cols(), 0.0); in Solve()
/external/jpeg/
Djdcolor.c148 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_convert() local
163 for (col = 0; col < num_cols; col++) { in ycc_rgb_convert()
189 JDIMENSION num_cols = cinfo->output_width; in ycc_rgba_8888_convert() local
204 for (col = 0; col < num_cols; col++) { in ycc_rgba_8888_convert()
230 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_565_convert() local
258 num_cols--; in ycc_rgb_565_convert()
260 for (col = 0; col < (num_cols>>1); col++) { in ycc_rgb_565_convert()
279 if (num_cols&1) { in ycc_rgb_565_convert()
302 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_565D_convert() local
330 num_cols--; in ycc_rgb_565D_convert()
[all …]
Djccolor.c142 JDIMENSION num_cols = cinfo->image_width; in rgb_ycc_convert() local
150 for (col = 0; col < num_cols; col++) { in rgb_ycc_convert()
198 JDIMENSION num_cols = cinfo->image_width; in rgb_gray_convert() local
204 for (col = 0; col < num_cols; col++) { in rgb_gray_convert()
237 JDIMENSION num_cols = cinfo->image_width; in cmyk_ycck_convert() local
246 for (col = 0; col < num_cols; col++) { in cmyk_ycck_convert()
289 JDIMENSION num_cols = cinfo->image_width; in grayscale_convert() local
296 for (col = 0; col < num_cols; col++) { in grayscale_convert()
350 JDIMENSION num_cols = cinfo->image_width; in null_convert() local
353 if (1 == num_rows && 3 == nc && num_cols > 0) { in null_convert()
[all …]
/external/qemu/distrib/jpeg-6b/
Djdcolor.c148 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_convert() local
163 for (col = 0; col < num_cols; col++) { in ycc_rgb_convert()
189 JDIMENSION num_cols = cinfo->output_width; in ycc_rgba_8888_convert() local
204 for (col = 0; col < num_cols; col++) { in ycc_rgba_8888_convert()
230 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_565_convert() local
258 num_cols--; in ycc_rgb_565_convert()
260 for (col = 0; col < (num_cols>>1); col++) { in ycc_rgb_565_convert()
279 if (num_cols&1) { in ycc_rgb_565_convert()
302 JDIMENSION num_cols = cinfo->output_width; in ycc_rgb_565D_convert() local
330 num_cols--; in ycc_rgb_565D_convert()
[all …]
Djccolor.c142 JDIMENSION num_cols = cinfo->image_width; in rgb_ycc_convert() local
150 for (col = 0; col < num_cols; col++) { in rgb_ycc_convert()
189 JDIMENSION num_cols = cinfo->image_width; in rgb565_ycc_convert() local
197 for (col = 0; col < num_cols; col++) { in rgb565_ycc_convert()
235 JDIMENSION num_cols = cinfo->image_width; in rgba8888_ycc_convert() local
243 for (col = 0; col < num_cols; col++) { in rgba8888_ycc_convert()
291 JDIMENSION num_cols = cinfo->image_width; in rgb_gray_convert() local
297 for (col = 0; col < num_cols; col++) { in rgb_gray_convert()
330 JDIMENSION num_cols = cinfo->image_width; in cmyk_ycck_convert() local
339 for (col = 0; col < num_cols; col++) { in cmyk_ycck_convert()
[all …]
/external/ceres-solver/include/ceres/internal/
Deigen.h52 template <int num_rows = Eigen::Dynamic, int num_cols = Eigen::Dynamic>
54 typedef Eigen::Matrix <double, num_rows, num_cols, RowMajor>
58 Eigen::Matrix<double, num_rows, num_cols, RowMajor> >
70 const Eigen::Matrix<double, num_rows, num_cols, RowMajor> >

123