| /external/chromium_org/third_party/skia/src/core/ |
| SkConvolver.cpp | 23 // Stores a list of rows in a circular buffer. The usage is you write into it
25 // should use next, and the total number of rows added.
29 // The maximum number of rows needed in the buffer is |maxYFilterSize|
30 // (we only need to store enough rows for the biggest filter).
33 // following rows returned by Advance().
58 // Returns a pointer to an "unrolled" array of rows. These rows will start
60 // order for the maximum number of rows in this circular buffer.
74 // to the firstRowIndex and the negative rows will never be used.
91 // The buffer storing the rows. They are packed, each one fRowByteWidth
[all...] |
| /external/eigen/Eigen/src/Householder/ |
| HouseholderSequence.h | 85 return Block<const VectorsType,Dynamic,1>(h.m_vectors, start, k, h.rows()-start, 1);
98 return Block<const VectorsType,1,Dynamic>(h.m_vectors, k, start, 1, h.rows()-start).transpose();
144 * i-th column). If \p v has fewer columns than rows, then the Householder sequence contains as many
170 /** \brief Number of rows of transformation viewed as a matrix.
171 * \returns Number of rows
174 Index rows() const { return Side==OnTheLeft ? m_vectors.rows() : m_vectors.cols(); } function in class:Eigen::HouseholderSequence
180 Index cols() const { return rows(); }
230 AutoAlign|ColMajor, DestType::MaxRowsAtCompileTime, 1> workspace(rows());
238 workspace.resize(rows());
[all...] |
| /external/freetype/src/base/ |
| ftbitmap.c | 65 size = (FT_ULong)( pitch * source->rows );
75 target_size = (FT_ULong)( target_pitch * target->rows );
114 height = bitmap->rows;
178 if ( FT_QALLOC_MULT( buffer, new_pitch, bitmap->rows + ypixels ) )
186 for ( i = 0; i < bitmap->rows; i++ )
195 for ( i = 0; i < bitmap->rows; i++ )
298 p = bitmap->buffer + pitch * ( bitmap->rows - 1 );
302 for ( y = 0; y < bitmap->rows ; y++ )
356 * Make the above `ystr' rows or'ed with it.
372 bitmap->rows += ystr
[all...] |
| /external/skia/src/core/ |
| SkConvolver.cpp | 23 // Stores a list of rows in a circular buffer. The usage is you write into it
25 // should use next, and the total number of rows added.
29 // The maximum number of rows needed in the buffer is |maxYFilterSize|
30 // (we only need to store enough rows for the biggest filter).
33 // following rows returned by Advance().
58 // Returns a pointer to an "unrolled" array of rows. These rows will start
60 // order for the maximum number of rows in this circular buffer.
74 // to the firstRowIndex and the negative rows will never be used.
91 // The buffer storing the rows. They are packed, each one fRowByteWidth
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/tests/ |
| uniform_initializer_utils.h | 37 unsigned columns, unsigned rows,
42 unsigned columns, unsigned rows, unsigned array_size,
|
| /external/chromium_org/tools/perf/utils/results_viewer/src/ |
| results_viewer.js | 36 var rows = fileContents.split('\n');
38 rows.forEach(function (row, index, array) {
|
| /external/chromium_org/ui/app_list/cocoa/ |
| apps_collection_view_drag_manager.h | 44 rows:(size_t)rows
|
| /external/eigen/Eigen/src/Core/ |
| Select.h | 68 eigen_assert(m_condition.rows() == m_then.rows() && m_condition.rows() == m_else.rows());
72 Index rows() const { return m_condition.rows(); } function in class:Eigen::Select
142 derived(), thenMatrix.derived(), ThenDerived::Constant(rows(),cols(),elseScalar));
157 derived(), ElseDerived::Constant(rows(),cols(),thenScalar), elseMatrix.derived());
|
| SelfCwiseBinaryOp.h | 57 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::SelfCwiseBinaryOp
91 eigen_internal_assert(row >= 0 && row < rows()
110 eigen_internal_assert(row >= 0 && row < rows()
136 eigen_assert(rows() == rhs.rows() && cols() == rhs.cols());
176 tmp = PlainObject::Constant(rows(),cols(),other);
188 tmp = PlainObject::Constant(rows(),cols(), NumTraits<Scalar>::IsInteger ? other : Scalar(1)/other);
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixVector_MKL.h | 57 Index rows, Index cols, \
64 rows, cols, lhs, lhsStride, rhs, rhsIncr, res, resIncr, alpha); \
67 rows, cols, lhs, lhsStride, rhs, rhsIncr, res, resIncr, alpha); \
74 Index rows, Index cols, \
80 rows, cols, lhs, lhsStride, rhs, rhsIncr, res, resIncr, alpha); \
96 Index rows, Index cols, \
101 MKL_INT m=rows, n=cols, lda=lhsStride, incx=rhsIncr, incy=resIncr; \
107 n=rows; \
|
| /external/eigen/bench/ |
| BenchSparseUtil.h | 27 void fillMatrix(float density, int rows, int cols, EigenSparseMatrix& dst)
29 dst.reserve(double(rows)*cols*density);
32 for(int i = 0; i < rows; i++)
42 void fillMatrix2(int nnzPerCol, int rows, int cols, EigenSparseMatrix& dst)
51 int k = internal::random<int>(0,rows-1);
53 k = internal::random<int>(0,rows-1);
76 GmmDynSparse tmp(src.rows(), src.cols());
130 dst.resize(src.rows(), src.cols(), false);
|
| sparse_cholesky.cpp | 44 void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst)
46 dst.startFill(rows*cols*density);
50 for(int i = j+1; i < rows; i++)
79 int rows = SIZE; local
92 EigenSparseSelfAdjointMatrix sm1(rows, cols);
94 fillSpdMatrix(density, rows, cols, sm1);
103 DenseMatrix m1(rows,cols);
118 for (int i=j; i<rows; ++i)
|
| /external/eigen/test/ |
| eigensolver_selfadjoint.cpp | 21 Index rows = m.rows(); local
32 MatrixType a = MatrixType::Random(rows,cols);
33 MatrixType a1 = MatrixType::Random(rows,cols);
37 MatrixType b = MatrixType::Random(rows,cols);
38 MatrixType b1 = MatrixType::Random(rows,cols);
85 MatrixType id = MatrixType::Identity(rows, cols);
105 if (rows > 1)
|
| diagonal.cpp | 20 Index rows = m.rows(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols);
31 if (rows>2)
|
| jacobi.cpp | 19 Index rows = m.rows(); local
29 const MatrixType a(MatrixType::Random(rows, cols));
36 Index p = internal::random<Index>(0, rows-1);
39 q = internal::random<Index>(0, rows-1);
|
| stddeque.cpp | 20 Index rows = m.rows(); local
22 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
23 std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
|
| stdlist.cpp | 20 Index rows = m.rows(); local
22 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
23 std::list<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
|
| /external/eigen/unsupported/test/ |
| matrix_exponential.cpp | 110 typename MatrixType::Index rows = m.rows(); local
112 MatrixType m1(rows, cols), m2(rows, cols), m3(rows, cols),
113 identity = MatrixType::Identity(rows, rows);
118 m1 = MatrixType::Random(rows, cols);
|
| /external/javasqlite/src/main/java/SQLite/JDBC2z/ |
| TableResultX.java | 27 this.rows = tr.rows;
|
| /external/mesa3d/src/glsl/tests/ |
| uniform_initializer_utils.h | 37 unsigned columns, unsigned rows,
42 unsigned columns, unsigned rows, unsigned array_size,
|
| /external/opencv/cxcore/include/ |
| cxcore.hpp | 214 CvMatrix( int rows, int cols, int type )
215 { matrix = cvCreateMat( rows, cols, type ); }
217 CvMatrix( int rows, int cols, int type, CvMat* hdr,
219 { matrix = cvInitMatHeader( hdr, rows, cols, type, data, step ); }
221 CvMatrix( int rows, int cols, int type, CvMemStorage* storage, bool alloc_data=true );
223 CvMatrix( int rows, int cols, int type, void* data, int step=CV_AUTOSTEP )
224 { matrix = cvCreateMatHeader( rows, cols, type );
260 void create( int rows, int cols, int type )
263 matrix->rows != rows || matrix->cols != cols |
312 int rows() const { return matrix ? matrix->rows : 0; } function in class:CvMatrix
[all...] |
| /build/tools/ |
| compare_fileslist.py | 46 rows = []
54 rows.append(row)
55 rows = sorted(rows, key=lambda x: x[0])
89 for row in rows:
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| analyze4.test | 13 # implements tests for ANALYZE to verify that multiple rows containing
14 # a NULL value count as distinct rows for the purposes of analyze
41 } {0 0 0 {SEARCH TABLE t1 USING INDEX t1a (a=?) (~1 rows)}}
53 # that the number of rows selected in stat1 is half the total
54 # number of rows.
|
| /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/util/ |
| sorttable.js | 21 -To avoid including the non-data rows (e.g., radio buttions) into sorting,
55 the.appendChild(table.rows[0]);
61 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
63 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
64 // "total" rows, for example). This is B&R, since what you're supposed
65 // to do is put them in a tfoot. So, if there are sortbottom rows,
68 for (var i=0; i<table.rows.length; i++) {
69 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
70 sortbottomrows[sortbottomrows.length] = table.rows[i]
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/benchmark/util/ |
| sorttable.js | 21 -To avoid including the non-data rows (e.g., radio buttions) into sorting,
53 the.appendChild(table.rows[0]);
59 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
61 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
62 // "total" rows, for example). This is B&R, since what you're supposed
63 // to do is put them in a tfoot. So, if there are sortbottom rows,
66 for (var i=0; i<table.rows.length; i++) {
67 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
68 sortbottomrows[sortbottomrows.length] = table.rows[i]
[all...] |
