| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 130 inline Index rows() const { return m_size; } function in class:Eigen::PardisoImpl
178 eigen_assert(rows()==b.rows()
179 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b");
192 eigen_assert(rows()==b.rows()
193 && "PardisoImpl::solve(): invalid number of rows of the right hand side matrix b");
287 m_size = a.rows();
288 eigen_assert(a.rows() == a.cols());
310 m_size = a.rows();
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| MappedSparseMatrix.h | 49 inline Index rows() const { return IsRowMajor ? m_outerSize : m_innerSize; } function in class:Eigen::MappedSparseMatrix
108 inline MappedSparseMatrix(Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr)
109 : m_outerSize(IsRowMajor?rows:cols), m_innerSize(IsRowMajor?cols:rows), m_nnz(nnz), m_outerIndex(outerIndexPtr),
|
| SparseUtil.h | 95 template<typename T,int Rows,int Cols> struct sparse_eval;
108 template<typename T,int Rows> struct sparse_eval<T,Rows,1> {
115 template<typename T,int Rows,int Cols> struct sparse_eval {
|
| /external/eigen/test/eigen2/ |
| sparse.h | 52 sparseMat.startFill(int(refMat.rows()*refMat.cols()*density));
55 for(int i=0; i<refMat.rows(); i++)
95 sparseMat.startFill(int(refMat.rows()*refMat.cols()*density));
98 for(int i=0; i<refMat.rows(); i++)
|
| /external/eigen/test/ |
| qr_fullpivoting.cpp | 18 Index rows = internal::random<Index>(20,200), cols = internal::random<int>(20,200), cols2 = internal::random<int>(20,200); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
38 for(int i = 0; i < rows; i++) for(int j = 0; j < cols; j++) if(i>j) r(i,j) = Scalar(0);
|
| sparse.h | 66 //sparseMat.reserve(int(refMat.rows()*refMat.cols()*density));
67 sparseMat.reserve(VectorXi::Constant(IsRowMajor ? refMat.rows() : refMat.cols(), int((1.5*density)*(IsRowMajor?refMat.cols():refMat.rows()))));
118 sparseMat.reserve(int(refMat.rows()*refMat.cols()*density));
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| Scaling.h | 14 * \brief iterative scaling algorithm to equilibrate rows and column norms in matrices
74 int m = mat.rows();
113 // Scale the rows and the columns of the matrix
146 /** Get the vector to scale the rows of the matrix
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| rwupdt.h | 15 eigen_assert(r.rows()>=n);
|
| /external/icu/icu4c/source/common/ |
| propsvec.h | 31 * Rows of uint32_t integers in a contiguous array store
45 * There are additional rows for special purposes, see UPVEC_FIRST_SPECIAL_CP.
48 * but self-contained rows allow to later sort them by contents.
80 * In rows for code points [start..end], select the column,
|
| /external/javasqlite/src/main/java/SQLite/ |
| FunctionContext.java | 68 * Retrieve number of rows for aggregate function.
|
| /external/jsr305/javadoc/ |
| index.html | 24 <FRAMESET rows="30%,70%" title="" onLoad="top.loadFrames()">
|
| /external/libhevc/decoder/x86/ |
| ihevcd_fmt_conv_ssse3_intr.c | 63 WORD32 num_rows, num_cols, src_strd, dst_strd, cols, rows; local
208 rows = num_rows & 0x3;
209 if(rows)
211 for(i = 0; i < rows; i++)
|
| /external/libvpx/libvpx/vp8/encoder/arm/neon/ |
| picklpf_arm.c | 31 /* number of MB rows to use in partial filtering */
|
| /external/libvpx/libvpx/vp9/common/arm/neon/ |
| vp9_idct16x16_neon.c | 46 /* Parallel idct on the upper 8 rows */
61 /* Parallel idct on the lower 8 rows */
121 /* Parallel idct on the upper 8 rows */
136 /* Skip Parallel idct on the lower 8 rows as they are all 0s */
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_mvref_common.h | 37 // check a list of motion vectors by sad score using a number rows of pixels
|
| /external/libvpx/libvpx/vp9/decoder/ |
| vp9_decoder.h | 55 int do_loopfilter_inline; // apply loopfilter to available rows immediately
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_segmentation.h | 32 // Segmentation map is arrange as [Rows][Columns]
|
| /external/mesa3d/src/glsl/tests/ |
| uniform_initializer_utils.cpp | 133 unsigned columns, unsigned rows,
139 glsl_type::get_instance(base_type, rows, columns);
147 unsigned columns, unsigned rows, unsigned array_size,
153 glsl_type::get_instance(base_type, rows, columns);
|
| /external/skia/experimental/iOSSampleApp/Shared/ |
| SkUIRootViewController.mm | 37 // Return the number of rows in the section.
|
| /external/skia/experimental/webtry/templates/ |
| content.html | 22 <textarea spellcheck=false name='code' id='code' rows='15' cols='100'>{{.Code}}</textarea>
|
| /external/skia/include/gpu/ |
| GrSurface.h | 100 * @param rowBytes number of bytes between consecutive rows. Zero means rows are tightly
122 * @param rowBytes number of bytes between consecutive rows. Zero means rows are tightly
|
| /external/skia/include/utils/ |
| SkBoundaryPatch.h | 41 bool evalPatch(SkPoint verts[], int rows, int cols);
|
| /frameworks/av/include/media/stagefright/ |
| YUVImage.h | 101 // Tries to use memcopy to copy entire rows of data.
153 // for the YUV channels. Note that this corresponds to data rows and not pixel rows.
155 // to two pixel rows.
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/arm_neon_asm/ |
| h264bsdWriteMacroblock.s | 118 VLD1 {qRow0, qRow1}, [data]! ;cb rows 0,1,2,3
120 VLD1 {qRow2, qRow3}, [data]! ;cb rows 4,5,6,7
122 VLD1 {qRow4, qRow5}, [data]! ;cr rows 0,1,2,3
124 VLD1 {qRow6, qRow7}, [data]! ;cr rows 4,5,6,7
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/arm_neon_asm_gcc/ |
| h264bsdWriteMacroblock.S | 120 VLD1 {qRow0, qRow1}, [data]! ;//cb rows 0,1,2,3
122 VLD1 {qRow2, qRow3}, [data]! ;//cb rows 4,5,6,7
124 VLD1 {qRow4, qRow5}, [data]! ;//cr rows 0,1,2,3
126 VLD1 {qRow6, qRow7}, [data]! ;//cr rows 4,5,6,7
|
