HomeSort by relevance Sort by last modified time
    Searched full:rows (Results 301 - 325 of 2399) sorted by null

<<11121314151617181920>>

  /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)
  /external/eigen/Eigen/src/Core/
Matrix.h 29 * \tparam _Rows Number of rows, or \b Dynamic
37 * \tparam _MaxRows Maximum number of rows. Defaults to \a _Rows (\ref maxrows "note").
82 * <dd>Fixed-size means that the numbers of rows and columns are known are compile-time. In this case, Eigen allocates the array
86 * Dynamic-size means that the numbers of rows or columns are not necessarily known at compile-time. In this case they are runtime
94 * These parameters mean the maximum size of rows and columns that the matrix may have. They are useful in cases
95 * when the exact numbers of rows and columns are not known are compile-time, but it is known at compile-time that they cannot
238 /** \brief Constructs an uninitialized matrix with \a rows rows and \a cols columns.
243 Matrix(Index rows, Index cols);
273 : Base(other.rows() * other.cols(), other.rows(), other.cols()
    [all...]
DenseBase.h 60 using Base::rows;
93 /**< The number of rows at compile-time. This is just a copy of the value provided
96 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
102 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
108 * rows times the number of columns, or to \a Dynamic if this is not
112 /**< This value is equal to the maximum possible number of rows that this expression
113 * might have. If this expression might have an arbitrarily high number of rows,
147 /**< This is set to true if either the number of rows or the number of
176 /** \returns true if either the number of rows or the number of columns is equal to 1.
178 * \code rows()==1 || cols()==1 \endcod
    [all...]
Swap.h 38 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::SwapWrapper
76 eigen_internal_assert(row >= 0 && row < rows()
97 eigen_internal_assert(row >= 0 && row < rows()
  /external/opencv/cv/src/
cvcalibration.cpp 89 if( !param || param->rows != nparams || nerrs != (err ? err->rows : 0) )
260 int i, j, nparams = param->rows;
295 CV_ASSERT( A->cols == B->rows );
297 M = A->rows;
305 dABdA->rows == A->rows*B->cols && dABdA->cols == A->rows*A->cols );
311 dABdB->rows == A->rows*B->cols && dABdB->cols == B->rows*B->cols )
    [all...]
  /frameworks/base/tools/aapt/
Images.cpp 36 image_info() : rows(NULL), is9Patch(false), allocRows(NULL) { }
38 if (rows && rows != allocRows) {
39 free(rows);
54 png_bytepp rows; member in struct:image_info
111 outImageInfo->rows = (png_bytepp)malloc(
114 outImageInfo->allocRows = outImageInfo->rows;
116 png_set_rows(read_ptr, read_info, outImageInfo->rows);
120 outImageInfo->rows[i] = (png_bytep)
124 png_read_image(read_ptr, outImageInfo->rows);
1093 png_bytepp rows; local
    [all...]
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/keyboard/
MoreKeysKeyboardBuilderTests.java 74 assertEquals("1 key max 5 M0 rows", 1, params.mNumRows);
86 assertEquals("1 key max 5 L0 rows", 1, params.mNumRows);
98 assertEquals("1 key max 5 L1 rows", 1, params.mNumRows);
110 assertEquals("1 key max 5 L2 rows", 1, params.mNumRows);
122 assertEquals("1 key max 5 R0 rows", 1, params.mNumRows);
134 assertEquals("1 key max 5 R1 rows", 1, params.mNumRows);
146 assertEquals("1 key max 5 R2 rows", 1, params.mNumRows);
158 assertEquals("2 key max 5 M0 rows", 1, params.mNumRows);
171 assertEquals("2 key max 5 L0 rows", 1, params.mNumRows);
184 assertEquals("2 key max 5 L1 rows", 1, params.mNumRows)
    [all...]
  /external/chromium_org/chrome/browser/thumbnails/
content_analysis.h 39 std::vector<float>* rows,
66 // Shrinks the source |bitmap| by removing rows and columns where |rows| and
70 const std::vector<bool>& rows,
  /external/chromium_org/chrome/common/extensions/docs/examples/api/storage/stylizr/
options.html 33 <textarea name="style_url" id="style_url" cols=80 rows=24
  /external/chromium_org/chrome/test/functional/perf/endure_graphs/
endure_plotter.js 32 function Rows(data) {
33 this.rows = data.split('\n');
34 this.length = this.rows.length;
43 Rows.prototype.get = function(i) {
44 if (!this.rows[i].length) return null;
45 var row = jsonToJs(this.rows[i]);
256 * @param {Rows} dataRows The |Rows| object containing the plot data.
339 var rows = new Rows(data)
    [all...]
  /external/chromium_org/third_party/WebKit/ManualTests/
textarea-caret-position-after-auto-spell-correct.html 6 <textarea rows="6" cols="35">
  /external/chromium_org/third_party/WebKit/Source/platform/graphics/filters/custom/
CustomFilterMeshGenerator.h 41 // Lines and columns are the values passed in CSS. The result is vertex mesh that has 'rows' numbers of rows
42 // and 'columns' number of columns with a total of 'rows + 1' * 'columns + 1' vertices.
45 CustomFilterMeshGenerator(unsigned columns, unsigned rows, const FloatRect& meshBox, CustomFilterMeshType);
  /external/chromium_org/third_party/libwebp/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.
  /external/chromium_org/third_party/mesa/src/docs/
index.html 8 <frameset rows="80,*" border="0" frameborder="yes">
  /external/chromium_org/third_party/mesa/src/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/chromium_org/third_party/pexpect/
screen.py 68 self.rows = r
75 self.scroll_row_end = self.rows
76 self.w = [ [SPACE] * self.cols for c in range(self.rows)]
103 self.fill_region (1,1,self.rows,self.cols, ch)
107 rs = constrain (rs, 1, self.rows)
108 re = constrain (re, 1, self.rows)
157 r = constrain (r, 1, self.rows)
176 r = constrain (r, 1, self.rows)
188 r = constrain (r, 1, self.rows)
201 rs = constrain (rs, 1, self.rows)
    [all...]
  /external/chromium_org/tools/telemetry/telemetry/page/
csv_page_measurement_results_unittest.py 41 rows = list(csv.reader(self.lines))
42 return rows[0]
46 rows = list(csv.reader(self.lines))
47 return rows[1:]
  /external/eigen/Eigen/src/Core/products/
TriangularMatrixVector.h 34 Index rows = IsLower ? _rows : (std::min)(_rows,_cols); local
38 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
46 ResMap res(_res,rows);
61 Index r = IsLower ? rows - pi - actualPanelWidth : pi;
75 rows, cols-size,
97 Index rows = IsLower ? _rows : diagSize; local
101 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
109 ResMap res(_res,rows,InnerStride<>(resIncr));
135 if(IsLower && rows>diagSize)
138 rows-diagSize, cols
    [all...]
  /external/eigen/Eigen/src/Eigen2Support/
LU.h 28 MatrixType::ColsAtCompileTime, // the number of rows in the "kernel matrix" is the number of cols of the original matrix
39 // of rows of the original matrix
43 MatrixType::MaxColsAtCompileTime // so it has the same number of rows and at most as many columns.
61 solve(MatrixType::Identity(this->rows(), this->cols()), result);
  /external/eigen/Eigen/src/UmfPackSupport/
UmfPackSupport.h 153 inline Index rows() const { return m_copyMatrix.rows(); } function in class:Eigen::UmfPackLU
209 eigen_assert(rows()==b.rows()
210 && "UmfPackLU::solve(): invalid number of rows of the right hand side matrix b");
222 // eigen_assert(rows()==b.rows()
223 // && "UmfPAckLU::solve(): invalid number of rows of the right hand side matrix b");
243 errorCode = umfpack_symbolic(matrix.rows(), matrix.cols(), m_outerIndexPtr, m_innerIndexPtr, m_valuePtr,
300 m_copyMatrix.resize(mat.rows(), mat.cols())
347 int lnz, unz, rows, cols, nz_udiag; local
    [all...]
  /external/eigen/bench/
bench_gemm.cpp 47 int M = c.rows(); int N = c.cols(); int K = a.cols();
48 int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows();
58 int M = c.rows(); int N = c.cols(); int K = a.cols();
59 int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows();
69 int M = c.rows(); int N = c.cols(); int K = a.cols();
70 int lda = a.rows(); int ldb = b.rows(); int ldc = c.rows()
    [all...]
sparse_lu.cpp 74 int rows = SIZE; local
87 EigenSparseMatrix sm1(rows, cols);
88 fillMatrix(density, rows, cols, sm1);
96 DenseMatrix m1(rows,cols);
  /external/eigen/test/eigen2/
eigen2_visitor.cpp 16 int rows = p.rows(); local
21 m = MatrixType::Random(rows, cols);
30 for(int i = 0; i < rows; i++)

Completed in 564 milliseconds

<<11121314151617181920>>