Searched refs:rows (Results 1 - 25 of 989) sorted by relevance

1234567891011>>

/external/eigen/doc/snippets/
H A DTutorial_commainit_02.cpp1 int rows=5, cols=5; variable
2 MatrixXf m(rows,cols);
5 MatrixXf::Zero(rows-3,3),
6 MatrixXf::Identity(rows-3,cols-3);
H A DMatrix_resize_int.cpp5 cout << "v: " << v.rows() << " rows, " << v.cols() << " cols" << endl;
6 cout << "w: " << w.rows() << " rows, " << w.cols() << " cols" << endl;
H A DMatrix_resize_NoChange_int.cpp3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
H A DMatrix_resize_int_NoChange.cpp3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
H A Dtut_matrix_assignment_resizing.cpp2 std::cout << "a is of size " << a.rows() << "x" << a.cols() << std::endl;
5 std::cout << "a is now of size " << a.rows() << "x" << a.cols() << std::endl;
/external/chromium_org/ui/webui/resources/js/cr/ui/
H A Dfocus_grid.js28 * @param {cr.ui.FocusRow.Observer=} opt_observer An observer of rows.
40 this.rows = [];
49 for (var i = 0; i < this.rows.length; ++i) {
50 for (var j = 0; j < this.rows[i].items.length; ++j) {
51 if (target == this.rows[i].items[j])
60 var rowIndex = this.rows.indexOf(keyRow);
72 row = this.rows.length - 1;
74 if (!this.rows[row])
78 var col = Math.min(colIndex, this.rows[row].items.length - 1);
80 this.rows[ro
[all...]
/external/eigen/test/
H A Dresize.cpp12 template<DenseIndex rows, DenseIndex cols>
15 MatrixXf A(rows, cols);
17 Matrix<double, rows, cols> C;
20 VERIFY(B.rows() == rows && B.cols() == cols);
22 VectorXf x(rows);
25 VERIFY(y.rows() == 1 && y.cols() == rows);
29 VERIFY(x.rows() == cols && x.cols() == 1);
H A Dmiscmatrices.cpp20 Index rows = m.rows(); local
23 Index r = internal::random<Index>(0, rows-1), r2 = internal::random<Index>(0, rows-1), c = internal::random<Index>(0, cols-1);
24 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
25 MatrixType m1 = MatrixType::Ones(rows,cols);
27 VectorType v1 = VectorType::Random(rows);
33 square = MatrixType::Zero(rows, rows);
34 square.diagonal() = VectorType::Ones(rows);
[all...]
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 Dspqr_support.cpp17 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/eigen/failtest/
H A Dmap_nonconst_ctor_on_const_ptr_2.cpp11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument
12 Map<MatrixXf> m(ptr, rows, cols);
H A Dmap_nonconst_ctor_on_const_ptr_3.cpp11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument
12 Map<MatrixXf, Aligned, InnerStride<2> > m(ptr, rows, cols, InnerStride<2>());
H A Dmap_nonconst_ctor_on_const_ptr_4.cpp11 void foo(const float *ptr, DenseIndex rows, DenseIndex cols){ argument
12 Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
/external/eigen/test/eigen2/
H A Deigen2_miscmatrices.cpp21 int rows = m.rows(); local
24 int r = ei_random<int>(0, rows-1), r2 = ei_random<int>(0, rows-1), c = ei_random<int>(0, cols-1);
25 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
26 MatrixType m1 = MatrixType::Ones(rows,cols);
28 VectorType v1 = VectorType::Random(rows);
34 square = MatrixType::Zero(rows, rows);
35 square.diagonal() = VectorType::Ones(rows);
[all...]
H A Deigen2_nomalloc.cpp30 int rows = m.rows(); local
33 MatrixType m1 = MatrixType::Random(rows, cols),
34 m2 = MatrixType::Random(rows, cols),
35 m3(rows, cols),
36 mzero = MatrixType::Zero(rows, cols),
38 ::Identity(rows, rows),
40 ::Random(rows, rows);
[all...]
H A Deigen2_sparse_product.cpp14 const int rows = ref.rows(); local
19 double density = std::max(8./(rows*cols), 0.01);
25 DenseMatrix refMat2 = DenseMatrix::Zero(rows, rows);
26 DenseMatrix refMat3 = DenseMatrix::Zero(rows, rows);
27 DenseMatrix refMat4 = DenseMatrix::Zero(rows, rows);
28 DenseMatrix dm4 = DenseMatrix::Zero(rows, row
[all...]
H A Deigen2_sparse_basic.cpp48 const int rows = ref.rows(); local
53 double density = std::max(8./(rows*cols), 0.01);
58 SparseMatrixType m(rows, cols);
59 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
60 DenseVector vec1 = DenseVector::Random(rows);
88 int i = ei_random<int>(0,rows-1);
90 int h = ei_random<int>(1,rows-i-1);
117 for(int r=0; r<rows; r++)
167 DenseMatrix m1(rows,col
[all...]
H A Deigen2_svd.cpp18 int rows = m.rows(); local
23 MatrixType a = MatrixType::Random(rows,cols);
25 Matrix<Scalar, MatrixType::RowsAtCompileTime, 1>::Random(rows,1);
34 MatrixType sigma = MatrixType::Zero(rows,cols);
35 MatrixType matU = MatrixType::Zero(rows,rows);
37 matU.block(0,0,rows,cols) = svd.matrixU();
42 if (rows==cols)
46 MatrixType a1 = MatrixType::Random(rows,col
[all...]
H A Deigen2_inverse.cpp19 int rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2(rows, cols),
28 mzero = MatrixType::Zero(rows, cols),
29 identity = MatrixType::Identity(rows, rows);
31 while(ei_abs(m1.determinant()) < RealScalar(0.1) && rows <= 8)
33 m1 = MatrixType::Random(rows, cols);
/external/chromium-trace/trace-viewer/src/tracing/analysis/
H A Danalyze_slices_test.js112 assertEquals(3, table.rows.length);
114 assertEquals('b', table.rows[0].text);
115 assertEquals(0, table.rows[1].time);
116 assertAlmostEquals(0.002, table.rows[2].time);
127 assertEquals(4, table.rows.length);
129 assertEquals('b', table.rows[0].text);
130 assertEquals('foo', table.rows[1].text);
131 assertEquals(0, table.rows[2].time);
132 assertAlmostEquals(0.002, table.rows[3].time);
143 assertEquals(6, table.rows
[all...]
/external/eigen/doc/examples/
H A Dclass_Block.cpp8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols) argument
10 return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols);
15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols) argument
17 return Eigen::Block<const Derived>(m.derived(), 0, 0, rows, cols);
/external/chromium_org/chrome/browser/
H A Dremove_rows_table_model.h12 // A table model that also supports removing rows. Used for example for the
18 // Returns whether or not the rows can be removed.
19 virtual bool CanRemoveRows(const Rows& rows) const = 0;
21 // Remove the rows from the table.
22 virtual void RemoveRows(const Rows& rows) = 0;
24 // Removes all the rows.
/external/chromium_org/third_party/WebKit/Source/modules/webdatabase/
H A DSQLResultSet.idl33 readonly attribute SQLResultSetRowList rows;
/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/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...]

Completed in 371 milliseconds

1234567891011>>