| /external/eigen/Eigen/src/Cholesky/ |
| LLT_MKL.h | 54 eigen_assert(m.rows()==m.cols()); \
56 size = m.rows(); \
|
| /external/eigen/Eigen/src/Core/ |
| BooleanRedux.h | 92 for(Index i = 0; i < rows(); ++i)
116 for(Index i = 0; i < rows(); ++i)
|
| CwiseUnaryOp.h | 70 EIGEN_STRONG_INLINE Index rows() const { return m_xpr.rows(); } function in class:Eigen::CwiseUnaryOp
|
| DenseStorage.h | 130 static inline DenseIndex rows(void) {return _Rows;} function in class:Eigen::DenseStorage
146 static inline DenseIndex rows(void) {return _Rows;} function in class:Eigen::DenseStorage
177 inline DenseIndex rows() const {return m_rows;} function in class:Eigen::DenseStorage
196 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
215 inline DenseIndex rows(void) const {return _Rows;} function in class:Eigen::DenseStorage
239 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
277 static inline DenseIndex rows(void) {return _Rows;} function in class:Eigen::DenseStorage
313 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
|
| Flagged.h | 53 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::Flagged
|
| ForceAlignedAccess.h | 44 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::ForceAlignedAccess
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrix_MKL.h | 56 static void run(Index rows, Index cols, Index depth, \
78 m = (MKL_INT)rows; \
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur.h | 113 : m_matT(matrix.rows(),matrix.cols()),
114 m_matU(matrix.rows(),matrix.cols()),
115 m_hess(matrix.rows()),
319 eigen_assert(matrix.cols() == matrix.rows());
388 maxIters = m_maxIterationsPerRow * m_matT.rows();
391 // Rows 0,...,il-1 are decoupled from the rest because m_matT(il,il-1) is zero.
392 // Rows il,...,iu is the part we are working on (the active submatrix).
393 // Rows iu+1,...,end are already brought in triangular form.
|
| /external/eigen/Eigen/src/LU/ |
| Determinant.h | 39 if(Derived::ColsAtCompileTime==Dynamic && m.rows()==0)
94 eigen_assert(rows() == cols());
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseBlock.h | 61 EIGEN_STRONG_INLINE Index rows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); } function in class:Eigen::BlockImpl
237 EIGEN_STRONG_INLINE Index rows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); } function in class:Eigen::BlockImpl
272 IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize);
284 IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize);
307 m_blockRows(xpr.rows()),
317 inline int rows() const { return m_blockRows.value(); } function in class:Eigen::BlockImpl
|
| SparseSelfAdjointView.h | 62 eigen_assert(rows()==cols() && "SelfAdjointView is only for squared matrices");
65 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::SparseSelfAdjointView
132 SparseMatrix<DestScalar,ColMajor,Index> tmp(_dest.rows(),_dest.cols());
326 Index size = mat.rows();
414 Index size = mat.rows();
482 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::SparseSymmetricPermutationProduct
|
| /external/eigen/bench/spbench/ |
| sp_solver.cpp | 94 cout<< "Rows and columns "<< A.rows() <<" " <<A.cols() <<"\n";
|
| /external/eigen/blas/ |
| common.h | 103 matrix(T* data, int rows, int cols, int stride)
105 return Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >(data, rows, cols, OuterStride<>(stride));
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixExponential.h | 165 m_U(M.rows(),M.cols()),
166 m_V(M.rows(),M.cols()),
167 m_tmp1(M.rows(),M.cols()),
168 m_tmp2(M.rows(),M.cols()),
169 m_Id(MatrixType::Identity(M.rows(), M.cols())),
425 Index rows() const { return m_src.rows(); } function in struct:Eigen::MatrixExponentialReturnValue
445 eigen_assert(rows() == cols());
|
| MatrixFunctionAtomic.h | 74 m_Arows = A.rows();
108 const Index n = F.rows();
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| BlockOfDynamicSparseMatrix.h | 107 EIGEN_STRONG_INLINE Index rows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); }
|
| /external/jpeg/ |
| jccoefct.c | 39 int MCU_vert_offset; /* counts MCU rows within iMCU row */
40 int MCU_rows_per_iMCU_row; /* number of such rows needed */
78 * In a noninterleaved scan, an iMCU row has v_samp_factor MCU rows.
135 * per call, ie, v_samp_factor block rows for each component in the image.
226 * per call, ie, v_samp_factor block rows for each component in the image.
263 /* Count non-dummy DCT block rows in this iMCU row. */
296 /* If at end of image, create dummy block rows as needed.
333 * per call, ie, v_samp_factor block rows for each component in the scan.
|
| jdsample.c | 12 * sample rows of each component. Upsampling will normally produce
13 * max_v_samp_factor pixel rows from each row group (but this could vary
48 int next_row_out; /* counts rows emitted from color_buf */
49 JDIMENSION rows_to_go; /* counts rows remaining in image */
114 /* Color-convert and emit rows */
216 /* Generate any additional output rows by duplicating the first one */
340 * It is OK for us to reference the adjacent input rows because we demanded
418 /* jdmainct.c doesn't support context rows when min_DCT_scaled_size = 1,
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_loopfilter.h | 112 // Apply the loop filter to [start, stop) macro block rows in frame_buffer.
131 // Operates on the rows described by LFWorkerData passed as 'arg1'.
|
| /external/libvpx/libvpx/vp9/encoder/x86/ |
| vp9_subtract_sse2.asm | 15 ; void vp9_subtract_block(int rows, int cols,
22 rows, cols, diff, diff_stride, src, src_stride, \
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| levenshtein.c | 12 * strings. To avoid a large space complexity, only the last three rows
14 * plus one insertion, only two rows would be needed).
|
| /external/opencv/ml/src/ |
| mlestimate.cpp | 207 step = trainClasses->rows == 1 ? 1 : trainClasses->step / sizeof(float);
226 step = trainClasses->rows == 1 ? 1 : trainClasses->step / sizeof(int);
255 step = trainClasses->rows == 1 ? 1 : trainClasses->step / sizeof(float);
266 step = trainClasses->rows == 1 ? 1 : trainClasses->step / sizeof(int);
462 if (sampleIdx->rows != 1 && sampleIdx->cols != 1)
465 s_len = sampleIdx->rows + sampleIdx->cols - 1;
466 s_step = sampleIdx->rows == 1 ?
691 samples_all = ((tflag) ? trueData->rows : trueData->cols);
|
| /external/pdfium/core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/ |
| invert.h | 48 * Calculates a n x n double matrix inversion with a LUP method. Data is aligned, rows after rows (or columns after columns).
|
| /external/pdfium/core/src/fxcodec/libjpeg/ |
| fpdfapi_jccoefct.c | 40 int MCU_vert_offset; /* counts MCU rows within iMCU row */
41 int MCU_rows_per_iMCU_row; /* number of such rows needed */
79 * In a noninterleaved scan, an iMCU row has v_samp_factor MCU rows.
136 * per call, ie, v_samp_factor block rows for each component in the image.
227 * per call, ie, v_samp_factor block rows for each component in the image.
264 /* Count non-dummy DCT block rows in this iMCU row. */
297 /* If at end of image, create dummy block rows as needed.
334 * per call, ie, v_samp_factor block rows for each component in the scan.
|
| fpdfapi_jdsample.c | 13 * sample rows of each component. Upsampling will normally produce
14 * max_v_samp_factor pixel rows from each row group (but this could vary
49 int next_row_out; /* counts rows emitted from color_buf */
50 JDIMENSION rows_to_go; /* counts rows remaining in image */
115 /* Color-convert and emit rows */
217 /* Generate any additional output rows by duplicating the first one */
341 * It is OK for us to reference the adjacent input rows because we demanded
419 /* jdmainct.c doesn't support context rows when min_DCT_scaled_size = 1,
|
