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

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/chrome_frame/test/data/
chrome_frame_http_header_frameset.html 14 <frameset rows="10%, *">
  /external/chromium_org/third_party/mesa/src/src/glsl/builtins/tools/
generate_outerProductGLSL.py 16 gen(2,3) # mat2x3 means 2 columns, 3 rows
  /external/eigen/Eigen/src/Core/
EigenBase.h 43 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
44 inline Index rows() const { return derived().rows(); } function in struct:Eigen::EigenBase
45 /** \returns the number of columns. \sa rows(), ColsAtCompileTime*/
47 /** \returns the number of coefficients, which is rows()*cols().
48 * \sa rows(), cols(), SizeAtCompileTime. */
49 inline Index size() const { return rows() * cols(); }
60 typename Dest::PlainObject res(rows(),cols());
70 typename Dest::PlainObject res(rows(),cols());
  /external/eigen/Eigen/src/Geometry/
Homogeneous.h 75 inline Index rows() const { return m_matrix.rows() + (int(Direction)==Vertical ? 1 : 0); } function in class:Eigen::Homogeneous
80 if( (int(Direction)==Vertical && row==m_matrix.rows())
179 Direction==Vertical ? _expression().rows()-1 : _expression().rows(),
185 Direction==Vertical ? _expression().rows()-1:0,
187 Direction==Vertical ? 1 : _expression().rows(),
189 Direction==Vertical ? _expression().rows()-1 : 1,
246 inline Index rows() const { return m_lhs.rows(); } function in struct:Eigen::internal::homogeneous_left_product_impl
285 inline Index rows() const { return m_lhs.rows(); } function in struct:Eigen::internal::homogeneous_right_product_impl
    [all...]
  /external/eigen/test/eigen2/
eigen2_qr.cpp 18 int rows = m.rows(); local
25 MatrixType a = MatrixType::Random(rows,cols);
28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR());
  /external/eigen/test/
jacobisvd.cpp 21 Index rows = m.rows(); local
36 MatrixType sigma = MatrixType::Zero(rows,cols);
52 Index rows = m.rows(); local
54 Index diagSize = (std::min)(rows, cols);
74 Index rows = m.rows(); local
85 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols));
95 if (QRPreconditioner == NoQRPreconditioner && m.rows() != m.cols()
143 Index rows = m.rows(); local
    [all...]
product_trmm.cpp 13 void trmm(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE),
26 TriMatrix mat(rows,cols), tri(rows,cols), triTr(cols,rows);
29 OnTheLeft ge_left(otherCols,rows);
65 void trmv(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE))
67 trmm<Scalar,Mode,TriOrder,ColMajor,ColMajor,1>(rows,cols,1);
71 void trmm(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int otherCols = internal::random<int>(1,EIGEN_TEST_MAX_SIZE))
73 trmm<Scalar,Mode,TriOrder,OtherOrder,ResOrder,Dynamic>(rows,cols,otherCols);
redux.cpp 18 Index rows = m.rows(); local
21 MatrixType m1 = MatrixType::Random(rows, cols);
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + Scalar(0.2) * m1;
27 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
28 VERIFY_IS_APPROX(MatrixType::Ones(rows, cols).sum(), Scalar(float(rows*cols))); // the float() here to shut up excessive MSVC warning about int->complex conversion being lossy
31 for(int i = 0; i < rows; i++)
38 const Scalar mean = s/Scalar(RealScalar(rows*cols));
47 Index r0 = internal::random<Index>(0,rows-1)
    [all...]
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
IncompleteLU.h 34 Index rows() const { return m_lu.rows(); } function in class:Eigen::IncompleteLU
84 eigen_assert(cols()==b.rows()
85 && "IncompleteLU::solve(): invalid number of rows of the right hand side matrix b");
  /external/eigen/unsupported/Eigen/src/Skyline/
