| /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/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...] |
| /external/eigen/test/ |
| upperbidiagonalization.cpp | 15 const typename MatrixType::Index rows = m.rows(); local
21 MatrixType a = MatrixType::Random(rows,cols);
23 RealMatrixType b(rows, cols);
|
| linearstructure.cpp | 20 Index rows = m.rows(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols);
32 Index r = internal::random<Index>(0, rows-1),
64 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
65 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), m1.cwiseProduct(m1));
66 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1);
67 VERIFY_IS_APPROX(m1.block(0,0,rows,cols) * s1, m1 * s1)
[all...] |
| qr.cpp | 17 Index rows = m.rows(); local
24 MatrixType a = MatrixType::Random(rows,cols);
36 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
38 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random();
39 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
41 Matrix<Scalar,Rows,Cols> r = qr.matrixQR();
43 for(int i = 0; i < Rows; i++) for(int j = 0; j < Cols; j++) if(i>j) r(i,j) = Scalar(0);
48 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.
|
| conservative_resize.cpp | 40 const Index rows = internal::random<Index>(1,50); local
43 m.conservativeResize(rows,cols);
44 VERIFY_IS_APPROX(m, n.block(0,0,rows,cols));
50 const Index rows = internal::random<Index>(50,75); local
53 m.conservativeResizeLike(MatrixType::Zero(rows,cols));
54 VERIFY_IS_APPROX(m.block(0,0,n.rows(),n.cols()), n);
55 VERIFY( rows<=50 || m.block(50,0,rows-50,cols).sum() == Scalar(0) );
56 VERIFY( cols<=50 || m.block(0,50,rows,cols-50).sum() == Scalar(0) );
|
| adjoint.cpp | 25 Index rows = m.rows(); local
28 MatrixType m1 = MatrixType::Random(rows, cols),
29 m2 = MatrixType::Random(rows, cols),
30 m3(rows, cols),
31 square = SquareMatrixType::Random(rows, rows);
32 VectorType v1 = VectorType::Random(rows),
33 v2 = VectorType::Random(rows),
34 v3 = VectorType::Random(rows),
[all...] |
| /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)
151 RealScalar normTminusI = (T - MatrixType::Identity(T.rows(), T.rows())).cwiseAbs().colwise().sum().maxCoeff();
250 MatrixType TminusI = T - MatrixType::Identity(T.rows(), T.rows());
251 result.setZero(T.rows(), T.rows());
465 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixLogarithmReturnValue
[all...] |
| /external/chromium/chrome/browser/geolocation/ |
| geolocation_exceptions_table_model.h | 25 // Return whether the given set of rows can be removed. A parent with setting
28 virtual bool CanRemoveRows(const Rows& rows) const;
35 virtual void RemoveRows(const Rows& rows);
|
| /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/eigen/doc/ |
| AsciiQuickReference.txt | 7 Matrix<double, 3, 3> A; // Fixed rows and cols. Same as Matrix3d.
8 Matrix<double, 3, Dynamic> B; // Fixed rows, dynamic cols.
19 C.rows() // size(C)(1) // number of rows
31 7, 8, 9; // and then the rows are stacked.
44 x.tail(n) // N = rows(x); x(N - n: N)
45 x.tail<n>() // N = rows(x); x(N - n: N)
48 P.block(i, j, rows, cols) // P(i+1 : i+rows, j+1 : j+cols)
49 P.block<rows, cols>(i, j) // P(i+1 : i+rows, j+1 : j+cols
[all...] |
| /external/chromium_org/chrome/browser/history/ |
| url_database_unittest.cc | 263 // We should get 2 rows for |keyword|.
264 std::vector<KeywordSearchTermRow> rows; local
265 ASSERT_TRUE(GetKeywordSearchTermRows(keyword, &rows));
266 ASSERT_EQ(2u, rows.size());
267 if (rows[0].url_id == url_id1) {
268 EXPECT_EQ(keyword, rows[0].term);
269 EXPECT_EQ(keyword, rows[1].term);
270 EXPECT_EQ(url_id2, rows[1].url_id);
272 EXPECT_EQ(keyword, rows[0].term);
273 EXPECT_EQ(url_id1, rows[1].url_id)
[all...] |
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR.h | 76 HouseholderQR(Index rows, Index cols)
77 : m_qr(rows, cols),
78 m_hCoeffs((std::min)(rows,cols)),
83 : m_qr(matrix.rows(), matrix.cols()),
84 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
162 inline Index rows() const { return m_qr.rows(); } function in class:Eigen::HouseholderQR
177 eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!");
185 eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!");
198 Index rows = mat.rows() local
238 Index rows = mat.rows(); local
288 const Index rows = dec().rows(), cols = dec().cols(); local
315 Index rows = matrix.rows(); local
[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...] |
| /external/chromium/chrome/browser/notifications/ |
| notification_exceptions_table_model.cc | 39 const Rows& rows) const {
40 return !rows.empty();
43 void NotificationExceptionsTableModel::RemoveRows(const Rows& rows) {
45 // This is O(n^2) in rows.size(). Since n is small, that's ok.
46 for (Rows::const_reverse_iterator i(rows.rbegin()); i != rows.rend(); ++i) {
|
| /external/chromium_org/third_party/icu/source/common/ |
| propsvec.c | 31 int32_t rows; member in struct:UPropsVectors
67 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
69 /* set the all-Unicode row and the special-value rows */
71 uprv_memset(row, 0, pv->rows*columns*4);
94 int32_t columns, i, start, limit, prevRow, rows; local
97 rows=limit=pv->rows;
183 /* find the rows whose ranges overlap with the input range */
185 /* find the first and last rows, always successful */
190 * Rows need to be split if they partially overlap with th
199 int32_t count, rows; local
335 int32_t i, columns, valueColumns, rows, count; local
[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/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| RequestTimingView.js | 88 var rows = [];
97 rows.push(row);
125 for (var i = 0; i < rows.length; ++i) {
130 td.textContent = rows[i].title;
141 bar.className = "network-timing-bar " + rows[i].className;
142 bar.style.left = Math.floor(scale * rows[i].start) + "px";
143 bar.style.right = Math.floor(scale * (total - rows[i].end)) + "px";
144 bar.style.backgroundColor = rows[i].color;
150 if (total - rows[i].end < rows[i].start
[all...] |
