| /external/pdfium/core/src/fxge/agg/agg23/ |
| agg_rendering_buffer.h | 81 int8u** rows = m_rows; local
83 *rows++ = row_ptr;
129 int8u const* const* rows() const function in class:agg::rendering_buffer
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/arm/neon/ |
| vp9_idct4x4_add_neon.asm | 28 ; similar. We first transform the rows. This is done by transposing
30 ; transposed rows) and then transpose the results (so that it goes back
73 ; do the transform on transposed rows
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| PhoneLookupWithStarPrefix.java | 34 * Returns a cursor with a subset of the rows passed into this function. If {@param number}
35 * starts with a "*" then only rows from {@param cursor} that have a number equal to
37 * only rows from {@param cursor} that have numbers without starting "*" characters
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| SearchDialogBase.py | 73 cols,rows=self.buttonframe.grid_size()
74 b.grid(pady=1,row=rows,column=0,sticky="ew")
75 self.buttonframe.grid(rowspan=rows+1)
|
| tabbedpages.py | 7 TabSet -- A widget containing tabs (buttons) in one or more rows.
17 """A widget containing tabs (buttons) in one or more rows.
36 n_rows -- Number of rows of tabs to be shown. If n_rows <= 0 or is
37 None, then the number of rows will be decided by TabSet. See
40 max_tabs_per_row -- Used for deciding how many rows of tabs are needed,
41 when the number of rows is not constant. See _arrange_tabs() for
137 Arrange the tabs in rows, in the order in which they were added.
139 If n_rows >= 1, this will be the number of rows used. Otherwise the
140 number of rows will be calculated according to the number of tabs and
141 max_tabs_per_row. In this case, the number of rows may change whe
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| SearchDialogBase.py | 73 cols,rows=self.buttonframe.grid_size()
74 b.grid(pady=1,row=rows,column=0,sticky="ew")
75 self.buttonframe.grid(rowspan=rows+1)
|
| tabbedpages.py | 7 TabSet -- A widget containing tabs (buttons) in one or more rows.
17 """A widget containing tabs (buttons) in one or more rows.
36 n_rows -- Number of rows of tabs to be shown. If n_rows <= 0 or is
37 None, then the number of rows will be decided by TabSet. See
40 max_tabs_per_row -- Used for deciding how many rows of tabs are needed,
41 when the number of rows is not constant. See _arrange_tabs() for
137 Arrange the tabs in rows, in the order in which they were added.
139 If n_rows >= 1, this will be the number of rows used. Otherwise the
140 number of rows will be calculated according to the number of tabs and
141 max_tabs_per_row. In this case, the number of rows may change whe
[all...] |
| /external/chromium_org/chrome/browser/autocomplete/ |
| shortcuts_backend.cc | 196 const history::URLRows& rows(deleted_details->rows);
201 rows.begin(), rows.end(), history::URLRow::URLRowHasURL(
202 it->second->second.match_core.destination_url)) != rows.end())
|
| /external/chromium_org/chrome/browser/sync/test/integration/ |
| typed_urls_helper.cc | 46 GetTypedUrlsTask(history::URLRows* rows, base::WaitableEvent* event)
47 : rows_(rows), wait_event_(event) {}
176 history::URLRows rows; local
180 new GetTypedUrlsTask(&rows, &wait_event)),
183 return rows;
|
| /external/chromium_org/third_party/WebKit/Source/modules/webdatabase/ |
| SQLStatementBackend.cpp | 171 SQLResultSetRowList* rows = m_resultSet->rows(); local
174 rows->addColumn(statement.getColumnName(i));
178 rows->addResult(statement.getColumnValue(i));
207 // sqlite3_total_changes() here instead of sqlite3_changed, because that includes rows modified from within a trigger
|
| /external/eigen/Eigen/src/Core/ |
| CwiseBinaryOp.h | 131 eigen_assert(aLhs.rows() == aRhs.rows() && aLhs.cols() == aRhs.cols());
134 EIGEN_STRONG_INLINE Index rows() const { function in class:Eigen::CwiseBinaryOp
137 return m_rhs.rows();
139 return m_lhs.rows();
|
| Ref.h | 46 * can be greater than the number of rows.
144 : this->rows();
165 eigen_assert(expr.rows()==1 || expr.cols()==1);
170 eigen_assert(expr.rows()==1 || expr.cols()==1);
174 ::new (static_cast<Base*>(this)) Base(expr.data(), expr.rows(), expr.cols());
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexEigenSolver.h | 126 : m_eivec(matrix.rows(),matrix.cols()),
128 m_schur(matrix.rows()),
131 m_matX(matrix.rows(),matrix.cols())
175 * rows in the matrix. The eigenvalues are not sorted in any particular
255 eigen_assert(matrix.cols() == matrix.rows());
|
| Tridiagonalization.h | 158 m_hCoeffs.resize(matrix.rows()-1, 1);
242 .setLength(m_matrix.rows() - 1)
316 Index n = m_matrix.rows();
352 Index n = matA.rows();
409 * vector \p diag should equal the number of rows in \p mat, and the
429 eigen_assert(mat.cols()==mat.rows() && diag.size()==mat.rows() && subdiag.size()==mat.rows()-1);
451 .setLength(mat.rows() - 1)
546 Index rows() const { return m_matrix.rows(); function in struct:Eigen::internal::TridiagonalizationMatrixTReturnType
[all...] |
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_panel_bmod.h | 43 * \param m number of rows in the matrix
50 * \param repfnz First nonzero rows
76 * nsupr = number of rows in a supernode
85 // loop over the panel columns to detect the actual number of columns and rows
152 internal::sparselu_gemm<Scalar>(L.rows(), L.cols(), B.cols(), B.data(), B.outerStride(), U.data(), U.outerStride(), L.data(), L.outerStride());
|
| /external/eigen/test/ |
| ref.cpp | 50 Index rows = m.rows(), cols = m.cols(); local
52 MatrixType m1 = MatrixType::Random(rows, cols),
55 Index i = internal::random<Index>(0,rows-1);
57 Index brows = internal::random<Index>(1,rows-i);
|
| sparse_solver.h | 21 Rhs x(b.rows(), b.cols());
63 DenseRhs x(db.rows(), db.cols());
66 x.block(0,0,x.rows(),x.cols()) = solver.solve(db.block(0,0,db.rows(),db.cols()));
79 Rhs x(b.rows(), b.cols());
|
| main.h | 327 void createRandomPIMatrixOfRank(typename MatrixType::Index desired_rank, typename MatrixType::Index rows, typename MatrixType::Index cols, MatrixType& m);
329 void createRandomPIMatrixOfRank(typename MatrixType::Index desired_rank, typename MatrixType::Index rows, typename MatrixType::Index cols, MatrixType& m)
333 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
336 typedef Matrix<Scalar, Rows, Rows> MatrixAType;
341 m.setZero(rows,cols);
348 m = VectorType::Random(rows).normalized() * VectorType::Random(cols).normalized().transpose();
352 MatrixAType a = MatrixAType::Random(rows,rows);
353 MatrixType d = MatrixType::Identity(rows,cols)
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| help.c | 76 int cols = 1, rows; local
87 rows = (cmds->cnt + cols - 1) / cols;
89 for (i = 0; i < rows; i++) {
93 unsigned int n = j * rows + i;
98 if (j == cols-1 || n + rows >= cmds->cnt)
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/api/ |
| armCOMM_IDCT_s.h | 385 ;// IStage 4,3, rows 2to3 x1/2
406 ;// IStage 4,3 rows 0to1 x 1/2
409 ADDS LoopRR2, LoopRR2, #2<<29 ;// done two rows
414 ;// IStage 2 rows 0to3 x 1/2
420 ;// IStage 1 all rows
465 ;// IStage 4,3 rows 0to1 x 1/2
470 ;// IStage 2 rows 0to3 x 1/2
476 ;// IStage 1 all rows
500 ADDS LoopRR2, LoopRR2, #2<<29 ;// done two rows
548 ;// IStage 4,3, rows 2to3 x1/
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/api/ |
| armCOMM_IDCT_s.h | 390 ;// IStage 4,3, rows 2to3 x1/2
412 ;// IStage 4,3 rows 0to1 x 1/2
415 ADDS LoopRR2, LoopRR2, #2<<29 ;// done two rows
420 ;// IStage 2 rows 0to3 x 1/2
426 ;// IStage 1 all rows
471 ;// IStage 4,3 rows 0to1 x 1/2
476 ;// IStage 2 rows 0to3 x 1/2
482 ;// IStage 1 all rows
506 ADDS LoopRR2, LoopRR2, #2<<29 ;// done two rows
554 ;// IStage 4,3, rows 2to3 x1/
[all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| DGMRES.h | 151 eigen_assert(Base::rows()==b.rows()
152 && "DGMRES::solve(): invalid number of rows of the right hand side matrix b");
227 void dgmresInitDeflation(Index& rows) const;
260 int n = mat.rows();
310 int n = mat.rows();
392 void DGMRES<_MatrixType, _Preconditioner>::dgmresInitDeflation(Index& rows) const
394 m_U.resize(rows, m_maxNeig);
395 m_MU.resize(rows, m_maxNeig);
412 Index it = T.rows();
[all...] |
| /external/opencv/cxcore/src/ |
| cxmatmul.cpp | [all...] |
| /developers/build/prebuilts/gradle/BasicSyncAdapter/Application/src/main/java/com/example/android/common/db/ |
| SelectionBuilder.java | 290 * @param orderBy How to order the rows, formatted as an SQL ORDER BY clause (excluding the
307 * @param groupBy A filter declaring how to group rows, formatted as an SQL GROUP BY clause
308 * (excluding the GROUP BY itself). Passing null will cause the rows to not be
314 * @param orderBy How to order the rows, formatted as an SQL ORDER BY clause (excluding the
317 * @param limit Limits the number of rows returned by the query, formatted as LIMIT clause.
337 * @return The number of rows affected.
349 * @return The number of rows affected.
|
| /developers/samples/android/common/src/java/com/example/android/common/db/ |
| SelectionBuilder.java | 290 * @param orderBy How to order the rows, formatted as an SQL ORDER BY clause (excluding the
307 * @param groupBy A filter declaring how to group rows, formatted as an SQL GROUP BY clause
308 * (excluding the GROUP BY itself). Passing null will cause the rows to not be
314 * @param orderBy How to order the rows, formatted as an SQL ORDER BY clause (excluding the
317 * @param limit Limits the number of rows returned by the query, formatted as LIMIT clause.
337 * @return The number of rows affected.
349 * @return The number of rows affected.
|
