| /external/opencv/cv/src/ |
| cvundistort.cpp | 150 if( !CV_IS_MAT(A) || A->rows != 3 || A->cols != 3 ||
154 if( !CV_IS_MAT(dist_coeffs) || (dist_coeffs->rows != 1 && dist_coeffs->cols != 1) ||
155 (dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 4 &&
156 dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 5) ||
163 _k = cvMat( dist_coeffs->rows, dist_coeffs->cols,
213 if( !CV_IS_MAT(A) || A->rows != 3 || A->cols != 3 ||
217 if( !CV_IS_MAT(dist_coeffs) || (dist_coeffs->rows != 1 && dist_coeffs->cols != 1) ||
218 (dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 4 &&
219 dist_coeffs->rows*dist_coeffs->cols*CV_MAT_CN(dist_coeffs->type) != 5) ||
226 _k = cvMat( dist_coeffs->rows, dist_coeffs->cols
[all...] |
| /external/ceres-solver/internal/ceres/ |
| compressed_col_sparse_matrix_utils.h | 71 const IntegerType* rows,
78 const IntegerType r = rows[idx];
92 const IntegerType* rows,
98 const IntegerType r = rows[idx];
118 const IntegerType* rows,
128 const IntegerType r = rows[idx];
136 SolveUpperTriangularInPlace(num_cols, rows, cols, values, solution);
|
| compressed_row_sparse_matrix.cc | 47 // duplicates in the pair of arrays rows and cols, i.e., there is no
50 // rows[i] == rows[j] && cols[i] == cols[j]
54 RowColLessThan(const int* rows, const int* cols)
55 : rows(rows), cols(cols) {
59 if (rows[x] == rows[y]) {
62 return (rows[x] < rows[y])
65 const int* rows; member in struct:ceres::internal::__anon6384::RowColLessThan
329 int* rows = matrix->mutable_rows(); local
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/effects/ |
| GrTextureStripAtlas.h | 19 * Maintains a single large texture whose rows store many textures of a small fixed height,
20 * stored in rows across the x-axis such that we can safely wrap/repeat them horizontally.
107 * Grabs the least recently used free row out of the LRU list, returns NULL if no rows are free.
121 * Compare two atlas rows by key, so we can sort/search by key
164 // Total locks on all rows (when this reaches zero, we can unlock our texture)
171 // Array of AtlasRows which store the state of all our rows. Stored in a contiguous array, in
176 // Head and tail for linked list of least-recently-used rows (front = least recently used).
|
| /external/eigen/Eigen/src/Core/ |
| Random.h | 31 * The parameters \a rows and \a cols are the number of rows and of columns of
35 * it is redundant to pass \a rows and \a cols as arguments, so Random() should be used
49 DenseBase<Derived>::Random(Index rows, Index cols)
51 return NullaryExpr(rows, cols, internal::scalar_random_op<Scalar>());
112 return *this = Random(rows(), cols());
134 * \param nbRows the new number of rows
|
| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 56 : m_householder(matrix.rows(), matrix.cols()),
91 Index rows = matrix.rows(); local
94 eigen_assert(rows >= cols && "UpperBidiagonalization is only for matrices satisfying rows>=cols.");
98 ColVectorType temp(rows);
102 Index remainingRows = rows - k;
|
| /external/eigen/test/ |
| mapstride.cpp | 56 Index rows = _m.rows(), cols = _m.cols(); local
58 MatrixType m = MatrixType::Random(rows,cols);
60 Index arraysize = 2*(rows+4)*(cols+4);
69 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1));
88 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4));
101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2));
|
| product_notemporary.cpp | 41 Index rows = m.rows(); local
44 ColMajorMatrixType m1 = MatrixType::Random(rows, cols),
45 m2 = MatrixType::Random(rows, cols),
46 m3(rows, cols);
47 RowVectorType rv1 = RowVectorType::Random(rows), rvres(rows);
49 RowMajorMatrixType rm3(rows, cols);
58 r1 = internal::random<Index>(8,rows-r0);
|
| /external/skia/src/gpu/effects/ |
| GrTextureStripAtlas.h | 19 * Maintains a single large texture whose rows store many textures of a small fixed height,
20 * stored in rows across the x-axis such that we can safely wrap/repeat them horizontally.
107 * Grabs the least recently used free row out of the LRU list, returns NULL if no rows are free.
121 * Compare two atlas rows by key, so we can sort/search by key
163 // Total locks on all rows (when this reaches zero, we can unlock our texture)
170 // Array of AtlasRows which store the state of all our rows. Stored in a contiguous array, in
175 // Head and tail for linked list of least-recently-used rows (front = least recently used).
|
| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor_table.cc | 93 void AutocompleteActionPredictorTable::GetAllRows(Rows* row_buffer) {
117 AddAndUpdateRows(Rows(1, row), Rows());
126 AddAndUpdateRows(Rows(), Rows(1, row));
130 const Rows& rows_to_add,
131 const Rows& rows_to_update) {
138 for (Rows::const_iterator it = rows_to_add.begin();
156 for (Rows::const_iterator it = rows_to_update.begin();
|
| /frameworks/base/core/tests/coretests/src/android/widget/ |
| SimpleCursorAdapterTest.java | 68 private ArrayList<ArrayList> createTestList(int rows, int cols) {
72 for (int i = 0; i < rows; i++) {
92 // Now see if we can pull 2 rows from the adapter
103 // The adapter should report zero rows
114 // Now see if we can pull 2 rows from the adapter
117 // now put in a different cursor (5 rows)
122 // Now see if we can pull 5 rows from the adapter
133 // Now see if we can pull 2 rows from the adapter
139 // The adapter should report zero rows
|
| /external/chromium_org/chrome/browser/history/android/ |
| android_urls_database.h | 41 // Deletes the rows whose url_id is in |url_ids|. Returns true if all
45 // Deletes all the rows whose url_id doesn't exist in urls table. Returns true
55 // Clears all the rows in android_urls table, returns true on success, false
|
| /external/chromium_org/chrome/browser/history/ |
| history_notifications.h | 44 // Lists the information for each of the URLs affected. The rows will have the
62 // indicating that a subset of history has been deleted. The rows will have
65 URLRows rows; member in struct:history::URLsDeletedDetails
|
| /external/chromium_org/sql/ |
| recovery_unittest.cc | 26 // columns and |row_sep| between rows.
442 size_t rows = 0; local
443 EXPECT_TRUE(recovery->AutoRecoverTable("x", 0, &rows));
444 EXPECT_EQ(2u, rows);
465 size_t rows = 0; local
466 EXPECT_FALSE(recovery->AutoRecoverTable("y", 0, &rows));
481 // rows. The row with 17 will get the default injected at insert
504 // defaults coming from the recovery system. The two %5 rows should
522 size_t rows = 0; local
523 EXPECT_TRUE(recovery->AutoRecoverTable("x", 0, &rows));
558 size_t rows = 0; local
597 size_t rows = 0; local
642 size_t rows = 0; local
677 size_t rows = 0; local
710 size_t rows = 0; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/modules/webdatabase/ |
| SQLResultSet.cpp | 55 // If the query didn't result in any rows being added, raise an InvalidAccessError exception
59 exceptionState.throwDOMException(InvalidAccessError, "The query didn't result in any rows being added.");
68 SQLResultSetRowList* SQLResultSet::rows() const function in class:blink::SQLResultSet
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_linear.h | 63 unsigned rows; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
100 if (t->size < t->stride * t->rows * t->tiles_y)
|
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixMatrix_MKL.h | 102 Index rows = IsLower ? _rows : diagSize; \
110 if (rows != depth) { \
114 if (((nthr==1) && (((std::max)(rows,depth)-diagSize)/(double)diagSize < 0.5))) { \
122 Map<const MatrixLhs, 0, OuterStride<> > lhsMap(_lhs,rows,depth,OuterStride<>(lhsStride)); \
127 rows, cols, depth, aa_tmp.data(), aStride, _rhs, rhsStride, res, resStride, alpha, gemm_blocking, 0); \
161 Map<const MatrixLhs, 0, OuterStride<> > lhs(_lhs,rows,depth,OuterStride<>(lhsStride)); \
181 Map<MatrixX##EIGPREFIX, 0, OuterStride<> > res_tmp(res,rows,cols,OuterStride<>(resStride)); \
216 Index rows = _rows; \
241 rows, cols, depth, _lhs, lhsStride, aa_tmp.data(), aStride, res, resStride, alpha, gemm_blocking, 0); \
257 m = (MKL_INT)rows; \
[all...] |
| /external/eigen/Eigen/src/Householder/ |
| BlockHouseholder.h | 27 eigen_assert(triFactor.rows() == nbVecs && triFactor.cols() == nbVecs && vectors.rows()>=nbVecs);
31 Index rs = vectors.rows() - i;
|
| /external/eigen/Eigen/src/misc/ |
| Kernel.h | 26 MatrixType::ColsAtCompileTime, // the number of rows in the "kernel matrix"
50 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::kernel_retval_base
75 using Base::rows; \
|
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.h | 27 struct C_MatrixXd* MatrixXd_new(int rows, int cols);
31 void MatrixXd_resize (struct C_MatrixXd *m, int rows, int cols);
50 struct C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols);
|
| /external/eigen/unsupported/Eigen/src/AutoDiff/ |
| AutoDiffJacobian.h | 60 ActiveValue av(jac.rows());
63 for (Index j=0; j<jac.rows(); j++)
71 for (Index i=0; i<jac.rows(); i++)
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_linear.h | 63 unsigned rows; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
100 if (t->size < t->stride * t->rows * t->tiles_y)
|
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/ |
| OnItemSelectedListener.java | 26 * item or selected row when user selects rows outside row UI (e.g. headers left of
27 * rows).
30 * selection changes between rows, regardless if row view has focus or not.
|
| OnItemViewSelectedListener.java | 24 * item or selected row when user selects rows outside row UI (e.g. headers left of
25 * rows).
28 * selection changes between rows, regardless if row view has focus or not.
|
| /packages/apps/Camera2/jni/ |
| jpegutilnative.cpp | 27 * @param yRStride the stride between adjacent rows in yBuf
30 * @param cbRStride the stride between adjacent rows in cbBuf
33 * @param crRStride the stride between adjacent rows in crBuf
|
