/external/eigen/test/ |
H A D | swap.cpp | 32 typename MatrixType::Index cols = m.cols(); local 35 MatrixType m1 = MatrixType::Random(rows,cols); 36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols); 37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols); 58 m1.swap(m2.block(0,0,rows,cols));
|
H A D | array_replicate.cpp | 24 Index cols = m.cols(); local 26 MatrixType m1 = MatrixType::Random(rows, cols), 27 m2 = MatrixType::Random(rows, cols); 37 x1.resize(rows*f1,cols*f2); 40 x1.block(i*rows,j*cols,rows,cols) = m1; 43 x2.resize(2*rows,3*cols);
|
H A D | array_reverse.cpp | 23 Index cols = m.cols(); local 27 MatrixType m1 = MatrixType::Random(rows, cols); 33 for ( int j = 0; j < cols; j++ ) { 34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j)); 41 for ( int j = 0; j < cols; j++ ) { 42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j)); 49 for ( int j = 0; j < cols; j++ ) { 50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows - 1 - i, cols - 1 - j)); 57 for ( int j = 0; j < cols; [all...] |
H A D | eigensolver_complex.cpp | 23 VERIFY(vec1.cols() == 1); 24 VERIFY(vec2.cols() == 1); 40 Index cols = m.cols(); local 45 MatrixType a = MatrixType::Random(rows,cols); 75 MatrixType z = MatrixType::Zero(rows,cols); 79 MatrixType id = MatrixType::Identity(rows, cols); 97 MatrixType a = MatrixType::Random(m.rows(),m.cols());
|
H A D | eigensolver_generic.cpp | 22 Index cols = m.cols(); local 29 MatrixType a = MatrixType::Random(rows,cols); 30 MatrixType a1 = MatrixType::Random(rows,cols); 63 MatrixType id = MatrixType::Identity(rows, cols); 83 MatrixType a = MatrixType::Random(m.rows(),m.cols());
|
H A D | eigensolver_selfadjoint.cpp | 22 Index cols = m.cols(); local 29 MatrixType a = MatrixType::Random(rows,cols); 30 MatrixType a1 = MatrixType::Random(rows,cols); 34 MatrixType b = MatrixType::Random(rows,cols); 35 MatrixType b1 = MatrixType::Random(rows,cols); 82 MatrixType id = MatrixType::Identity(rows, cols);
|
H A D | mapstride.cpp | 56 Index rows = _m.rows(), cols = _m.cols(); local 58 MatrixType m = MatrixType::Random(rows,cols); 60 Index arraysize = 2*(rows+4)*(cols+4); 69 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1)); 88 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4)); 101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2));
|
H A D | nullary.cpp | 21 for (Index j = i+1; j < A.cols(); ++j) { 26 for (Index j = 0; j < (std::min)(i, A.cols()); ++j) { 107 const Index cols = m.cols(); local 110 A.setIdentity(rows, cols); 112 VERIFY(equalsIdentity(MatrixType::Identity(rows, cols)));
|
H A D | product_symm.cpp | 22 Index cols = size; local 24 MatrixType m1 = MatrixType::Random(rows, cols), 25 m2 = MatrixType::Random(rows, cols), m3; 29 Rhs1 rhs1 = Rhs1::Random(cols, othersize), rhs12(cols, othersize), rhs13(cols, othersize); 31 Rhs3 rhs3 = Rhs3::Random(cols, othersize), rhs32(cols, othersize), rhs33(cols, othersize);
|
/external/eigen/unsupported/test/ |
H A D | kronecker_product.cpp | 19 void check_dimension(const MatrixType& ab, const int rows, const int cols) argument 22 VERIFY_IS_EQUAL(ab.cols(), cols); 30 VERIFY_IS_EQUAL(ab.cols(), 6); 75 VERIFY_IS_EQUAL(ab.cols(), 10); 116 for(int j=0;j<DM_fix_ab.cols();++j)
|
/external/libvpx/libvpx/vp8/common/ |
H A D | debugmodes.c | 16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame) argument 30 for (mb_col = 0; mb_col < cols; mb_col++) 49 for (mb_col = 0; mb_col < cols; mb_col++) 69 for (mb_col = 0; mb_col < cols; mb_col++) 94 for (b_col = 0; b_col < 4 * cols; b_col++) 96 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2); 117 for (mb_col = 0; mb_col < cols; mb_col++) 142 for (b_col = 0; b_col < 4 * cols; b_col++) 144 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2);
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_linear.h | 62 unsigned cols; member in struct:pipe_tile_info 94 if (t->tile.size != t->block.size * t->cols * t->rows) 97 if (t->stride != t->block.size * t->cols * t->tiles_x)
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/ |
H A D | vp9_debugmodes.c | 32 int cols = cm->mi_cols; local 39 for (mi_col = 0; mi_col < cols; mi_col++) { 58 int cols = cm->mi_cols; local 70 for (mi_col = 0; mi_col < cols; mi_col++) {
|
/external/chromium_org/third_party/skia/include/utils/ |
H A D | SkMeshUtils.h | 23 bool init(int texW, int texH, int rows, int cols) { argument 24 return this->init(NULL, NULL, texW, texH, rows, cols); 28 int texW, int texH, int rows, int cols); 45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
|
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkMeshUtils.cpp | 21 int texW, int texH, int rows, int cols) { 22 if (rows < 2 || cols < 2) { 34 fTexCount = rows * cols; 36 cols -= 1; 37 fIndexCount = rows * cols * 6; 53 for (int y = 0; y < cols; y++) { 73 const SkScalar dy = SkIntToScalar(texH) / cols; 74 for (int y = 0; y <= cols; y++) { 89 int rows, int cols, const SkPoint verts[], 93 if (idx.init(bitmap.width(), bitmap.height(), rows, cols)) { 20 init(SkPoint tex[], uint16_t indices[], int texW, int texH, int rows, int cols) argument 88 Draw(SkCanvas* canvas, const SkBitmap& bitmap, int rows, int cols, const SkPoint verts[], const SkColor colors[], const SkPaint& paint) argument [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | 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) argument 51 return NullaryExpr(rows, cols, internal::scalar_random_op<Scalar>()); 112 return *this = Random(rows(), cols());
|
H A D | ReturnByValue.h | 63 inline Index cols() const { return static_cast<const Derived*>(this)->cols(); } function in class:Eigen::ReturnByValue
|
/external/eigen/Eigen/src/misc/ |
H A D | Kernel.h | 27 // is the number of cols of the original matrix 47 m_cols(m_rank==dec.cols() ? 1 : dec.cols() - m_rank) 50 inline Index rows() const { return m_dec.cols(); } 51 inline Index cols() const { return m_cols; } function in struct:Eigen::internal::kernel_retval_base 76 using Base::cols; \
|
H A D | Solve.h | 44 inline Index rows() const { return m_dec.cols(); } 45 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::solve_retval_base 70 using Base::cols; \
|
/external/eigen/bench/ |
H A D | spmv.cpp | 28 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra, 31 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1, 41 int cols = size; local 55 cols = atoi(argv[i]+1); 80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n"; 82 EigenSparseMatrix sm(rows,cols); 83 DenseVector dv(cols), res(rows); 91 fillMatrix2(nnzPerCol, rows, cols, sm); 96 DenseMatrix dm(rows,cols), (row local [all...] |
/external/eigen/test/eigen2/ |
H A D | eigen2_array.cpp | 24 int cols = m.cols(); local 26 MatrixType m1 = MatrixType::Random(rows, cols), 27 m2 = MatrixType::Random(rows, cols), 28 m3(rows, cols); 35 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1); 36 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) ); 59 int cols = m.cols(); local 62 c = ei_random<int>(0, cols [all...] |
H A D | eigen2_basicstuff.cpp | 18 int cols = m.cols(); local 22 MatrixType m1 = MatrixType::Random(rows, cols), 23 m2 = MatrixType::Random(rows, cols), 24 m3(rows, cols), 25 mzero = MatrixType::Zero(rows, cols), 36 c = ei_random<int>(0, cols-1); 68 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1)); 78 if(cols!=1 && rows!=1 && MatrixType::SizeAtCompileTime!=Dynamic) 80 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols [all...] |
H A D | eigen2_lu.cpp | 17 for(int a = 0; a < 3*(m.rows()+m.cols()); a++) 27 i = Eigen::ei_random<int>(0,m.cols()-1); // i is a random column number 29 j = Eigen::ei_random<int>(0,m.cols()-1); 41 int rows = ei_random<int>(20,200), cols = ei_random<int>(20,200), cols2 = ei_random<int>(20,200); local 42 int rank = ei_random<int>(1, std::min(rows, cols)-1); 44 MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1); 45 m1 = MatrixType::Random(rows,cols); 46 if(rows <= cols) 49 for(int i = rank; i < cols; [all...] |
H A D | eigen2_sparse_solvers.cpp | 17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols()); 26 for (int j=0 ; j<sparseMat.cols(); ++j) 33 template<typename Scalar> void sparse_solvers(int rows, int cols) argument 35 double density = std::max(8./(rows*cols), 0.01); 48 SparseMatrix<Scalar> m2(rows, cols); 49 DenseMatrix refMat2 = DenseMatrix::Zero(rows, cols); 75 SparseMatrix<Scalar> m2(rows, cols); 76 DenseMatrix refMat2(rows, cols); 78 DenseVector b = DenseVector::Random(cols); 79 DenseVector refX(cols), [all...] |
H A D | eigen2_sparse_vector.cpp | 12 template<typename Scalar> void sparse_vector(int rows, int cols) argument 14 double densityMat = std::max(8./(rows*cols), 0.01); 22 SparseMatrixType m1(rows,cols); 24 DenseMatrix refM1 = DenseMatrix::Zero(rows, cols);
|