| /external/eigen/test/ |
| selfadjoint.cpp | 21 Index cols = m.cols(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols),
25 m3(rows, cols),
26 m4(rows, cols);
|
| array_reverse.cpp | 23 Index cols = m.cols(); local
27 MatrixType m1 = MatrixType::Random(rows, cols), m2;
33 for ( int j = 0; j < cols; j++ ) {
34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j));
41 for ( int j = 0; j < cols; j++ ) {
42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j));
49 for ( int j = 0; j < cols; j++ ) {
50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows - 1 - i, cols - 1 - j));
57 for ( int j = 0; j < cols; j++ )
[all...] |
| swap.cpp | 32 typename MatrixType::Index cols = m.cols(); local
35 MatrixType m1 = MatrixType::Random(rows,cols);
36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols);
37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols);
64 m1.swap(m2.block(0,0,rows,cols));
|
| zerosized.cpp | 36 VERIFY(t1.cols() == 0);
43 VERIFY(t2.cols() == 0);
53 Index cols = MatrixType::ColsAtCompileTime==Dynamic ? internal::random<Index>(1,10) : Index(MatrixType::ColsAtCompileTime); local
54 MatrixType m(rows,cols);
55 zeroReduction(m.template block<0,MatrixType::ColsAtCompileTime>(0,0,0,cols));
59 Matrix<Scalar,Dynamic,Dynamic> prod = m.template block<MatrixType::RowsAtCompileTime,0>(0,0,rows,0) * m.template block<0,MatrixType::ColsAtCompileTime>(0,0,0,cols);
60 VERIFY(prod.rows()==rows && prod.cols()==cols);
|
| array.cpp | 21 Index cols = m.cols(); local
23 ArrayType m1 = ArrayType::Random(rows, cols),
24 m2 = ArrayType::Random(rows, cols),
25 m3(rows, cols);
30 RowVectorType rv1 = RowVectorType::Random(cols);
37 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1);
39 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1));
40 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1);
41 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) )
138 Index cols = m.cols(); local
216 Index cols = m.cols(); local
[all...] |
| sizeoverflow.cpp | 22 void triggerMatrixBadAlloc(Index rows, Index cols)
24 VERIFY_THROWS_BADALLOC( MatrixType m(rows, cols) );
25 VERIFY_THROWS_BADALLOC( MatrixType m; m.resize(rows, cols) );
26 VERIFY_THROWS_BADALLOC( MatrixType m; m.conservativeResize(rows, cols) );
39 // there are 2 levels of overflow checking. first in PlainObjectBase.h we check for overflow in rows*cols computations.
|
| spqr_support.cpp | 20 int cols = internal::random<int>(1,rows); local
21 double density = (std::max)(8./(rows*cols), 0.01);
23 A.resize(rows,cols);
24 dA.resize(rows,cols);
|
| /external/autotest/contrib/ |
| watch_expensive_rpcs.py | 29 cols = [x.text.strip() for x in row.findAll('td')]
30 if not cols:
32 if cols[3] == 'W' and int(cols[5]) > 10 and cols[1] != '-':
33 pids.append((cols[1], cols[3], cols[5]))
|
| /external/eigen/Eigen/src/Core/products/ |
| Parallelizer.h | 86 void parallelize_gemm(const Functor& func, Index rows, Index cols, Index depth, bool transpose)
97 func(0,rows, 0,cols);
108 Index size = transpose ? rows : cols;
112 double work = static_cast<double>(rows) * static_cast<double>(cols) *
124 return func(0,rows, 0,cols);
130 std::swap(rows,cols);
140 Index blockCols = (cols / actual_threads) & ~Index(0x3);
148 Index actualBlockCols = (i+1==actual_threads) ? cols-c0 : blockCols;
|
| /external/eigen/bench/ |
| sparse_randomsetter.cpp | 48 int cols = sm1.cols(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
68 int cols = SIZE; local
71 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols);
74 nentries = rows*cols*density;
81 dummy = internal::random<int>(0,rows-1) + internal::random<int>(0,cols-1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1
[all...] |
| sparse_trisolver.cpp | 40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst)
42 dst.startFill(rows*cols*density);
43 for(int j = 0; j < cols; j++)
59 int cols = SIZE; local
63 EigenSparseTriMatrix sm1(rows,cols);
65 DenseVector b = DenseVector::Random(cols);
66 DenseVector x = DenseVector::Random(cols);
72 EigenSparseTriMatrix sm1(rows, cols);
73 fillMatrix(density, rows, cols, sm1);
81 DenseMatrix m1(rows,cols);
[all...] |
| spmv.cpp | 28 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
31 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
41 int cols = size; local
55 cols = atoi(argv[i]+1);
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
82 EigenSparseMatrix sm(rows,cols);
83 DenseVector dv(cols), res(rows);
91 fillMatrix2(nnzPerCol, rows, cols, sm);
96 DenseMatrix dm(rows,cols), (rows,cols) local
[all...] |
| basicbenchmark.h | 44 const int cols = mat.cols(); local
46 MatrixType I(rows,cols);
47 MatrixType m(rows,cols);
|
| sparse_dense_product.cpp | 55 int cols = SIZE; local
58 EigenSparseMatrix sm1(rows,cols);
59 DenseVector v1(cols), v2(cols);
65 //fillMatrix(density, rows, cols, sm1);
66 fillMatrix2(7, rows, cols, sm1);
72 DenseMatrix m1(rows,cols);
93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
106 // std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/float(m1.rows()*m1.cols())*100 << "%\n";
119 //GmmDynSparse gmmT3(rows,cols);
[all...] |
| /external/eigen/doc/snippets/ |
| Tutorial_SlicingCol.cpp | 3 Map<MatrixXf,0,OuterStride<> > M2(M1.data(), M1.rows(), (M1.cols()+2)/3, OuterStride<>(M1.outerStride()*3));
9 Map<RowMajorMatrixXf,0,Stride<Dynamic,3> > M4(M3.data(), M3.rows(), (M3.cols()+2)/3,
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
| LevenbergMarquardtEstimator.java | 254 solvedCols = FastMath.min(rows, cols);
255 diagR = new double[cols];
256 jacNorm = new double[cols];
257 beta = new double[cols];
258 permutation = new int[cols];
259 lmDir = new double[cols];
264 double[] diag = new double[cols];
265 double[] oldX = new double[cols];
267 double[] work1 = new double[cols];
268 double[] work2 = new double[cols];
[all...] |
| /external/dng_sdk/source/ |
| dng_bottlenecks.h | 56 uint32 cols,
66 uint32 cols,
76 uint32 cols,
88 uint32 cols,
101 uint32 cols,
114 uint32 cols,
127 uint32 cols,
140 uint32 cols,
153 uint32 cols,
166 uint32 cols,
[all...] |
| dng_reference.h | 45 uint32 cols,
54 uint32 cols,
63 uint32 cols,
74 uint32 cols,
86 uint32 cols,
98 uint32 cols,
110 uint32 cols,
122 uint32 cols,
134 uint32 cols,
146 uint32 cols,
[all...] |
| /external/eigen/Eigen/src/Core/ |
| PlainObjectBase.h | 40 static EIGEN_ALWAYS_INLINE void run(Index rows, Index cols)
45 bool error = (rows == 0 || cols == 0) ? false
46 : (rows > max_index / cols);
153 EIGEN_STRONG_INLINE Index cols() const { return m_storage.cols(); } function in class:Eigen::PlainObjectBase
163 return m_storage.data()[colId + rowId * m_storage.cols()];
186 return m_storage.data()[colId + rowId * m_storage.cols()];
207 return m_storage.data()[colId + rowId * m_storage.cols()];
226 ? colId + rowId * m_storage.cols()
243 ? colId + rowId * m_storage.cols()
285 && rows>=0 && cols>=0 && "Invalid sizes when resizing a matrix or array."); local
336 resize(rows(), cols); local
420 conservativeResize(rows(), cols); local
[all...] |
| SelfCwiseBinaryOp.h | 21 internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>());
29 internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::add_assign_op<Scalar,Scalar>());
37 internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>());
45 internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
|
| /external/eigen/Eigen/src/QR/ |
| FullPivHouseholderQR.h | 103 FullPivHouseholderQR(Index rows, Index cols)
104 : m_qr(rows, cols),
105 m_hCoeffs((std::min)(rows,cols)),
106 m_rows_transpositions((std::min)(rows,cols)),
107 m_cols_transpositions((std::min)(rows,cols)),
108 m_cols_permutation(cols),
109 m_temp(cols),
119 * FullPivHouseholderQR<MatrixType> qr(matrix.rows(), matrix.cols());
127 : m_qr(matrix.rows(), matrix.cols()),
128 m_hCoeffs((std::min)(matrix.rows(), matrix.cols())),
319 inline Index cols() const { return m_qr.cols(); } function in class:Eigen::FullPivHouseholderQR
463 Index cols = m_qr.cols(); local
628 const Index cols = m_qr.cols(); local
641 Index cols() const { return m_qr.rows(); } function in struct:Eigen::internal::FullPivHouseholderQRMatrixQReturnType
[all...] |
| /external/eigen/blas/ |
| GeneralRank1Update.h | 22 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha)
28 for (Index i=0; i<cols; ++i)
36 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha)
38 general_rank1_update<Scalar,Index,ColMajor,ConjRhs,ConjRhs>::run(rows,cols,mat,stride,u,v,alpha);
|
| /external/eigen/doc/examples/ |
| function_taking_eigenbase.cpp | 8 std::cout << "size (rows, cols): " << b.size() << " (" << b.rows()
9 << ", " << b.cols() << ")" << std::endl;
|
| /external/libvpx/libvpx/vpx_dsp/ |
| subtract.c | 19 void vpx_subtract_block_c(int rows, int cols, int16_t *diff,
26 for (c = 0; c < cols; c++) diff[c] = src[c] - pred[c];
35 void vpx_highbd_subtract_block_c(int rows, int cols, int16_t *diff,
45 for (c = 0; c < cols; c++) {
|
| /external/opencv/cvaux/src/ |
| cvvideo.cpp | 64 if( frame->cols != even->cols || frame->cols != odd->cols ||
|
