Searched refs:cols (Results 176 - 200 of 683) sorted by relevance

1234567891011>>

/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DIncompleteLU.h35 Index cols() const { return m_lu.cols(); } function in class:Eigen::IncompleteLU
41 int size = mat.cols();
84 eigen_assert(cols()==b.rows()
/external/kernel-headers/original/uapi/linux/
H A Dvirtio_console.h47 __u16 cols; member in struct:virtio_console_config
/external/libhevc/decoder/x86/
H A Dihevcd_fmt_conv_ssse3_intr.c63 WORD32 num_rows, num_cols, src_strd, dst_strd, cols, rows; local
66 cols = 0;
128 cols = num_cols >> 4;
143 for(j = 0; j < cols; j++)
219 for(j = 0; j < cols; j++)
250 pu1_u_dst += (cols << 4);
251 pu1_v_dst += (cols << 4);
252 pu1_u_src += 2 * (cols << 4);
253 pu1_v_src += 2 * (cols << 4);
/external/skia/src/utils/
H A DSkBoundaryPatch.cpp44 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) { argument
45 if (rows < 2 || cols < 2) {
50 const SkScalar invC = SkScalarInvert(SkIntToScalar(cols - 1));
52 for (int y = 0; y < cols; y++) {
/external/eigen/test/
H A Dsparse_product.cpp17 Index c = internal::random<Index>(0,m2.cols()-1);
18 Index c1 = internal::random<Index>(0,m2.cols()-1);
28 Index c1 = internal::random<Index>(0,m2.cols()-1);
43 const Index cols = internal::random<Index>(1,n); local
48 double density = (std::max)(8./(rows*cols), 0.1);
62 DenseMatrix refMat3 = DenseMatrix::Zero(depth, cols);
63 DenseMatrix refMat3t = DenseMatrix::Zero(cols, depth);
64 DenseMatrix refMat4 = DenseMatrix::Zero(rows, cols);
65 DenseMatrix refMat4t = DenseMatrix::Zero(cols, rows);
66 DenseMatrix refMat5 = DenseMatrix::Random(depth, cols);
[all...]
H A Djacobisvd.cpp22 Index cols = m.cols(); local
33 MatrixType sigma = MatrixType::Zero(rows,cols);
50 Index cols = m.cols(); local
51 Index diagSize = (std::min)(rows, cols);
73 Index cols = m.cols(); local
83 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols));
127 Index rank = RankAtCompileTime2==Dynamic ? internal::random<Index>(1,cols)
[all...]
H A Dsparse_basic.cpp20 const Index cols = ref.cols(); local
24 double density = (std::max)(8./(rows*cols), 0.01);
31 SparseMatrixType m(rows, cols);
32 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
59 int j = internal::random<int>(0,cols-1);
61 int w = internal::random<int>(1,cols-j-1);
83 for(int c=0; c<cols; c++)
98 VERIFY_RAISES_ASSERT( m.coeffRef(0,m.cols()) = 0 );
103 DenseMatrix m1(rows,cols);
[all...]
H A Dproduct_notemporary.cpp42 Index cols = m.cols(); local
44 ColMajorMatrixType m1 = MatrixType::Random(rows, cols),
45 m2 = MatrixType::Random(rows, cols),
46 m3(rows, cols);
48 ColVectorType cv1 = ColVectorType::Random(cols), cvres(cols);
49 RowMajorMatrixType rm3(rows, cols);
55 Index c0 = internal::random<Index>(4,cols-8),
56 c1 = internal::random<Index>(8,cols
[all...]
H A Dredux.cpp19 Index cols = m.cols(); local
21 MatrixType m1 = MatrixType::Random(rows, cols);
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + RealScalar(0.2) * m1;
27 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
28 VERIFY_IS_APPROX(MatrixType::Ones(rows, cols).sum(), Scalar(float(rows*cols))); // the float() here to shut up excessive MSVC warning about int->complex conversion being lossy
30 for(int j = 0; j < cols; j++)
38 const Scalar mean = s/Scalar(RealScalar(rows*cols));
48 Index c0 = internal::random<Index>(0,cols
[all...]
H A Dpermutationmatrices.cpp27 Index cols = m.cols(); local
29 MatrixType m_original = MatrixType::Random(rows,cols);
34 randomPermutationVector(rv, cols);
39 for (int j=0; j<cols; j++)
84 if(rows>1 && cols>1)
96 i = internal::random<Index>(0, cols-1);
97 do j = internal::random<Index>(0, cols-1); while(j==i);
H A Dspqr_support.cpp18 int cols = internal::random<int>(1,rows); local
19 double density = (std::max)(8./(rows*cols), 0.01);
H A Dzerosized.cpp35 VERIFY(t1.cols() == 0);
42 VERIFY(t2.cols() == 0);
/external/eigen/Eigen/src/Core/products/
H A DTriangularMatrixMatrix.h60 Index rows, Index cols, Index depth,
74 ::run(cols, rows, depth, rhs, rhsStride, lhs, lhsStride, res, resStride, alpha, blocking);
118 Index cols = _cols; local
127 std::size_t sizeB = kc*cols;
159 pack_rhs(blockB, &rhs(actual_k2,0), rhsStride, actual_kc, cols);
189 gebp_kernel(res+startBlock, resStride, blockA, blockB, actualPanelWidth, actualPanelWidth, cols, alpha,
199 gebp_kernel(res+startTarget, resStride, blockA, blockB, lengthTarget, actualPanelWidth, cols, alpha,
214 gebp_kernel(res+i2, resStride, blockA, blockB, actual_mc, actual_kc, cols, alpha, -1, -1, 0, 0, blockW);
259 Index cols = IsLower ? diagSize : _cols; local
268 std::size_t sizeB = kc*cols;
59 run( Index rows, Index cols, Index depth, const Scalar* lhs, Index lhsStride, const Scalar* rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking) argument
[all...]
H A DGeneralMatrixMatrix.h28 Index rows, Index cols, Index depth,
41 ::run(cols,rows,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking,info);
55 static void run(Index rows, Index cols, Index depth, argument
94 const Index actual_kc = (std::min)(k+kc,depth)-k; // => rows of B', and cols of the A'
137 gebp(res+i, resStride, blockA, blockB, actual_mc, actual_kc, cols, alpha, -1,-1,0,0, w);
154 std::size_t sizeB = kc*cols;
171 pack_rhs(blockB, &rhs(k2,0), rhsStride, actual_kc, cols);
181 // micro vertical panel of the large rhs's panel (e.g., cols/4 times).
185 gebp(res+i2, resStride, blockA, blockB, actual_mc, actual_kc, cols, alpha, -1, -1, 0, 0, blockW);
216 void operator() (Index row, Index rows, Index col=0, Index cols argument
27 run( Index rows, Index cols, Index depth, const LhsScalar* lhs, Index lhsStride, const RhsScalar* rhs, Index rhsStride, ResScalar* res, Index resStride, ResScalar alpha, level3_blocking<RhsScalar,LhsScalar>& blocking, GemmParallelInfo<Index>* info = 0) argument
330 gemm_blocking_space(DenseIndex rows, DenseIndex cols, DenseIndex depth) argument
[all...]
/external/eigen/Eigen/src/Core/
H A DBandMatrix.h51 using Base::cols;
85 { return Block<CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
89 { return Block<const CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
136 dst.resize(rows(),cols());
147 DenseMatrixType res(rows(),cols());
155 { return i<0 ? (std::min)(cols(),rows()+i) : (std::min)(rows(),cols()-i); }
207 inline BandMatrix(Index rows=Rows, Index cols=Cols, Index supers=Supers, Index subs=Subs) argument
208 : m_coeffs(1+supers+subs,cols),
217 inline Index cols() cons function in class:Eigen::internal::BandMatrix
269 BandMatrixWrapper(const CoefficientsType& coeffs, Index rows=_Rows, Index cols=_Cols, Index supers=_Supers, Index subs=_Subs) argument
281 inline Index cols() const { return m_coeffs.cols(); } function in class:Eigen::internal::BandMatrixWrapper
[all...]
H A DArray.h151 /** constructs an uninitialized matrix with \a rows rows and \a cols columns.
156 Array(Index rows, Index cols);
186 : Base(other.rows() * other.cols(), other.rows(), other.cols())
193 : Base(other.rows() * other.cols(), other.rows(), other.cols())
203 Base::resize(other.rows(), other.cols());
210 : Base(other.derived().rows() * other.derived().cols(), other.derived().rows(), other.derived().cols())
H A DSelfCwiseBinaryOp.h58 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::SelfCwiseBinaryOp
92 && col >= 0 && col < cols());
111 && col >= 0 && col < cols());
136 eigen_assert(rows() == rhs.rows() && cols() == rhs.cols());
176 tmp = PlainObject::Constant(rows(),cols(),other);
191 tmp = PlainObject::Constant(rows(),cols(), actual_other);
/external/opencv/cvaux/src/
H A Dcvbgfg_codebook.cpp105 roi.width = image->cols;
109 CV_ASSERT( (unsigned)roi.x < (unsigned)image->cols &&
112 roi.x + roi.width <= image->cols &&
115 if( image->cols != model->size.width || image->rows != model->size.height )
120 int bufSz = image->cols*image->rows*sizeof(model->cbmap[0]);
123 model->size = cvSize(image->cols, image->rows);
142 CvBGCodeBookElem** cb = model->cbmap + image->cols*(y + roi.y) + roi.x;
241 image->cols == model->size.width && image->rows == model->size.height &&
246 roi.width = image->cols;
250 CV_ASSERT( (unsigned)roi.x < (unsigned)image->cols
[all...]
/external/opencv/ml/src/
H A Dml_inner_functions.cpp160 int dim = sample->cols;
220 int dim = sample->cols;
277 int dim = data ? data->cols : 0;
345 CV_ASSERT (center->cols == desired_matrix->cols);
347 dim = desired_matrix->cols;
377 int rows, cols; local
385 cols = matrix->cols;
405 for( j = i+1; j < cols;
[all...]
/external/ceres-solver/internal/ceres/
H A Dblock_random_access_diagonal_matrix.cc68 int* cols = tsm_->mutable_cols(); local
79 cols[pos] = block_begin + c;
/external/chromium_org/third_party/WebKit/Source/core/html/
H A DHTMLFrameSetElement.idl25 [Reflect] attribute DOMString cols;
/external/chromium_org/third_party/webrtc/tools/loopback_test/
H A Dstat_tracker.js82 function allColumns(cols) {
84 for (var i = 1; i < cols; ++i) a.push(i);
/external/eigen/Eigen/src/LU/
H A DPartialPivLU_MKL.h49 static lapack_int blocked_lu(lapack_int rows, lapack_int cols, EIGTYPE* lu_data, lapack_int luStride, lapack_int* row_transpositions, lapack_int& nb_transpositions, lapack_int maxBlockSize=256) \
61 n = cols; \
H A DPartialPivLU.h150 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
171 inline Index cols() const { return m_lu.cols(); } function in class:Eigen::PartialPivLU
242 const Index cols = lu.cols(); local
243 const Index size = (std::min)(rows,cols);
249 Index rcols = cols-k-1;
284 * by the variables \a rows, \a cols, \a lu_data, and \a lu_stride using a
298 static Index blocked_lu(Index rows, Index cols, Scalar* lu_data, Index luStride, PivIndex* row_transpositions, PivIndex& nb_transpositions, Index maxBlockSize=256) argument
300 MapLU lu1(lu_data,StorageOrder==RowMajor?rows:luStride,StorageOrder==RowMajor?luStride:cols);
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparseSparseProductWithPruning.h29 Index cols = rhs.outerSize(); local
46 res.resize(cols, rows);
48 res.resize(rows, cols);
51 double ratioColRes = double(estimated_nnz_prod)/double(lhs.rows()*rhs.cols());
52 for (Index j=0; j<cols; ++j)
55 //double ratioColRes = (double(rhs.innerVector(j).nonZeros()) + double(lhs.nonZeros())/double(lhs.cols()))/double(lhs.rows());
90 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
104 SparseTemporaryType _res(res.rows(), res.cols());
117 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
137 // SparseTemporaryType _res(res.cols(), re
[all...]

Completed in 2702 milliseconds

1234567891011>>