| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| RequestTimingView.js | 87 var rows = [];
96 rows.push(row);
121 for (var i = 0; i < rows.length; ++i) {
126 td.textContent = rows[i].title;
137 bar.className = "network-timing-bar " + rows[i].className;
138 bar.style.left = scale * rows[i].start + "px";
139 bar.style.right = scale * (total - rows[i].end) + "px";
140 bar.style.backgroundColor = rows[i].color;
146 if (total - rows[i].end < rows[i].start
[all...] |
| /external/eigen/test/ |
| 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...] |
| vectorwiseop.cpp | 22 Index rows = m.rows(); local
24 Index r = internal::random<Index>(0, rows-1),
27 ArrayType m1 = ArrayType::Random(rows, cols),
28 m2(rows, cols),
29 m3(rows, cols);
31 ColVectorType colvec = ColVectorType::Random(rows);
115 Index rows = m.rows(); local
117 Index r = internal::random<Index>(0, rows-1)
[all...] |
| block.cpp | 23 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
28 m2 = MatrixType::Random(rows, cols),
29 m3(rows, cols),
30 ones = MatrixType::Ones(rows, cols);
31 VectorType v1 = VectorType::Random(rows);
35 Index r1 = internal::random<Index>(0,rows-1);
36 Index r2 = internal::random<Index>(r1,rows-1);
59 VectorType bc1(m1.block(0,c1,rows,1))
154 Index rows = m.rows(); local
188 Index rows = m.rows(); local
[all...] |
| eigensolver_generic.cpp | 21 Index rows = m.rows(); local
30 MatrixType a = MatrixType::Random(rows,cols);
31 MatrixType a1 = MatrixType::Random(rows,cols);
45 VERIFY_IS_APPROX(ei1.eigenvectors().colwise().norm(), RealVectorType::Ones(rows).transpose());
53 MatrixType id = MatrixType::Identity(rows, cols);
56 if (rows > 2)
73 MatrixType a = MatrixType::Random(m.rows(),m.cols());
|
| /external/eigen/bench/ |
| 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/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/icu4c/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...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| analyze6.test | 64 } {0 0 1 {SCAN TABLE cat (~16 rows)} 0 1 0 {SEARCH TABLE ev USING COVERING INDEX evy (y=?) (~32 rows)}}
71 } {0 0 0 {SCAN TABLE cat (~16 rows)} 0 1 1 {SEARCH TABLE ev USING COVERING INDEX evy (y=?) (~32 rows)}}
85 } {0 0 0 {SEARCH TABLE t201 USING INDEX t201z (z=?) (~10 rows)}}
88 } {0 0 0 {SEARCH TABLE t201 USING INDEX sqlite_autoindex_t201_1 (y=?) (~1 rows)}}
91 } {0 0 0 {SEARCH TABLE t201 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}}
98 } {0 0 0 {SEARCH TABLE t201 USING INDEX t201z (z=?) (~10 rows)}}
101 } {0 0 0 {SEARCH TABLE t201 USING INDEX sqlite_autoindex_t201_1 (y=?) (~1 rows)}}
104 } {0 0 0 {SEARCH TABLE t201 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}}
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_lu.cpp | 17 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; i++) m1.row(i).setZero()
[all...] |
| eigen2_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);
75 SparseMatrix<Scalar> m2(rows, cols);
76 DenseMatrix refMat2(rows, cols);
116 SparseMatrix<Scalar> m2(rows, cols)
[all...] |
| /frameworks/base/core/tests/coretests/src/android/database/sqlite/ |
| SQLiteCursorTest.java | 81 Set<Integer> rows = new HashSet<Integer>(); local
86 rows.add(j); // store in a hashtable so we can verify the results from cursor later on
90 assertEquals(N, rows.size());
102 assertTrue(rows.contains(val));
103 assertTrue(rows.remove(val));
105 // did I see all the rows in the table?
106 assertTrue(rows.isEmpty());
109 rows = new HashSet<Integer>();
113 rows.add(j);
122 assertEquals(M, rows.size())
[all...] |
| /external/ceres-solver/internal/ceres/ |
| compressed_row_sparse_matrix.cc | 46 // duplicates in the pair of arrays rows and cols, i.e., there is no
49 // rows[i] == rows[j] && cols[i] == cols[j]
53 RowColLessThan(const int* rows, const int* cols)
54 : rows(rows), cols(cols) {
58 if (rows[x] == rows[y]) {
61 return (rows[x] < rows[y])
64 const int* rows; member in struct:ceres::internal::__anon4015::RowColLessThan
303 int* rows = matrix->mutable_rows(); local
[all...] |
| compressed_col_sparse_matrix_utils_test.cc | 91 int* rows,
106 rows[offset] = row_pos + r;
134 int* rows = tsm.mutable_rows(); local
142 rows + offset, cols + offset);
200 rows.resize(7);
204 rows[0] = 0;
208 rows[1] = 1;
212 rows[2] = 1;
214 rows[3] = 2;
218 rows[4] = 0
229 vector<int> rows; member in class:ceres::internal::SolveUpperTriangularTest
[all...] |
| visibility_test.cc | 62 bs.rows.push_back(CompressedRow());
63 CompressedRow& row = bs.rows.back();
72 bs.rows.push_back(CompressedRow());
73 CompressedRow& row = bs.rows.back();
82 bs.rows.push_back(CompressedRow());
83 CompressedRow& row = bs.rows.back();
92 bs.rows.push_back(CompressedRow());
93 CompressedRow& row = bs.rows.back();
142 bs.rows.push_back(CompressedRow());
143 CompressedRow& row = bs.rows.back()
[all...] |
| /cts/tests/tests/provider/src/android/provider/cts/ |
| Settings_SystemTest.java | 64 * rows: an int, a long, a float, a String, and a ShowGTalkServiceStatus.
65 * Get these six rows to check whether insert succeeded and then delete them.
67 // Precondition: these rows must not exist in the db when we begin
70 // first query exist rows
79 // insert 5 rows, and update 1 rows
91 // get these rows to assert
99 // delete the tested rows again
|
| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 48 // rows, cols and values.
50 // rows is a num_rows + 1 sized array that points into the cols and
53 // cols[rows[i]] ... cols[rows[i + 1] - 1] are the indices of the
56 // values[rows[i]] .. values[rows[i + 1] - 1] are the values of the
72 // rows = [ 0, 2, 5, 7]
77 vector<int> rows; member in struct:ceres::CRSMatrix
|
| /external/eigen/Eigen/src/Core/products/ |
| Parallelizer.h | 86 void parallelize_gemm(const Functor& func, Index rows, Index cols, bool transpose)
96 func(0,rows, 0,cols);
108 return func(0,rows, 0,cols);
110 Index size = transpose ? cols : rows;
120 return func(0,rows, 0,cols);
126 std::swap(rows,cols);
129 Index blockRows = (rows / threads) & ~Index(0x7);
137 Index actualBlockRows = (i+1==threads) ? rows-r0 : blockRows;
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_tile_common.h | 22 // 'cm->log2_tile_(rows|cols)' & 'cm->mi_(rows|cols)'
|
| /external/markdown/markdown/extensions/ |
| tables.py | 25 rows = block.split('\n')
26 return (len(rows) > 2 and '|' in rows[0] and
27 '|' in rows[1] and '-' in rows[1] and
28 rows[1][0] in ['|', ':', '-'])
34 rows = block[2:]
55 for row in rows:
|
| /external/chromium/chrome/browser/ |
| plugin_exceptions_table_model.h | 32 virtual bool CanRemoveRows(const Rows& rows) const;
33 virtual void RemoveRows(const Rows& rows);
|
| /external/chromium_org/third_party/WebKit/ManualTests/ |
| input-type-file-autocomplete-refresh.html | 5 <frameset rows="50%,50%">
|
| /external/chromium_org/third_party/WebKit/ManualTests/resources/ |
| textarea-form-back-on-submit.html | 8 <textarea name="text" rows="3" cols="10" id="textarea">123</textarea><br />
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Layout/ |
| floats_100_100.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
