/external/eigen/test/ |
H A D | eigensolver_complex.cpp | 17 by checking that the k-th power sums are equal for k = 1, ..., vec1.rows() */ 25 VERIFY(vec1.rows() == vec2.rows()); 26 for (int k = 1; k <= vec1.rows(); ++k) 39 Index rows = m.rows(); local 45 MatrixType a = MatrixType::Random(rows,cols); 60 ei2.setMaxIterations(ComplexSchur<MatrixType>::m_maxIterationsPerRow * rows).compute(a); 64 if (rows > 2) { 75 MatrixType z = MatrixType::Zero(rows,col [all...] |
H A D | eigensolver_generic.cpp | 21 Index rows = m.rows(); local 29 MatrixType a = MatrixType::Random(rows,cols); 30 MatrixType a1 = MatrixType::Random(rows,cols); 44 VERIFY_IS_APPROX(ei1.eigenvectors().colwise().norm(), RealVectorType::Ones(rows).transpose()); 48 ei2.setMaxIterations(RealSchur<MatrixType>::m_maxIterationsPerRow * rows).compute(a); 52 if (rows > 2) { 63 MatrixType id = MatrixType::Identity(rows, cols); 66 if (rows > 2) 83 MatrixType a = MatrixType::Random(m.rows(), [all...] |
H A D | eigensolver_selfadjoint.cpp | 21 Index rows = m.rows(); local 29 MatrixType a = MatrixType::Random(rows,cols); 30 MatrixType a1 = MatrixType::Random(rows,cols); 34 MatrixType b = MatrixType::Random(rows,cols); 35 MatrixType b1 = MatrixType::Random(rows,cols); 82 MatrixType id = MatrixType::Identity(rows, cols); 102 if (rows > 1)
|
H A D | mapstride.cpp | 56 Index rows = _m.rows(), cols = _m.cols(); local 58 MatrixType m = MatrixType::Random(rows,cols); 60 Index arraysize = 2*(rows+4)*(cols+4); 69 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1)); 88 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4)); 101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2));
|
H A D | nullary.cpp | 20 for (Index i = 0; i < A.rows(); ++i) { 25 for (Index i = 0; i < A.rows(); ++i) { 106 const Index rows = m.rows(); local 110 A.setIdentity(rows, cols); 112 VERIFY(equalsIdentity(MatrixType::Identity(rows, cols)));
|
H A D | product_symm.cpp | 21 Index rows = size; local 24 MatrixType m1 = MatrixType::Random(rows, cols), 25 m2 = MatrixType::Random(rows, cols), m3; 30 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows);
|
H A D | product_trmm.cpp | 13 void trmm(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), argument 24 TriMatrix mat(rows,cols), tri(rows,cols), triTr(cols,rows); 27 OnTheLeft ge_left(otherCols,rows); 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);
|
H A D | sparse_solvers.cpp | 17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols()); 27 for (int i=j ; i<sparseMat.rows(); ++i) 33 template<typename Scalar> void sparse_solvers(int rows, int cols) argument 35 double density = (std::max)(8./(rows*cols), 0.01); 40 DenseVector vec1 = DenseVector::Random(rows); 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()); 80 SparseMatrix<Scalar> matB(rows, row [all...] |
H A D | spqr_support.cpp | 17 int rows = internal::random<int>(1,maxRows); local 18 int cols = internal::random<int>(1,rows); 19 double density = (std::max)(8./(rows*cols), 0.01); 21 A.resize(rows,rows); 22 dA.resize(rows,rows); 25 return rows; 38 int m = A.rows();
|
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_debugmodes.c | 31 int rows = cm->mi_rows; local 37 for (mi_row = 0; mi_row < rows; mi_row++) { 56 int rows = cm->mi_rows; local 67 for (mi_row = 0; mi_row < rows; mi_row++) {
|
/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]; 38 mRowCount = rows; 42 for (int y = 0; y < rows; y++) {
|
/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; 35 rows -= 1; 37 fIndexCount = rows * cols * 6; 54 for (int x = 0; x < rows; x++) { 56 *idx++ = index + rows + 1; 60 *idx++ = index + rows + 1; 61 *idx++ = index + rows + 2; 72 const SkScalar dx = SkIntToScalar(texW) / rows; 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/webp/src/dsp/ |
H A D | neon.h | 50 static WEBP_INLINE int32x4x4_t Transpose4x4(const int32x4x4_t rows) { argument 53 row01.val[0] = vreinterpretq_u64_s32(rows.val[0]); 54 row01.val[1] = vreinterpretq_u64_s32(rows.val[1]); 55 row23.val[0] = vreinterpretq_u64_s32(rows.val[2]); 56 row23.val[1] = vreinterpretq_u64_s32(rows.val[3]);
|
/external/ceres-solver/internal/ceres/ |
H A D | block_random_access_diagonal_matrix.cc | 51 // rows/columns. 67 int* rows = tsm_->mutable_rows(); local 78 rows[pos] = block_begin + r;
|
H A D | block_random_access_sparse_matrix.cc | 55 // rows/columns. 81 int* rows = tsm_->mutable_rows(); local 108 rows[pos] = col_layout[row_block_id] + r; 111 DCHECK_LT(rows[pos], tsm_->num_rows());
|
H A D | block_structure.h | 82 vector<CompressedRow> rows; member in struct:ceres::internal::CompressedRowBlockStructure 86 vector<Block> rows; 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 74 // Build a square sparse diagonal matrix with num_rows rows and 109 const int* rows() const { return &rows_[0]; } function in class:ceres::internal::CompressedRowSparseMatrix 144 // Since the entries of the program are the same for rows with the
|
H A D | dense_sparse_matrix.cc | 68 const int *rows = m.rows(); 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; 131 return m_.rows() - m_.cols(); 133 return m_.rows(); 142 return (m_.rows() - m_.cols()) * m_.cols(); 144 return m_.rows() * m_.cols(); 151 ? m_.rows() [all...] |
H A D | triplet_sparse_matrix.h | 83 // the same number of rows as num_rows_; 91 const int* rows() const { return rows_.get(); } function in class:ceres::internal::TripletSparseMatrix
|
/external/chromium_org/chrome/browser/history/ |
H A D | top_sites_database_unittest.cc | 67 size_t rows = 0; local 68 EXPECT_TRUE(sql::test::CountTableRows(db, "thumbnails", &rows)); 69 EXPECT_EQ(0u, rows);
|
/external/chromium_org/media/cast/test/utility/ |
H A D | barcode.cc | 72 // Now replicate this one row into all rows in kYPlane. 73 for (int row = 0; row < output_frame->rows(VideoFrame::kYPlane); row++) { 157 int rows = frame->rows(VideoFrame::kYPlane); local 161 std::max(0, rows / 2 - 5), 162 std::min(rows, rows / 2 + 5))) { 167 if (DecodeBarCodeRows(frame, output, 0, std::min(5, rows))) {
|
/external/chromium_org/mojo/examples/keyboard/ |
H A D | keys.cc | 168 std::vector<const Row*> rows; local 169 rows.push_back(&kQWERTYRow1); 170 rows.push_back(&kQWERTYRow2); 171 rows.push_back(&kQWERTYRow3); 172 rows.push_back(&kQWERTYRow4); 173 return rows; 177 std::vector<const Row*> rows; local 178 rows.push_back(&kNumericRow1); 179 rows.push_back(&kNumericRow2); 180 rows [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/ |
H A D | HTMLTextAreaElement.h | 41 int rows() const { return m_rows; } function in class:blink::FINAL
|
/external/chromium_org/third_party/WebKit/Source/modules/webdatabase/ |
H A D | SQLStatementBackend.cpp | 171 SQLResultSetRowList* rows = m_resultSet->rows(); local 174 rows->addColumn(statement.getColumnName(i)); 178 rows->addResult(statement.getColumnValue(i)); 207 // sqlite3_total_changes() here instead of sqlite3_changed, because that includes rows modified from within a trigger
|