| /external/gemmlowp/internal/ |
| block_params.h | 46 void Init(int rows, int cols, int depth, int num_threads, int l1_bytes_to_use,
48 FindL2BlockSizes<KernelFormat>(rows, cols, depth, num_threads,
56 static void FindL2BlockSizes(int rows, int cols, int depth, int num_threads,
65 std::max(1, RoundUp<KernelFormat::kRows>(rows) / num_threads);
104 static void FindL1BlockSizes(int rows, int cols, int depth,
112 assert(rows % KernelFormat::kRows == 0);
134 std::max(1, CeilQuotient(rows, max_cache_friendly_l1_rows));
136 RoundUp<KernelFormat::kRows>(CeilQuotient(rows, min_l1_rows_blocks));
147 // rows/colums. See the explanation in kernel.h: in the LHS, 'width' means
148 // the number of rows, while in the RHS, 'width' means the number of columns
[all...] |
| /external/gemmlowp/test/ |
| test.h | 62 Matrix(int rows, int cols) : Map(nullptr, 0, 0, 0) { Resize(rows, cols); }
77 void Resize(int rows, int cols) {
78 rows_ = rows;
80 stride_ = kOrder == MapOrder::ColMajor ? rows : cols;
112 for (int r = 0; r < m->rows(); r++) {
125 for (int r = 0; r < m->rows(); r++) {
136 for (int r = 0; r < m->rows(); r++) {
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_ethread.h | 42 int rows; member in struct:VP9RowMTSyncData
61 int rows);
|
| /external/libxcam/modules/ocl/ |
| cv_edgetaper.cpp | 39 // get psf rows and cols projections
43 cv::copyMakeBorder (rows_proj, rows_proj_border, (psf.rows - 1) / 2, (psf.rows - 1) / 2, 0, 0, cv::BORDER_CONSTANT, cv::Scalar::all (0));
61 int nr = image.rows / psf.rows + 1;
64 cv::Mat weights = expanded (cv::Rect (expanded.cols / 2 - image.cols / 2, expanded.rows / 2 - image.rows / 2, image.cols, image.rows));
71 cv::Mat blurred = cv::Mat::zeros (img.rows, img.cols, CV_32FC1);
|
| /external/syslinux/com32/lib/sys/ |
| ansicon_write.c | 82 ti.rows = 25;
89 firmware->o_ops->get_mode(&ti.cols, &ti.rows);
97 fp->o.rows = ti.rows;
172 uint8_t rows, cols, attribute; local
175 rows = ti.rows - 1;
178 firmware->o_ops->scroll_up(cols, rows, attribute);
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 100 ColPivHouseholderQR(Index rows, Index cols)
101 : m_qr(rows, cols),
102 m_hCoeffs((std::min)(rows,cols)),
117 * ColPivHouseholderQR<MatrixType> qr(matrix.rows(), matrix.cols());
125 : m_qr(matrix.rows(), matrix.cols()),
126 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
147 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
301 return rank() == rows();
327 inline Index rows() const { return m_qr.rows(); } function in class:Eigen::ColPivHouseholderQR
[all...] |
| /external/eigen/test/ |
| triangular.cpp | 22 typename MatrixType::Index rows = m.rows(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols),
28 m4(rows, cols),
29 r1(rows, cols),
30 r2(rows, cols);
31 VectorType v2 = VectorType::Random(rows);
36 if (rows*cols>1
142 Index rows = m.rows(); local
[all...] |
| constructor.cpp | 26 Index rows = m.rows(); local
29 MatrixType m0 = MatrixType::Random(rows,cols);
33 VERIFY_EVALUATION_COUNT( MatrixType m2(m0.block(0,0,rows,cols)) , 1);
|
| 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...] |
| /external/ImageMagick/Magick++/tests/ |
| montageImages.cpp | 61 if ( montage[0].columns() != 768 || montage[0].rows() != 504 )
65 << " Montage columns/rows ("
67 << montage[0].rows()
109 if ( montage[0].columns() != 136 || montage[0].rows() != 70 )
113 << " Montage columns/rows ("
115 << montage[0].rows()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| FieldMatrixChangingVisitor.java | 35 * @param rows number of rows of the matrix
42 void start(int rows, int columns,
|
| FieldMatrixPreservingVisitor.java | 35 * @param rows number of rows of the matrix
42 void start(int rows, int columns,
|
| /external/autotest/database/ |
| db_utils.py | 86 rows = manager.execute(query, manager.get_db_name())
87 existing_names = [row[0] for row in rows]
105 rows = manager.execute(query, manager.get_db_name(), table_name, index_name)
106 return bool(rows)
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| PropsVectors.java | 28 * Rows of primitive integers in a contiguous array store the range limits and
37 * self-contained rows allow to later sort them by contents.
45 private int rows; field in class:PropsVectors
108 int limit = rows;
154 rows = 2 + (MAX_CP - FIRST_SPECIAL_CP);
168 * In rows for code points [start..end], select the column, reset the mask
194 // find the rows whose ranges overlap with the input range
200 * Rows need to be split if they partially overlap with the input range
201 * (only possible for the first and last rows) and if their value
207 // split first/last rows if necessar
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| PropsVectors.java | 27 * Rows of primitive integers in a contiguous array store the range limits and
36 * self-contained rows allow to later sort them by contents.
43 private int rows; field in class:PropsVectors
106 int limit = rows;
152 rows = 2 + (MAX_CP - FIRST_SPECIAL_CP);
166 * In rows for code points [start..end], select the column, reset the mask
192 // find the rows whose ranges overlap with the input range
198 * Rows need to be split if they partially overlap with the input range
199 * (only possible for the first and last rows) and if their value
205 // split first/last rows if necessar
[all...] |
| /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/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/tensorflow/tensorflow/core/kernels/ |
| inplace_ops_functor_gpu.cu.cc | 30 __global__ void DoParallelConcatOpKernel(int nthreads, const int64 rows,
35 int64 r = (loc % rows + rows) % rows; // Guard index range.
|
| /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...] |
| /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);
|
