Searched defs:cols (Results 126 - 150 of 357) sorted by relevance

1234567891011>>

/external/eigen/test/eigen2/
H A Dgsl_helper.h28 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_alloc(rows,cols); } argument
63 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_complex_alloc(rows,cols); } argument
100 res = gsl_matrix_alloc(m.rows(), m.cols());
102 for (int j=0 ; j<m.cols(); ++j)
111 for (int j=0 ; j<res.cols(); ++j)
135 res = gsl_matrix_complex_alloc(m.rows(), m.cols());
137 for (int j=0 ; j<m.cols(); ++j)
149 for (int j=0 ; j<res.cols();
[all...]
/external/eigen/test/
H A Dinteger_types.cpp28 Index cols = m.cols(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
62 Index cols = m.cols(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols),
[all...]
H A Dlu.cpp21 Index rows, cols, cols2; local
32 cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE);
37 cols2 = cols = MatrixType::ColsAtCompileTime;
51 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
54 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1));
56 MatrixType m1(rows, cols), m3(rows, cols2);
57 CMatrixType m2(cols, cols2);
58 createRandomPIMatrixOfRank(rank, rows, cols, m
134 Index cols = rows; local
[all...]
H A Dmapped_matrix.cpp52 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...]
H A Dpermutationmatrices.cpp27 Index cols = m.cols(); local
29 MatrixType m_original = MatrixType::Random(rows,cols);
34 randomPermutationVector(rv, cols);
39 for (int j=0; j<cols; j++)
84 if(rows>1 && cols>1)
96 i = internal::random<Index>(0, cols-1);
97 do j = internal::random<Index>(0, cols-1); while(j==i);
H A Dproduct.h35 Index cols = m.cols(); local
39 MatrixType m1 = MatrixType::Random(rows, cols),
40 m2 = MatrixType::Random(rows, cols),
41 m3(rows, cols);
47 square2 = ColSquareMatrixType::Random(cols, cols),
48 res2 = ColSquareMatrixType::Random(cols, cols);
50 ColVectorType vc2 = ColVectorType::Random(cols), vcre
[all...]
H A Dproduct_selfadjoint.cpp22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
56 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
58 m3.block(1,1,rows-1,cols-1) += v1.tail(rows-1) * v2.head(cols-1).adjoint()+ v2.head(cols-1) * v1.tail(rows-1).adjoint();
H A Dproduct_syrk.cpp22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
26 m3 = MatrixType::Random(rows, cols);
27 RMatrixType rm2 = MatrixType::Random(rows, cols);
29 Rhs1 rhs1 = Rhs1::Random(internal::random<int>(1,320), cols); Rhs1 rhs11 = Rhs1::Random(rhs1.rows(), cols);
30 Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320)); Rhs2 rhs22 = Rhs2::Random(rows, rhs2.cols());
35 Index c = internal::random<Index>(0,cols
[all...]
H A Dqr.cpp18 Index cols = m.cols(); local
23 MatrixType a = MatrixType::Random(rows,cols);
H A Dqr_colpivoting.cpp18 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols2 = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
39 MatrixType m2 = MatrixType::Random(cols,cols2);
41 m2 = MatrixType::Random(cols,cols2);
H A Dqr_fullpivoting.cpp18 Index rows = internal::random<Index>(20,200), cols = internal::random<int>(20,200), cols2 = internal::random<int>(20,200); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
38 for(int i = 0; i < rows; i++) for(int j = 0; j < cols; j++) if(i>j) r(i,j) = Scalar(0);
44 MatrixType m2 = MatrixType::Random(cols,cols2);
46 m2 = MatrixType::Random(cols,cols2);
H A Dredux.cpp19 Index cols = m.cols(); local
21 MatrixType m1 = MatrixType::Random(rows, cols);
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + RealScalar(0.2) * m1;
27 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
28 VERIFY_IS_APPROX(MatrixType::Ones(rows, cols).sum(), Scalar(float(rows*cols))); // the float() here to shut up excessive MSVC warning about int->complex conversion being lossy
30 for(int j = 0; j < cols; j++)
38 const Scalar mean = s/Scalar(RealScalar(rows*cols));
48 Index c0 = internal::random<Index>(0,cols
[all...]
H A Dsparse_permutations.cpp17 const Index cols = ref.cols(); local
24 double density = (std::max)(8./(rows*cols), 0.01);
26 SparseMatrixType mat(rows, cols), up(rows,cols), lo(rows,cols);
28 DenseMatrix mat_d = DenseMatrix::Zero(rows, cols), up_sym_d, lo_sym_d, res_d;
44 randomPermutationVector(pi, cols);
H A Dsparse_vector.cpp12 template<typename Scalar,typename Index> void sparse_vector(int rows, int cols) argument
14 double densityMat = (std::max)(8./(rows*cols), 0.01);
H A Dsparseqr.cpp18 int cols = internal::random<int>(1,maxCols); local
19 double density = (std::max)(8./(rows*cols), 0.01);
21 A.resize(rows,cols);
22 dA.resize(rows,cols);
25 int nop = internal::random<int>(0, internal::random<double>(0,1) > 0.5 ? cols/2 : 0);
28 int j0 = internal::random<int>(0,cols-1);
29 int j1 = internal::random<int>(0,cols-1);
35 // if(rows<cols) {
36 // A.conservativeResize(cols,cols);
[all...]
H A Dstable_norm.cpp56 Index cols = m.cols(); local
69 MatrixType vzero = MatrixType::Zero(rows, cols),
70 vrand = MatrixType::Random(rows, cols),
71 vbig(rows, cols),
72 vsmall(rows,cols);
H A Dtriangular.cpp23 typename MatrixType::Index cols = m.cols(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols),
28 m4(rows, cols),
29 r1(rows, cols),
30 r2(rows, cols);
36 if (rows*cols>1)
66 m1 = MatrixType::Random(rows, cols);
128 Index cols = m.cols(); local
[all...]
H A Dvectorwiseop.cpp22 Index cols = m.cols(); local
24 c = internal::random<Index>(0, cols-1);
26 ArrayType m1 = ArrayType::Random(rows, cols),
27 m2(rows, cols),
28 m3(rows, cols);
31 RowVectorType rowvec = RowVectorType::Random(cols);
127 Index cols = m.cols(); local
129 c = internal::random<Index>(0, cols
[all...]
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DIncompleteLU.h35 Index cols() const { return m_lu.cols(); } function in class:Eigen::IncompleteLU
41 int size = mat.cols();
84 eigen_assert(cols()==b.rows()
/external/eigen/unsupported/test/
H A Dmatrix_exponential.cpp104 typename MatrixType::Index cols = m.cols(); local
105 MatrixType m1(rows, cols), m2(rows, cols), identity = MatrixType::Identity(rows, cols);
110 m1 = MatrixType::Random(rows, cols);
H A Dsparse_extra.cpp54 const Index cols = ref.cols(); local
58 double density = (std::max)(8./(rows*cols), 0.01);
63 SparseMatrixType m(rows, cols);
64 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
118 SparseMatrixType m1(rows,cols), m2(rows,cols);
/external/kernel-headers/original/uapi/linux/
H A Dvirtio_console.h47 __u16 cols; member in struct:virtio_console_config
/external/opencv/cv/src/
H A Dcvadapthresh.cpp53 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/qemu/distrib/sdl-1.2.15/src/video/
H A DSDL_yuv_mmx.c83 int rows, int cols, int mod )
88 unsigned char* y = lum +cols*rows; // Pointer to the end
91 row2 = (Uint32 *)out+cols+mod; // start of second row
92 mod = (mod+cols+mod)*4; // increment for row1 in byte
125 // L2=lum+cols
223 "addl %4,%2\n" // lum += cols
234 "r"(row1),"r"(cols),"r"(row2),"m"(x),"m"(y),"m"(mod),
244 int rows, int cols, int mod )
249 unsigned char* y = lum +cols*rows; /* Pointer to the end */
252 row2 = (Uint16 *)out+cols
80 ColorRGBDitherYV12MMX1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
241 Color565DitherYV12MMX1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
[all...]
/external/skia/src/utils/
H A DSkBoundaryPatch.cpp44 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) { argument
45 if (rows < 2 || cols < 2) {
50 const SkScalar invC = SkScalarInvert(SkIntToScalar(cols - 1));
52 for (int y = 0; y < cols; y++) {

Completed in 245 milliseconds

1234567891011>>