| /external/eigen/test/ |
| product_trmm.cpp | 14 int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE),
26 TriMatrix mat(rows,cols), tri(rows,cols), triTr(cols,rows);
28 OnTheRight ge_right(cols,otherCols);
65 void trmv(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE))
67 trmm<Scalar,Mode,TriOrder,ColMajor,ColMajor,1>(rows,cols,1);
71 void trmm(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int otherCols = internal::random<int>(1,EIGEN_TEST_MAX_SIZE))
73 trmm<Scalar,Mode,TriOrder,OtherOrder,ResOrder,Dynamic>(rows,cols,otherCols);
|
| cholesky.cpp | 68 Index cols = m.cols(); local
75 MatrixType a0 = MatrixType::Random(rows,cols);
77 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
82 MatrixType a1 = MatrixType::Random(rows,cols);
171 MatrixType m1 = MatrixType::Random(rows,cols), m2(rows,cols);
200 Index cols = m.cols(); local
[all...] |
| jacobisvd.cpp | 22 Index cols = m.cols(); local
36 MatrixType sigma = MatrixType::Zero(rows,cols);
53 Index cols = m.cols(); local
54 Index diagSize = (std::min)(rows, cols);
75 Index cols = m.cols(); local
85 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols));
95 if (QRPreconditioner == NoQRPreconditioner && m.rows() != m.cols())
144 Index cols = m.cols(); local
[all...] |
| product_notemporary.cpp | 42 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-c0)
[all...] |
| redux.cpp | 19 Index cols = m.cols(); local
21 MatrixType m1 = MatrixType::Random(rows, cols);
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + Scalar(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-1)
[all...] |
| sparse_product.cpp | 16 int c = internal::random(0,m2.cols()-1);
17 int c1 = internal::random(0,m2.cols()-1);
26 int c1 = internal::random(0,m2.cols()-1);
41 const Index cols = internal::random<int>(1,n); local
46 double density = (std::max)(8./(rows*cols), 0.01);
57 DenseMatrix refMat3 = DenseMatrix::Zero(depth, cols);
58 DenseMatrix refMat3t = DenseMatrix::Zero(cols, depth);
59 DenseMatrix refMat4 = DenseMatrix::Zero(rows, cols);
60 DenseMatrix refMat4t = DenseMatrix::Zero(cols, rows);
61 DenseMatrix refMat5 = DenseMatrix::Random(depth, cols);
[all...] |
| inverse.cpp | 21 Index cols = m.cols(); local
27 MatrixType m1(rows, cols),
28 m2(rows, cols),
63 MatrixType m3 = v3*v3.transpose(), m4(rows,cols);
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 35 Index cols() const { return m_lu.cols(); } function in class:Eigen::IncompleteLU
41 int size = mat.cols();
84 eigen_assert(cols()==b.rows()
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_debugmodes.c | 32 int cols = cm->mi_cols; local
39 for (mi_col = 0; mi_col < cols; mi_col++) {
57 int cols = cm->mi_cols; local
69 for (mi_col = 0; mi_col < cols; mi_col++) {
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 81 ColPivHouseholderQR(Index rows, Index cols)
82 : m_qr(rows, cols),
83 m_hCoeffs((std::min)(rows,cols)),
84 m_colsPermutation(cols),
85 m_colsTranspositions(cols),
86 m_temp(cols),
87 m_colSqNorms(cols),
92 : m_qr(matrix.rows(), matrix.cols()),
93 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
94 m_colsPermutation(matrix.cols()),
257 inline Index cols() const { return m_qr.cols(); } function in class:Eigen::ColPivHouseholderQR
362 Index cols = matrix.cols(); local
461 const int cols = dec().cols(), local
[all...] |
| /external/eigen/Eigen/src/Core/ |
| CwiseNullaryOp.h | 57 CwiseNullaryOp(Index rows, Index cols, const NullaryOp& func = NullaryOp())
58 : m_rows(rows), m_cols(cols), m_functor(func)
62 && cols >= 0
63 && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols));
67 EIGEN_STRONG_INLINE Index cols() const { return m_cols.value(); } function in class:Eigen::CwiseNullaryOp
69 EIGEN_STRONG_INLINE const Scalar coeff(Index rows, Index cols) const
71 return m_functor(rows, cols);
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
[all...] |
| BandMatrix.h | 51 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); }
166 * \param Cols Number of columns, or \b Dynamic
198 template<typename _Scalar, int Rows, int Cols, int Supers, int Subs, int Options>
199 class BandMatrix : public BandMatrixBase<BandMatrix<_Scalar,Rows,Cols,Supers,Subs,Options>
217 inline Index cols() const { return m_coeffs.cols(); } function in class:Eigen::internal::BandMatrix
281 inline Index cols() const { return m_coeffs.cols(); } function in class:Eigen::internal::BandMatrixWrapper
[all...] |
| EigenBase.h | 43 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
46 inline Index cols() const { return derived().cols(); } function in struct:Eigen::EigenBase
47 /** \returns the number of coefficients, which is rows()*cols().
48 * \sa rows(), cols(), SizeAtCompileTime. */
49 inline Index size() const { return rows() * cols(); }
60 typename Dest::PlainObject res(rows(),cols());
70 typename Dest::PlainObject res(rows(),cols());
|
| 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());
135 * \param cols the new number of columns
144 PlainObjectBase<Derived>::setRandom(Index rows, Index cols)
146 resize(rows, cols);
|
| Select.h | 69 eigen_assert(m_condition.cols() == m_then.cols() && m_condition.cols() == m_else.cols());
73 Index cols() const { return m_condition.cols(); } function in class:Eigen::Select
142 derived(), thenMatrix.derived(), ThenDerived::Constant(rows(),cols(),elseScalar));
157 derived(), ElseDerived::Constant(rows(),cols(),thenScalar), elseMatrix.derived());
|
| SelfCwiseBinaryOp.h | 58 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::SelfCwiseBinaryOp
92 && col >= 0 && col < cols());
111 && col >= 0 && col < cols());
136 eigen_assert(rows() == rhs.rows() && cols() == rhs.cols());
176 tmp = PlainObject::Constant(rows(),cols(),other);
188 tmp = PlainObject::Constant(rows(),cols(), NumTraits<Scalar>::IsInteger ? other : Scalar(1)/other);
|
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixMatrix.h | 60 Index rows, Index cols, Index depth,
74 ::run(cols, rows, depth, rhs, rhsStride, lhs, lhsStride, res, resStride, alpha, blocking);
105 Index cols = _cols; local
114 std::size_t sizeB = kc*cols;
146 pack_rhs(blockB, &rhs(actual_k2,0), rhsStride, actual_kc, cols);
176 gebp_kernel(res+startBlock, resStride, blockA, blockB, actualPanelWidth, actualPanelWidth, cols, alpha,
186 gebp_kernel(res+startTarget, resStride, blockA, blockB, lengthTarget, actualPanelWidth, cols, alpha,
201 gebp_kernel(res+i2, resStride, blockA, blockB, actual_mc, actual_kc, cols, alpha, -1, -1, 0, 0, blockW);
234 Index cols = IsLower ? diagSize : _cols; local
243 std::size_t sizeB = kc*cols;
[all...] |
| /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...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrixBase.h | 54 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
60 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
146 /** \returns the number of rows. \sa cols() */
149 inline Index cols() const { return derived().cols(); } function in class:Eigen::SparseMatrixBase
150 /** \returns the number of coefficients, which is \a rows()*cols().
151 * \sa rows(), cols(). */
152 inline Index size() const { return rows() * cols(); }
158 * \code rows()==1 || cols()==1 \endcode
159 * \sa rows(), cols(), IsVectorAtCompileTime. *
[all...] |
| TriangularSolver.h | 33 for(int col=0 ; col<other.cols() ; ++col)
67 for(int col=0 ; col<other.cols() ; ++col)
105 for(int col=0 ; col<other.cols() ; ++col)
107 for(int i=0; i<lhs.cols(); ++i)
137 for(int col=0 ; col<other.cols() ; ++col)
139 for(int i=lhs.cols()-1; i>=0; --i)
168 eigen_assert(m_matrix.cols() == m_matrix.rows() && m_matrix.cols() == other.rows());
219 Rhs res(other.rows(), other.cols());
222 for(int col=0 ; col<other.cols() ; ++col
[all...] |
| /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/Eigen2Support/ |
| Block.h | 43 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
47 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
63 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
67 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
95 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
99 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
116 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
120 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
|
| /external/opencv/cxcore/include/ |
| cxcore.hpp | 214 CvMatrix( int rows, int cols, int type )
215 { matrix = cvCreateMat( rows, cols, type ); }
217 CvMatrix( int rows, int cols, int type, CvMat* hdr,
219 { matrix = cvInitMatHeader( hdr, rows, cols, type, data, step ); }
221 CvMatrix( int rows, int cols, int type, CvMemStorage* storage, bool alloc_data=true );
223 CvMatrix( int rows, int cols, int type, void* data, int step=CV_AUTOSTEP )
224 { matrix = cvCreateMatHeader( rows, cols, type );
260 void create( int rows, int cols, int type )
263 matrix->rows != rows || matrix->cols != cols ||
313 int cols() const { return matrix ? matrix->cols : 0; } function in class:CvMatrix
[all...] |
| /external/ceres-solver/internal/ceres/ |
| 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...] |
| /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;
|
