| /external/opencv3/modules/cudev/include/opencv2/cudev/ptr2d/ |
| zip.hpp | 110 int rows, cols; member in struct:cv::cudev::ZipPtrSz
120 const int rows = getRows(ptr0); local
123 CV_Assert( getRows(ptr1) == rows && getCols(ptr1) == cols );
127 z.rows = rows;
137 const int rows = getRows(ptr0); local
140 CV_Assert( getRows(ptr1) == rows && getCols(ptr1) == cols );
141 CV_Assert( getRows(ptr2) == rows && getCols(ptr2) == cols );
145 z.rows = rows;
155 const int rows = getRows(ptr0); local
[all...] |
| /external/opencv3/modules/python/test/ |
| precornerdetect.py | 13 corner_mask = cv.CreateMat(image.rows, image.cols, cv.CV_8UC1)
|
| /external/skia/src/utils/ |
| SkBoundaryPatch.cpp | 44 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) {
45 if (rows < 2 || cols < 2) {
49 const SkScalar invR = SkScalarInvert(SkIntToScalar(rows - 1));
54 for (int x = 0; x < rows; x++) {
|
| /external/eigen/test/ |
| cholesky.cpp | 44 VectorType vec = VectorType::Random(symm.rows());
67 Index rows = m.rows(); local
75 MatrixType a0 = MatrixType::Random(rows,cols);
76 VectorType vecB = VectorType::Random(rows), vecX(rows);
77 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
82 MatrixType a1 = MatrixType::Random(rows,cols);
119 MatrixType m1 = MatrixType::Random(rows,cols), m2(rows,cols)
250 Index rows = m.rows(); local
[all...] |
| 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...] |
| mapped_matrix.cpp | 52 Index rows = m.rows(), cols = m.cols(), size = rows*cols; local
62 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
63 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>(array1, rows, cols);
64 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
65 MatrixType ma1 = Map<MatrixType>(array1, rows, cols)
[all...] |
| qr_colpivoting.cpp | 18 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols2 = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
48 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
50 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1);
51 Matrix<Scalar,Rows,Cols> m1;
52 createRandomPIMatrixOfRank(rank,Rows,Cols,m1);
53 ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
56 VERIFY(qr.isInjective() == (rank == Rows));
60 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>()
[all...] |
| /external/eigen/Eigen/src/Core/ |
| CommaInitializer.h | 41 : m_xpr(xpr), m_row(0), m_col(other.cols()), m_currentBlockRows(other.rows())
43 m_xpr.block(0, 0, other.rows(), other.cols()) = other;
52 const_cast<CommaInitializer&>(o).m_row = m_xpr.rows();
65 eigen_assert(m_row<m_xpr.rows()
66 && "Too many rows passed to comma initializer (operator<<)");
79 if(other.cols()==0 || other.rows()==0)
85 m_currentBlockRows = other.rows();
86 eigen_assert(m_row+m_currentBlockRows<=m_xpr.rows()
87 && "Too many rows passed to comma initializer (operator<<)");
91 eigen_assert(m_currentBlockRows==other.rows());
[all...] |
| BandMatrix.h | 50 using Base::rows;
72 Index len = coeffs().rows();
76 len = (std::min)(rows(),std::max<Index>(0,coeffs().rows() - (supers()-i)));
78 else if (i>=rows()-subs())
79 len = std::max<Index>(0,coeffs().rows() - (i + 1 - rows() + subs()));
85 { return Block<CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
89 { return Block<const CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
136 dst.resize(rows(),cols())
214 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrix
278 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrixWrapper
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_map.cpp | 42 int rows = m.rows(), cols = m.cols(), size = rows*cols; local
52 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
53 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>((const Scalar*)array1, rows, cols); // test non-const-correctness support in eigen2
54 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
55 MatrixType ma1 = Map<MatrixType>(array1, rows, cols)
[all...] |
| gsl_helper.h | 28 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_alloc(rows,cols); }
63 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_complex_alloc(rows,cols); }
100 res = gsl_matrix_alloc(m.rows(), m.cols());
101 for (int i=0 ; i<m.rows() ; ++i)
110 for (int i=0 ; i<res.rows() ; ++i)
128 for (int i=0 ; i<res.rows() ; ++i)
135 res = gsl_matrix_complex_alloc(m.rows(), m.cols());
136 for (int i=0 ; i<m.rows() ; ++i
[all...] |
| /external/gemmlowp/internal/ |
| block_params.h | 46 void Init(int rows, int cols, int depth, int num_threads) {
47 FindL2BlockSizes<KernelFormat>(rows, cols, depth, num_threads, &l2_rows,
54 static void FindL2BlockSizes(int rows, int cols, int depth, int num_threads,
83 l2_rows = RoundUp<KernelFormat::kRows>(rows);
89 std::max(1, CeilQuotient(rows, max_cache_friendly_l2_rows));
91 RoundUp<KernelFormat::kRows>(CeilQuotient(rows, min_l2_rows_blocks));
100 static void FindL1BlockSizes(int rows, int cols, int depth, int* out_l1_rows,
107 assert(rows % KernelFormat::kRows == 0);
131 std::max(1, CeilQuotient(rows, max_cache_friendly_l1_rows));
133 RoundUp<KernelFormat::kRows>(CeilQuotient(rows, min_l1_rows_blocks))
[all...] |
| /external/mesa3d/src/glsl/tests/ |
| copy_constant_to_storage_tests.cpp | 40 void int_test(unsigned rows);
41 void uint_test(unsigned rows);
42 void bool_test(unsigned rows);
44 void float_test(unsigned columns, unsigned rows);
67 copy_constant_to_storage::int_test(unsigned rows)
70 generate_data(mem_ctx, GLSL_TYPE_INT, 1, rows, val);
86 copy_constant_to_storage::uint_test(unsigned rows)
89 generate_data(mem_ctx, GLSL_TYPE_UINT, 1, rows, val);
105 copy_constant_to_storage::float_test(unsigned columns, unsigned rows)
108 generate_data(mem_ctx, GLSL_TYPE_FLOAT, columns, rows, val)
[all...] |
| /external/opencv3/modules/cudev/include/opencv2/cudev/grid/ |
| reduce_to_vec.hpp | 148 const int rows = getRows(src); local
151 CV_Assert( getRows(mask) == rows && getCols(mask) == cols );
158 rows, cols, local
165 const int rows = getRows(src); local
173 rows, cols, local
180 const int rows = getRows(src); local
183 CV_Assert( getRows(mask) == rows && getCols(mask) == cols );
185 dst.create(1, rows);
190 rows, cols, local
197 const int rows = getRows(src) local
205 rows, cols, local
[all...] |
| /external/chromium-trace/catapult/dashboard/dashboard/ |
| dump_graph_json_test.py | 30 # Insert a test with no rows or alerts.
47 # Insert a test with rows.
51 rows = []
57 rows.append(row)
58 ndb.put_multi(rows)
60 # There is a maximum number of rows returned by default, and the rows
87 # An alternative max number of rows can be specified.
134 # Add some rows.
135 rows = [
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| ConservativeSparseSparseProduct.h | 24 Index rows = lhs.innerSize(); local
28 std::vector<bool> mask(rows,false);
29 Matrix<Scalar,Dynamic,1> values(rows);
30 Matrix<Index,Dynamic,1> indices(rows);
79 Index t200 = rows/(log2(200)*1.39);
80 Index t = (rows*100)/139;
103 for(Index i=0; i<rows; ++i)
139 ColMajorMatrix resCol(lhs.rows(),rhs.cols());
154 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
167 RowMajorMatrix resRow(lhs.rows(), rhs.cols())
[all...] |
| /external/ceres-solver/internal/ceres/ |
| normal_prior.cc | 44 CHECK_GT(b_.rows(), 0);
45 CHECK_GT(A_.rows(), 0);
46 CHECK_EQ(b_.rows(), A.cols());
47 set_num_residuals(A_.rows());
48 mutable_parameter_block_sizes()->push_back(b_.rows());
|
| /external/chromium-trace/catapult/tracing/tracing/ui/analysis/ |
| single_sample_sub_view.html | 63 var rows = [];
65 rows.push({
70 rows.push({
80 rows.push({
84 table.tableRows = rows;
|
| /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.
49 inline Index rows() const { return m_dec.rows(); } function in struct:Eigen::internal::image_retval_base
77 using Base::rows; \
|
| /external/libvpx/libvpx/vpx_dsp/arm/ |
| subtract_neon.c | 16 void vpx_subtract_block_neon(int rows, int cols,
23 for (r = 0; r < rows; ++r) {
47 for (r = 0; r < rows; ++r) {
61 for (r = 0; r < rows; ++r) {
71 for (r = 0; r < rows; ++r) {
|
| /external/opencv3/samples/cpp/ |
| dft.cpp | 38 int M = getOptimalDFTSize( img.rows );
41 copyMakeBorder(img, padded, 0, M - img.rows, 0, N - img.cols, BORDER_CONSTANT, Scalar::all(0));
56 // crop the spectrum, if it has an odd number of rows or columns
57 mag = mag(Rect(0, 0, mag.cols & -2, mag.rows & -2));
60 int cy = mag.rows/2;
|
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteQuery.java | 25 * Represents a query that reads the resulting rows into a {@link SQLiteQuery}.
43 * Reads rows into a buffer.
49 * @param countAllRows True to count all rows that the query would
51 * @return Number of rows that were enumerated. Might not be all rows
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/include/cloog/ |
| matrix.h | 13 * row. NbRows and NbColumns are respectively the number of rows and columns of
25 * would be represented by the following rows:
39 { unsigned NbRows; /* Number of rows. */
41 cloog_int_t ** p; /* Array of pointers to the matrix rows. */
42 cloog_int_t * p_Init; /* Matrix rows contiguously in memory. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/include/cloog/ |
| matrix.h | 13 * row. NbRows and NbColumns are respectively the number of rows and columns of
25 * would be represented by the following rows:
39 { unsigned NbRows; /* Number of rows. */
41 cloog_int_t ** p; /* Array of pointers to the matrix rows. */
42 cloog_int_t * p_Init; /* Matrix rows contiguously in memory. */
|
| /external/doclava/res/assets/templates/ |
| diff.cs | 71 if (tr.rowIndex + 1 < table.rows.length) {
72 var tbody = table.rows[tr.rowIndex + 1].parentNode;
79 if (tr.rowIndex + 1 < table.rows.length
80 && $(table.rows[tr.rowIndex + 1]).hasClass("class-entry")) {
81 var tbody = table.rows[tr.rowIndex + 1].parentNode;
99 while (i < table.rows.length && $(table.rows[i]).hasClass("method-entry")) {
100 $(table.rows[i++]).show();
107 while (i < table.rows.length && $(table.rows[i]).hasClass("method-entry"))
[all...] |
