| /external/ceres-solver/internal/ceres/ |
| 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.h | 63 // num_rows, num_cols and max_num_nonzeros.
70 CompressedRowSparseMatrix(int num_rows,
74 // Build a square sparse diagonal matrix with num_rows rows and
76 CompressedRowSparseMatrix(const double* diagonal, int num_rows);
89 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::CompressedRowSparseMatrix
96 // num_rows -= delta_rows
122 void set_num_rows(const int num_rows) { num_rows_ = num_rows; }
|
| dense_sparse_matrix.cc | 42 DenseSparseMatrix::DenseSparseMatrix(int num_rows, int num_cols)
45 m_.resize(num_rows, num_cols);
49 DenseSparseMatrix::DenseSparseMatrix(int num_rows,
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());
93 matrix().transpose() * ConstVectorRef(x, num_rows());
105 *dense_matrix = m_.block(0, 0, num_rows(), num_cols());
129 int DenseSparseMatrix::num_rows() const function in class:ceres::internal::DenseSparseMatrix
[all...] |
| implicit_schur_complement.h | 130 virtual int num_rows() const { return A_->num_cols_f(); } function in class:ceres::internal::ImplicitSchurComplement
|
| schur_complement_solver.cc | 111 set_rhs(new double[lhs()->num_rows()]);
126 const int num_rows = m->num_rows(); local
130 if (num_rows == 0) {
138 ConstMatrixRef(m->values(), num_rows, num_rows)
148 VectorRef(solution, num_rows) = llt.solve(ConstVectorRef(rhs(), num_rows));
150 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows);
[all...] |
| triplet_sparse_matrix.h | 49 TripletSparseMatrix(int num_rows, int num_cols, int max_num_nonzeros);
64 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::TripletSparseMatrix
102 // Build a sparse diagonal matrix of size num_rows x num_rows from
106 int num_rows);
|
| visibility_based_preconditioner.h | 141 virtual int num_rows() const;
218 virtual int num_rows() const { return -1; } function in class:ceres::internal::VisibilityBasedPreconditioner
|
| dynamic_compressed_row_sparse_matrix_test.cc | 48 num_rows = 7;
56 expected_num_nonzeros = num_rows * num_cols - min(num_rows, num_cols);
61 dcrsm.reset(new DynamicCompressedRowSparseMatrix(num_rows,
71 dense.resize(num_rows, num_cols);
74 for (int i = 0; i < (num_rows * num_cols); ++i) {
87 for (int i = 0; i < (num_rows * num_cols); ++i) {
97 tsm.reset(new TripletSparseMatrix(num_rows,
116 for (int r = 0; r < num_rows; ++r) {
127 EXPECT_EQ(dcrsm->num_rows(), num_rows)
160 int num_rows; member in class:ceres::internal::DynamicCompressedRowSparseMatrixTest
[all...] |
| linear_least_squares_problems.cc | 181 int num_rows = 6; local
185 TripletSparseMatrix* A = new TripletSparseMatrix(num_rows,
187 num_rows * num_cols);
188 problem->b.reset(new double[num_rows]);
277 for (int i = 0; i < num_rows; ++i) {
286 int num_rows = 6; local
291 problem->b.reset(new double[num_rows]);
296 scoped_array<double> values(new double[num_rows * num_cols]);
393 for (int i = 0; i < num_rows; ++i) {
420 int num_rows = 5 local
[all...] |
| compressed_row_sparse_matrix.cc | 72 CompressedRowSparseMatrix::CompressedRowSparseMatrix(int num_rows,
75 num_rows_ = num_rows;
77 rows_.resize(num_rows + 1, 0);
92 num_rows_ = m.num_rows();
135 int num_rows) {
138 num_rows_ = num_rows;
139 num_cols_ = num_rows;
140 rows_.resize(num_rows + 1);
141 cols_.resize(num_rows);
142 values_.resize(num_rows);
151 CHECK_EQ(num_nonzeros(), num_rows); local
223 int num_rows = 0; local
319 int num_rows = 0; local
[all...] |
| incomplete_lq_factorization.cc | 122 int num_nonzeros = rows[matrix->num_rows()];
125 matrix->set_num_rows(matrix->num_rows() + 1);
126 rows[matrix->num_rows()] = num_nonzeros;
159 matrix->set_num_rows(matrix->num_rows() + 1);
160 rows[matrix->num_rows()] = num_nonzeros;
170 const int num_rows = matrix.num_rows(); local
177 new CompressedRowSparseMatrix(num_rows,
178 num_rows,
179 l_level_of_fill * num_rows);
[all...] |
| compressed_row_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 row_blocks->resize(num_rows);
92 int num_rows; member in class:ceres::internal::CompressedRowSparseMatrixTest
461 const int num_rows = std::accumulate(row_blocks.begin(), row_blocks.end(), 0); local
[all...] |
| /external/libhevc/decoder/ |
| ihevcd_decode.c | 90 WORD32 num_rows);
718 WORD32 num_rows = 1 << ps_sps->i1_log2_ctb_size; local
724 num_rows = MIN(num_rows, (ps_codec->i4_disp_ht - (s_job.i2_ctb_y << ps_sps->i1_log2_ctb_size)));
725 if(num_rows < 0)
726 num_rows = 0;
733 num_rows);
|
| ihevcd_fmt_conv.c | 391 WORD32 num_rows, num_cols, src_strd, dst_strd; local
398 num_rows = ht;
404 for(i = 0; i < num_rows; i++)
415 num_rows = ht >> 1;
421 for(i = 0; i < num_rows; i++)
490 WORD32 num_rows, num_cols, src_strd, dst_strd; local
497 num_rows = ht;
503 for(i = 0; i < num_rows; i++)
514 num_rows = ht >> 1;
520 for(i = 0; i < num_rows; i++
603 WORD32 num_rows, num_cols, src_strd, dst_strd; 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
75 num_rows = ht;
80 for(i = 0; i < num_rows; i++)
118 num_rows = ht >> 1;
130 for(i = 0; i < (num_rows >> 2); i++)
208 rows = num_rows & 0x3;
244 pu1_u_dst -= (num_rows * dst_strd);
245 pu1_v_dst -= (num_rows * dst_strd);
254 for(i = 0; i < num_rows; i++)
|
| /external/chromium_org/third_party/libjpeg_turbo/ |
| jdmerge.c | 259 JDIMENSION num_rows; /* number of rows returned to caller */ local
265 num_rows = 1;
269 num_rows = 2;
271 if (num_rows > upsample->rows_to_go)
272 num_rows = upsample->rows_to_go;
275 if (num_rows > out_rows_avail)
276 num_rows = out_rows_avail;
279 if (num_rows > 1) {
290 *out_row_ctr += num_rows;
291 upsample->rows_to_go -= num_rows;
[all...] |
| jdsample.c | 103 JDIMENSION num_rows; local
122 num_rows = (JDIMENSION) (cinfo->max_v_samp_factor - upsample->next_row_out);
126 if (num_rows > upsample->rows_to_go)
127 num_rows = upsample->rows_to_go;
130 if (num_rows > out_rows_avail)
131 num_rows = out_rows_avail;
136 (int) num_rows);
139 *out_row_ctr += num_rows;
140 upsample->rows_to_go -= num_rows;
141 upsample->next_row_out += num_rows;
[all...] |
| /external/chromium_org/ash/wm/overview/ |
| window_grid.cc | 204 int num_rows = ((window_list_.size() + num_columns_ - 1) / num_columns_); local
207 static_cast<int>(total_bounds.height() * kCardAspectRatio / num_rows)));
215 num_rows * window_size.height()) / 2;
|
| /external/chromium_org/media/base/ |
| video_util.cc | 191 int num_rows = height; local
231 num_rows = num_cols = height;
235 num_rows = num_cols = width;
261 for (int row = 0; row < num_rows; ++row) {
|
| /external/jpeg/ |
| jdmerge.c | 171 JDIMENSION num_rows; /* number of rows returned to caller */ local
183 num_rows = 1;
187 num_rows = 2;
189 if (num_rows > upsample->rows_to_go)
190 num_rows = upsample->rows_to_go;
193 if (num_rows > out_rows_avail)
194 num_rows = out_rows_avail;
197 if (num_rows > 1) {
208 *out_row_ctr += num_rows;
209 upsample->rows_to_go -= num_rows;
[all...] |
| jdsample.c | 98 JDIMENSION num_rows; local
117 num_rows = (JDIMENSION) (cinfo->max_v_samp_factor - upsample->next_row_out);
121 if (num_rows > upsample->rows_to_go)
122 num_rows = upsample->rows_to_go;
125 if (num_rows > out_rows_avail)
126 num_rows = out_rows_avail;
131 (int) num_rows);
134 *out_row_ctr += num_rows;
135 upsample->rows_to_go -= num_rows;
136 upsample->next_row_out += num_rows;
[all...] |
| /external/pdfium/core/src/fxcodec/libjpeg/ |
| fpdfapi_jdmerge.c | 157 JDIMENSION num_rows; /* number of rows returned to caller */
local
163 num_rows = 1;
167 num_rows = 2;
169 if (num_rows > upsample->rows_to_go)
170 num_rows = upsample->rows_to_go;
173 if (num_rows > out_rows_avail)
174 num_rows = out_rows_avail;
177 if (num_rows > 1) {
188 *out_row_ctr += num_rows;
189 upsample->rows_to_go -= num_rows;
[all...] |
| fpdfapi_jdsample.c | 99 JDIMENSION num_rows;
local
118 num_rows = (JDIMENSION) (cinfo->max_v_samp_factor - upsample->next_row_out);
122 if (num_rows > upsample->rows_to_go)
123 num_rows = upsample->rows_to_go;
126 if (num_rows > out_rows_avail)
127 num_rows = out_rows_avail;
132 (int) num_rows);
135 *out_row_ctr += num_rows;
136 upsample->rows_to_go -= num_rows;
137 upsample->next_row_out += num_rows;
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jdmerge.c | 171 JDIMENSION num_rows; /* number of rows returned to caller */ local
183 num_rows = 1;
187 num_rows = 2;
189 if (num_rows > upsample->rows_to_go)
190 num_rows = upsample->rows_to_go;
193 if (num_rows > out_rows_avail)
194 num_rows = out_rows_avail;
197 if (num_rows > 1) {
208 *out_row_ctr += num_rows;
209 upsample->rows_to_go -= num_rows;
[all...] |
| jdsample.c | 98 JDIMENSION num_rows; local
117 num_rows = (JDIMENSION) (cinfo->max_v_samp_factor - upsample->next_row_out);
121 if (num_rows > upsample->rows_to_go)
122 num_rows = upsample->rows_to_go;
125 if (num_rows > out_rows_avail)
126 num_rows = out_rows_avail;
131 (int) num_rows);
134 *out_row_ctr += num_rows;
135 upsample->rows_to_go -= num_rows;
136 upsample->next_row_out += num_rows;
[all...] |
