| /external/eigen/Eigen/src/Core/ |
| Random.h | 31 * The parameters \a rows and \a cols are the number of rows and of columns of
35 * it is redundant to pass \a rows and \a cols as arguments, so Random() should be used
49 DenseBase<Derived>::Random(Index rows, Index cols)
51 return NullaryExpr(rows, cols, internal::scalar_random_op<Scalar>());
112 return *this = Random(rows(), cols());
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseRedux.h | 19 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
31 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
39 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
|
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.h | 27 struct C_MatrixXd* MatrixXd_new(int rows, int cols);
31 void MatrixXd_resize (struct C_MatrixXd *m, int rows, int cols);
50 struct C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols);
|
| /external/eigen/test/eigen2/ |
| eigen2_map.cpp | 42 int rows = m.rows(), cols = m.cols(), size = rows*cols; local
52 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
53 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>((const Scalar*)array1, rows, cols); // test non-const-correctness support in eigen2
54 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
55 MatrixType ma1 = Map<MatrixType>(array1, rows, cols);
[all...] |
| eigen2_triangular.cpp | 21 int cols = m.cols(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols),
25 m3(rows, cols),
26 m4(rows, cols),
27 r1(rows, cols),
28 r2(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
30 mones = MatrixType::Ones(rows, cols),
[all...] |
| eigen2_cwiseop.cpp | 29 int cols = m.cols(); local
31 MatrixType m1 = MatrixType::Random(rows, cols),
32 m2 = MatrixType::Random(rows, cols),
33 m3(rows, cols),
34 m4(rows, cols),
35 mzero = MatrixType::Zero(rows, cols),
36 mones = MatrixType::Ones(rows, cols),
47 c = ei_random<int>(0, cols-1);
52 m3 = MatrixType::Constant(rows, cols, s1)
[all...] |
| eigen2_adjoint.cpp | 23 int cols = m.cols(); local
29 MatrixType m1 = MatrixType::Random(rows, cols),
30 m2 = MatrixType::Random(rows, cols),
31 m3(rows, cols),
32 mzero = MatrixType::Zero(rows, cols),
68 c = ei_random<int>(0, cols-1);
|
| /external/eigen/test/ |
| mapped_matrix.cpp | 52 Index rows = m.rows(), cols = m.cols(), size = rows*cols; local
62 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
63 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>(array1, rows, cols);
64 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
65 MatrixType ma1 = Map<MatrixType>(array1, rows, cols);
[all...] |
| block.cpp | 44 Index cols = m.cols(); local
46 MatrixType m1 = MatrixType::Random(rows, cols),
48 m2 = MatrixType::Random(rows, cols),
49 m3(rows, cols),
50 ones = MatrixType::Ones(rows, cols);
57 Index c1 = internal::random<Index>(0,cols-1);
58 Index c2 = internal::random<Index>(c1,cols-1);
81 RowVectorType br1(m1.block(r1,0,1,cols));
94 if (rows>=5 && cols>=8
184 Index cols = m.cols(); local
218 Index cols = m.cols(); local
[all...] |
| cwiseop.cpp | 73 Index cols = m.cols(); local
75 MatrixType m1 = MatrixType::Random(rows, cols),
77 m2 = MatrixType::Random(rows, cols),
78 m3(rows, cols),
79 m4(rows, cols),
80 mzero = MatrixType::Zero(rows, cols),
81 mones = MatrixType::Ones(rows, cols),
89 c = internal::random<Index>(0, cols-1);
94 m3 = MatrixType::Constant(rows, cols, s1)
[all...] |
| inverse.cpp | 22 Index cols = m.cols(); local
26 MatrixType m1(rows, cols),
27 m2(rows, cols),
65 MatrixType m3 = v3*v3.transpose(), m4(rows,cols);
|
| jacobi.cpp | 19 Index cols = m.cols(); local
28 const MatrixType a(MatrixType::Random(rows, cols));
48 Index p = internal::random<Index>(0, cols-1);
51 q = internal::random<Index>(0, cols-1);
|
| /external/libvpx/libvpx/test/ |
| active_map_test.cc | 53 map.cols = (kWidth + 15) / 16;
55 ASSERT_EQ(map.cols, 13u);
61 map.cols = (kWidth + 15) / 16;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/test/ |
| active_map_test.cc | 53 map.cols = (kWidth + 15) / 16;
55 ASSERT_EQ(map.cols, 13u);
61 map.cols = (kWidth + 15) / 16;
|
| /external/ceres-solver/internal/ceres/ |
| partitioned_matrix_view_impl.h | 55 num_col_blocks_f_ = bs->cols.size() - num_col_blocks_e_;
74 for (int c = 0; c < bs->cols.size(); ++c) {
75 const Block& block = bs->cols[c];
110 const int col_block_pos = bs->cols[col_block_id].position;
111 const int col_block_size = bs->cols[col_block_id].size;
137 const int col_block_pos = bs->cols[col_block_id].position;
138 const int col_block_size = bs->cols[col_block_id].size;
152 const int col_block_pos = bs->cols[col_block_id].position;
153 const int col_block_size = bs->cols[col_block_id].size;
176 const int col_block_pos = bs->cols[col_block_id].position
[all...] |
| linear_least_squares_problems.cc | 193 int* cols = A->mutable_cols(); local
201 cols[nnz] = 0;
205 cols[nnz] = 2;
212 cols[nnz] = 0;
216 cols[nnz] = 3;
223 cols[nnz] = 1;
227 cols[nnz] = 4;
234 cols[nnz] = 1;
238 cols[nnz] = 2;
245 cols[nnz] = 1
[all...] |
| dynamic_compressed_row_sparse_matrix_test.cc | 85 std::vector<int> rows, cols; local
91 cols.push_back(c);
101 std::copy(cols.begin(), cols.end(), tsm->mutable_cols());
134 EXPECT_EQ(dense_from_dcrsm.cols(), num_cols);
151 ConstIntVectorRef crsm_cols(crsm->cols(), crsm->num_nonzeros());
152 ConstIntVectorRef dcrsm_cols(dcrsm->cols(), dcrsm->num_nonzeros());
|
| /external/opencv/cv/src/ |
| cvkdtree.cpp | 90 assert(d->cols == tr->dims());
93 assert(results->cols == k);
94 assert(dist->cols == k);
120 int rn = results->rows * results->cols;
146 (&tmp[0], &tmp[0] + tmp.size(), mat->cols,
174 assert(bounds_min->rows * bounds_min->cols == dims());
175 assert(bounds_max->rows * bounds_max->cols == dims());
216 if (desc->cols != dims)
218 if (results->rows != desc->rows && results->cols != k)
220 if (dist->rows != desc->rows && dist->cols != k
[all...] |
| cvadapthresh.cpp | 53 int i, j, rows, cols; local
67 cols = src->cols;
72 CV_CALL( mean = cvCreateMat( rows, cols, CV_8UC1 ));
92 for( j = 0; j < cols; j++ )
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixMatrix.h | 22 void pack(Scalar* blockA, const const_blas_data_mapper<Scalar,Index,StorageOrder>& lhs, Index cols, Index i, Index& count)
42 for(Index k=i+BlockRows; k<cols; k++)
46 void operator()(Scalar* blockA, const Scalar* _lhs, Index lhsStride, Index cols, Index rows)
53 pack<Pack1>(blockA, lhs, cols, i, count);
58 pack<Pack2>(blockA, lhs, cols, peeled_mc, count);
70 for(Index k=i+1; k<cols; k++)
80 void operator()(Scalar* blockB, const Scalar* _rhs, Index rhsStride, Index rows, Index cols, Index k2)
85 Index packet_cols = (cols/nr)*nr;
166 for(Index j2=packet_cols; j2<cols; ++j2)
210 Index rows, Index cols,
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_linear.c | 42 size_t bytes = t->cols * t->block.size;
66 size_t bytes = t->cols * t->block.size;
93 t->cols = t->tile.width / t->block.width;
95 t->tile.size = t->cols * t->rows * t->block.size;
99 t->stride = t->cols * t->tiles_x * t->block.size;
|
| /external/eigen/bench/ |
| BenchUtil.h | 24 mat.setRandom();// = MatrixType::random(mat.rows(), mat.cols());
51 dst.resize(src.rows(),src.cols());
52 for (int j=0; j<src.cols(); ++j)
66 for (int j=0; j<src.cols(); ++j)
78 dst.resize(src.rows(),src.cols());
79 for (int j=0; j<src.cols(); ++j)
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_linear.c | 42 size_t bytes = t->cols * t->block.size;
66 size_t bytes = t->cols * t->block.size;
93 t->cols = t->tile.width / t->block.width;
95 t->tile.size = t->cols * t->rows * t->block.size;
99 t->stride = t->cols * t->tiles_x * t->block.size;
|
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| SDL_yuv_sw.c | 110 int rows, int cols, int mod );
114 int rows, int cols, int mod );
128 int rows, int cols, int mod );
132 int rows, int cols, int mod );
138 int rows, int cols, int mod )
147 int cols_2 = cols / 2;
150 row2 = row1 + cols + mod;
151 lum2 = lum + cols;
153 mod += cols + mod;
198 lum += cols;
[all...] |
| /external/eigen/Eigen/src/plugins/ |
| BlockMethods.h | 82 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
88 return Block<const Derived>(derived(), 0, cols() - cCols, cRows, cCols);
104 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
111 return Block<const Derived, CRows, CCols>(derived(), 0, cols() - CCols);
134 return Block<Derived, CRows, CCols>(derived(), 0, cols() - cCols, cRows, cCols);
141 return Block<const Derived, CRows, CCols>(derived(), 0, cols() - cCols, cRows, cCols);
233 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
239 return Block<const Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
254 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
261 return Block<const Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols)
[all...] |
