Searched defs:cols (Results 176 - 200 of 357) sorted by relevance

1234567891011>>

/external/eigen/test/
H A Dcwiseop.cpp73 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, s
[all...]
H A Dhouseholder.cpp22 Index cols = m.cols(); local
34 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols));
52 MatrixType m1(rows, cols),
53 m2(rows, cols);
62 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(m1.block(1,0,rows-1,cols).norm(), m1.norm());
82 m1.setRandom(rows, cols);
83 HBlockMatrixType hbm = m1.block(shift,0,brows,cols);
86 m2.block(shift,0,brows,cols) = qr.matrixQR();
94 m5.block(shift,0,brows,cols)
[all...]
H A Djacobisvd.cpp22 Index cols = m.cols(); local
33 MatrixType sigma = MatrixType::Zero(rows,cols);
50 Index cols = m.cols(); local
51 Index diagSize = (std::min)(rows, cols);
73 Index cols = m.cols(); local
83 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols));
127 Index rank = RankAtCompileTime2==Dynamic ? internal::random<Index>(1,cols)
[all...]
H A Dnomalloc.cpp41 Index cols = m.cols(); local
43 MatrixType m1 = MatrixType::Random(rows, cols),
44 m2 = MatrixType::Random(rows, cols),
45 m3(rows, cols);
50 c = internal::random<Index>(0, cols-1);
54 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), (m1.array()*m1.array()).matrix());
H A Dproduct_extra.cpp22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
26 m3(rows, cols),
27 mzero = MatrixType::Zero(rows, cols),
31 square2 = MatrixType::Random(cols, cols),
32 res2 = MatrixType::Random(cols, cols);
[all...]
H A Dproduct_notemporary.cpp42 Index cols = m.cols(); local
44 ColMajorMatrixType m1 = MatrixType::Random(rows, cols),
45 m2 = MatrixType::Random(rows, cols),
46 m3(rows, cols);
48 ColVectorType cv1 = ColVectorType::Random(cols), cvres(cols);
49 RowMajorMatrixType rm3(rows, cols);
55 Index c0 = internal::random<Index>(4,cols-8),
56 c1 = internal::random<Index>(8,cols
[all...]
H A Dvisitor.cpp18 Index cols = p.cols(); local
22 m = MatrixType::Random(rows, cols);
30 for(Index j = 0; j < cols; j++)
/external/eigen/test/eigen2/
H A Deigen2_sparse_basic.cpp49 const int cols = ref.cols(); local
53 double density = std::max(8./(rows*cols), 0.01);
58 SparseMatrixType m(rows, cols);
59 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
87 int j = ei_random<int>(0,cols-1);
89 int w = ei_random<int>(1,cols-j-1);
111 for(int c=0; c<cols; c++)
167 DenseMatrix m1(rows,cols);
169 SparseMatrixType m2(rows,cols);
[all...]
H A Deigen2_submatrices.cpp22 int cols = m1.cols(); local
25 VERIFY_IS_APPROX(mi, m1.block(1,1,rows-1,cols-1));
49 int cols = m.cols(); local
51 MatrixType m1 = MatrixType::Random(rows, cols),
52 m2 = MatrixType::Random(rows, cols),
53 m3(rows, cols),
54 mzero = MatrixType::Zero(rows, cols),
55 ones = MatrixType::Ones(rows, cols),
[all...]
H A Dproduct.h37 int cols = m.cols(); local
41 MatrixType m1 = MatrixType::Random(rows, cols),
42 m2 = MatrixType::Random(rows, cols),
43 m3(rows, cols),
44 mzero = MatrixType::Zero(rows, cols);
50 square2 = ColSquareMatrixType::Random(cols, cols),
51 res2 = ColSquareMatrixType::Random(cols, cols);
[all...]
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DConstrainedConjGrad.h55 Index rows = C.rows(), cols = C.cols(); local
57 TmpVec d(rows), e(rows), l(cols), p(rows), q(rows), r(rows);
124 SparseMatrix<Scalar,RowMajor> CINV(C.rows(), C.cols());
/external/eigen/unsupported/Eigen/src/Skyline/
H A DSkylineMatrixBase.h38 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
44 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
104 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
110 inline Index cols() const { function in class:Eigen::SkylineMatrixBase
111 return derived().cols();
114 /** \returns the number of coefficients, which is \a rows()*cols().
115 * \sa rows(), cols(), SizeAtCompileTime. */
117 return rows() * cols();
129 return (int(Flags) & RowMajorBit) ? this->rows() : this->cols();
133 * i.e., the number of rows for a columns major matrix, and the number of cols otherwis
[all...]
/external/eigen/unsupported/test/
H A Djacobisvd.cpp40 if (QRPreconditioner == NoQRPreconditioner && m.rows() != m.cols())
55 MatrixType m = pickrandom ? MatrixType::Random(a.rows(), a.cols()) : a;
72 Index cols = m.cols(); local
79 MatrixType a = MatrixType::Zero(rows, cols);
H A Dsvd_common.h31 Index cols = m.cols(); local
42 MatrixType sigma = MatrixType::Zero(rows, cols);
61 Index cols = m.cols(); local
62 Index diagSize = (std::min)(rows, cols);
85 Index cols = m.cols(); local
95 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols));
133 Index diagSize = (std::min)(m.rows(), m.cols());
145 Index cols = m.cols(); local
[all...]
/external/libhevc/decoder/x86/
H A Dihevcd_fmt_conv_ssse3_intr.c63 WORD32 num_rows, num_cols, src_strd, dst_strd, cols, rows; local
66 cols = 0;
128 cols = num_cols >> 4;
143 for(j = 0; j < cols; j++)
219 for(j = 0; j < cols; j++)
250 pu1_u_dst += (cols << 4);
251 pu1_v_dst += (cols << 4);
252 pu1_u_src += 2 * (cols << 4);
253 pu1_v_src += 2 * (cols << 4);
/external/opencv/cxcore/src/
H A Dcximage.cpp88 CV_CALL( img = cvCreateImageHeader( cvSize(m->cols,m->rows),
215 CvMatrix::CvMatrix( int rows, int cols, int type, CvMemStorage* storage, bool alloc_data ) argument
220 cvInitMatHeader( matrix, rows, cols, type, alloc_data ?
221 cvMemStorageAlloc( storage, rows*cols*CV_ELEM_SIZE(type) ) : 0 );
242 CV_CALL( m = cvCreateMat( src->rows, src->cols, src->type ));
275 CV_CALL( temp_mat = cvCreateMat( m->rows, m->cols,
/external/ceres-solver/internal/ceres/
H A Dincomplete_lq_factorization.cc70 const int* a_cols = a.cols();
74 const int* b_cols = b.cols();
120 int* cols = matrix->mutable_cols(); local
154 cols[num_nonzeros] = entry.first;
173 const int* cols = matrix.cols(); local
212 q_i(cols[idx]) = values[idx];
/external/chromium_org/third_party/angle/src/compiler/translator/
H A DStructureHLSL.cpp302 int cols = ctorType.getCols(); local
307 for (int col = 0; col < cols; col++)
313 if (row < rows - 1 || col < cols - 1)
322 for (int col = 0; col < cols; col++)
335 if (row < rows - 1 || col < cols - 1)
344 ASSERT(rows == 2 && cols == 2 && parameter.isVector() && parameter.getNominalSize() == 4);
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
H A Dvp9_idct.h117 transform_1d cols, rows; // vertical and horizontal member in struct:__anon13123
124 high_transform_1d cols, rows; // vertical and horizontal member in struct:__anon13124
/external/chromium_org/third_party/skia/src/images/
H A Dbmpdecoderhelper.cpp41 int cols = 0; local
56 cols = GetInt();
78 if (cols < 0 || cols > 256) {
82 if (cols == 0 && bpp_ <= 8) {
83 cols = 1 << bpp_;
85 if (bpp_ <= 8 || cols > 0) {
90 if (cols > 0) {
91 if (pos_ + (cols * colLen) > len_) {
94 for (int i = 0; i < cols;
[all...]
/external/e2fsprogs/ext2ed/
H A Dfile_com.c320 long offset=0,last_offset,l=0,cols=0; local
336 if (cols==SHOW_PAD_COLS-1) {
338 l++;cols=0;
352 l++;cols=0;
368 offset++;cols++;ch_ptr++;
/external/eigen/Eigen/src/Core/
H A DBandMatrix.h51 using Base::cols;
85 { return Block<CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
89 { return Block<const CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
136 dst.resize(rows(),cols());
147 DenseMatrixType res(rows(),cols());
155 { return i<0 ? (std::min)(cols(),rows()+i) : (std::min)(rows(),cols()-i); }
207 inline BandMatrix(Index rows=Rows, Index cols=Cols, Index supers=Supers, Index subs=Subs) argument
208 : m_coeffs(1+supers+subs,cols),
217 inline Index cols() cons function in class:Eigen::internal::BandMatrix
269 BandMatrixWrapper(const CoefficientsType& coeffs, Index rows=_Rows, Index cols=_Cols, Index supers=_Supers, Index subs=_Subs) argument
281 inline Index cols() const { return m_coeffs.cols(); } function in class:Eigen::internal::BandMatrixWrapper
[all...]
H A DCwiseBinaryOp.h131 eigen_assert(aLhs.rows() == aRhs.rows() && aLhs.cols() == aRhs.cols());
141 EIGEN_STRONG_INLINE Index cols() const { function in class:Eigen::CwiseBinaryOp
144 return m_rhs.cols();
146 return m_lhs.cols();
H A DCwiseNullaryOp.h67 EIGEN_STRONG_INLINE Index cols() const { return m_cols.value(); } function in class:Eigen::CwiseNullaryOp
103 * The parameters \a rows and \a cols are the number of rows and of columns of
107 * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used
117 DenseBase<Derived>::NullaryExpr(Index rows, Index cols, const CustomNullaryOp& func) argument
119 return CwiseNullaryOp<CustomNullaryOp, Derived>(rows, cols, func);
300 for(Index j = 0; j < cols(); ++j)
334 return derived() = Constant(rows(), cols(), val);
414 * The parameters \a rows and \a cols are the number of rows and of columns of
418 * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used
484 for(Index j = 0; j < cols();
[all...]
H A DDiagonalMatrix.h57 inline Index cols() const { return diagonal().size(); } function in class:Eigen::DiagonalBase
295 if(cols() != rows()) return false;
297 for(Index j = 0; j < cols(); ++j)
302 for(Index j = 0; j < cols(); ++j)

Completed in 2492 milliseconds

1234567891011>>