| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_curses.py | 260 lines, cols = curses.LINES, curses.COLS
261 curses.resizeterm(lines - 1, cols + 1)
263 if curses.LINES != lines - 1 or curses.COLS != cols + 1:
264 raise RuntimeError, "Expected resizeterm to update LINES and COLS"
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_curses.py | 260 lines, cols = curses.LINES, curses.COLS
261 curses.resizeterm(lines - 1, cols + 1)
263 if curses.LINES != lines - 1 or curses.COLS != cols + 1:
264 raise RuntimeError, "Expected resizeterm to update LINES and COLS"
|
| /external/ceres-solver/internal/ceres/ |
| solver_impl_test.cc | 872 int* cols = expected_block_sparse_jacobian.mutable_cols(); local
875 cols[0] = 0;
878 cols[1] = 1;
880 cols[2] = 1;
883 cols[3] = 2;
885 cols[4] = 2;
888 cols[5] = 3;
890 cols[6] = 3;
893 cols[7] = 4;
895 cols[8] = 4
969 int* cols = expected_block_sparse_jacobian.mutable_cols(); local
[all...] |
| block_structure.h | 83 vector<Block> cols; member in struct:ceres::internal::CompressedRowBlockStructure
89 vector<CompressedColumn> cols; member in struct:ceres::internal::CompressedColumnBlockStructure
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 75 static const int Cols = Traits::ColsAtCompileTime;
81 typedef Matrix<ComplexScalar, Rows, Cols, Options, MaxRows, MaxCols> ComplexMatrix;
368 m_fT.resize(m_T.rows(), m_T.cols());
437 eigen_assert(A.rows() == A.cols());
439 eigen_assert(B.rows() == B.cols());
442 eigen_assert(C.cols() == B.rows());
528 Index cols() const { return m_A.cols(); } function in class:Eigen::MatrixFunctionReturnValue
552 eigen_assert(rows() == cols());
559 eigen_assert(rows() == cols());
[all...] |
| MatrixExponential.h | 170 m_U(M.rows(),M.cols()),
171 m_V(M.rows(),M.cols()),
172 m_tmp1(M.rows(),M.cols()),
173 m_tmp2(M.rows(),M.cols()),
174 m_Id(MatrixType::Identity(M.rows(), M.cols())),
429 Index cols() const { return m_src.cols(); } function in struct:Eigen::MatrixExponentialReturnValue
448 eigen_assert(rows() == cols());
|
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| SDL_yuv_mmx.c | 83 int rows, int cols, int mod )
88 unsigned char* y = lum +cols*rows; // Pointer to the end
91 row2 = (Uint32 *)out+cols+mod; // start of second row
92 mod = (mod+cols+mod)*4; // increment for row1 in byte
125 // L2=lum+cols
223 "addl %4,%2\n" // lum += cols
234 "r"(row1),"r"(cols),"r"(row2),"m"(x),"m"(y),"m"(mod),
244 int rows, int cols, int mod )
249 unsigned char* y = lum +cols*rows; /* Pointer to the end */
252 row2 = (Uint16 *)out+cols+mod; /* start of second row *
[all...] |
| /external/opencv/ml/src/ |
| mlcnn.cpp | 132 if( params->etalons->cols != last_layer->n_output_planes* \
144 if( params->etalons->rows != cnn_model->cls_labels->cols ) \
231 const int n_images = responses->cols;
338 nclasses = cnn_model->cls_labels->cols;
363 etalon = cvMat( cnn_model->etalons->cols, 1, CV_32FC1, cnn_model->etalons->data.fl );
364 for( i = 0; i < nclasses; i++, etalon.data.fl += cnn_model->etalons->cols )
426 for( i = 0; i < cls_labels->cols; i++ )
[all...] |
| /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...] |
| /external/chromium_org/chrome/android/java/src/org/chromium/chrome/browser/ |
| ChromeBrowserProviderSuggestionsCursor.java | 22 private static final String[] COLS = new String [] {
50 return COLS;
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 90 : m_matrix(matrix.rows(), matrix.cols()),
171 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::LLT
202 int n = mat.cols();
268 eigen_assert(mat.rows()==mat.cols());
293 eigen_assert(m.rows()==m.cols());
385 eigen_assert(a.rows()==a.cols());
407 eigen_assert(v.size()==m_matrix.cols());
|
| /external/eigen/Eigen/src/Core/ |
| BooleanRedux.h | 93 for(Index j = 0; j < cols(); ++j)
119 for(Index j = 0; j < cols(); ++j)
|
| CwiseUnaryOp.h | 71 EIGEN_STRONG_INLINE Index cols() const { return m_xpr.cols(); } function in class:Eigen::CwiseUnaryOp
|
| CwiseUnaryView.h | 72 EIGEN_STRONG_INLINE Index cols() const { return m_matrix.cols(); } function in class:Eigen::CwiseUnaryView
|
| Flagged.h | 54 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::Flagged
|
| ForceAlignedAccess.h | 45 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::ForceAlignedAccess
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrix_MKL.h | 56 static void run(Index rows, Index cols, Index depth, \
79 n = (MKL_INT)cols; \
|
| TriangularSolverMatrix.h | 22 Index size, Index cols,
32 ::run(size, cols, tri, triStride, _other, otherStride, blocking);
47 Index cols = otherSize; local
61 std::size_t sizeB = kc*cols;
77 Index subcols = cols>0 ? l2/(4 * sizeof(Scalar) * otherStride) : 0;
99 for(Index j2=0; j2<cols; j2+=subcols)
101 Index actual_cols = (std::min)(cols-j2,subcols);
170 gebp_kernel(_other+i2, otherStride, blockA, blockB, actual_mc, actual_kc, cols, Scalar(-1), -1, -1, 0, 0, blockW);
|
| /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
61 solve(MatrixType::Identity(this->rows(), this->cols()), result);
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| RealSchur_MKL.h | 51 assert(matrix.cols() == matrix.rows()); \
53 lapack_int n = matrix.cols(), sdim, info; \
|
| SelfAdjointEigenSolver_MKL.h | 47 eigen_assert(matrix.cols() == matrix.rows()); \
52 lapack_int n = matrix.cols(), lda, matrix_order, info; \
|
| /external/eigen/bench/ |
| bench_gemm.cpp | 47 int M = c.rows(); int N = c.cols(); int K = a.cols();
58 int M = c.rows(); int N = c.cols(); int K = a.cols();
69 int M = c.rows(); int N = c.cols(); int K = a.cols();
80 int M = c.rows(); int N = c.cols(); int K = a.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 | 98 matrix(T* data, int rows, int cols, int stride)
100 return Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >(data, rows, cols, OuterStride<>(stride));
|
| /external/eigen/test/ |
| sparse_vector.cpp | 12 template<typename Scalar> void sparse_vector(int rows, int cols)
14 double densityMat = (std::max)(8./(rows*cols), 0.01);
|
