Searched refs:cols (Results 26 - 50 of 683) sorted by relevance

1234567891011>>

/external/eigen/test/eigen2/
H A Deigen2_nomalloc.cpp31 int cols = m.cols(); local
33 MatrixType m1 = MatrixType::Random(rows, cols),
34 m2 = MatrixType::Random(rows, cols),
35 m3(rows, cols),
36 mzero = MatrixType::Zero(rows, cols),
48 c = ei_random<int>(0, cols-1);
52 VERIFY_IS_APPROX(m1.cwise() * m1.block(0,0,rows,cols), m1.cwise() * m1);
H A Deigen2_swap.cpp32 int 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 Deigen2_inverse.cpp20 int cols = m.cols(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2(rows, cols),
28 mzero = MatrixType::Zero(rows, cols),
33 m1 = MatrixType::Random(rows, cols);
H A Deigen2_lu.cpp17 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 Deigen2_array.cpp24 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 Deigen2_sparse_solvers.cpp17 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 Deigen2_miscmatrices.cpp22 int cols = m.cols(); local
24 int r = ei_random<int>(0, rows-1), r2 = ei_random<int>(0, rows-1), c = ei_random<int>(0, cols-1);
25 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
26 MatrixType m1 = MatrixType::Ones(rows,cols);
/external/eigen/test/
H A Dupperbidiagonalization.cpp16 const typename MatrixType::Index cols = m.cols(); local
21 MatrixType a = MatrixType::Random(rows,cols);
23 RealMatrixType b(rows, cols);
25 b.block(0,0,cols,cols) = ubd.bidiagonal();
H A Dmapstaticmethods.cpp72 int rows = m.rows(), cols = m.cols(); local
76 PlainObjectType::Map(ptr, rows, cols).setZero();
77 PlainObjectType::MapAligned(ptr, rows, cols).setZero();
78 PlainObjectType::Map(const_ptr, rows, cols).sum();
79 PlainObjectType::MapAligned(const_ptr, rows, cols).sum();
81 PlainObjectType::Map(ptr, rows, cols, InnerStride<>(i)).setZero();
82 PlainObjectType::MapAligned(ptr, rows, cols, InnerStride<>(i)).setZero();
83 PlainObjectType::Map(const_ptr, rows, cols, InnerStride<>(i)).sum();
84 PlainObjectType::MapAligned(const_ptr, rows, cols, InnerStrid
[all...]
H A Darray.cpp20 Index cols = m.cols(); local
22 ArrayType m1 = ArrayType::Random(rows, cols),
23 m2 = ArrayType::Random(rows, cols),
24 m3(rows, cols);
27 RowVectorType rv1 = RowVectorType::Random(cols);
34 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1);
36 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1));
37 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1);
38 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s
94 Index cols = m.cols(); local
161 Index cols = m.cols(); local
223 Index cols = m.cols(); local
242 Index cols = m.cols(); local
[all...]
H A Dspecial_numbers.cpp16 int cols = internal::random<int>(1,300); local
22 MatType m1 = MatType::Random(rows,cols),
23 mnan = MatType::Random(rows,cols),
24 minf = MatType::Random(rows,cols),
25 mboth = MatType::Random(rows,cols);
30 mnan(internal::random<int>(0,rows-1), internal::random<int>(0,cols-1)) = nan;
31 minf(internal::random<int>(0,rows-1), internal::random<int>(0,cols-1)) = inf;
H A Darray_for_matrix.cpp20 Index cols = m.cols(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols);
27 RowVectorType rv1 = RowVectorType::Random(cols);
34 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);
35 VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );
61 VERIFY_IS_APPROX(m1.block(0,0,0,cols).colwise().sum(), RowVectorType::Zero(cols));
81 Index cols = m.cols(); local
150 Index cols = m.cols(); local
192 Index rows = t.rows(), cols = t.cols(); local
[all...]
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 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 Dmiscmatrices.cpp21 Index cols = m.cols(); local
23 Index r = internal::random<Index>(0, rows-1), r2 = internal::random<Index>(0, rows-1), c = internal::random<Index>(0, cols-1);
24 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
25 MatrixType m1 = MatrixType::Ones(rows,cols);
/external/eigen/Eigen/src/Core/products/
H A DParallelizer.h86 void parallelize_gemm(const Functor& func, Index rows, Index cols, bool transpose) argument
96 func(0,rows, 0,cols);
108 return func(0,rows, 0,cols);
110 Index size = transpose ? cols : rows;
120 return func(0,rows, 0,cols);
126 std::swap(rows,cols);
128 Index blockCols = (cols / threads) & ~Index(0x3);
140 Index actualBlockCols = (i+1==threads) ? cols-c0 : blockCols;
146 func(0, cols, r0, actualBlockRows, info);
148 func(r0, actualBlockRows, 0,cols, inf
[all...]
/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/eigen/Eigen/src/QR/
H A DHouseholderQR.h76 HouseholderQR(Index rows, Index cols) argument
77 : m_qr(rows, cols),
78 m_hCoeffs((std::min)(rows,cols)),
79 m_temp(cols),
88 * HouseholderQR<MatrixType> qr(matrix.rows(), matrix.cols());
95 : m_qr(matrix.rows(), matrix.cols()),
96 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
97 m_temp(matrix.cols()),
183 inline Index cols() const { return m_qr.cols(); } function in class:Eigen::HouseholderQR
225 Index cols = mat.cols(); local
264 Index cols = mat.cols(); local
313 const Index rows = dec().rows(), cols = dec().cols(); local
347 Index cols = matrix.cols(); local
[all...]
H A DColPivHouseholderQR.h88 ColPivHouseholderQR(Index rows, Index cols) argument
89 : m_qr(rows, cols),
90 m_hCoeffs((std::min)(rows,cols)),
91 m_colsPermutation(PermIndexType(cols)),
92 m_colsTranspositions(cols),
93 m_temp(cols),
94 m_colSqNorms(cols),
104 * ColPivHouseholderQR<MatrixType> qr(matrix.rows(), matrix.cols());
111 : m_qr(matrix.rows(), matrix.cols()),
112 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
297 inline Index cols() const { return m_qr.cols(); } function in class:Eigen::ColPivHouseholderQR
427 Index cols = matrix.cols(); local
529 const Index cols = dec().cols(), local
[all...]
/external/valgrind/main/drd/tests/
H A Dmatinv.c36 int cols; member in struct:gj_threadinfo
56 static elem_t* new_matrix(const int rows, const int cols) argument
59 assert(cols > 0);
60 return malloc(rows * cols * sizeof(elem_t));
70 static void init_matrix(elem_t* const a, const int rows, const int cols) argument
77 a[i * cols + j] = 1.0 / (1 + abs(i-j));
84 const elem_t* const a, const int rows, const int cols)
90 for (j = 0; j < cols; j++)
92 printf("%g ", a[i * cols + j]);
175 const int cols local
83 print_matrix(const char* const label, const elem_t* const a, const int rows, const int cols) argument
223 gj(elem_t* const a, const int rows, const int cols) argument
[all...]
H A Domp_matinv.c44 static elem_t* new_matrix(const int rows, const int cols) argument
47 assert(cols > 0);
48 return malloc(rows * cols * sizeof(elem_t));
58 static void init_matrix(elem_t* const a, const int rows, const int cols) argument
65 a[i * cols + j] = 1.0 / (1 + abs(i-j));
72 const elem_t* const a, const int rows, const int cols)
78 for (j = 0; j < cols; j++)
80 printf("%g ", a[i * cols + j]);
158 static void gj(elem_t* const a, const int rows, const int cols) argument
169 if (a[k * cols
71 print_matrix(const char* const label, const elem_t* const a, const int rows, const int cols) argument
[all...]
/external/eigen/bench/
H A Dsparse_product.cpp53 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
56 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
101 int cols = SIZE; local
104 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols), sm3(rows,cols), sm4(rows,cols);
111 fillMatrix2(nnzPerCol, rows, cols, sm1);
112 fillMatrix2(nnzPerCol, rows, cols, sm
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/
H A Ddebugmodes.c16 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/libvpx/libvpx/vp8/common/
H A Ddebugmodes.c16 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/eigen/Eigen/src/Eigen2Support/
H A DQR.h37 MatrixType ret = MatrixType::Identity(this->rows(), this->cols());
49 int cols = this->cols(); local
50 return MatrixRBlockType(this->matrixQR(), 0, 0, cols, cols).template triangularView<UpperTriangular>();

Completed in 252 milliseconds

1234567891011>>