| /external/eigen/bench/btl/libs/mtl4/ |
| mtl4_LU_solve_interface.hh | 90 ASSERT( LU.rows()==LU.cols() ) ;
155 ASSERT( LU.rows()==LU.cols() ) ;
|
| /external/eigen/blas/ |
| BandTriangularSolver.h | 38 for(int col=0 ; col<other.cols() ; ++col)
74 for(int col=0 ; col<other.cols() ; ++col)
|
| 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/test/ |
| main.h | 327 void createRandomPIMatrixOfRank(typename MatrixType::Index desired_rank, typename MatrixType::Index rows, typename MatrixType::Index cols, MatrixType& m);
329 void createRandomPIMatrixOfRank(typename MatrixType::Index desired_rank, typename MatrixType::Index rows, typename MatrixType::Index cols, MatrixType& m)
333 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
337 typedef Matrix<Scalar, Cols, Cols> MatrixBType;
341 m.setZero(rows,cols);
348 m = VectorType::Random(rows).normalized() * VectorType::Random(cols).normalized().transpose();
353 MatrixType d = MatrixType::Identity(rows,cols);
354 MatrixBType b = MatrixBType::Random(cols,cols);
[all...] |
| sparse_vector.cpp | 12 template<typename Scalar,typename Index> void sparse_vector(int rows, int cols)
14 double densityMat = (std::max)(8./(rows*cols), 0.01);
|
| /external/libvpx/libvpx/vp8/common/ |
| onyx.h | 261 int vp8_set_roimap(struct VP8_COMP* comp, unsigned char *map, unsigned int rows, unsigned int cols, int delta_q[4], int delta_lf[4], unsigned int threshold[4]);
262 int vp8_set_active_map(struct VP8_COMP* comp, unsigned char *map, unsigned int rows, unsigned int cols);
|
| /external/opencv/cv/src/ |
| cvfilter.cpp | 453 width = src->cols;
685 (_kx->cols != 1 && _kx->rows != 1) ||
686 (_ky->cols != 1 && _ky->rows != 1) ||
697 _ksize.width = _kx->rows + _kx->cols - 1;
698 _ksize.height = _ky->rows + _ky->cols - 1;
706 CV_CALL( kx = cvCreateMat( _kx->rows, _kx->cols, filter_type ));
712 CV_CALL( ky = cvCreateMat( _ky->rows, _ky->cols, filter_type ));
718 xsz = kx->rows + kx->cols - 1;
719 ysz = ky->rows + ky->cols - 1;
907 int ksize = _kx->cols + _kx->rows - 1
[all...] |
| cvpyramids.cpp | [all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderTextControlMultiLine.cpp | 64 int factor = toHTMLTextAreaElement(node())->cols();
|
| /external/chromium_org/third_party/libvpx/source/libvpx/test/ |
| pp_filter_test.cc | 22 int cols,
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| fts3_common.tcl | 196 set cols ""
199 append cols " $iCol\[[join $lPos { }]\]"
201 lappend lDoc "\[${docid}${cols}\]"
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT_MKL.h | 54 eigen_assert(m.rows()==m.cols()); \
|
| /external/eigen/Eigen/src/Core/ |
| Transpose.h | 69 inline Index rows() const { return m_matrix.cols(); }
70 inline Index cols() const { return m_matrix.rows(); } function in class:Eigen::Transpose
263 if (m.rows()==m.cols())
294 eigen_assert((rows() == cols() || (RowsAtCompileTime == Dynamic && ColsAtCompileTime == Dynamic))
|
| Diagonal.h | 78 { return m_index.value()<0 ? (std::min<Index>)(m_matrix.cols(),m_matrix.rows()+m_index.value()) : (std::min<Index>)(m_matrix.rows(),m_matrix.cols()-m_index.value()); }
80 inline Index cols() const { return 1; } function in class:Eigen::Diagonal
|
| DiagonalProduct.h | 55 eigen_assert(diagonal.diagonal().size() == (ProductOrder == OnTheLeft ? matrix.rows() : matrix.cols()));
59 EIGEN_STRONG_INLINE Index cols() const { return m_matrix.cols(); } function in class:Eigen::DiagonalProduct
|
| MapBase.h | 62 using Base::cols;
80 inline Index cols() const { return m_cols.value(); } function in class:Eigen::MapBase
182 using Base::cols;
|
| /external/eigen/doc/ |
| tutorial.cpp | 27 int rows = 3, cols = 3; local
|
| /external/eigen/unsupported/Eigen/src/AutoDiff/ |
| AutoDiffJacobian.h | 66 for (Index i=0; i<jac.cols(); i++)
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteCholesky.h | 51 Index cols() const { return m_L.cols(); } function in class:Eigen::IncompleteCholesky
111 eigen_assert(cols()==b.rows()
146 Index n = m_L.cols();
|
| /external/javasqlite/src/main/java/SQLite/ |
| Shell.java | 26 String cols[]; field in class:Shell
167 cols = args;
186 pw.println(cols[i] + " = " +
196 w = cols[i].length();
202 pw.print(csep + cols[i]);
224 pw.print(cols[i] +
245 pw.print("<TH>" + html_quote(cols[i]) + "</TH>");
|
| /external/libvpx/libvpx/test/ |
| pp_filter_test.cc | 22 int cols,
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_idct.h | 90 transform_1d cols, rows; // vertical and horizontal member in struct:__anon4467
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_utilities_indexing.h | 35 inline void db_SetupMatrixRefs(double **ar,long rows,long cols,double *a)
38 for(i=0;i<rows;i++) ar[i]=&a[i*cols];
41 inline void db_SymmetricExtendUpperToLower(double **A,int rows,int cols)
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/test/ |
| core-extensions.rb | 166 rows, cols, xpixels, ypixels = data.unpack( "SSSS" )
167 if cols >= 0 then cols else default_width end
|
| /external/ceres-solver/internal/ceres/ |
| gradient_checking_cost_function.cc | 159 term_jacobians[k].cols()) = term_jacobians[k];
168 static_cast<long>(term_jacobians[k].cols()));
174 for (int j = 0; j < term_jacobians[k].cols(); j++) {
|
