| /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++) {
|
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/keyboard/layout/expected/ |
| AbstractKeyboardBuilder.java | 24 * A keyboard consists of an array of rows, and a row consists of an array of elements. Each row
31 // A building array of rows.
50 * elements of <code>rows</rows>.
51 * @param rows the template keyboard rows. The elements of the <code>rows</code> will be
54 AbstractKeyboardBuilder(final E[][] rows) {
55 mRows = newArrayOfArray(rows.length);
56 for (int rowIndex = 0; rowIndex < rows.length; rowIndex++)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/ |
| virtio_console.h | 47 /* rows of the screens */
48 __u16 rows; member in struct:virtio_console_config
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrix.h | 30 Index rows, Index cols, Index depth,
43 ::run(cols,rows,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking,info);
59 static void run(Index rows, Index cols, Index depth,
75 Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction
98 const Index actual_kc = (std::min)(k+kc,depth)-k; // => rows of B', and cols of the A'
143 gebp(res.getSubMapper(0, j), blockA, blockB, rows, actual_kc, actual_nc, alpha);
165 const bool pack_rhs_once = mc!=rows && kc==depth && nc==cols;
168 for(Index i2=0; i2<rows; i2+=mc)
170 const Index actual_mc = (std::min)(i2+mc,rows)-i2;
189 // micro horizontal panel of the large rhs's panel (e.g., rows/12 times)
[all...] |
| /external/ImageMagick/coders/ |
| otb.c | 151 image->rows=(size_t) ReadBlobByte(image);
156 image->rows=(size_t) ReadBlobMSBShort(image);
158 if ((image->columns == 0) || (image->rows == 0))
170 status=SetImageExtent(image,image->columns,image->rows,exception);
176 for (y=0; y < (ssize_t) image->rows; y++)
202 image->rows);
349 if ((image->columns >= 256) || (image->rows >= 256))
352 if ((image->columns >= 256) || (image->rows >= 256))
355 (void) WriteBlobMSBShort(image,(unsigned short) image->rows);
360 (void) WriteBlobByte(image,(unsigned char) image->rows);
[all...] |
| dib.c | 186 (void) ResetMagickMemory(pixels,0,(size_t) image->columns*image->rows*
191 q=pixels+(size_t) image->columns*image->rows;
192 for (y=0; y < (ssize_t) image->rows; )
282 if (SetImageProgress(image,LoadImageTag,y,image->rows) == MagickFalse)
351 for (y=0; y < (ssize_t) image->rows; y++)
370 if (SetImageProgress(image,LoadImageTag,y,image->rows) == MagickFalse)
571 image->rows=(size_t) MagickAbsoluteValue(dib_info.height);
601 if ((geometry.height != 0) && (geometry.height < image->rows))
602 image->rows=geometry.height;
604 status=SetImageExtent(image,image->columns,image->rows,exception)
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/scripts_cvs/searchcvs/www/projectName/ |
| searchcvs.php | 76 $rows = $row[0]; variable
78 $title = "<span>$rows results total</span>Showing results " . ($offset + 1) . "-" . ($offset + $pagesize > $rows ? $rows : $offset + $pagesize) . " for " . ($_GET["q"] == "" ? "last $days days of commits" : "$et" . sanitize($_GET["q"], "text"));
79 $title = ($rows == 0 ? "No results found for " . sanitize($_GET["q"], "text") . "" : $title);
84 dopager($rows, $page, $pagesize);
103 dopager($rows, $page, $pagesize);
146 print $rows;
227 function dopager($rows, $page, $pagesize)
230 $endpage = ($page + 5 > $rows/$pagesize ? ceil($rows/$pagesize) : $page + 5)
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseRedux.h | 19 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
32 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
43 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
|
| /external/eigen/Eigen/src/misc/ |
| Image.h | 27 // dimension is the number of rows of the original matrix
31 MatrixType::MaxColsAtCompileTime // so it has the same number of rows and at most as many columns.
48 inline Index rows() const { return m_dec.rows(); } function in struct:Eigen::internal::image_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/test/ |
| conservative_resize.cpp | 40 const Index rows = internal::random<Index>(1,50); local
43 m.conservativeResize(rows,cols);
44 VERIFY_IS_APPROX(m, n.block(0,0,rows,cols));
50 const Index rows = internal::random<Index>(50,75); local
53 m.conservativeResizeLike(MatrixType::Zero(rows,cols));
54 VERIFY_IS_APPROX(m.block(0,0,n.rows(),n.cols()), n);
55 VERIFY( rows<=50 || m.block(50,0,rows-50,cols).sum() == Scalar(0) );
56 VERIFY( cols<=50 || m.block(0,50,rows,cols-50).sum() == Scalar(0) );
77 m.conservativeResize(m.rows(),1)
[all...] |
| linearstructure.cpp | 26 Index rows = m.rows(); local
31 MatrixType m1 = MatrixType::Random(rows, cols),
32 m2 = MatrixType::Random(rows, cols),
33 m3(rows, cols);
38 Index r = internal::random<Index>(0, rows-1),
70 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
71 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), m1.cwiseProduct(m1));
72 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1);
73 VERIFY_IS_APPROX(m1.block(0,0,rows,cols) * s1, m1 * s1)
[all...] |
| sparse_solvers.cpp | 17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
27 for (int i=j ; i<sparseMat.rows(); ++i)
33 template<typename Scalar> void sparse_solvers(int rows, int cols)
35 double density = (std::max)(8./(rows*cols), 0.01);
40 DenseVector vec1 = DenseVector::Random(rows);
48 SparseMatrix<Scalar> m2(rows, cols);
49 DenseMatrix refMat2 = DenseMatrix::Zero(rows, cols);
64 //Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr
65 MappedSparseMatrix<Scalar> mm2(rows, cols, cm2.nonZeros(), cm2.outerIndexPtr(), cm2.innerIndexPtr(), cm2.valuePtr());
80 SparseMatrix<Scalar> matB(rows, rows)
[all...] |
| vectorwiseop.cpp | 23 Index rows = m.rows(); local
25 Index r = internal::random<Index>(0, rows-1),
28 ArrayType m1 = ArrayType::Random(rows, cols),
29 m2(rows, cols),
30 m3(rows, cols);
32 ColVectorType colvec = ColVectorType::Random(rows);
118 Array<bool,Dynamic,Dynamic> mb(rows,cols);
140 Index rows = m.rows(); local
[all...] |
| basicstuff.cpp | 21 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
30 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);
31 VectorType v1 = VectorType::Random(rows),
32 vzero = VectorType::Zero(rows);
152 Index rows = m.rows(); local
[all...] |
| sparse_block.cpp | 28 const Index rows = ref.rows(); local
36 double density = (std::max)(8./(rows*cols), 0.01);
44 SparseMatrixType m(rows, cols);
45 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
54 Index i = internal::random<Index>(0,rows-2);
56 Index h = internal::random<Index>(1,rows-i);
114 for(Index r=0; r<rows; r++)
123 DenseMatrix refMat2 = DenseMatrix::Zero(rows, cols);
124 SparseMatrixType m2(rows, cols)
[all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 55 Index rows = C.rows(), cols = C.cols(); local
57 TmpVec d(rows), e(rows), l(cols), p(rows), q(rows), r(rows);
64 for (Index i = 0; i < rows; ++i)
119 std::vector<bool> satured(C.rows());
124 SparseMatrix<Scalar,RowMajor> CINV(C.rows(), C.cols())
[all...] |
| /external/libvpx/libvpx/test/ |
| active_map_test.cc | 56 map.rows = (kHeight + 15) / 16;
58 ASSERT_EQ(map.rows, 9u);
64 map.rows = (kHeight + 15) / 16;
|
| /external/webrtc/webrtc/system_wrappers/include/ |
| aligned_array.h | 23 AlignedArray(size_t rows, size_t cols, size_t alignment)
24 : rows_(rows),
70 size_t rows() const { function in class:webrtc::AlignedArray
|
| /external/eigen/Eigen/src/Householder/ |
| HouseholderSequence.h | 93 return Block<const VectorsType,Dynamic,1>(h.m_vectors, start, k, h.rows()-start, 1);
105 return Block<const VectorsType,1,Dynamic>(h.m_vectors, k, start, 1, h.rows()-start).transpose();
150 * i-th column). If \p v has fewer columns than rows, then the Householder sequence contains as many
176 /** \brief Number of rows of transformation viewed as a matrix.
177 * \returns Number of rows
180 Index rows() const { return Side==OnTheLeft ? m_vectors.rows() : m_vectors.cols(); } function in class:Eigen::HouseholderSequence
186 Index cols() const { return rows(); }
236 AutoAlign|ColMajor, DestType::MaxRowsAtCompileTime, 1> workspace(rows());
244 workspace.resize(rows());
[all...] |
| /external/eigen/Eigen/src/QR/ |
| CompleteOrthogonalDecomposition.h | 93 CompleteOrthogonalDecomposition(Index rows, Index cols)
94 : m_cpqr(rows, cols), m_zCoeffs((std::min)(rows, cols)), m_temp(cols) {}
104 * CompleteOrthogonalDecomposition<MatrixType> cod(matrix.rows(),
114 : m_cpqr(matrix.rows(), matrix.cols()),
115 m_zCoeffs((std::min)(matrix.rows(), matrix.cols())),
130 m_zCoeffs((std::min)(matrix.rows(), matrix.cols())),
281 inline Index rows() const { return m_cpqr.rows(); } function in class:Eigen::CompleteOrthogonalDecomposition
419 const Index rows = m_cpqr.rows() local
[all...] |
| /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/eigen/Eigen/src/Core/ |
| CwiseNullaryOp.h | 68 CwiseNullaryOp(Index rows, Index cols, const NullaryOp& func = NullaryOp())
69 : m_rows(rows), m_cols(cols), m_functor(func)
71 eigen_assert(rows >= 0
72 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows)
78 EIGEN_STRONG_INLINE Index rows() const { return m_rows.value(); } function in class:Eigen::CwiseNullaryOp
95 * The parameters \a rows and \a cols are the number of rows and of columns of
99 * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used
109 DenseBase<Derived>::NullaryExpr(Index rows, Index cols, const CustomNullaryOp& func)
111 return CwiseNullaryOp<CustomNullaryOp, PlainObject>(rows, cols, func)
[all...] |
| EigenBase.h | 56 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
58 inline Index rows() const { return derived().rows(); } function in struct:Eigen::EigenBase
59 /** \returns the number of columns. \sa rows(), ColsAtCompileTime*/
62 /** \returns the number of coefficients, which is rows()*cols().
63 * \sa rows(), cols(), SizeAtCompileTime. */
65 inline Index size() const { return rows() * cols(); }
80 typename Dest::PlainObject res(rows(),cols());
92 typename Dest::PlainObject res(rows(),cols());
|
| /external/ImageMagick/Magick++/tests/ |
| readWriteImages.cpp | 71 if (firstIter->rows() != secondIter->rows())
75 << " Image rows " << secondIter->rows()
77 << firstIter->rows()
87 << firstIter->rows()
|
