| /external/ceres-solver/internal/ceres/ |
| implicit_schur_complement.cc | 127 ConstVectorRef Dref(D_ + A_->num_cols_e(), num_cols());
128 VectorRef(y, num_cols()) =
130 ConstVectorRef(x, num_cols()).array()).matrix();
132 VectorRef(y, num_cols()).setZero();
171 const int num_cols = A_->num_cols(); local
186 VectorRef(y, num_cols).setZero();
|
| incomplete_lq_factorization.cc | 108 // In the row vector dense_row(0:num_cols), drop values smaller than
171 const int num_cols = matrix.num_cols(); local
182 CompressedRowSparseMatrix q(num_rows, num_cols, q_level_of_fill * num_rows);
194 Vector q_i(num_cols);
195 vector<pair<int, double> > scratch(num_cols);
223 num_cols,
|
| incomplete_lq_factorization_test.cc | 46 EXPECT_EQ(expected.num_cols(), actual.num_cols());
138 EXPECT_EQ(matrix.num_cols(), 10);
146 EXPECT_EQ(matrix.num_cols(), 10);
156 EXPECT_EQ(matrix.num_cols(), 10);
170 EXPECT_EQ(matrix.num_cols(), 10);
186 EXPECT_EQ(matrix.num_cols(), 10);
|
| compressed_row_sparse_matrix.h | 63 // num_rows, num_cols and max_num_nonzeros.
71 int num_cols,
90 virtual int num_cols() const { return num_cols_; } function in class:ceres::internal::CompressedRowSparseMatrix
123 void set_num_cols(const int num_cols) { num_cols_ = num_cols; }
|
| covariance_impl.cc | 417 const int num_cols = jacobian.num_cols; local
420 vector<SuiteSparse_long> transpose_rows(num_cols + 1, 0);
449 cholmod_jacobian.ncol = num_cols;
504 vector<int> inverse_permutation(num_cols);
505 for (SuiteSparse_long i = 0; i < num_cols; ++i) {
523 scoped_array<double> workspace(new double[num_threads * num_cols]);
526 for (int r = 0; r < num_cols; ++r) {
539 double* solution = workspace.get() + thread_id * num_cols;
541 num_cols,
710 const int num_cols = jacobian.num_cols; local
[all...] |
| block_random_access_dense_matrix.h | 48 // num_rows x num_cols.
78 // structure, num_rows() = num_cols().
80 virtual int num_cols() const { return num_rows_; } function in class:ceres::internal::BlockRandomAccessDenseMatrix
|
| block_random_access_diagonal_matrix.h | 73 // Since the matrix is square, num_rows() == num_cols().
75 virtual int num_cols() const { return tsm_->num_cols(); } function in class:ceres::internal::BlockRandomAccessDiagonalMatrix
|
| block_random_access_sparse_matrix.h | 78 // Since the matrix is square, num_rows() == num_cols().
80 virtual int num_cols() const { return tsm_->num_cols(); } function in class:ceres::internal::BlockRandomAccessSparseMatrix
|
| dense_sparse_matrix.h | 54 DenseSparseMatrix(int num_rows, int num_cols);
55 DenseSparseMatrix(int num_rows, int num_cols, bool reserve_diagonal);
68 virtual int num_cols() const;
|
| dynamic_compressed_row_sparse_matrix.cc | 39 int num_cols,
42 num_cols,
54 CHECK_LT(col, num_cols());
|
| visibility_test.cc | 59 int num_cols = 6; local
102 bs.cols.resize(num_cols);
106 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
139 int num_cols = 6; local
178 bs.cols.resize(num_cols);
182 ASSERT_EQ(visibility.size(), num_cols - num_eliminate_blocks);
|
| triplet_sparse_matrix_test.cc | 42 EXPECT_EQ(m.num_cols(), 0);
51 EXPECT_EQ(m.num_cols(), 5);
115 EXPECT_EQ(cpy.num_cols(), 5);
161 EXPECT_EQ(cpy.num_cols(), 5);
206 EXPECT_EQ(m.num_cols(), 5);
259 EXPECT_EQ(m.num_cols(), 20);
289 EXPECT_EQ(m->num_cols(), 10);
311 EXPECT_EQ(m.num_cols(), 6);
|
| cgnr_linear_operator.h | 98 int n = A_.num_cols();
108 virtual int num_rows() const { return A_.num_cols(); }
109 virtual int num_cols() const { return A_.num_cols(); } function in class:ceres::internal::CgnrLinearOperator
|
| lapack.cc | 115 int LAPACK::EstimateWorkSizeForQR(int num_rows, int num_cols) {
127 &num_cols,
149 int num_cols,
161 int n = num_cols;
|
| triplet_sparse_matrix.cc | 56 int num_cols,
59 num_cols_(num_cols),
67 CHECK_GE(num_cols, 0);
192 CHECK_EQ(B.num_cols(), num_cols_);
210 num_cols_ = num_cols_ + B.num_cols();
|
| /external/jpeg/ |
| jccolor.c | 142 JDIMENSION num_cols = cinfo->image_width; local
150 for (col = 0; col < num_cols; col++) {
198 JDIMENSION num_cols = cinfo->image_width; local
204 for (col = 0; col < num_cols; col++) {
237 JDIMENSION num_cols = cinfo->image_width; local
246 for (col = 0; col < num_cols; col++) {
289 JDIMENSION num_cols = cinfo->image_width; local
296 for (col = 0; col < num_cols; col++) {
350 JDIMENSION num_cols = cinfo->image_width; local
353 if (1 == num_rows && 3 == nc && num_cols > 0)
[all...] |
| jutils.c | 119 int num_rows, JDIMENSION num_cols)
123 * The source and destination arrays must be at least as wide as num_cols.
128 register size_t count = (size_t) (num_cols * SIZEOF(JSAMPLE));
143 for (count = num_cols; count > 0; count--)
|
| /external/libhevc/decoder/ |
| ihevcd_fmt_conv.c | 391 WORD32 num_rows, num_cols, src_strd, dst_strd; local
399 num_cols = wd;
406 memcpy(pu1_dst, pu1_src, num_cols);
416 num_cols = wd;
423 memcpy(pu1_dst, pu1_src, num_cols);
490 WORD32 num_rows, num_cols, src_strd, dst_strd; local
498 num_cols = wd;
505 memcpy(pu1_dst, pu1_src, num_cols);
515 num_cols = wd;
523 for(j = 0; j < num_cols; j += 2
603 WORD32 num_rows, num_cols, src_strd, dst_strd; local
832 WORD32 num_cols = ps_codec->i4_disp_wd; local
[all...] |
| /external/pdfium/core/src/fxcodec/libjpeg/ |
| fpdfapi_jutils.c | 114 int num_rows, JDIMENSION num_cols)
118 * The source and destination arrays must be at least as wide as num_cols.
123 register size_t count = (size_t) (num_cols * SIZEOF(JSAMPLE));
138 for (count = num_cols; count > 0; count--)
|
| fpdfapi_jccolor.c | 141 JDIMENSION num_cols = cinfo->image_width;
local
149 for (col = 0; col < num_cols; col++) {
197 JDIMENSION num_cols = cinfo->image_width;
local
203 for (col = 0; col < num_cols; col++) {
236 JDIMENSION num_cols = cinfo->image_width;
local
245 for (col = 0; col < num_cols; col++) {
288 JDIMENSION num_cols = cinfo->image_width;
local
295 for (col = 0; col < num_cols; col++) {
319 JDIMENSION num_cols = cinfo->image_width;
local
326 for (col = 0; col < num_cols; col++) {
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jccolor.c | 142 JDIMENSION num_cols = cinfo->image_width; local
150 for (col = 0; col < num_cols; col++) {
189 JDIMENSION num_cols = cinfo->image_width; local
197 for (col = 0; col < num_cols; col++) {
235 JDIMENSION num_cols = cinfo->image_width; local
243 for (col = 0; col < num_cols; col++) {
291 JDIMENSION num_cols = cinfo->image_width; local
297 for (col = 0; col < num_cols; col++) {
330 JDIMENSION num_cols = cinfo->image_width; local
339 for (col = 0; col < num_cols; col++)
382 JDIMENSION num_cols = cinfo->image_width; local
443 JDIMENSION num_cols = cinfo->image_width; local
[all...] |
| jutils.c | 119 int num_rows, JDIMENSION num_cols)
123 * The source and destination arrays must be at least as wide as num_cols.
128 register size_t count = (size_t) (num_cols * SIZEOF(JSAMPLE));
143 for (count = num_cols; count > 0; count--)
|
| /developers/samples/android/wearable/wear/SkeletonWearableApp/Wearable/src/main/java/com/example/android/skeletonwearableapp/ |
| GridExampleActivity.java | 38 private static final int NUM_COLS = 3;
68 return NUM_COLS;
|
| /development/samples/wearable/SkeletonWearableApp/Wearable/src/main/java/com/example/android/google/wearable/app/ |
| GridExampleActivity.java | 38 private static final int NUM_COLS = 3;
68 return NUM_COLS;
|
| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 43 CRSMatrix() : num_rows(0), num_cols(0) {}
46 int num_cols; member in struct:ceres::CRSMatrix
|
