Searched defs:rows (Results 51 - 75 of 469) sorted by relevance

1234567891011>>

/external/eigen/test/
H A Dstdvector.cpp17 typename MatrixType::Index rows = m.rows(); local
19 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
20 std::vector<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
H A Dstdvector_overload.cpp31 typename MatrixType::Index rows = m.rows(); local
33 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
34 std::vector<MatrixType> v(10, MatrixType(rows,cols)), w(20, y);
H A Dswap.cpp31 typename MatrixType::Index rows = m.rows(); local
35 MatrixType m1 = MatrixType::Random(rows,cols);
36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols);
37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols);
58 m1.swap(m2.block(0,0,rows,cols));
H A Darray_replicate.cpp23 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols);
29 VectorType v1 = VectorType::Random(rows);
37 x1.resize(rows*f1,cols*f2);
40 x1.block(i*rows,j*cols,rows,cols) = m1;
43 x2.resize(2*rows,3*cols);
48 x2.resize(rows,f
[all...]
H A Darray_reverse.cpp22 Index rows = m.rows(); local
27 MatrixType m1 = MatrixType::Random(rows, cols);
28 VectorType v1 = VectorType::Random(rows);
32 for ( int i = 0; i < rows; i++ ) {
34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j));
40 for ( int i = 0; i < rows; i++ ) {
42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j));
48 for ( int i = 0; i < rows; i++ ) {
50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows
[all...]
/external/eigen/unsupported/test/
H A Dkronecker_product.cpp19 void check_dimension(const MatrixType& ab, const int rows, const int cols) argument
21 VERIFY_IS_EQUAL(ab.rows(), rows);
29 VERIFY_IS_EQUAL(ab.rows(), 6);
74 VERIFY_IS_EQUAL(ab.rows(), 12);
115 for(int i=0;i<DM_fix_ab.rows();++i)
/external/javasqlite/src/main/java/SQLite/
H A DTableResult.java39 * Number of rows in the result set.
60 public Vector rows; field in class:TableResult
63 * Maximum number of rows to hold in the table.
69 * Flag to indicate Maximum number of rows condition.
83 * Create an empty result set with maximum number of rows.
98 rows = new Vector();
130 rows.addElement(rowdata);
150 String row[] = (String[]) rows.elementAt(i);
/external/libvpx/libvpx/vp8/common/
H A Ddebugmodes.c16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame) argument
28 for (mb_row = 0; mb_row < rows; mb_row++)
47 for (mb_row = 0; mb_row < rows; mb_row++)
67 for (mb_row = 0; mb_row < rows; mb_row++)
89 for (b_row = 0; b_row < 4 * rows; b_row++)
115 for (mb_row = 0; mb_row < rows; mb_row++)
137 for (b_row = 0; b_row < 4 * rows; b_row++)
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_linear.h63 unsigned rows; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
100 if (t->size < t->stride * t->rows * t->tiles_y)
/external/mesa3d/src/glsl/tests/
H A Dcopy_constant_to_storage_tests.cpp40 void int_test(unsigned rows);
41 void uint_test(unsigned rows);
42 void bool_test(unsigned rows);
44 void float_test(unsigned columns, unsigned rows);
67 copy_constant_to_storage::int_test(unsigned rows) argument
70 generate_data(mem_ctx, GLSL_TYPE_INT, 1, rows, val);
86 copy_constant_to_storage::uint_test(unsigned rows) argument
89 generate_data(mem_ctx, GLSL_TYPE_UINT, 1, rows, val);
105 copy_constant_to_storage::float_test(unsigned columns, unsigned rows) argument
108 generate_data(mem_ctx, GLSL_TYPE_FLOAT, columns, rows, va
124 bool_test(unsigned rows) argument
[all...]
/external/chromium_org/chrome/browser/history/
H A Dhistory_notifications.h44 // Lists the information for each of the URLs affected. The rows will have the
62 // indicating that a subset of history has been deleted. The rows will have
65 URLRows rows; member in struct:history::URLsDeletedDetails
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
H A Dvp9_debugmodes.c31 int rows = cm->mi_rows; local
37 for (mi_row = 0; mi_row < rows; mi_row++) {
57 int rows = cm->mi_rows; local
68 for (mi_row = 0; mi_row < rows; mi_row++) {
/external/chromium_org/third_party/libwebp/dsp/
H A Dneon.h50 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/chromium_org/third_party/skia/include/utils/
H A DSkMeshUtils.h23 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/chromium_org/third_party/skia/src/utils/
H A DSkMeshUtils.cpp21 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/eigen/Eigen/src/Core/
H A DRandom.h31 * 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) argument
51 return NullaryExpr(rows, cols, internal::scalar_random_op<Scalar>());
112 return *this = Random(rows(), cols());
134 * \param nbRows the new number of rows
H A DReturnByValue.h62 inline Index rows() const { return static_cast<const Derived*>(this)->rows(); } function in class:Eigen::ReturnByValue
/external/eigen/Eigen/src/misc/
H A DKernel.h26 MatrixType::ColsAtCompileTime, // the number of rows in the "kernel matrix"
50 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::kernel_retval_base
75 using Base::rows; \
H A DSolve.h44 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::solve_retval_base
69 using Base::rows; \
/external/eigen/bench/
H A Dspmv.cpp28 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
31 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
32 // // lhs._valuePtr(), lhs.rows(), DST, dst_stride);
40 int rows = size; local
51 rows = atoi(argv[i]+1);
76 std::cout << argv[0] << " r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\n";
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
82 EigenSparseMatrix sm(rows,cols);
83 DenseVector dv(cols), res(rows);
91 fillMatrix2(nnzPerCol, rows, col
[all...]
/external/eigen/test/eigen2/
H A Deigen2_array.cpp23 int rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols);
35 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
36 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
58 int rows = m.rows(); local
61 int r = ei_random<int>(0, rows
[all...]
H A Deigen2_basicstuff.cpp17 int rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols),
25 mzero = MatrixType::Zero(rows, cols),
27 ::Identity(rows, rows),
28 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);
[all...]
H A Deigen2_lu.cpp17 for(int a = 0; a < 3*(m.rows()+m.cols()); a++)
20 int i = Eigen::ei_random<int>(0,m.rows()-1); // i is a random row number
23 j = Eigen::ei_random<int>(0,m.rows()-1);
41 int rows = ei_random<int>(20,200), cols = ei_random<int>(20,200), cols2 = ei_random<int>(20,200); local
42 int rank = ei_random<int>(1, std::min(rows, cols)-1);
44 MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1);
45 m1 = MatrixType::Random(rows,cols);
46 if(rows <= cols)
47 for(int i = rank; i < rows;
[all...]
H A Deigen2_sparse_solvers.cpp17 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);
75 SparseMatrix<Scalar> m2(rows, cols);
76 DenseMatrix refMat2(rows, cols);
116 SparseMatrix<Scalar> m2(rows, col
[all...]
H A Deigen2_sparse_vector.cpp12 template<typename Scalar> void sparse_vector(int rows, int cols) argument
14 double densityMat = std::max(8./(rows*cols), 0.01);
15 double densityVec = std::max(8./float(rows), 0.1);
22 SparseMatrixType m1(rows,cols);
23 SparseVectorType v1(rows), v2(rows), v3(rows);
24 DenseMatrix refM1 = DenseMatrix::Zero(rows, cols);
25 DenseVector refV1 = DenseVector::Random(rows),
26 refV2 = DenseVector::Random(rows),
[all...]

Completed in 2585 milliseconds

1234567891011>>