/external/eigen/test/ |
H A D | product_trmm.cpp | 14 int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), 24 TriMatrix mat(rows,cols), tri(rows,cols), triTr(cols,rows); 26 OnTheRight ge_right(cols,otherCols); 64 void trmv(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) argument 66 trmm<Scalar,Mode,TriOrder,ColMajor,ColMajor,1>(rows,cols,1); 70 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)) argument 72 trmm<Scalar,Mode,TriOrder,OtherOrder,ResOrder,Dynamic>(rows,cols,otherCols); 13 trmm(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int otherCols = OtherCols==Dynamic?internal::random<int>(1,EIGEN_TEST_MAX_SIZE):OtherCols) argument
|
H A D | sparse_solvers.cpp | 17 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); 64 //Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr 65 MappedSparseMatrix<Scalar> mm2(rows, cols, cm2.nonZeros(), cm2.outerIndexPtr(), cm2.innerIndexPtr(), cm2.valuePtr());
|
H A D | spqr_support.cpp | 18 int cols = internal::random<int>(1,rows); local 19 double density = (std::max)(8./(rows*cols), 0.01);
|
/external/libvpx/libvpx/vp9/common/ |
H A D | 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/replicaisland/src/com/replica/replicaisland/ |
H A D | TiledWorld.java | 35 public TiledWorld(int cols, int rows) { argument 37 mTilesArray = new int[cols][rows]; 39 mColCount = cols; 41 for (int x = 0; x < cols; x++) {
|
/external/skia/include/utils/ |
H A D | SkMeshUtils.h | 23 bool init(int texW, int texH, int rows, int cols) { argument 24 return this->init(NULL, NULL, texW, texH, rows, cols); 28 int texW, int texH, int rows, int cols); 45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
|
/external/skia/src/utils/ |
H A D | SkMeshUtils.cpp | 21 int texW, int texH, int rows, int cols) { 22 if (rows < 2 || cols < 2) { 34 fTexCount = rows * cols; 36 cols -= 1; 37 fIndexCount = rows * cols * 6; 53 for (int y = 0; y < cols; y++) { 73 const SkScalar dy = SkIntToScalar(texH) / cols; 74 for (int y = 0; y <= cols; y++) { 89 int rows, int cols, const SkPoint verts[], 93 if (idx.init(bitmap.width(), bitmap.height(), rows, cols)) { 20 init(SkPoint tex[], uint16_t indices[], int texW, int texH, int rows, int cols) argument 88 Draw(SkCanvas* canvas, const SkBitmap& bitmap, int rows, int cols, const SkPoint verts[], const SkColor colors[], const SkPaint& paint) argument [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | block_random_access_diagonal_matrix.cc | 68 int* cols = tsm_->mutable_cols(); local 79 cols[pos] = block_begin + c;
|
H A D | block_random_access_sparse_matrix.cc | 82 int* cols = tsm_->mutable_cols(); local 109 cols[pos] = col_layout[col_block_id] + c; 112 DCHECK_LT(cols[pos], tsm_->num_rows());
|
H A D | block_structure.h | 81 vector<Block> cols; member in struct:ceres::internal::CompressedRowBlockStructure 87 vector<CompressedColumn> cols; member in struct:ceres::internal::CompressedColumnBlockStructure
|
H A D | compressed_row_sparse_matrix.h | 62 // as the rows and cols matrices do not match the values of 106 const int* cols() const { return &cols_[0]; } function in class:ceres::internal::CompressedRowSparseMatrix
|
H A D | dense_sparse_matrix.cc | 69 const int *cols = m.cols(); local 73 m_(rows[i], cols[i]) += values[i]; 112 m_.resize(m_.rows() + m_.cols(), m_.cols()); 114 m_.block(0, 0, tmp.rows(), tmp.cols()) = tmp; 118 m_.bottomLeftCorner(m_.cols(), m_.cols()) = 119 ConstVectorRef(d, m_.cols()).asDiagonal(); 131 return m_.rows() - m_.cols(); [all...] |
H A D | triplet_sparse_matrix.h | 92 const int* cols() const { return cols_.get(); } function in class:ceres::internal::TripletSparseMatrix
|
/external/chromium_org/third_party/WebKit/Source/core/html/ |
H A D | HTMLTextAreaElement.h | 40 int cols() const { return m_cols; } function in class:blink::FINAL
|
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | UtilsHLSL.cpp | 107 int cols = type.getCols(); local 109 return "float" + str(cols) + "x" + str(rows);
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/arm/neon/ |
H A D | vp9_subtract_neon.c | 17 void vp9_subtract_block_neon(int rows, int cols, argument 23 if (cols > 16) { 25 for (c = 0; c < cols; c += 32) { 47 } else if (cols > 8) { 61 } else if (cols > 4) { 73 for (c = 0; c < cols; ++c)
|
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkBoundaryPatch.cpp | 44 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) { argument 45 if (rows < 2 || cols < 2) { 50 const SkScalar invC = SkScalarInvert(SkIntToScalar(cols - 1)); 52 for (int y = 0; y < cols; y++) {
|
H A D | SkPatchGrid.cpp | 11 SkPatchGrid::SkPatchGrid(int rows, int cols, VertexType flags, SkXfermode* xfer) argument 21 this->reset(rows, cols, flags, xfer); 122 void SkPatchGrid::reset(int rows, int cols, VertexType flags, SkXfermode* xMode) { argument 129 fCols = cols;
|
/external/eigen/Eigen/src/Core/ |
H A D | CwiseUnaryOp.h | 71 EIGEN_STRONG_INLINE Index cols() const { return m_xpr.cols(); } function in class:Eigen::CwiseUnaryOp
|
H A D | DenseStorage.h | 131 static inline DenseIndex cols(void) {return _Cols;} function in class:Eigen::DenseStorage 147 static inline DenseIndex cols(void) {return _Cols;} function in class:Eigen::DenseStorage 178 inline DenseIndex cols() const {return m_cols;} function in class:Eigen::DenseStorage 197 inline DenseIndex cols(void) const {return _Cols;} function in class:Eigen::DenseStorage 216 inline DenseIndex cols(void) const {return m_cols;} function in class:Eigen::DenseStorage 240 inline DenseIndex cols(void) const {return m_cols;} function in class:Eigen::DenseStorage 278 inline DenseIndex cols(void) const {return m_cols;} function in class:Eigen::DenseStorage 314 static inline DenseIndex cols(void) {return _Cols;} function in class:Eigen::DenseStorage
|
H A D | 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());
|
H A D | Flagged.h | 54 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::Flagged
|
H A D | ForceAlignedAccess.h | 45 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::ForceAlignedAccess
|
H A D | NestByValue.h | 46 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::NestByValue
|
H A D | Swap.h | 39 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::SwapWrapper 77 && colId >= 0 && colId < cols()); 98 && colId >= 0 && colId < cols());
|