| /external/chromium_org/chrome/browser/resources/ |
| about_stats.js | 136 // The function sorts rows after the row with onclick event handler.
149 var rows = new Array();
153 for (var i = startIndex; i < table.rows.length; i++)
154 rows.push(table.rows[i]);
186 rows.sort(sortFunc);
190 for (var i = rows.length - 1; i >= 0; i--)
191 tbody.appendChild(rows[i]);
194 for (var i = 0; i < rows.length; i++)
195 tbody.appendChild(rows[i])
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/rtree/ |
| rtree6.test | 77 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2:Ca (~0 rows)}
78 0 1 1 {SEARCH TABLE t2 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
84 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2:Ca (~0 rows)}
85 0 1 1 {SEARCH TABLE t2 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
91 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2: (~0 rows)}
92 0 1 1 {SEARCH TABLE t2 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
98 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2:CaEb (~0 rows)}
99 0 1 1 {SCAN TABLE t2 (~100000 rows)}
105 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2: (~0 rows)}
106 0 1 1 {SEARCH TABLE t2 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
[all...] |
| /external/chromium_org/third_party/webrtc/modules/desktop_capture/ |
| desktop_region.h | 25 // Internally each region is stored as a set of rows where each row contains one
59 // Type used to store list of rows in the region. The bottom position of row
60 // is used as the key so that rows are always ordered by their position. The
62 typedef std::map<int, Row*> Rows;
80 // |row_span_| matches spans on consecutive rows then they are also merged
84 Rows::const_iterator row_;
85 Rows::const_iterator previous_row_;
156 // the region). If the rows were merged |row| remains a valid iterator to the
158 void MergeWithPrecedingRow(Rows::iterator row);
160 Rows rows_
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| Block.h | 20 * \param cRows the number of rows in the corner
45 return Block<Derived>(derived(), rows() - cRows, 0, cRows, cCols);
47 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
65 return Block<Derived>(derived(), rows() - cRows, 0, cRows, cCols);
67 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
76 * The template parameters CRows and CCols arethe number of rows and columns in the corner.
97 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, 0);
99 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
118 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, 0);
120 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols)
[all...] |
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 80 FullPivLU(Index rows, Index cols);
199 * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition.
341 return rank() == rows();
353 return isInjective() && (m_lu.rows() == m_lu.cols());
366 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
368 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
373 inline Index rows() const { return m_lu.rows(); } function in class:Eigen::FullPivLU
394 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols
428 const Index rows = matrix.rows(); local
682 const Index rows = dec().rows(), cols = dec().cols(), local
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSparseProductWithPruning.h | 28 Index rows = lhs.innerSize(); local
34 AmbiVector<Scalar,Index> tempVector(rows);
46 res.resize(cols, rows);
48 res.resize(rows, cols);
51 double ratioColRes = double(estimated_nnz_prod)/double(lhs.rows()*rhs.cols());
55 //double ratioColRes = (double(rhs.innerVector(j).nonZeros()) + double(lhs.nonZeros())/double(lhs.cols()))/double(lhs.rows());
90 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
104 SparseTemporaryType _res(res.rows(), res.cols());
117 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
137 // SparseTemporaryType _res(res.cols(), res.rows());
[all...] |
| /external/eigen/unsupported/test/ |
| sparse_extra.cpp | 53 const Index rows = ref.rows(); local
58 double density = (std::max)(8./(rows*cols), 0.01);
63 SparseMatrixType m(rows, cols);
64 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
65 DenseVector vec1 = DenseVector::Random(rows);
118 SparseMatrixType m1(rows,cols), m2(rows,cols);
119 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows);
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/decoder/ |
| vp9_dthread.c | 142 // Number of superblock rows and cols
157 // Initialize cur_sb_col to -1 for all SB rows.
196 // Wait till all rows are finished
217 void vp9_loop_filter_alloc(VP9LfSync *lf_sync, VP9_COMMON *cm, int rows,
219 lf_sync->rows = rows;
225 vpx_malloc(sizeof(*lf_sync->mutex_) * rows));
226 for (i = 0; i < rows; ++i) {
231 vpx_malloc(sizeof(*lf_sync->cond_) * rows));
232 for (i = 0; i < rows; ++i)
[all...] |
| /external/eigen/bench/ |
| sparse_trisolver.cpp | 40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst)
42 dst.startFill(rows*cols*density);
58 int rows = SIZE; local
63 EigenSparseTriMatrix sm1(rows,cols);
72 EigenSparseTriMatrix sm1(rows, cols);
73 fillMatrix(density, rows, cols, sm1);
81 DenseMatrix m1(rows,cols);
82 Matrix<Scalar,Dynamic,Dynamic,Dynamic,Dynamic,RowMajorBit> m2(rows,cols);
138 GmmSparse m1(rows,cols);
163 MtlSparse m1(rows,cols)
[all...] |
| /external/eigen/test/ |
| adjoint.cpp | 68 Index rows = m.rows(); local
71 MatrixType m1 = MatrixType::Random(rows, cols),
72 m2 = MatrixType::Random(rows, cols),
73 m3(rows, cols),
74 square = SquareMatrixType::Random(rows, rows);
75 VectorType v1 = VectorType::Random(rows),
76 v2 = VectorType::Random(rows),
77 v3 = VectorType::Random(rows),
[all...] |
| /external/libvpx/libvpx/vp9/decoder/ |
| vp9_dthread.c | 140 // Number of superblock rows and cols
168 // Initialize cur_sb_col to -1 for all SB rows.
208 // Wait till all rows are finished
229 void vp9_loop_filter_alloc(VP9_COMMON *cm, VP9LfSync *lf_sync, int rows,
235 vpx_malloc(sizeof(*lf_sync->mutex_) * rows));
236 for (i = 0; i < rows; ++i) {
241 vpx_malloc(sizeof(*lf_sync->cond_) * rows));
242 for (i = 0; i < rows; ++i) {
248 vpx_malloc(sizeof(*lf_sync->cur_sb_col) * rows));
255 void vp9_loop_filter_dealloc(VP9LfSync *lf_sync, int rows) {
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/decoder/ |
| vp9_dthread.c | 141 // Number of superblock rows and cols
169 // Initialize cur_sb_col to -1 for all SB rows.
200 // Wait till all rows are finished
221 void vp9_loop_filter_alloc(VP9_COMMON *cm, VP9LfSync *lf_sync, int rows,
227 vpx_malloc(sizeof(*lf_sync->mutex_) * rows));
228 for (i = 0; i < rows; ++i) {
233 vpx_malloc(sizeof(*lf_sync->cond_) * rows));
234 for (i = 0; i < rows; ++i) {
240 vpx_malloc(sizeof(*lf_sync->cur_sb_col) * rows));
247 void vp9_loop_filter_dealloc(VP9LfSync *lf_sync, int rows) {
[all...] |
| /external/ceres-solver/internal/ceres/ |
| program_test.cc | 272 int* rows = expected_block_sparse_jacobian.mutable_rows(); local
275 rows[0] = 0;
278 rows[1] = 2;
280 rows[2] = 0;
283 rows[3] = 2;
285 rows[4] = 1;
288 rows[5] = 2;
290 rows[6] = 1;
293 rows[7] = 0;
295 rows[8] = 2
369 int* rows = expected_block_sparse_jacobian.mutable_rows(); local
[all...] |
| incomplete_lq_factorization.cc | 46 const int row_begin = matrix->rows()[row];
47 const int row_end = matrix->rows()[row + 1];
69 const int* a_rows = a.rows();
73 const int* b_rows = b.rows();
119 int* rows = matrix->mutable_rows(); local
122 int num_nonzeros = rows[matrix->num_rows()];
126 rows[matrix->num_rows()] = num_nonzeros;
160 rows[matrix->num_rows()] = num_nonzeros;
172 const int* rows = matrix.rows(); local
[all...] |
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineMatrix.h | 74 inline Index rows() const { function in class:Eigen::SkylineMatrix
456 const Index stop = m_rowStartIndex[rows()];
464 for (Index innerIdx = rows(); innerIdx > outer; innerIdx--) {
486 const Index stop = m_rowStartIndex[rows()];
536 if (rows() > cols())
537 m_data.resize(cols(), cols(), rows(), m_colStartIndex[cols()] + 1, m_rowStartIndex[rows()] + 1);
539 m_data.resize(rows(), cols(), rows(), m_colStartIndex[cols()] + 1, m_rowStartIndex[rows()] + 1)
[all...] |
| /external/chromium_org/content/test/data/ |
| simple_database.html | 62 sendValueToTest("multiple rows with index: " + index);
99 for (var i = 0; i < result.rows.length; i++) {
102 items += result.rows.item(i).data;
118 // rows from the database by index. E.g., LIMIT 2,10 will give us 10 records
124 if (result.rows.length >= 1)
125 callback(result.rows.item(0).id);
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_linear.c | 51 ptr = (char*)src_ptr + src_stride * t->rows * y + bytes * x;
52 for (z = 0; z < t->rows; z++) {
73 ptr = (char*)dst_ptr + dst_stride * t->rows * y + bytes * x;
74 for (z = 0; z < t->rows; z++) {
94 t->rows = t->tile.height / t->block.height;
95 t->tile.size = t->cols * t->rows * t->block.size;
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixMatrix.h | 46 void operator()(Scalar* blockA, const Scalar* _lhs, Index lhsStride, Index cols, Index rows)
50 Index peeled_mc = (rows/Pack1)*Pack1;
56 if(rows-peeled_mc>=Pack2)
63 for(Index i=peeled_mc; i<rows; i++)
80 void operator()(Scalar* blockB, const Scalar* _rhs, Index rhsStride, Index rows, Index cols, Index k2)
82 Index end_k = k2 + rows;
104 for(Index j2=k2; j2<(std::min)(k2+rows,packet_cols); j2+=nr)
150 for(Index j2=k2+rows; j2<packet_cols; j2+=nr)
176 if(half==j2 && half<k2+rows)
185 for(Index k=half+1; k<k2+rows; k++
[all...] |
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.cpp | 72 C_MatrixXd* MatrixXd_new(int rows, int cols)
74 return eigen_to_c(*new MatrixXd(rows,cols));
92 void MatrixXd_resize(C_MatrixXd *m, int rows, int cols)
94 c_to_eigen(m).resize(rows,cols);
137 C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols)
139 return eigen_to_c(*new Map<MatrixXd>(array,rows,cols));
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_linear.c | 51 ptr = (char*)src_ptr + src_stride * t->rows * y + bytes * x;
52 for (z = 0; z < t->rows; z++) {
73 ptr = (char*)dst_ptr + dst_stride * t->rows * y + bytes * x;
74 for (z = 0; z < t->rows; z++) {
94 t->rows = t->tile.height / t->block.height;
95 t->tile.size = t->cols * t->rows * t->block.size;
|
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteStatement.java | 23 * cannot return multiple rows or columns, but single value (1 x 1) result sets
54 * Execute this SQL statement, if the the number of rows affected by execution of this SQL
57 * @return the number of rows affected by this SQL statement execution.
102 * @throws android.database.sqlite.SQLiteDoneException if the query returns zero rows
123 * @throws android.database.sqlite.SQLiteDoneException if the query returns zero rows
144 * @throws android.database.sqlite.SQLiteDoneException if the query returns zero rows
|
| /packages/apps/Camera2/jni/ |
| jpegutil.h | 34 * Provides access to several rows of planar data at a time, copied into an
35 * intermediate buffer with pixel data packed in contiguous rows which can be
52 // pixel data for rows of the image to be sent to libjpeg.
56 // The total number of rows in the ring-buffer
60 // The number of bytes between consecutive rows in the buffer
84 // The difference in address between the start of consecutive rows
|
| /cts/tools/signature-tools/templates/ |
| ApiOverviewPage.st | 36 $Table(name="Removed Packages", rows=removed_packages:{$it.from:ModelElementRow()$})$
42 $Table(name="Added Packages", rows=added_packages:{$it.to:PackageAddedLink()$}:SimpleTableRow())$
47 $Table(name="Changed Packages", rows=changed_packages:{$it.to:PackageChangedLink()$}:SimpleTableRow())$
|
| /external/chromium_org/chrome/browser/resources/net_internals/ |
| logs_view.js | 34 this.rows = [];
106 logDiv.id = 'logs-view.log-cell.' + this.rows.length;
129 this.rows.push(row);
174 for (var row in this.rows) {
175 if (isShowAll != this.rows[row].logVisible) {
176 this.onButtonClicked_(this.rows[row]);
191 for (var row in this.rows) {
192 if (this.rows[row].logVisible) {
193 visibleLogRows.push(this.rows[row]);
195 hiddenLogRows.push(this.rows[row])
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/Layout/resources/ |
| floats.js | 37 function createTestFunction(width, height, nested, runs, rows) {
39 for (var i = 0; i < rows; ++i)
44 for (var c = 0; c < rows; ++c) {
|
