| /external/eigen/Eigen/src/Core/ |
| 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...] |
| Array.h | 151 /** constructs an uninitialized matrix with \a rows rows and \a cols columns.
156 Array(Index rows, Index cols);
186 : Base(other.rows() * other.cols(), other.rows(), other.cols())
193 : Base(other.rows() * other.cols(), other.rows(), other.cols())
203 Base::resize(other.rows(), other.cols());
210 : Base(other.derived().rows() * other.derived().cols(), other.derived().rows(), other.derived().cols())
244 * \c ArrayRowsColsType where \c Rows and \c Cols can be \c 2,\c 3,\c 4 for fixed size square matrices or \c X for dynamic size
[all...] |
| Matrix.h | 238 /** \brief Constructs an uninitialized matrix with \a rows rows and \a cols columns.
243 Matrix(Index rows, Index cols);
273 : Base(other.rows() * other.cols(), other.rows(), other.cols())
285 : Base(other.rows() * other.cols(), other.rows(), other.cols())
295 Base::resize(other.rows(), other.cols());
304 : Base(other.derived().rows() * other.derived().cols(), other.derived().rows(), other.derived().cols())
|
| ReturnByValue.h | 63 inline Index cols() const { return static_cast<const Derived*>(this)->cols(); } function in class:Eigen::ReturnByValue
|
| 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);
191 tmp = PlainObject::Constant(rows(),cols(), actual_other);
|
| /external/opencv/cvaux/src/ |
| cvbgfg_codebook.cpp | 105 roi.width = image->cols;
109 CV_ASSERT( (unsigned)roi.x < (unsigned)image->cols &&
112 roi.x + roi.width <= image->cols &&
115 if( image->cols != model->size.width || image->rows != model->size.height )
120 int bufSz = image->cols*image->rows*sizeof(model->cbmap[0]);
123 model->size = cvSize(image->cols, image->rows);
142 CvBGCodeBookElem** cb = model->cbmap + image->cols*(y + roi.y) + roi.x;
241 image->cols == model->size.width && image->rows == model->size.height &&
246 roi.width = image->cols;
250 CV_ASSERT( (unsigned)roi.x < (unsigned)image->cols &
[all...] |
| /external/eigen/test/ |
| 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...] |
| permutationmatrices.cpp | 17 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime,
22 typedef PermutationMatrix<Cols> RightPermutationType;
23 typedef Matrix<int, Cols, 1> RightPermutationVectorType;
27 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++)
43 Matrix<Scalar,Cols,Cols> rm(rp)
[all...] |
| spqr_support.cpp | 18 int cols = internal::random<int>(1,rows); local
19 double density = (std::max)(8./(rows*cols), 0.01);
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineProduct.h | 78 eigen_assert(lhs.cols() == rhs.rows());
101 EIGEN_STRONG_INLINE Index cols() const { function in class:Eigen::internal::SkylineProduct
102 return m_rhs.cols();
138 for (Index col = 0; col < rhs.cols(); col++) {
147 for (Index col = 0; col < rhs.cols(); col++) {
164 for (Index lhscol = 0; lhscol < lhs.cols(); lhscol++) {
167 for (Index rhscol = 0; rhscol < rhs.cols(); rhscol++) {
201 for (Index col = 0; col < rhs.cols(); col++) {
211 for (Index col = 0; col < rhs.cols(); col++) {
229 for (Index lhscol = 0; lhscol < lhs.cols(); lhscol++)
[all...] |
| SkylineMatrix.h | 78 inline Index cols() const { function in class:Eigen::SkylineMatrix
425 const Index stop = m_colStartIndex[cols()];
433 for (Index innerIdx = cols(); innerIdx > inner; innerIdx--) {
513 const Index stop = m_colStartIndex[cols()];
536 if (rows() > cols())
537 m_data.resize(cols(), cols(), rows(), m_colStartIndex[cols()] + 1, m_rowStartIndex[rows()] + 1);
539 m_data.resize(rows(), cols(), rows(), m_colStartIndex[cols()] + 1, m_rowStartIndex[rows()] + 1)
[all...] |
| /external/opencv/ml/src/ |
| ml_inner_functions.cpp | 160 int dim = sample->cols;
220 int dim = sample->cols;
277 int dim = data ? data->cols : 0;
345 CV_ASSERT (center->cols == desired_matrix->cols);
347 dim = desired_matrix->cols;
377 int rows, cols; local
385 cols = matrix->cols;
405 for( j = i+1; j < cols; j++, src += step
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrix.h | 28 Index rows, Index cols, Index depth,
41 ::run(cols,rows,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking,info);
55 static void run(Index rows, Index cols, Index depth,
94 const Index actual_kc = (std::min)(k+kc,depth)-k; // => rows of B', and cols of the A'
137 gebp(res+i, resStride, blockA, blockB, actual_mc, actual_kc, cols, alpha, -1,-1,0,0, w);
154 std::size_t sizeB = kc*cols;
171 pack_rhs(blockB, &rhs(k2,0), rhsStride, actual_kc, cols);
181 // micro vertical panel of the large rhs's panel (e.g., cols/4 times).
185 gebp(res+i2, resStride, blockA, blockB, actual_mc, actual_kc, cols, alpha, -1, -1, 0, 0, blockW);
216 void operator() (Index row, Index rows, Index col=0, Index cols=-1, GemmParallelInfo<Index>* info=0) cons
[all...] |
| /external/ceres-solver/internal/ceres/ |
| block_random_access_diagonal_matrix.cc | 68 int* cols = tsm_->mutable_cols(); local
79 cols[pos] = block_begin + c;
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLFrameSetElement.idl | 25 [Reflect] attribute DOMString cols;
|
| /external/chromium_org/third_party/webrtc/tools/loopback_test/ |
| stat_tracker.js | 82 function allColumns(cols) {
84 for (var i = 1; i < cols; ++i) a.push(i);
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU_MKL.h | 49 static lapack_int blocked_lu(lapack_int rows, lapack_int cols, EIGTYPE* lu_data, lapack_int luStride, lapack_int* row_transpositions, lapack_int& nb_transpositions, lapack_int maxBlockSize=256) \
61 n = cols; \
|
| PartialPivLU.h | 150 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
171 inline Index cols() const { return m_lu.cols(); } function in class:Eigen::PartialPivLU
242 const Index cols = lu.cols(); local
243 const Index size = (std::min)(rows,cols);
249 Index rcols = cols-k-1;
284 * by the variables \a rows, \a cols, \a lu_data, and \a lu_stride using a
298 static Index blocked_lu(Index rows, Index cols, Scalar* lu_data, Index luStride, PivIndex* row_transpositions, PivIndex& nb_transpositions, Index maxBlockSize=256)
300 MapLU lu1(lu_data,StorageOrder==RowMajor?rows:luStride,StorageOrder==RowMajor?luStride:cols);
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSparseProductWithPruning.h | 29 Index cols = rhs.outerSize(); local
46 res.resize(cols, rows);
48 res.resize(rows, cols);
51 double ratioColRes = double(estimated_nnz_prod)/double(lhs.rows()*rhs.cols());
52 for (Index j=0; j<cols; ++j)
55 //double ratioColRes = (double(rhs.innerVector(j).nonZeros()) + double(lhs.nonZeros())/double(lhs.cols()))/double(lhs.rows());
90 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
104 SparseTemporaryType _res(res.rows(), res.cols());
117 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
137 // SparseTemporaryType _res(res.cols(), res.rows())
[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...] |
| ConservativeSparseSparseProduct.h | 25 Index cols = rhs.outerSize(); local
43 for (Index j=0; j<cols; ++j)
139 ColMajorMatrix resCol(lhs.rows(),rhs.cols());
154 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
167 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
179 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
194 ColMajorMatrix resCol(lhs.rows(), rhs.cols());
207 ColMajorMatrix resCol(lhs.rows(), rhs.cols());
220 ColMajorMatrix resCol(lhs.rows(), rhs.cols());
233 RowMajorMatrix resRow(lhs.rows(),rhs.cols());
[all...] |
| /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/eigen/unsupported/test/ |
| sparse_extra.cpp | 54 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/chromium_org/third_party/skia/src/images/ |
| bmpdecoderhelper.cpp | 41 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; ++i)
[all...] |
| /external/eigen/test/eigen2/ |
| gsl_helper.h | 28 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_alloc(rows,cols); }
63 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_complex_alloc(rows,cols); }
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(); ++j
[all...] |
