| /external/chromium_org/chrome/browser/resources/net_internals/ |
| bandwidth_view.html | 12 <tr jsselect="rows">
|
| bandwidth_view.js | 80 var rows = [];
81 rows.push({
86 rows.push({
91 rows.push({
98 rows.push({
105 var input = new JsEvalContext({rows: rows});
|
| /external/chromium_org/third_party/WebKit/Source/web/tests/data/ |
| select_range_textarea_overflow.html | 4 <textarea id='target' rows='2' cols='3'>
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| analyze7.test | 40 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1a (a=?) (~10 rows)}}
43 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1b (b=?) (~10 rows)}}
46 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1cd (c=?) (~10 rows)}}
56 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1a (a=?) (~1 rows)}}
59 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1b (b=?) (~10 rows)}}
62 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1cd (c=?) (~10 rows)}}
69 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1a (a=?) (~1 rows)}}
78 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1a (a=?) (~1 rows)}}
81 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1b (b=?) (~10 rows)}}
84 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1cd (c=?) (~86 rows)}}
[all...] |
| indexedby.test | 45 } {0 0 0 {SEARCH TABLE t1 USING INDEX i1 (a=?) (~10 rows)}}
48 } {0 0 0 {SCAN TABLE t1 (~1000000 rows)}}
52 0 0 1 {SEARCH TABLE t2 USING INDEX i3 (c=?) (~10 rows)}
53 0 1 0 {SCAN TABLE t1 (~1000000 rows)}
88 } {0 0 0 {SCAN TABLE t1 (~10000 rows)}}
92 } {0 0 0 {SEARCH TABLE t1 USING INDEX i1 (a=?) (~2 rows)}}
96 } {0 0 0 {SEARCH TABLE t1 USING INDEX i2 (b=?) (~2 rows)}}
113 } {0 0 0 {SCAN TABLE t3 USING INDEX sqlite_autoindex_t3_1 (~1000000 rows)}}
117 } {0 0 0 {SEARCH TABLE t3 USING INDEX sqlite_autoindex_t3_1 (e=?) (~1 rows)}}
130 0 0 0 {SCAN TABLE t1 (~1000000 rows)}
[all...] |
| analyze2.test | 127 0 0 0 {SEARCH TABLE t1 USING INDEX t1_y (y>?) (~100 rows)}
132 0 0 0 {SEARCH TABLE t1 USING INDEX t1_x (x>?) (~100 rows)}
137 0 0 0 {SEARCH TABLE t1 USING INDEX t1_y (y>?) (~100 rows)}
142 0 0 0 {SEARCH TABLE t1 USING INDEX t1_x (x>?) (~100 rows)}
147 0 0 0 {SEARCH TABLE t1 USING INDEX t1_x (x>? AND x<?) (~25 rows)}
152 0 0 0 {SEARCH TABLE t1 USING INDEX t1_y (y>? AND y<?) (~75 rows)}
157 0 0 0 {SEARCH TABLE t1 USING INDEX t1_x (x>? AND x<?) (~12 rows)}
162 0 0 0 {SEARCH TABLE t1 USING INDEX t1_y (y>? AND y<?) (~12 rows)}
167 0 0 0 {SEARCH TABLE t1 USING INDEX t1_x (x>? AND x<?) (~12 rows)}
172 0 0 0 {SEARCH TABLE t1 USING INDEX t1_y (y>? AND y<?) (~12 rows)}
[all...] |
| /external/eigen/bench/ |
| basicbenchmark.h | 43 const int rows = mat.rows(); local
46 MatrixType I(rows,cols);
47 MatrixType m(rows,cols);
|
| sparse_product.cpp | 53 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
56 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
57 // // lhs._valuePtr(), lhs.rows(), DST, dst_stride);
100 int rows = SIZE; local
104 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols), sm3(rows,cols), sm4(rows,cols);
111 fillMatrix2(nnzPerCol, rows, cols, sm1);
112 fillMatrix2(nnzPerCol, rows, cols, sm2)
[all...] |
| BenchUtil.h | 24 mat.setRandom();// = MatrixType::random(mat.rows(), mat.cols());
51 dst.resize(src.rows(),src.cols());
53 for (int i=0; i<src.rows(); ++i)
67 for (int i=0; i<src.rows(); ++i)
78 dst.resize(src.rows(),src.cols());
80 for (int i=0; i<src.rows(); ++i)
|
| bench_reverse.cpp | 20 int rows = m.rows(); local
25 MatrixType a = MatrixType::Random(rows,cols);
26 MatrixType b = MatrixType::Random(rows,cols);
31 int r = internal::random<int>(0,rows-1);
50 std::cout << rows << " x " << cols << " \t"
|
| /external/eigen/test/eigen2/ |
| eigen2_sum.cpp | 16 int rows = m.rows(); local
19 MatrixType m1 = MatrixType::Random(rows, cols);
21 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
22 VERIFY_IS_APPROX(MatrixType::Ones(rows, cols).sum(), Scalar(float(rows*cols))); // the float() here to shut up excessive MSVC warning about int->complex conversion being lossy
24 for(int i = 0; i < rows; i++) for(int j = 0; j < cols; j++) x += m1(i,j);
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 85 MatrixType result(A.rows(), A.rows());
86 if (A.rows() == 1)
88 else if (A.rows() == 2)
140 RealScalar normTminusI = (T - MatrixType::Identity(T.rows(), T.rows())).cwiseAbs().colwise().sum().maxCoeff();
241 MatrixType TminusI = T - MatrixType::Identity(T.rows(), T.rows());
242 result.setZero(T.rows(), T.rows());
456 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixLogarithmReturnValue
[all...] |
| /external/eigen/test/ |
| 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(),m.cols())
[all...] |
| linearstructure.cpp | 21 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols);
33 Index r = internal::random<Index>(0, rows-1),
65 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
66 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), m1.cwiseProduct(m1));
67 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1);
68 VERIFY_IS_APPROX(m1.block(0,0,rows,cols) * s1, m1 * s1)
[all...] |
| qr.cpp | 17 Index rows = m.rows(); local
23 MatrixType a = MatrixType::Random(rows,cols);
35 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
37 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random();
38 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
40 Matrix<Scalar,Rows,Cols> r = qr.matrixQR();
42 for(int i = 0; i < Rows; i++) for(int j = 0; j < Cols; j++) if(i>j) r(i,j) = Scalar(0);
47 Matrix<Scalar,Rows,Cols2> m3 = m1*m2
[all...] |
| sizeoverflow.cpp | 24 void triggerMatrixBadAlloc(Index rows, Index cols)
26 VERIFY_THROWS_BADALLOC( MatrixType m(rows, cols) );
27 VERIFY_THROWS_BADALLOC( MatrixType m; m.resize(rows, cols) );
28 VERIFY_THROWS_BADALLOC( MatrixType m; m.conservativeResize(rows, cols) );
41 // there are 2 levels of overflow checking. first in PlainObjectBase.h we check for overflow in rows*cols computations.
|
| sparseqr.cpp | 17 int rows = internal::random<int>(1,maxRows); local
19 double density = (std::max)(8./(rows*cols), 0.01);
21 A.resize(rows,cols);
22 dA.resize(rows,cols);
35 // if(rows<cols) {
38 // dA.bottomRows(cols-rows).setZero();
41 return rows;
88 idM.resize(Q.rows(), Q.rows()); idM.setIdentity();
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineMatrixBase.h | 35 /**< The number of rows at compile-time. This is just a copy of the value provided
38 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
44 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
50 * rows times the number of columns, or to \a Dynamic if this is not
60 /**< This is set to true if either the number of rows or the number of
104 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
105 inline Index rows() const { function in class:Eigen::SkylineMatrixBase
106 return derived().rows();
109 /** \returns the number of columns. \sa rows(), ColsAtCompileTime*/
114 /** \returns the number of coefficients, which is \a rows()*cols()
[all...] |
| /external/chromium_org/components/history/core/browser/ |
| url_database_unittest.cc | 300 // We should get 2 rows for |keyword|.
301 std::vector<KeywordSearchTermRow> rows; local
302 ASSERT_TRUE(GetKeywordSearchTermRows(keyword, &rows));
303 ASSERT_EQ(2u, rows.size());
304 if (rows[0].url_id == url_id1) {
305 EXPECT_EQ(keyword, rows[0].term);
306 EXPECT_EQ(keyword, rows[1].term);
307 EXPECT_EQ(url_id2, rows[1].url_id);
309 EXPECT_EQ(keyword, rows[0].term);
310 EXPECT_EQ(url_id1, rows[1].url_id)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| linear_least_squares_problems.cc | 192 int* rows = A->mutable_rows(); local
200 rows[nnz] = 0;
204 rows[nnz] = 0;
211 rows[nnz] = 1;
215 rows[nnz] = 1;
222 rows[nnz] = 2;
226 rows[nnz] = 2;
233 rows[nnz] = 3;
237 rows[nnz] = 3;
244 rows[nnz] = 4
[all...] |
| partitioned_matrix_view_impl.h | 63 for (int r = 0; r < bs->rows.size(); ++r) {
64 const vector<Cell>& cells = bs->rows[r].cells;
106 const Cell& cell = bs->rows[r].cells[0];
107 const int row_block_pos = bs->rows[r].block.position;
108 const int row_block_size = bs->rows[r].block.size;
132 const int row_block_pos = bs->rows[r].block.position;
133 const int row_block_size = bs->rows[r].block.size;
134 const vector<Cell>& cells = bs->rows[r].cells;
146 for (int r = num_row_blocks_e_; r < bs->rows.size(); ++r) {
147 const int row_block_pos = bs->rows[r].block.position
[all...] |
| /external/chromium-trace/trace-viewer/src/tracing/analysis/ |
| analyze_counters_test.js | 153 assertEquals(3, table.rows.length);
155 assertEquals('Title', table.rows[0].label);
156 assertEquals('Timestamp', table.rows[1].label);
157 assertEquals('value', table.rows[2].label);
158 assertEquals(10, table.rows[2].text);
169 assertEquals(4, table.rows.length);
171 assertEquals('ctr1: series(bytesallocated)', table.rows[0].label);
172 assertEquals('ctr1: series(bytesfree)', table.rows[1].label);
173 assertEquals('ctr2: series(bytesallocated)', table.rows[2].label);
174 assertEquals('ctr2: series(bytesfree)', table.rows[3].label)
[all...] |
| /external/valgrind/main/drd/tests/ |
| matinv.c | 35 int rows; member in struct:gj_threadinfo
53 /** Allocate memory for a matrix with the specified number of rows and
56 static elem_t* new_matrix(const int rows, const int cols)
58 assert(rows > 0);
60 return malloc(rows * cols * sizeof(elem_t));
70 static void init_matrix(elem_t* const a, const int rows, const int cols)
73 for (i = 0; i < rows; i++)
75 for (j = 0; j < rows; j++)
84 const elem_t* const a, const int rows, const int cols)
88 for (i = 0; i < rows; i++
174 const int rows = p->rows; local
[all...] |
| /external/eigen/Eigen/src/plugins/ |
| BlockMethods.h | 23 /** \internal expression type of a block of whole rows */
29 /** \internal expression type of a block of whole rows */
44 * \param blockRows the number of rows in the block
72 * \param cRows the number of rows in the corner
93 * \tparam CRows the number of rows in the corner
116 * \tparam CRows number of rows in corner as specified at compile-time
118 * \param cRows number of rows in corner as specified at run-time
121 * This function is mainly useful for corners where the number of rows is specified at compile-time
148 * \param cRows the number of rows in the corner
169 * The template parameters CRows and CCols are the number of rows and columns in the corner
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| propsvec.c | 32 int32_t rows; member in struct:UPropsVectors
68 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
70 /* set the all-Unicode row and the special-value rows */
72 uprv_memset(row, 0, pv->rows*columns*4);
98 limit=pv->rows;
184 /* find the rows whose ranges overlap with the input range */
186 /* find the first and last rows, always successful */
191 * Rows need to be split if they partially overlap with the
192 * input range (only possible for the first and last rows)
198 /* split first/last rows if necessary *
200 int32_t count, rows; local
336 int32_t i, columns, valueColumns, rows, count; local
[all...] |