SkylineInplaceLU.h 37 : /*m_matrix(matrix.rows(), matrix.cols()),*/ m_flags(flags), m_status(0), m_lu(matrix) {
121 const size_t rows = m_lu.rows(); local
124 eigen_assert(rows == cols && "We do not (yet) support rectangular LU.");
127 for (Index row = 0; row < rows; row++) {
138 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
157 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
170 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
185 const size_t rows = m_lu.rows(); local
308 const size_t rows = m_lu.rows(); local
    [all...]
  /external/kernel-headers/original/linux/
vt.h 46 unsigned short v_rows; /* number of rows */
53 unsigned short v_rows; /* number of rows */
55 unsigned short v_vlin; /* number of pixel rows on screen */
56 unsigned short v_clin; /* number of pixel rows per character */
  /external/libvpx/libvpx/vp9/common/
vp9_debugmodes.c 31 int rows = cm->mi_rows; local
37 for (mi_row = 0; mi_row < rows; mi_row++) {
56 int rows = cm->mi_rows; local
67 for (mi_row = 0; mi_row < rows; mi_row++) {
  /external/markdown/markdown/extensions/
imagelinks.py 55 rows = []
72 for row in rows:
99 rows.append([]) # start a new row
109 rows[-1].append((photo_url, title))
  /external/mesa3d/src/glsl/builtins/tools/
generate_outerProductGLSL.py 16 gen(2,3) # mat2x3 means 2 columns, 3 rows
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/
vt.h 58 unsigned short v_rows; /* number of rows */
65 unsigned short v_rows; /* number of rows */
67 unsigned short v_vlin; /* number of pixel rows on screen */
68 unsigned short v_clin; /* number of pixel rows per character */
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/
vt.h 58 unsigned short v_rows; /* number of rows */
65 unsigned short v_rows; /* number of rows */
67 unsigned short v_vlin; /* number of pixel rows on screen */
68 unsigned short v_clin; /* number of pixel rows per character */
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/
vt.h 58 unsigned short v_rows; /* number of rows */
65 unsigned short v_rows; /* number of rows */
67 unsigned short v_vlin; /* number of pixel rows on screen */
68 unsigned short v_clin; /* number of pixel rows per character */
  /external/eigen/Eigen/src/Core/products/
TriangularMatrixMatrix.h 21 // void operator()(Scalar* blockA, const EIGEN_RESTRICT Scalar* _lhs, int lhsStride, int depth, int rows)
26 // const int peeled_mc = (rows/mr)*mr;
33 // for(int i=peeled_mc; i<rows; i++)
60 Index rows, Index cols, Index depth,
74 ::run(cols, rows, depth, rhs, rhsStride, lhs, lhsStride, res, resStride, alpha, blocking);
103 Index rows = IsLower ? _rows : diagSize; local
111 Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction
140 if((!IsLower)&&(k2<rows)&&(k2+actual_kc>rows))
142 actual_kc = rows-k2
232 Index rows = _rows; local
    [all...]
SelfadjointMatrixMatrix.h 46 void operator()(Scalar* blockA, const Scalar* _lhs, Index lhsStride, Index cols, Index rows)
50 Index peeled_mc = (rows/Pack1)*Pack1;
56 if(rows-peeled_mc>=Pack2)
63 for(Index i=peeled_mc; i<rows; i++)
80 void operator()(Scalar* blockB, const Scalar* _rhs, Index rhsStride, Index rows, Index cols, Index k2)
82 Index end_k = k2 + rows;
104 for(Index j2=k2; j2<(std::min)(k2+rows,packet_cols); j2+=nr)
150 for(Index j2=k2+rows; j2<packet_cols; j2+=nr)
176 if(half==j2 && half<k2+rows)
185 for(Index k=half+1; k<k2+rows; k++
    [all...]
  /external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixFunction.h 74 static const int Rows = Traits::RowsAtCompileTime;
81 typedef Matrix<ComplexScalar, Rows, Cols, Options, MaxRows, MaxCols> ComplexMatrix;
238 const Index rows = m_T.rows(); local
241 for (Index i=0; i<rows; ++i) {
253 for (Index j=i+1; j<rows; ++j) {
288 const Index rows = m_T.rows(); local
293 m_eivalToCluster.resize(rows);
296 for (Index i = 0; i < diag.rows(); ++i)
527 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixFunctionReturnValue
    [all...]
  /external/opencv/cv/src/
cvtemplmatch.cpp 103 if( img->cols < templ->cols || img->rows < templ->rows )
107 if( corr->rows > img->rows + templ->rows - 1 ||
115 blocksize.height = cvRound(templ->rows*block_scale);
116 blocksize.height = MAX( blocksize.height, min_block_size - templ->rows + 1 );
117 blocksize.height = MIN( blocksize.height, corr->rows );
122 dftsize.height = cvGetOptimalDFTSize(blocksize.height + templ->rows - 1);
129 blocksize.height = dftsize.height - templ->rows + 1
    [all...]
  /external/chromium_org/third_party/sqlite/src/test/
where3.test 229 0 0 0 {SCAN TABLE t302 (~1 rows)}
230 0 1 1 {SEARCH TABLE t301 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
236 0 0 1 {SCAN TABLE t302 (~1 rows)}
237 0 1 0 {SEARCH TABLE t301 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
242 # the fewest number of output rows as the outer loop.
251 0 0 2 {SCAN TABLE t402 (~500000 rows)}
252 0 1 0 {SCAN TABLE t400 (~1000000 rows)}
253 0 2 1 {SCAN TABLE t401 (~1000000 rows)}
259 0 0 1 {SCAN TABLE t401 (~500000 rows)}
260 0 1 0 {SCAN TABLE t400 (~1000000 rows)}
    [all...]
  /external/ceres-solver/internal/ceres/
covariance_impl.cc 153 const int* rows = covariance_matrix_->rows(); local
155 const int row_size = rows[row_begin + 1] - rows[row_begin];
156 const int* cols_begin = cols + rows[row_begin];
185 ConstMatrixRef cov(covariance_matrix_->values() + rows[row_begin],
280 // Compute the number of rows. Map each parameter block to the
336 int* rows = covariance_matrix_->mutable_rows(); local
339 // Iterate over parameter blocks and in turn over the rows of the
343 // set of compressed rows corresponding to this parameter block
468 const int* rows = covariance_matrix_->rows(); local
698 const int* rows = covariance_matrix_->rows(); local
830 const int* rows = covariance_matrix_->rows(); local
    [all...]
  /frameworks/base/core/java/android/database/sqlite/
SQLiteQueryBuilder.java 183 * @param where A filter declaring which rows to return, formatted as an SQL
185 * return all rows for the given URL.
186 * @param groupBy A filter declaring how to group rows, formatted as an SQL
188 * will cause the rows to not be grouped.
194 * @param orderBy How to order the rows, formatted as an SQL ORDER BY clause
197 * @param limit Limits the number of rows returned by the query,
269 * @param selection A filter declaring which rows to return,
271 * itself). Passing null will return all rows for the given URL.
276 * @param groupBy A filter declaring how to group rows, formatted
278 * itself). Passing null will cause the rows to not be grouped
    [all...]
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IterativeSolverBase.h 115 Index rows() const { return mp_matrix ? mp_matrix->rows() : 0; } function in class:Eigen::IterativeSolverBase
170 eigen_assert(rows()==b.rows()
171 && "IterativeSolverBase::solve(): invalid number of rows of the right hand side matrix b");
184 eigen_assert(rows()==b.rows()
185 && "IterativeSolverBase::solve(): invalid number of rows of the right hand side matrix b");
200 eigen_assert(rows()==b.rows());
    [all...]

Completed in 1004 milliseconds

1 2 3 4 5 6 7 8 91011>>