| /external/opencv3/modules/core/include/opencv2/core/ |
| cuda.inl.hpp | 59 : flags(0), rows(0), cols(0), step(0), data(0), refcount(0), datastart(0), dataend(0), allocator(allocator_)
64 : flags(0), rows(0), cols(0), step(0), data(0), refcount(0), datastart(0), dataend(0), allocator(allocator_)
72 : flags(0), rows(0), cols(0), step(0), data(0), refcount(0), datastart(0), dataend(0), allocator(allocator_)
80 : flags(0), rows(0), cols(0), step(0), data(0), refcount(0), datastart(0), dataend(0), allocator(allocator_)
91 : flags(0), rows(0), cols(0), step(0), data(0), refcount(0), datastart(0), dataend(0), allocator(allocator_)
102 : flags(m.flags), rows(m.rows), cols(m.cols), step(m.step), data(m.data), refcount(m.refcount), datastart(m.datastart), dataend(m.dataend), allocator(m.allocator)
110 flags(0), rows(0), cols(0), step(0), data(0), refcount(0), datastart(0), dataend(0), allocator(allocator_)
143 std::swap(rows, b.rows);
[all...] |
| /external/opencv3/modules/core/misc/java/src/java/ |
| core+Mat.java | 30 // C++: Mat::Mat(int rows, int cols, int type)
33 // javadoc: Mat::Mat(rows, cols, type)
34 public Mat(int rows, int cols, int type)
37 nativeObj = n_Mat(rows, cols, type);
56 // C++: Mat::Mat(int rows, int cols, int type, Scalar s)
59 // javadoc: Mat::Mat(rows, cols, type, s)
60 public Mat(int rows, int cols, int type, Scalar s)
63 nativeObj = n_Mat(rows, cols, type, s.val[0], s.val[1], s.val[2], s.val[3]);
333 // C++: void Mat::create(int rows, int cols, int type)
336 // javadoc: Mat::create(rows, cols, type
713 public int rows() method in class:Mat
[all...] |
| /external/opencv3/modules/core/test/ |
| test_dxt.cpp | 37 int i, j, k, n = _dst.cols + _dst.rows - 1;
45 CV_Assert( _src.cols + _src.rows - 1 == n );
110 Mat tmp( src.cols, src.rows, src.type());
114 for( i = 0; i < dst.rows; i++ )
122 if( dst.cols != dst.rows )
123 wave = initDFTWave( dst.rows, (flags & DFT_INVERSE) != 0 );
161 int i, j, n = _dst.cols + _dst.rows - 1;
166 CV_Assert( _src.cols + _src.rows - 1 == n);
217 Mat tmp(dst.cols, dst.rows, dst.type() );
221 for( i = 0; i < dst.rows; i++
365 int i, rows = mat.rows; local
[all...] |
| /external/opencv3/modules/cudev/include/opencv2/cudev/grid/ |
| integral.hpp | 62 const int rows = getRows(src); local
65 dst.create(rows, cols);
67 integral_detail::integral(shrinkPtr(src), shrinkPtr(dst), rows, cols, StreamAccessor::getStream(stream)); local
|
| /external/opencv3/modules/imgproc/perf/opencl/ |
| perf_houghLines.cpp | 45 line(src, Point(100, 0), Point(100, src.rows), Scalar::all(255), 1);
46 line(src, Point(200, 0), Point(200, src.rows), Scalar::all(255), 1);
47 line(src, Point(400, 0), Point(400, src.rows), Scalar::all(255), 1);
|
| /external/opencv3/samples/cpp/ |
| demhist.cpp | 48 normalize(hist, hist, 0, histImage.rows, NORM_MINMAX, CV_32F);
54 rectangle( histImage, Point(i*binW, histImage.rows),
55 Point((i+1)*binW, histImage.rows - cvRound(hist.at<float>(i))),
|
| intelperc_capture.cpp | 164 int y = (int)((*uvmap) * image.rows);
169 for (int row = y; row < min(y + pointSize, image.rows); row++)
187 image.create(ir.rows, ir.cols, CV_8UC3);
188 for (int row = 0; row < ir.rows; row++)
202 for (int row = g_closedDepthPoint[0]; row < min(g_closedDepthPoint[0] + pointSize, image.rows); row++)
213 image.create(ir.rows, ir.cols, CV_8UC1);
214 for (int row = 0; row < ir.rows; row++)
235 image.create(depth.rows, depth.cols, CV_8UC3);
236 for (int row = 0; row < depth.rows; row++)
259 for (int row = g_closedDepthPoint[0]; row < min(g_closedDepthPoint[0] + pointSize, image.rows); row++
[all...] |
| /external/autotest/contrib/ |
| db_cleanup.py | 46 WHERE %(table)s.%(primary_key)s IN (%(rows)s)
137 using a related table to find the rows to delete.
144 There are also tables that require 2 joins to determine which rows we want
145 to delete and we determine these rows by joining the table we want to
148 @param table_to_delete_from: Table whose rows we want to delete.
158 to the table we are trying to delete rows
179 # There are cases where we need to JOIN 3 TABLES to determine the rows
193 rows = [x[0] for x in cursor.fetchall()]
194 logging.debug(rows)
196 if not rows or rows == [None]
[all...] |
| /external/gemmlowp/test/ |
| benchmark.cc | 58 int rows, depth, cols; member in struct:gemmlowp::gemm_t
59 gemm_t() : rows(0), depth(0), cols(0) {}
60 gemm_t(int r, int d, int c) : rows(r), depth(d), cols(c) {}
64 return a.rows < b.rows ||
65 (a.rows <= b.rows &&
77 int rows = gemm.rows; local
81 sizeof(Scalar) * (rows * depth + depth * cols + rows * cols)
[all...] |
| /external/opencv3/modules/cudawarping/src/cuda/ |
| resize.cu | 62 if (dst_x < dst.cols && dst_y < dst.rows)
78 if (dst_x < dst.cols && dst_y < dst.rows)
90 const int y2_read = ::min(y2, src.rows - 1);
113 if (dst_x < dst.cols && dst_y < dst.rows)
127 if (x < dst.cols && y < dst.rows)
187 const dim3 grid(divUp(dst.cols, block.x), divUp(dst.rows, block.y));
200 const dim3 grid(divUp(dst.cols, block.x), divUp(dst.rows, block.y));
214 const dim3 grid(divUp(dst.cols, block.x), divUp(dst.rows, block.y));
227 const dim3 grid(divUp(dst.cols, block.x), divUp(dst.rows, block.y));
240 BrdReplicate<T> brd(src.rows, src.cols)
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| filterengine.hpp | 166 // let's process 10 source rows at once
167 int DELTA = std::min(10, src.rows);
178 // the buffers need to have more than DELTA rows, because at the
179 // last iteration the output may take max(kd.rows-1,ks.rows-1)
180 // rows more than the input.
181 Mat Ixx( DELTA + kd.rows - 1, src.cols, dst.type() );
182 Mat Iyy( DELTA + kd.rows - 1, src.cols, dst.type() );
184 // inside the loop we always pass DELTA rows to the filter
188 // * < DELTA rows (the initial buffer accumulation stage
274 std::vector<uchar*> rows; member in class:cv::FilterEngine
[all...] |
| /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...] |
| /external/opencv3/modules/ml/src/ |
| lr.cpp | 159 Mat data_t = Mat::zeros(_data_i.rows, _data_i.cols+1, CV_32F);
160 vconcat(Mat(_data_i.rows, 1, _data_i.type(), Scalar::all(1.0)), data_t.col(0));
172 if(_labels_i.rows != _data_i.rows)
174 CV_Error( CV_StsBadArg, "number of rows in data and labels should be the equal" );
242 Mat data_t = Mat::zeros(data.rows, data.cols+1, CV_32F);
247 vconcat(Mat(data.rows, 1, data.type(), Scalar::all(1.0)), data_t.col(i));
255 CV_Assert(thetas.rows > 0);
266 Mat pred_m = Mat::zeros(data_t.rows, thetas.rows, data.type())
[all...] |
| /external/opencv3/modules/shape/src/ |
| sc_dis.cpp | 285 gaussWindow = Mat::zeros(warpedImage.rows, warpedImage.cols, CV_32F);
289 for (ii=0; ii<diffIm.rows; ii++)
299 Mat appIm(diffIm.rows, diffIm.cols, CV_32F);
300 for (ii=0; ii<diffIm.rows; ii++)
405 cv::Mat mask(disMatrix.rows, disMatrix.cols, CV_8U);
490 hungarian(costMat, matches, inliers1, inliers2, descriptors1.rows, descriptors2.rows);
502 std::vector<int> free(costMatrix.rows, 0), collist(costMatrix.rows, 0);
503 std::vector<int> matches(costMatrix.rows, 0), colsol(costMatrix.rows), rowsol(costMatrix.rows)
[all...] |
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/keyboard/ |
| MoreKeysKeyboardBuilderMaxOrderTests.java | 75 assertEquals("1 key max 5 M0 rows", 1, params.mNumRows);
87 assertEquals("1 key max 5 L0 rows", 1, params.mNumRows);
99 assertEquals("1 key max 5 L1 rows", 1, params.mNumRows);
111 assertEquals("1 key max 5 L2 rows", 1, params.mNumRows);
123 assertEquals("1 key max 5 R0 rows", 1, params.mNumRows);
135 assertEquals("1 key max 5 R1 rows", 1, params.mNumRows);
147 assertEquals("1 key max 5 R2 rows", 1, params.mNumRows);
159 assertEquals("2 key max 5 M0 rows", 1, params.mNumRows);
172 assertEquals("2 key max 5 L0 rows", 1, params.mNumRows);
185 assertEquals("2 key max 5 L1 rows", 1, params.mNumRows)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| FieldLUDecomposition.java | 26 * such that P×A = L×U. P is a rows permutation matrix that is used
27 * to rearrange the rows of A before so that it can be decomposed. L is a lower
65 * Returns the P rows permutation matrix.
70 * @return the P rows permutation matrix (or null if decomposed matrix is singular)
|
| LUDecomposition.java | 25 * such that P×A = L×U. P is a rows permutation matrix that is used
26 * to rearrange the rows of A before so that it can be decomposed. L is a lower
63 * Returns the P rows permutation matrix.
68 * @return the P rows permutation matrix (or null if decomposed matrix is singular)
|
| /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/chromium-trace/catapult/dashboard/dashboard/ |
| change_internal_only_test.py | 88 rows = graph_data.Row.query().fetch()
89 for row in rows:
135 rows = graph_data.Row.query().fetch()
136 for row in rows:
|
| /external/chromium-trace/catapult/tracing/tracing/ui/analysis/ |
| counter_sample_sub_view.html | 73 * Returns the table rows for the specified samples.
87 var rows = [];
103 rows.push(seriesRows[0]);
107 return rows;
|
| /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...] |
| Swap.h | 38 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::SwapWrapper
76 eigen_internal_assert(rowId >= 0 && rowId < rows()
97 eigen_internal_assert(rowId >= 0 && rowId < rows()
|
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixVector.h | 40 Index rows = IsLower ? _rows : (std::min)(_rows,_cols); local
44 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
52 ResMap res(_res,rows);
67 Index r = IsLower ? rows - pi - actualPanelWidth : pi;
81 rows, cols-size,
108 Index rows = IsLower ? _rows : diagSize; local
112 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
120 ResMap res(_res,rows,InnerStride<>(resIncr));
146 if(IsLower && rows>diagSize)
149 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 | 163 inline Index rows() const { return m_copyMatrix.rows(); } function in class:Eigen::UmfPackLU
223 eigen_assert(rows()==b.rows()
224 && "UmfPackLU::solve(): invalid number of rows of the right hand side matrix b");
236 eigen_assert(rows()==b.rows()
237 && "UmfPackLU::solve(): invalid number of rows of the right hand side matrix b");
303 m_copyMatrix.resize(mat.rows(), mat.cols());
338 errorCode = umfpack_symbolic(m_copyMatrix.rows(), m_copyMatrix.cols(), m_outerIndexPtr, m_innerIndexPtr, m_valuePtr
389 int lnz, unz, rows, cols, nz_udiag; local
[all...] |
