| /external/eigen/Eigen/src/plugins/ |
| MatrixCwiseBinaryOps.h | 91 return cwiseMin(Derived::Constant(rows(), cols(), other));
117 return cwiseMax(Derived::Constant(rows(), cols(), other));
151 return CwiseScalarEqualReturnType(derived(), Derived::Constant(rows(), cols(), s), internal::scalar_cmp_op<Scalar,Scalar,internal::cmp_EQ>());
|
| /external/eigen/test/ |
| nomalloc.cpp | 31 Index cols = m.cols(); local
33 MatrixType m1 = MatrixType::Random(rows, cols),
34 m2 = MatrixType::Random(rows, cols),
35 m3(rows, cols);
40 c = internal::random<Index>(0, cols-1);
44 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), (m1.array()*m1.array()).matrix());
176 typename MatrixType::Index rows = m.rows(), cols=m.cols(); local
184 Ref r2(m.block(rows/3, cols/4, rows/2, cols/2))
[all...] |
| redux.cpp | 22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols);
28 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + RealScalar(0.2) * m1;
30 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
31 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
33 for(int j = 0; j < cols; j++)
41 const Scalar mean = s/Scalar(RealScalar(rows*cols));
51 Index c0 = internal::random<Index>(0,cols-1)
[all...] |
| sparse_product.cpp | 35 const Index cols = internal::random<Index>(1,n); local
40 double density = (std::max)(8./(rows*cols), 0.2);
54 DenseMatrix refMat3 = DenseMatrix::Zero(depth, cols);
55 DenseMatrix refMat3t = DenseMatrix::Zero(cols, depth);
56 DenseMatrix refMat4 = DenseMatrix::Zero(rows, cols);
57 DenseMatrix refMat4t = DenseMatrix::Zero(cols, rows);
58 DenseMatrix refMat5 = DenseMatrix::Random(depth, cols);
64 SparseMatrixType m3 (depth, cols);
65 SparseMatrixType m3t(cols, depth);
66 SparseMatrixType m4 (rows, cols);
[all...] |
| basicstuff.cpp | 22 Index cols = m.cols(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
39 c = internal::random<Index>(0, cols-1);
70 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1));
81 if(cols!=1 && rows!=1 && MatrixType::SizeAtCompileTime!=Dynamic)
83 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1)))
153 Index cols = m.cols(); local
[all...] |
| is_same_dense.cpp | 25 VERIFY(is_same_dense(m1.block(0,0,m1.rows(),m1.cols()),m1));
|
| jacobisvd.cpp | 32 if(m.rows()==m.cols())
41 Index cols = m.cols(); local
48 MatrixType a = MatrixType::Zero(rows, cols);
|
| nesting_ops.cpp | 19 typename XprType::PlainObject res(mat.rows(), mat.cols());
52 Index cols = _m.cols(); local
53 MatrixType m1 = MatrixType::Random(rows,cols);
|
| product_notemporary.cpp | 27 Index cols = m.cols(); local
29 ColMajorMatrixType m1 = MatrixType::Random(rows, cols),
30 m2 = MatrixType::Random(rows, cols),
31 m3(rows, cols);
33 ColVectorType cv1 = ColVectorType::Random(cols), cvres(cols);
34 RowMajorMatrixType rm3(rows, cols);
40 Index c0 = internal::random<Index>(4,cols-8),
41 c1 = internal::random<Index>(8,cols-c0)
[all...] |
| /external/libxcam/modules/ocl/ |
| cv_image_process_helper.cpp | 63 int n = cv::getOptimalDFTSize (image.cols);
64 cv::copyMakeBorder (image, padded, 0, m - image.rows, 0, n - image.cols, cv::BORDER_CONSTANT, cv::Scalar::all(0));
82 for (int j = 0; j < image.cols; j++) {
|
| /external/shflags/src/ |
| shflags_test_private.sh | 15 cols=`_flags_columns`
16 value=`expr "${cols}" : '\([0-9]*\)'`
17 assertNotNull "unexpected screen width (${cols})" "${value}"
|
| /external/syslinux/core/ |
| font.c | 156 uint8_t rows, cols; local
173 cols = oreg.eax.b[1];
175 VidCols = --cols; /* Store count-1 (same as rows) */
|
| /external/opencv/cxcore/src/ |
| cxutils.cpp | 78 if( (labels->rows != 1 && (labels->cols != 1 || !CV_IS_MAT_CONT(labels->type))) ||
79 labels->rows + labels->cols - 1 != samples->rows )
91 dims = samples->cols*CV_MAT_CN(samples->type);
102 counters->cols = cluster_count; // cut down counters
289 coeff_count = coeffs->rows + coeffs->cols - 1;
291 if( (coeffs->rows != 1 && coeffs->cols != 1) || (coeff_count != 3 && coeff_count != 4) )
295 if( (roots->rows != 1 && roots->cols != 1) ||
296 roots->rows + roots->cols - 1 != 3 )
657 m = a->rows * a->cols;
658 n = r->rows * r->cols;
819 int cont_flag, arr_size, elem_size, cols, step; local
918 int rows, cols; local
[all...] |
| /external/eigen/Eigen/src/Core/ |
| DenseBase.h | 79 using Base::cols;
104 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
110 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
221 : int(IsRowMajor) ? this->rows() : this->cols();
233 : int(IsRowMajor) ? this->cols() : this->rows();
252 void resize(Index rows, Index cols)
255 EIGEN_ONLY_USED_FOR_DEBUG(cols);
256 eigen_assert(rows == this->rows() && cols == this->cols()
329 Constant(Index rows, Index cols, const Scalar& value)
[all...] |
| /external/gemmlowp/internal/ |
| multi_thread_gemm.h | 465 const int cols = result_block.cols; variable
466 const int depth = lhs.cols();
474 for (int c = 0; c < cols; c += block_params.l2_cols) {
475 int cs = std::min(block_params.l2_cols, cols - c);
552 inline int HowManyThreads(int max_num_threads, int rows, int cols, int depth) {
577 // that the cubic size (rows*cols*depth) is big enough to keep
585 std::uint64_t(rows) * std::uint64_t(cols) * std::uint64_t(depth);
616 assert(lhs.cols() == rhs.rows());
619 int cols = result->cols() local
[all...] |
| compute.h | 69 for (int col = 0; col < packed_result_block.cols(); col++) {
91 void ComputeL1(int start_row, int rows, int start_col, int cols,
94 assert(cols % Format::kCols == 0);
97 for (int c = 0; c < cols; c += Format::kCols) {
|
| /external/gemmlowp/meta/ |
| test_gemm_correctness.cc | 80 void prepare_test_data(std::uint8_t* data, std::int32_t rows, std::int32_t cols,
83 for (int i = 0; i < rows * cols; ++i) {
90 void clear(int rows, int cols, CLEAR_TYPE* data) {
91 for (int i = 0; i < rows * cols; ++i) {
97 int cols, int depth) {
101 for (int j = 0; j < cols; ++j) {
117 int actual = static_cast<int>(results[i * cols + j]);
126 std::cout << wrong << "/" << (rows * cols) << std::endl;
132 int cols, int depth) {
136 for (int j = 0; j < cols; ++j)
[all...] |
| /external/opencv/cvaux/src/ |
| cvtrifocal.cpp | 109 for(j=0;j<matrix->cols;j++)
138 numPoints = points->cols;
139 if( numPoints <= 0 || numPoints != normPoints->cols )
149 if(cameraMatr->rows != 3 || cameraMatr->cols != 3)
202 if( (points1->cols != points2->cols) || (points1->cols != points3->cols) || (points1->cols != 6) /* || (points4D->cols !=6) */
[all...] |
| /external/dng_sdk/source/ |
| dng_reference.cpp | 87 uint32 cols,
99 for (uint32 col = 0; col < cols; col++)
128 uint32 cols,
140 for (uint32 col = 0; col < cols; col++)
169 uint32 cols,
181 for (uint32 col = 0; col < cols; col++)
210 uint32 cols,
226 for (uint32 col = 0; col < cols; col++)
259 uint32 cols,
275 for (uint32 col = 0; col < cols; col++
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixVector.h | 41 Index cols = IsLower ? (std::min)(_rows,_cols) : _cols; local
44 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
48 const RhsMap rhs(_rhs,cols,InnerStride<>(rhsIncr));
81 if((!IsLower) && cols>size)
84 rows, cols-size,
112 Index cols = IsLower ? diagSize : _cols; local
115 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
119 const RhsMap rhs(_rhs,cols);
141 Index r = IsLower ? pi : cols - pi - actualPanelWidth;
155 rows-diagSize, cols,
[all...] |
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR_LAPACKE.h | 51 lapack_int n = (lapack_int) mat.cols(); \
|
| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 128 inline Index cols() const { return m_pmat.cols();} function in class:Eigen::SparseQR
205 y.resize((std::max<Index>)(cols(),y.rows()),y.cols());
210 if (m_perm_c.size()) dest = colsPermutation() * y.topRows(cols());
211 else dest = y.topRows(cols());
315 Index n = mat.cols();
354 StorageIndex n = StorageIndex(mat.cols());
607 inline Index rows() const { return m_transpose ? m_qr.rows() : m_qr.cols(); }
608 inline Index cols() const { return m_other.cols(); function in struct:Eigen::SparseQR_QProduct
676 inline Index cols() const { return (std::min)(m_qr.rows(),m_qr.cols()); } function in struct:Eigen::SparseQRMatrixQReturnType
[all...] |
| /external/lisa/libs/utils/android/workloads/ |
| sysapp.py | 186 cols = []
191 cols.append("test-name")
194 cols.append(name[4:])
198 return pd.DataFrame([vals], columns=cols)
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixSquareRoot.h | 184 eigen_assert(arg.rows() == arg.cols());
185 result.resize(arg.rows(), arg.cols());
212 eigen_assert(arg.rows() == arg.cols());
216 result.resize(arg.rows(), arg.cols());
220 for (Index j = 1; j < arg.cols(); j++) {
262 eigen_assert(arg.rows() == arg.cols());
270 MatrixType sqrtT = MatrixType::Zero(arg.rows(), arg.cols());
287 eigen_assert(arg.rows() == arg.cols());
347 Index cols() const { return m_src.cols(); } function in class:Eigen::MatrixSquareRootReturnValue
[all...] |
| /external/eigen/unsupported/Eigen/src/Splines/ |
| SplineFitting.h | 193 const DenseIndex n = pts.cols();
196 chord_lengths.resize(pts.cols());
300 DenseIndex n = pts.cols();
343 const DenseIndex n = points.cols() + derivatives.cols();
374 if (derivativeIndices[derivatives.cols() - 1] == points.cols() - 1)
379 b.col(b.cols() - 2) = y*derivatives.col(derivatives.cols() - 1);
403 b.col(b.cols() - 1) = points.col(points.cols() - 1)
[all...] |
