Searched defs:cols (Results 251 - 275 of 357) sorted by relevance

<<1112131415

/external/chromium_org/third_party/libvpx/source/libvpx/vpx/
H A Dvp8cx.h244 unsigned int cols; /**< Number of columns. */ member in struct:vpx_roi_map
264 unsigned int cols; /**< number of cols */ member in struct:vpx_active_map
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Duniform_query.cpp386 unsigned rows, unsigned cols, unsigned count,
394 const unsigned elems = rows * cols * count;
395 const char *const extra = (cols == 1) ? "uniform" : "uniform matrix";
825 * Note: cols=2, rows=4 ==> array[2] of vec4
829 GLuint cols, GLuint rows,
859 if (vectors != cols || components != rows) {
912 for (unsigned c = 0; c < cols; c++) {
385 log_uniform(const void *values, enum glsl_base_type basicType, unsigned rows, unsigned cols, unsigned count, bool transpose, const struct gl_shader_program *shProg, GLint location, const struct gl_uniform_storage *uni) argument
828 _mesa_uniform_matrix(struct gl_context *ctx, struct gl_shader_program *shProg, GLuint cols, GLuint rows, GLint location, GLsizei count, GLboolean transpose, const GLfloat *values) argument
/external/chromium_org/ui/app_list/views/
H A Dapps_grid_view.h76 void SetLayout(int cols, int rows_per_page);
78 int cols() const { return cols_; } function in class:app_list::AppsGridView
/external/eigen/Eigen/src/Cholesky/
H A DLDLT.h102 : m_matrix(matrix.rows(), matrix.cols()),
224 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::LDLT
265 eigen_assert(mat.rows()==mat.cols());
357 eigen_assert(mat.cols() == size && w.size()==size);
437 eigen_assert(a.rows()==a.cols());
H A DLLT.h90 : m_matrix(matrix.rows(), matrix.cols()),
171 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::LLT
203 Index n = mat.cols();
270 eigen_assert(mat.rows()==mat.cols());
295 eigen_assert(m.rows()==m.cols());
387 eigen_assert(a.rows()==a.cols());
409 eigen_assert(v.size()==m_matrix.cols());
/external/eigen/Eigen/src/CholmodSupport/
H A DCholmodSupport.h57 res.ncol = mat.cols();
128 res.ncol = mat.cols();
194 inline Index cols() const { return m_cholmodFactor->n; } function in class:Eigen::CholmodBase
309 dest = Matrix<Scalar,Dest::RowsAtCompileTime,Dest::ColsAtCompileTime>::Map(reinterpret_cast<Scalar*>(x_cd->x),b.rows(),b.cols());
/external/eigen/Eigen/src/Core/
H A DBlock.h118 ||((BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) && i<xpr.cols())));
128 && a_startCol >= 0 && BlockCols >= 1 && a_startCol + BlockCols <= xpr.cols());
141 && a_startCol >= 0 && blockCols >= 0 && a_startCol <= xpr.cols() - blockCols);
188 m_blockCols(BlockCols==1 ? 1 : xpr.cols())
208 inline Index cols() const { return m_blockCols.value(); } function in class:Eigen::internal::BlockImpl_dense
330 BlockCols==1 ? 1 : xpr.cols()),
H A DPermutationMatrix.h111 inline Index cols() const { return Index(indices().size()); } function in class:Eigen::PermutationBase
223 eigen_assert(lhs.cols() == rhs.rows());
263 * \param SizeAtCompileTime the number of rows/cols, or Dynamic
264 * \param MaxSizeAtCompileTime the maximum number of rows/cols, or Dynamic. This optional parameter defaults to SizeAtCompileTime. Most of the time, you should not have to specify it.
551 inline Index cols() const { return m_matrix.cols(); } function in struct:Eigen::internal::permut_matrix_product_retval
555 const Index n = Side==OnTheLeft ? rows() : cols();
640 inline int cols() const { return m_permutation.cols(); } function in class:Eigen::Transpose
H A DProductBase.h93 eigen_assert(a_lhs.cols() == a_rhs.rows()
99 inline Index cols() const { return m_rhs.cols(); } function in class:Eigen::ProductBase
119 m_result.resize(m_lhs.rows(), m_rhs.cols());
141 eigen_assert(this->rows() == 1 && this->cols() == 1);
150 eigen_assert(this->rows() == 1 && this->cols() == 1);
158 eigen_assert(this->rows() == 1 && this->cols() == 1);
165 eigen_assert(this->rows() == 1 && this->cols() == 1);
H A DTranspose.h69 inline Index rows() const { return m_matrix.cols(); }
70 inline Index cols() const { return m_matrix.rows(); } function in class:Eigen::Transpose
263 if (m.rows()==m.cols())
294 eigen_assert((rows() == cols() || (RowsAtCompileTime == Dynamic && ColsAtCompileTime == Dynamic))
/external/eigen/Eigen/src/Core/products/
H A DGeneralMatrixVector.h52 Index rows, Index cols,
60 Index rows, Index cols,
129 skipColumns = (std::min)(skipColumns,cols);
134 || (skipColumns + columnsAtOnce >= cols)
148 Index columnBound = ((cols-skipColumns)/columnsAtOnce)*columnsAtOnce + skipColumns;
243 Index end = cols;
315 Index rows, Index cols,
324 Index rows, Index cols,
352 const Index depth = cols;
59 run( Index rows, Index cols, const LhsScalar* lhs, Index lhsStride, const RhsScalar* rhs, Index rhsIncr, ResScalar* res, Index resIncr, RhsScalar alpha) argument
323 run( Index rows, Index cols, const LhsScalar* lhs, Index lhsStride, const RhsScalar* rhs, Index rhsIncr, ResScalar* res, Index resIncr, ResScalar alpha) argument
H A DTriangularMatrixVector.h41 Index cols = IsLower ? (std::min)(_rows,_cols) : _cols; local
44 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
48 const RhsMap rhs(_rhs,cols,InnerStride<>(rhsIncr));
78 if((!IsLower) && cols>size)
81 rows, cols-size,
109 Index cols = IsLower ? diagSize : _cols; local
112 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
116 const RhsMap rhs(_rhs,cols);
135 Index r = IsLower ? pi : cols - pi - actualPanelWidth;
149 rows-diagSize, cols,
[all...]
/external/eigen/Eigen/src/IterativeLinearSolvers/
H A DIncompleteLUT.h124 Index cols() const { return m_lu.cols(); } function in class:Eigen::IncompleteLUT
173 eigen_assert(cols()==b.rows()
248 eigen_assert((amat.rows() == amat.cols()) && "The factorization should be done on a square matrix");
249 Index n = amat.cols(); // Size of the matrix
/external/eigen/Eigen/src/LU/
H A DFullPivLU.h80 FullPivLU(Index rows, Index cols);
315 return cols() - rank();
328 return rank() == cols();
353 return isInjective() && (m_lu.rows() == m_lu.cols());
366 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
368 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
374 inline Index cols() const { return m_lu.cols(); } function in class:Eigen::FullPivLU
394 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols) argument
395 : m_lu(rows, cols),
429 const Index cols = matrix.cols(); local
556 const Index cols = dec().matrixLU().cols(), dimker = cols - rank(); local
682 const Index rows = dec().rows(), cols = dec().cols(), local
[all...]
/external/eigen/Eigen/src/PaStiXSupport/
H A DPaStiXSupport.h206 inline Index cols() const { return m_size; } function in class:Eigen::PastixBase
317 eigen_assert(mat.rows() == mat.cols() && "The input matrix should be squared");
397 for (int i = 0; i < b.cols(); i++){
/external/eigen/Eigen/src/QR/
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...]
H A DFullPivHouseholderQR.h94 FullPivHouseholderQR(Index rows, Index cols) argument
95 : m_qr(rows, cols),
96 m_hCoeffs((std::min)(rows,cols)),
97 m_rows_transpositions((std::min)(rows,cols)),
98 m_cols_transpositions((std::min)(rows,cols)),
99 m_cols_permutation(cols),
100 m_temp(cols),
110 * FullPivHouseholderQR<MatrixType> qr(matrix.rows(), matrix.cols());
117 : m_qr(matrix.rows(), matrix.cols()),
118 m_hCoeffs((std::min)(matrix.rows(), matrix.cols())),
293 inline Index cols() const { return m_qr.cols(); } function in class:Eigen::FullPivHouseholderQR
412 Index cols = matrix.cols(); local
498 const Index rows = dec().rows(), cols = dec().cols(); local
571 const Index cols = m_qr.cols(); local
584 Index cols() const { return m_qr.rows(); } function in struct:Eigen::internal::FullPivHouseholderQRMatrixQReturnType
[all...]
/external/eigen/Eigen/src/SPQRSupport/
H A DSuiteSparseQRSupport.h106 Index col = matrix.cols();
128 inline Index cols() const { return m_cR->ncol; } function in class:Eigen::SPQR
147 eigen_assert(b.cols()==1 && "This method is for vectors only");
155 y.bottomRows(cols()-rk).setZero();
157 dest.topRows(cols()) = colsPermutation() * y.topRows(cols());
190 * It should be equal to matrixQR().cols if the matrix is full-rank
244 inline Index rows() const { return m_transpose ? m_spqr.rows() : m_spqr.cols(); }
245 inline Index cols() const { return m_other.cols(); } function in struct:Eigen::SPQR_QProduct
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparseMatrixBase.h54 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
60 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
149 /** \returns the number of rows. \sa cols() */
152 inline Index cols() const { return derived().cols(); } function in class:Eigen::SparseMatrixBase
153 /** \returns the number of coefficients, which is \a rows()*cols().
154 * \sa rows(), cols(). */
155 inline Index size() const { return rows() * cols(); }
161 * \code rows()==1 || cols()==1 \endcode
162 * \sa rows(), cols(), IsVectorAtCompileTim
[all...]
H A DSparseSelfAdjointView.h62 eigen_assert(rows()==cols() && "SelfAdjointView is only for squared matrices");
66 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::SparseSelfAdjointView
132 SparseMatrix<DestScalar,ColMajor,Index> tmp(_dest.rows(),_dest.cols());
483 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::SparseSymmetricPermutationProduct
/external/eigen/Eigen/src/SparseLU/
H A DSparseLU_SupernodalMatrix.h83 Index cols() { return m_col; } function in class:Eigen::internal::MappedSuperNodalMatrix
237 Index nrhs = X.cols();
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
H A DMatrixPower.h32 Index cols() const { return m_pow.cols(); } function in class:Eigen::MatrixPowerRetval
74 { eigen_assert(T.rows() == T.cols()); }
100 res = (MatrixType::Identity(IminusT.rows(), IminusT.cols()) + res).template triangularView<Upper>()
103 res += MatrixType::Identity(IminusT.rows(), IminusT.cols());
116 for (Index i=1; i < m_A.cols(); ++i) {
155 for (Index i=0; i < m_A.cols(); ++i)
159 IminusT = MatrixType::Identity(m_A.rows(), m_A.cols()) - T;
298 { eigen_assert(A.rows() == A.cols()); }
321 Index cols() cons function in class:Eigen::MatrixPower
483 Index cols() const { return m_A.cols(); } function in class:Eigen::MatrixPowerReturnValue
[all...]
/external/eigen/unsupported/Eigen/src/SVD/
H A DJacobiSVD.h79 if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols())
82 ::new (&m_qr) QRType(svd.rows(), svd.cols());
89 if(matrix.rows() > matrix.cols())
92 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
124 if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols())
127 ::new (&m_qr) QRType(svd.cols(), svd.rows());
129 m_adjoint.resize(svd.cols(), sv
540 JacobiSVD(Index rows, Index cols, unsigned int computationOptions = 0) argument
621 allocate(Index rows, Index cols, unsigned int computationOptions) argument
[all...]
/external/libedit/src/
H A Dfilecomplete.c360 size_t line, lines, col, cols, thisguy; local
371 cols = (size_t)screenwidth / (width + 1);
372 if (cols == 0)
373 cols = 1;
376 lines = (num + cols - 1) / cols;
385 for (col = 0; col < cols; col++) {
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/
H A Dhelp.c76 int cols = 1, rows; local
86 cols = max_cols / space;
87 rows = (cmds->cnt + cols - 1) / cols;
92 for (j = 0; j < cols; j++) {
98 if (j == cols-1 || n + rows >= cmds->cnt)

Completed in 1594 milliseconds

<<1112131415