| /external/eigen/test/ |
| qr_fullpivoting.cpp | 18 Index rows = internal::random<Index>(20,200), cols = internal::random<int>(20,200), cols2 = internal::random<int>(20,200); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
25 createRandomPIMatrixOfRank(rank,rows,cols,m1);
39 for(int i = 0; i < rows; i++) for(int j = 0; j < cols; j++) if(i>j) r(i,j) = Scalar(0);
|
| visitor.cpp | 17 Index rows = p.rows(); local
22 m = MatrixType::Random(rows, cols);
31 for(Index i = 0; i < rows; i++)
|
| /external/libvpx/libvpx/vp8/common/ppc/ |
| systemdependent.c | 27 extern void (*vp8_mbpost_proc_down)(unsigned char *dst, int pitch, int rows, int cols, int flimit);
28 extern void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols, int flimit);
29 extern void (*vp8_mbpost_proc_across_ip)(unsigned char *src, int pitch, int rows, int cols, int flimit);
30 extern void vp8_mbpost_proc_across_ip_c(unsigned char *src, int pitch, int rows, int cols, int flimit);
|
| /external/linux-tools-perf/util/ |
| svghelper.h | 6 extern void open_svg(const char *filename, int cpus, int rows, u64 start, u64 end);
|
| /external/mesa3d/docs/ |
| index.html | 8 <frameset rows="80,*" border="0" frameborder="yes">
|
| /external/mesa3d/src/glsl/builtins/tools/ |
| generate_matrixCompMultGLSL.py | 23 gen_matrix(2,3) # mat2x3 means 2 columns, 3 rows
|
| generate_transposeGLSL.py | 21 gen(2,3) # mat2x3 means 2 columns, 3 rows
|
| /external/opencv/cvaux/src/ |
| cvvideo.cpp | 65 frame->rows != even->rows*2 || odd->rows != even->rows )
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| TiledWorld.java | 35 public TiledWorld(int cols, int rows) {
37 mTilesArray = new int[cols][rows];
38 mRowCount = rows;
42 for (int y = 0; y < rows; y++) {
|
| /external/webp/src/utils/ |
| rescaler.h | 54 // Import multiple rows over all channels, until at least one row is ready to
59 // Return true if there is pending output rows ready.
69 // Export as many rows as possible. Return the numbers of rows written.
|
| /frameworks/base/core/java/android/provider/ |
| BaseColumns.java | 28 * The count of rows in a directory.
|
| /frameworks/base/core/tests/coretests/src/android/widget/gridview/ |
| GridVerticalSpacing.java | 22 * A grid with vertical spacing between rows
|
| GridVerticalSpacingStackFromBottom.java | 22 * A grid with vertical spacing between rows that stacks from the bottom
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| autoindex1.test | 150 0 0 0 {SEARCH TABLE t501 USING INTEGER PRIMARY KEY (rowid=?) (~25 rows)}
152 1 0 0 {SCAN TABLE t502 (~100000 rows)}
159 0 0 0 {SCAN TABLE t501 (~500000 rows)}
161 1 0 0 {SEARCH TABLE t502 USING AUTOMATIC COVERING INDEX (y=?) (~7 rows)}
169 0 0 0 {SEARCH TABLE t501 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
171 1 0 0 {SCAN TABLE t502 (~100000 rows)}
243 1 0 0 {SCAN TABLE sheep AS s (~1000000 rows)}
244 1 1 1 {SEARCH TABLE flock_owner AS prev USING INDEX sqlite_autoindex_flock_owner_1 (flock_no=? AND owner_change_date<?) (~2 rows)}
246 2 0 0 {SEARCH TABLE flock_owner AS later USING COVERING INDEX sqlite_autoindex_flock_owner_1 (flock_no=? AND owner_change_date>? AND owner_change_date<?) (~1 rows)}
247 0 0 0 {SCAN TABLE sheep AS x USING INDEX sheep_reg_flock_index (~1000000 rows)}
[all...] |
| 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/SparseCore/ |
| TriangularSolver.h | 35 for(int i=0; i<lhs.rows(); ++i)
69 for(int i=lhs.rows()-1 ; i>=0 ; --i)
168 eigen_assert(m_matrix.cols() == m_matrix.rows() && m_matrix.cols() == other.rows());
216 AmbiVector<Scalar,Index> tempVector(other.rows()*2);
217 tempVector.setBounds(0,other.rows());
219 Rhs res(other.rows(), other.cols());
225 tempVector.init(.99/*float(other.col(col).nonZeros())/float(other.rows())*/);
280 // std::cout << "tempVector.nonZeros() == " << int(count) << " / " << (other.rows()) << "\n";
293 eigen_assert(m_matrix.cols() == m_matrix.rows() && m_matrix.cols() == other.rows())
[all...] |
| /external/eigen/doc/ |
| SparseQuickReference.dox | 71 Beyond the functions rows() and cols() that are used to get the number of rows and columns, there are some useful functions that are available to easily get some informations from the matrix.
75 sm1.rows(); // Number of rows
78 sm1.outerSize(); // Number of columns (resp. rows) for a column major (resp. row major )
79 sm1.innerSize(); // Number of rows (resp. columns) for a row major (resp. column major)
169 In many cases, it is necessary to reorder the rows and/or the columns of the sparse matrix for several purposes : fill-in reducing during matrix decomposition, better data locality for sparse matrix-vector products... The class PermutationMatrix is available to this end.
174 sm1.twistedBy(perm) //Apply the permutation on rows and columns
176 sm2 = perm * sm1; // ??? Apply the permutation on rows ???;
180 The following functions are useful to extract a block of rows (resp. columns) from a row-major (resp. column major) sparse matrix. Note that because of the part (…)
[all...] |
| QuickReference.dox | 50 \li \c RowsAtCompileTime and \c ColsAtCompileTime are the number of rows and columns of the matrix as known at compile-time or \c Dynamic.
53 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:
56 Matrix<double, Dynamic, 2> // Dynamic number of rows (heap allocation)
146 matrix.rows(); matrix.cols();
231 x = Dynamic2D::Zero(rows, cols);
232 x = Dynamic2D::Ones(rows, cols);
233 x = Dynamic2D::Constant(rows, cols, value);
234 x = Dynamic2D::Random(rows, cols);
237 x.setZero(rows, cols);
238 x.setOnes(rows, cols)
[all...] |
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| DynamicSparseMatrix.h | 25 * nonzero and outer_size is the number of columns if the matrix is column-major and the number of rows
80 inline Index rows() const { return IsRowMajor ? outerSize() : m_innerSize; } function in class:Eigen::DynamicSparseMatrix
197 void resize(Index rows, Index cols)
199 const Index outerSize = IsRowMajor ? rows : cols;
200 m_innerSize = IsRowMajor ? cols : rows;
208 void resizeAndKeepData(Index rows, Index cols)
210 const Index outerSize = IsRowMajor ? rows : cols;
211 const Index innerSize = IsRowMajor ? cols : rows;
233 EIGEN_DEPRECATED inline DynamicSparseMatrix(Index rows, Index cols)
236 resize(rows, cols)
[all...] |
| /external/jpeg/ |
| jcprepct.c | 12 * Most of the complexity here is associated with buffering input rows
22 /* At present, jcsample.c can request context rows only for smoothing.
23 * In the future, we might also need context rows for CCIR601 sampling
25 * context rows should be compiled only if needed.
39 * When providing context rows, we must buffer three row groups' worth of
43 * This allows the downsampler to access the proper context rows.
44 * At the top and bottom of the image, we create dummy context rows by
61 JDIMENSION rows_to_go; /* counts rows remaining in source image */
122 * is defined to be v_samp_factor sample rows of each component.
124 * input rows
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jcprepct.c | 12 * Most of the complexity here is associated with buffering input rows
22 /* At present, jcsample.c can request context rows only for smoothing.
23 * In the future, we might also need context rows for CCIR601 sampling
25 * context rows should be compiled only if needed.
39 * When providing context rows, we must buffer three row groups' worth of
43 * This allows the downsampler to access the proper context rows.
44 * At the top and bottom of the image, we create dummy context rows by
61 JDIMENSION rows_to_go; /* counts rows remaining in source image */
122 * is defined to be v_samp_factor sample rows of each component.
124 * input rows
[all...] |
| /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; \
|
