| /external/chromium_org/third_party/WebKit/ManualTests/blackberry/ |
| selection-touch-override.html | 1 <br><textarea cols="45" rows="5">Text Area without override attribute select all this text and tap on the selection, context menu should be shown!</textarea>
2 <br><textarea cols="45" rows="5" data-blackberry-end-selection-on-touch="on">Text Area with override attribute select all this text and tap on the selection, caret should be placed!</textarea>
|
| /cts/tools/signature-tools/templates/ |
| ClassOverviewPage.st | 43 $Table(name="Removed Annotation Fields", rows=removed_annotation_fields:{$it.from:ModelElementRow()$})$
48 $Table(name="Added Annotation Fields", rows=added_annotation_fields:{$it.to:ModelElementRow()$})$
53 $Table(name="Changed Annotation Fields", rows=changed_annotation_fields:DeltaTableRow())$
61 $Table(name="Removed Enum Constants", rows=removed_enum_constants:{$it.from:ModelElementRow()$})$
66 $Table(name="Added Enum Constants", rows=added_enum_constants:{$it.to:ModelElementRow()$})$
71 $Table(name="Changed Enum Constants", rows=changed_enum_constants:DeltaTableRow())$
79 $Table(name="Removed Fields", rows=removed_fields:{$it.from:ModelElementRow()$})$
84 $Table(name="Added Fields", rows=added_fields:{$it.to:ModelElementRow()$})$
89 $Table(name="Changed Fields", rows=changed_fields:DeltaTableRow())$
97 $Table(name="Removed Constructors", rows=removed_constructors:{$it.from:ModelElementRow()$})
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 116 Matrix(unsigned rows, unsigned cols) :
117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) :
123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
124 std::fill(data, data + (rows * cols), initVal);
129 rows(m.rows), cols(m.cols), data(new PBQPNum[rows * cols])
[all...] |
| /external/eigen/test/eigen2/ |
| product.h | 36 int rows = m.rows(); local
41 MatrixType m1 = MatrixType::Random(rows, cols),
42 m2 = MatrixType::Random(rows, cols),
43 m3(rows, cols),
44 mzero = MatrixType::Zero(rows, cols);
46 identity = RowSquareMatrixType::Identity(rows, rows),
47 square = RowSquareMatrixType::Random(rows, rows),
[all...] |
| eigen2_array.cpp | 23 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-1)
[all...] |
| eigen2_cwiseop.cpp | 28 int rows = m.rows(); local
31 MatrixType m1 = MatrixType::Random(rows, cols),
32 m2 = MatrixType::Random(rows, cols),
33 m3(rows, cols),
34 m4(rows, cols),
35 mzero = MatrixType::Zero(rows, cols),
36 mones = MatrixType::Ones(rows, cols),
38 ::Identity(rows, rows),
[all...] |
| eigen2_submatrices.cpp | 21 int rows = m1.rows(); local
25 VERIFY_IS_APPROX(mi, m1.block(1,1,rows-1,cols-1));
48 int rows = m.rows(); local
51 MatrixType m1 = MatrixType::Random(rows, cols),
52 m2 = MatrixType::Random(rows, cols),
53 m3(rows, cols),
54 mzero = MatrixType::Zero(rows, cols),
55 ones = MatrixType::Ones(rows, cols)
[all...] |
| eigen2_triangular.cpp | 20 int rows = m.rows(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols),
25 m3(rows, cols),
26 m4(rows, cols),
27 r1(rows, cols),
28 r2(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
30 mones = MatrixType::Ones(rows, cols)
[all...] |
| /external/eigen/test/ |
| basicstuff.cpp | 21 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
30 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);
31 VectorType v1 = VectorType::Random(rows),
32 vzero = VectorType::Zero(rows);
139 Index rows = m.rows(); local
[all...] |
| mapstaticmethods.cpp | 72 int rows = m.rows(), cols = m.cols(); local
76 PlainObjectType::Map(ptr, rows, cols).setZero();
77 PlainObjectType::MapAligned(ptr, rows, cols).setZero();
78 PlainObjectType::Map(const_ptr, rows, cols).sum();
79 PlainObjectType::MapAligned(const_ptr, rows, cols).sum();
81 PlainObjectType::Map(ptr, rows, cols, InnerStride<>(i)).setZero();
82 PlainObjectType::MapAligned(ptr, rows, cols, InnerStride<>(i)).setZero();
83 PlainObjectType::Map(const_ptr, rows, cols, InnerStride<>(i)).sum();
84 PlainObjectType::MapAligned(const_ptr, rows, cols, InnerStride<>(i)).sum()
[all...] |
| array.cpp | 20 Index rows = m.rows(); local
23 ArrayType m1 = ArrayType::Random(rows, cols),
24 m2 = ArrayType::Random(rows, cols),
25 m3(rows, cols);
27 ColVectorType cv1 = ColVectorType::Random(rows);
35 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1);
37 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1));
38 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1);
39 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) )
91 Index rows = m.rows(); local
156 Index rows = m.rows(); local
218 Index rows = m.rows(); local
238 Index rows = m.rows(); local
[all...] |
| sparse_vector.cpp | 12 template<typename Scalar> void sparse_vector(int rows, int cols)
14 double densityMat = (std::max)(8./(rows*cols), 0.01);
15 double densityVec = (std::max)(8./float(rows), 0.1);
22 SparseMatrixType m1(rows,rows);
23 SparseVectorType v1(rows), v2(rows), v3(rows);
24 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows);
[all...] |
| array_reverse.cpp | 22 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 - 1 - i, cols - 1 - j))
[all...] |
| integer_types.cpp | 27 Index rows = m.rows(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
61 Index rows = m.rows(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols)
[all...] |
| product.h | 35 Index rows = m.rows(); local
40 MatrixType m1 = MatrixType::Random(rows, cols),
41 m2 = MatrixType::Random(rows, cols),
42 m3(rows, cols);
44 identity = RowSquareMatrixType::Identity(rows, rows),
45 square = RowSquareMatrixType::Random(rows, rows),
46 res = RowSquareMatrixType::Random(rows, rows)
[all...] |
| inverse.cpp | 20 Index rows = m.rows(); local
27 MatrixType m1(rows, cols),
28 m2(rows, cols),
29 identity = MatrixType::Identity(rows, rows);
30 createRandomPIMatrixOfRank(rows,rows,rows,m1);
62 VectorType v3 = VectorType::Random(rows);
[all...] |
| 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)
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, rows)
[all...] |
| array_for_matrix.cpp | 20 Index rows = m.rows(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols),
25 m3(rows, cols);
27 ColVectorType cv1 = ColVectorType::Random(rows);
35 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);
36 VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );
63 VERIFY_IS_APPROX(m1.block(0,0,rows,0).rowwise().prod(), ColVectorType::Ones(rows));
81 Index rows = m.rows(); local
149 Index rows = m.rows(); local
[all...] |
| lu.cpp | 22 Index rows, cols, cols2; local
25 rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE);
29 rows = MatrixType::RowsAtCompileTime;
52 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
55 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1));
57 MatrixType m1(rows, cols), m3(rows, cols2);
59 createRandomPIMatrixOfRank(rank, rows, cols, m1);
69 MatrixType u(rows,cols)
137 Index rows = internal::random<Index>(1,4); local
[all...] |
| /external/eigen/bench/ |
| spmv.cpp | 28 // 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, cols, sm)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
| Table_Suite.py | 42 class rows(aetools.ComponentItem): class in inherits:aetools.ComponentItem
43 """rows - """
46 row = rows
66 rows._superclassnames = []
67 rows._privpropdict = {
69 rows._privelemdict = {
89 'crow' : rows,
|
| /external/ceres-solver/internal/ceres/ |
| incomplete_lq_factorization_test.cc | 48 EXPECT_EQ(expected.rows()[i], actual.rows()[i]);
84 int* rows = matrix.mutable_rows(); local
90 rows[i] = idx;
100 rows[10] = idx;
148 for (int idx = matrix.rows()[1]; idx < matrix.rows()[2]; ++idx) {
149 EXPECT_EQ(matrix.cols()[idx], idx - matrix.rows()[1]);
150 EXPECT_EQ(matrix.values()[idx], dense_vector(idx - matrix.rows()[1]));
159 EXPECT_EQ(matrix.cols()[matrix.rows()[2]], 0)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| PlainObjectBase.h | 25 EIGEN_ALWAYS_INLINE void check_rows_cols_for_overflow(Index rows, Index cols)
30 bool error = (rows < 0 || cols < 0) ? true
31 : (rows == 0 || cols == 0) ? false
32 : (rows > max_index / cols);
119 EIGEN_STRONG_INLINE Index rows() const { return m_storage.rows(); } function in class:Eigen::PlainObjectBase
127 return m_storage.data()[row + col * m_storage.rows()];
140 return m_storage.data()[row + col * m_storage.rows()];
153 return m_storage.data()[row + col * m_storage.rows()];
168 : row + col * m_storage.rows()));
[all...] |
| /external/javasqlite/src/main/java/SQLite/ |
| TableResult.java | 39 * Number of rows in the result set.
57 * Rows of the result set. Each row is stored as a String array.
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/chromium-trace/trace-viewer/src/tracing/analysis/ |
| stub_analysis_results.js | 17 rows: []
31 table.rows.push({label: label,
36 table.rows.push({spacing: true});
40 table.rows.push({label: label,
46 table.rows.push({label: label,
|
