| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 42 CRSMatrix() : num_rows(0), num_cols(0) {}
44 int num_rows; member in struct:ceres::CRSMatrix
|
| /external/ceres-solver/internal/ceres/ |
| block_jacobi_preconditioner.h | 69 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockJacobiPreconditioner
|
| dense_normal_cholesky_solver.cc | 54 const int num_rows = A->num_rows(); local
69 Vector rhs = Aref.transpose() * ConstVectorRef(b, num_rows);
|
| dense_qr_solver.cc | 53 const int num_rows = A->num_rows(); local
56 << num_rows << " x " << num_cols << " system.";
65 const int augmented_num_rows = num_rows + ((per_solve_options.D != NULL) ? num_cols : 0);
70 rhs_.head(num_rows) = ConstVectorRef(b, num_rows);
|
| block_random_access_dense_matrix.h | 48 // num_rows x num_cols.
78 // structure, num_rows() = num_cols().
79 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockRandomAccessDenseMatrix
|
| block_random_access_dense_matrix_test.cc | 44 const int num_rows = 3 + 4 + 5; local
46 EXPECT_EQ(m.num_rows(), num_rows);
47 EXPECT_EQ(m.num_cols(), num_rows);
76 const int num_rows = 3 + 4 + 5; local
104 int pos = row_idx * num_rows + col_idx;
|
| block_random_access_sparse_matrix.h | 79 // Since the matrix is square, num_rows() == num_cols().
80 virtual int num_rows() const { return tsm_->num_rows(); } function in class:ceres::internal::BlockRandomAccessSparseMatrix
|
| cgnr_linear_operator.h | 83 : A_(A), D_(D), z_(new double[A.num_rows()]) {
88 std::fill(z_.get(), z_.get() + A_.num_rows(), 0.0);
108 virtual int num_rows() const { return A_.num_cols(); } function in class:ceres::internal::CgnrLinearOperator
|
| partitioned_matrix_view.h | 103 int num_rows() const { return matrix_.num_rows(); } function in class:ceres::internal::PartitionedMatrixView
|
| block_sparse_matrix.h | 118 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockSparseMatrix
|
| compressed_row_sparse_matrix_test.cc | 46 EXPECT_EQ(a->num_rows(), b->num_rows());
49 int num_rows = a->num_rows(); local
56 Vector y_a = Vector::Zero(num_rows);
57 Vector y_b = Vector::Zero(num_rows);
77 num_rows = tsm->num_rows();
81 int num_rows; member in class:ceres::internal::CompressedRowSparseMatrixTest
93 for (int i = 0; i < num_rows; ++i)
[all...] |
| implicit_schur_complement.cc | 79 tmp_rows_.resize(A_->num_rows());
175 const int num_rows = A_->num_rows(); local
182 tmp_rows_ = ConstVectorRef(b_, num_rows) - tmp_rows_;
220 tmp_rows_ = ConstVectorRef(b_, A_->num_rows()) - tmp_rows_;
|
| schur_complement_solver_test.cc | 59 num_rows = A->num_rows();
71 TripletSparseMatrix triplet_A(A->num_rows(),
128 int num_rows; member in class:ceres::internal::SchurComplementSolverTest
|
| 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);
|
| compressed_row_sparse_matrix.cc | 70 CompressedRowSparseMatrix::CompressedRowSparseMatrix(int num_rows,
73 num_rows_ = num_rows;
94 num_rows_ = m.num_rows();
146 num_rows_ = proto.num_rows();
171 int num_rows) {
174 num_rows_ = num_rows;
175 num_cols_ = num_rows;
176 max_num_nonzeros_ = num_rows;
189 CHECK_EQ(num_nonzeros(), num_rows); local
314 int* new_rows = new int[num_rows_ + m.num_rows() + 1]
[all...] |
| compressed_row_sparse_matrix.h | 68 // num_rows, num_cols and max_num_nonzeros.
75 CompressedRowSparseMatrix(int num_rows,
79 // Build a square sparse diagonal matrix with num_rows rows and
81 CompressedRowSparseMatrix(const double* diagonal, int num_rows);
97 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::CompressedRowSparseMatrix
104 // num_rows -= delta_rows
|
| dense_sparse_matrix.cc | 42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols)
46 m_.resize(num_rows, num_cols);
50 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols, bool reserve_diagonal)
55 m_.resize(num_rows + num_cols, num_cols);
57 m_.resize(num_rows, num_cols);
63 : m_(Eigen::MatrixXd::Zero(m.num_rows(), m.num_cols())),
85 outer_proto.dense_matrix().num_rows(),
103 VectorRef(y, num_rows()) += matrix() * ConstVectorRef(x, num_cols());
108 matrix().transpose() * ConstVectorRef(x, num_rows());
129 proto->set_num_rows(num_rows());
160 int DenseSparseMatrix::num_rows() const { function in class:ceres::internal::DenseSparseMatrix
[all...] |
| dense_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 int num_rows; member in class:ceres::internal::DenseSparseMatrixTest
100 Vector b1 = Vector::Zero(num_rows);
[all...] |
| implicit_schur_complement.h | 130 virtual int num_rows() const { return A_->num_cols_f(); } function in class:ceres::internal::ImplicitSchurComplement
|
| triplet_sparse_matrix.h | 51 TripletSparseMatrix(int num_rows, int num_cols, int max_num_nonzeros);
72 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::TripletSparseMatrix
110 // Build a sparse diagonal matrix of size num_rows x num_rows from
114 int num_rows);
|
| visibility_based_preconditioner.h | 179 // num_rows respectively. Update() must be called before
185 virtual int num_rows() const;
186 virtual int num_cols() const { return num_rows(); }
262 virtual int num_rows() const { return -1; } function in class:ceres::internal::VisibilityBasedPreconditioner
|
| linear_least_squares_problems.cc | 251 int num_rows = 6; local
255 TripletSparseMatrix* A = new TripletSparseMatrix(num_rows,
257 num_rows * num_cols);
258 problem->b.reset(new double[num_rows]);
347 for (int i = 0; i < num_rows; ++i) {
356 int num_rows = 6; local
361 problem->b.reset(new double[num_rows]);
366 scoped_array<double> values(new double[num_rows * num_cols]);
463 for (int i = 0; i < num_rows; ++i) {
490 int num_rows = 5 local
[all...] |
| evaluator_test.cc | 94 int num_rows; member in struct:ceres::internal::ExpectedEvaluation
192 ASSERT_EQ(expected_num_rows, jacobian->num_rows());
225 expected.num_rows,
639 ASSERT_EQ(2, jacobian->num_rows());
739 m.resize(input.num_rows, input.num_cols);
741 for (int row = 0; row < input.num_rows; ++row) {
805 EXPECT_EQ(jacobian.num_rows, expected_num_rows);
828 EvaluateAndCompare(expected.num_rows,
845 EvaluateAndCompare(expected.num_rows,
|
| /external/jpeg/ |
| jdpostct.c | 133 JDIMENSION num_rows, max_rows; local
140 num_rows = 0;
143 post->buffer, &num_rows, max_rows);
146 post->buffer, output_buf + *out_row_ctr, (int) num_rows);
147 *out_row_ctr += num_rows;
165 JDIMENSION old_next_row, num_rows; local
183 num_rows = post->next_row - old_next_row;
185 (JSAMPARRAY) NULL, (int) num_rows);
186 *out_row_ctr += num_rows;
209 JDIMENSION num_rows, max_rows local
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jdpostct.c | 133 JDIMENSION num_rows, max_rows; local
140 num_rows = 0;
143 post->buffer, &num_rows, max_rows);
146 post->buffer, output_buf + *out_row_ctr, (int) num_rows);
147 *out_row_ctr += num_rows;
165 JDIMENSION old_next_row, num_rows; local
183 num_rows = post->next_row - old_next_row;
185 (JSAMPARRAY) NULL, (int) num_rows);
186 *out_row_ctr += num_rows;
209 JDIMENSION num_rows, max_rows local
[all...] |
