| /external/chromium_org/media/cast/test/utility/ |
| barcode.cc | 72 // Now replicate this one row into all rows in kYPlane.
73 for (int row = 0; row < output_frame->rows(VideoFrame::kYPlane); row++) {
157 int rows = frame->rows(VideoFrame::kYPlane); local
161 std::max(0, rows / 2 - 5),
162 std::min(rows, rows / 2 + 5))) {
167 if (DecodeBarCodeRows(frame, output, 0, std::min(5, rows))) {
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| delete3.test | 13 # large number of rows are deleted.
19 # Create a table that contains a large number of rows.
|
| fts3query.test | 121 0 0 0 {SCAN TABLE t1 USING COVERING INDEX i1 (~1000000 rows)}
122 0 1 1 {SCAN TABLE ft VIRTUAL TABLE INDEX 1: (~0 rows)}
127 0 0 1 {SCAN TABLE t1 USING COVERING INDEX i1 (~1000000 rows)}
128 0 1 0 {SCAN TABLE ft VIRTUAL TABLE INDEX 1: (~0 rows)}
133 0 0 0 {SCAN TABLE t1 USING COVERING INDEX i1 (~1000000 rows)}
134 0 1 1 {SEARCH TABLE bt USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
139 0 0 1 {SCAN TABLE t1 USING COVERING INDEX i1 (~1000000 rows)}
140 0 1 0 {SEARCH TABLE bt USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixMatrix_MKL.h | 51 Index rows, Index cols, \
66 m = (MKL_INT)rows; \
102 Index rows, Index cols, \
118 m = (MKL_INT)rows; \
178 Index rows, Index cols, \
192 m = (MKL_INT)rows; \
228 Index rows, Index cols, \
243 m = (MKL_INT)rows; \
|
| TriangularMatrixVector_MKL.h | 93 Index rows = IsLower ? _rows : size; \
131 if (size<(std::max)(rows,cols)) { \
135 if (size<rows) { \
138 m = rows-size; \
178 Index rows = IsLower ? _rows : size; \
216 if (size<(std::max)(rows,cols)) { \
220 if (size<rows) { \
223 m = rows-size; \
|
| /external/eigen/Eigen/src/misc/ |
| Solve.h | 44 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::solve_retval_base
69 using Base::rows; \
|
| /external/eigen/doc/ |
| QuickReference.dox | 40 \li \c RowsAtCompileTime and \c ColsAtCompileTime are the number of rows and columns of the matrix as known at compile-time or \c Dynamic.
43 All combinations are allowed: you can have a matrix with a fixed number of rows and a dynamic number of columns, etc. The following are all valid:
46 Matrix<double, Dynamic, 2> // Dynamic number of rows (heap allocation)
136 matrix.rows(); matrix.cols();
221 x = Dynamic2D::Zero(rows, cols);
222 x = Dynamic2D::Ones(rows, cols);
223 x = Dynamic2D::Constant(rows, cols, value);
224 x = Dynamic2D::Random(rows, cols);
227 x.setZero(rows, cols);
228 x.setOnes(rows, cols)
[all...] |
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowSQLiteStatement.java | 77 //if the query returns zero rows
80 //if the query returns zero rows (SQLiteMap)
|
| /external/smack/src/org/jivesoftware/smackx/ |
| ReportedData.java | 34 * in columns and rows.
41 private List<Row> rows = new ArrayList<Row>(); field in class:ReportedData
77 // Add the rows to the report based on the form's items
91 rows.add(new Row(fieldList));
108 rows.add(row);
121 * Returns an Iterator for the rows returned from a search.
123 * @return an Iterator for the rows returned from a search.
126 return Collections.unmodifiableList(new ArrayList<Row>(rows)).iterator();
|
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/ |
| BrowseRowsFrameLayout.java | 23 * So we can change left margin of rows while keep the width of rows unchanged without
|
| /packages/apps/Launcher2/ |
| print_db.py | 11 ROWS = 4
45 rows = []
47 rows.append(row)
48 return columns,rows
123 columns,rows = get_favorites(conn)
124 data = [dict(zip(columns,row)) for row in rows]
154 for row in rows:
188 for j in range(0,ROWS):
|
| /external/ceres-solver/internal/ceres/ |
| dynamic_compressed_row_sparse_matrix.h | 51 // Set the number of rows and columns for the underlyig
61 // number of rows, columns and maximum number of non-zero elements
71 // thread-safe across rows i.e. different threads can insert values
72 // simultaneously into different rows. It should be emphasised that this
79 // Clear all entries for rows, starting from row index `row_start`
86 // `num_additional_elements`. This is useful when it is known that rows will
|
| /external/chromium_org/chrome/utility/importer/ |
| external_process_importer_bridge.cc | 103 const std::vector<ImporterURLRow>& rows,
105 Send(new ProfileImportProcessHostMsg_NotifyHistoryImportStart(rows.size()));
110 int rows_left = rows.end() - rows.begin();
111 for (std::vector<ImporterURLRow>::const_iterator it = rows.begin();
112 it < rows.end();) {
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTableRowElement.cpp | 69 // Rows from the first <thead> are numbered before all <tbody> rows.
70 // Rows from the first <tfoot> are numbered after all <tbody> rows.
71 // Rows from other <thead> and <tfoot> elements don't get row indices at all.
99 // We get here for rows that are in <thead> or <tfoot> sections other than the main header and footer.
|
| /external/chromium_org/third_party/freetype/src/sfnt/ |
| pngshim.c | 196 png_byte* *rows; local
200 y_offset < 0 || y_offset + metrics->height > map->rows ||
310 if ( FT_NEW_ARRAY( rows, imgHeight ) )
317 rows[i] = map->buffer + ( y_offset + i ) * map->pitch + x_offset * 4;
319 png_read_image( png, rows );
321 FT_FREE( rows );
|
| /external/chromium_org/third_party/webrtc/tools/barcode_tools/ |
| yuv_cropper.py | 19 respective amount of rows.
41 # Only write the plane data for the rows bigger than crop_height.
48 """Crops rows of pixels from the top of the YUV frames.
51 top pixel rows of every frame.
59 crop_height(int): The height (the number of pixel rows) to be cropped from
105 """A tool to crop rows of pixels from the top part of a YUV file.
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparsePermutation.h | 52 inline int rows() const { return m_matrix.rows(); } function in struct:Eigen::internal::permut_sparsematrix_product_retval
59 SparseMatrix<Scalar,SrcStorageOrder,Index> tmp(m_matrix.rows(), m_matrix.cols());
79 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> tmp(m_matrix.rows(), m_matrix.cols());
117 /** \returns the matrix with the permutation applied to the rows
137 /** \returns the matrix with the inverse permutation applied to the rows.
|
| /external/eigen/test/ |
| nullary.cpp | 20 for (Index i = 0; i < A.rows(); ++i) {
25 for (Index i = 0; i < A.rows(); ++i) {
106 const Index rows = m.rows(); local
110 A.setIdentity(rows, cols);
112 VERIFY(equalsIdentity(MatrixType::Identity(rows, cols)));
|
| product_symm.cpp | 21 Index rows = size; local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols), m3;
30 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows);
|
| product_trmv.cpp | 21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m3(rows, cols);
26 VectorType v1 = VectorType::Random(rows);
30 m1 = MatrixType::Random(rows, cols);
|
| stable_norm.cpp | 55 Index rows = m.rows(); local
69 MatrixType vzero = MatrixType::Zero(rows, cols),
70 vrand = MatrixType::Random(rows, cols),
71 vbig(rows, cols),
72 vsmall(rows,cols);
|
| /external/eigen/unsupported/test/ |
| matrix_exponential.cpp | 103 typename MatrixType::Index rows = m.rows(); local
105 MatrixType m1(rows, cols), m2(rows, cols), identity = MatrixType::Identity(rows, cols);
110 m1 = MatrixType::Random(rows, cols);
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/sfnt/ |
| pngshim.c | 196 png_byte* *rows; local
200 y_offset < 0 || y_offset + metrics->height > map->rows ||
310 if ( FT_NEW_ARRAY( rows, imgHeight ) )
317 rows[i] = map->buffer + ( y_offset + i ) * map->pitch + x_offset * 4;
319 png_read_image( png, rows );
321 FT_FREE( rows );
|
| /development/samples/training/threadsample/src/com/example/android/threadsample/ |
| DataProvider.java | 94 * URIs and an integer code. These are custom MIME types that apply to tables and rows
237 * @param sortOrder A clause defining the order in which the retrieved rows should be sorted
238 * @return The query results, as a {@link android.database.Cursor} of rows and columns
349 * @return The number of rows inserted.
369 // Deletes all the existing rows in the table
396 // The semantics of bulkInsert is to return the number of rows inserted.
424 * @return the number of rows deleted
433 * Updates one or more rows in a table.
436 * @param values The values to use to update the row or rows. You only need to specify column
439 * @param selection An SQL WHERE clause (without the WHERE keyword) specifying the rows t
460 int rows = localSQLiteDatabase.update( local
[all...] |
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 90 : m_matrix(matrix.rows(), matrix.cols()),
125 eigen_assert(m_matrix.rows()==b.rows()
126 && "LLT::solve(): invalid number of rows of the right hand side matrix b");
170 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::LLT
204 eigen_assert(mat.rows()==n && vec.size()==n);
270 eigen_assert(mat.rows()==mat.cols());
271 const Index size = mat.rows();
295 eigen_assert(m.rows()==m.cols())
[all...] |
