| /external/eigen/test/ |
| sparse_basic.cpp | 19 const Index rows = ref.rows(); local
24 double density = (std::max)(8./(rows*cols), 0.01);
31 SparseMatrixType m(rows, cols);
32 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
33 DenseVector vec1 = DenseVector::Random(rows);
60 int i = internal::random<int>(0,rows-1);
62 int h = internal::random<int>(1,rows-i-1);
89 for(int r=0; r<rows; r++)
103 DenseMatrix m1(rows,cols)
[all...] |
| array_replicate.cpp | 23 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols);
29 VectorType v1 = VectorType::Random(rows);
37 x1.resize(rows*f1,cols*f2);
40 x1.block(i*rows,j*cols,rows,cols) = m1;
43 x2.resize(2*rows,3*cols);
48 x2.resize(rows,f1)
[all...] |
| array_for_matrix.cpp | 19 Index rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols);
26 ColVectorType cv1 = ColVectorType::Random(rows);
34 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);
35 VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );
62 VERIFY_IS_APPROX(m1.block(0,0,rows,0).rowwise().prod(), ColVectorType::Ones(rows));
80 Index rows = m.rows(); local
149 Index rows = m.rows(); local
192 Index rows = t.rows(), cols = t.cols(); local
[all...] |
| dontalign.cpp | 27 Index rows = m.rows(); local
30 MatrixType a = MatrixType::Random(rows,cols);
31 SquareMatrixType square = SquareMatrixType::Random(rows,rows);
32 VectorType v = VectorType::Random(rows);
43 Scalar* array = internal::aligned_new<Scalar>(rows);
44 v = VectorType::MapAligned(array, rows);
45 internal::aligned_delete(array, rows);
|
| spqr_support.cpp | 17 int rows = internal::random<int>(1,maxRows); local
18 int cols = internal::random<int>(1,rows);
19 double density = (std::max)(8./(rows*cols), 0.01);
21 A.resize(rows,rows);
22 dA.resize(rows,rows);
25 return rows;
38 int m = A.rows();
|
| householder.cpp | 21 Index rows = m.rows(); local
34 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols));
41 VectorType v1 = VectorType::Random(rows), v2;
46 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(v1.tail(rows-1).norm(), v1.norm());
47 v1 = VectorType::Random(rows);
52 MatrixType m1(rows, cols),
53 m2(rows, cols);
55 v1 = VectorType::Random(rows);
[all...] |
| permutationmatrices.cpp | 17 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime,
19 typedef PermutationMatrix<Rows> LeftPermutationType;
20 typedef Matrix<int, Rows, 1> LeftPermutationVectorType;
26 Index rows = m.rows(); local
29 MatrixType m_original = MatrixType::Random(rows,cols);
31 randomPermutationVector(lv, rows);
38 for (int i=0; i<rows; i++)
42 Matrix<Scalar,Rows,Rows> lm(lp)
[all...] |
| corners.cpp | 19 Index rows = m.rows(); local
22 Index r = internal::random<Index>(1,rows);
25 MatrixType matrix = MatrixType::Random(rows,cols);
26 const MatrixType const_matrix = MatrixType::Random(rows,cols);
30 COMPARE_CORNER(bottomLeftCorner(r,c), block(rows-r,0,r,c));
31 COMPARE_CORNER(bottomRightCorner(r,c), block(rows-r,cols-c,r,c));
33 Index sr = internal::random<Index>(1,rows) - 1;
34 Index nr = internal::random<Index>(1,rows-sr);
40 COMPARE_CORNER(bottomRows(r), block(rows-r,0,r,cols))
52 rows = MatrixType::RowsAtCompileTime, enumerator in enum:__anon25651
[all...] |
| sparse_product.cpp | 27 Index r = internal::random<Index>(0,m2.rows()-1);
42 const Index rows = internal::random<Index>(1,n); local
48 double density = (std::max)(8./(rows*cols), 0.1);
60 DenseMatrix refMat2 = DenseMatrix::Zero(rows, depth);
61 DenseMatrix refMat2t = DenseMatrix::Zero(depth, rows);
64 DenseMatrix refMat4 = DenseMatrix::Zero(rows, cols);
65 DenseMatrix refMat4t = DenseMatrix::Zero(cols, rows);
67 DenseMatrix refMat6 = DenseMatrix::Random(rows, rows);
68 DenseMatrix dm4 = DenseMatrix::Zero(rows, rows)
[all...] |
| diagonalmatrices.cpp | 16 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
17 typedef Matrix<Scalar, Rows, 1> VectorType;
19 typedef Matrix<Scalar, Rows, Rows> SquareMatrixType;
20 typedef DiagonalMatrix<Scalar, Rows> LeftDiagonalMatrix;
22 typedef Matrix<Scalar, Rows==Dynamic?Dynamic:2*Rows, Cols==Dynamic?Dynamic:2*Cols> BigMatrix;
23 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols)
[all...] |
| product_selfadjoint.cpp | 21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
27 VectorType v1 = VectorType::Random(rows),
28 v2 = VectorType::Random(rows),
29 v3(rows);
30 RowVectorType r1 = RowVectorType::Random(rows),
31 r2 = RowVectorType::Random(rows);
32 RhsMatrixType m4 = RhsMatrixType::Random(rows,10)
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 177 Matrix(unsigned Rows, unsigned Cols) :
178 Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
183 Matrix(unsigned Rows, unsigned Cols, PBQPNum InitVal)
184 : Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
185 std::fill(Data, Data + (Rows * Cols), InitVal);
190 : Rows(M.Rows), Cols(M.Cols), Data(new PBQPNum[Rows * Cols])
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_inverse.cpp | 19 int rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2(rows, cols),
28 mzero = MatrixType::Zero(rows, cols),
29 identity = MatrixType::Identity(rows, rows);
31 while(ei_abs(m1.determinant()) < RealScalar(0.1) && rows <= 8)
33 m1 = MatrixType::Random(rows, cols);
|
| eigen2_svd.cpp | 18 int rows = m.rows(); local
23 MatrixType a = MatrixType::Random(rows,cols);
25 Matrix<Scalar, MatrixType::RowsAtCompileTime, 1>::Random(rows,1);
34 MatrixType sigma = MatrixType::Zero(rows,cols);
35 MatrixType matU = MatrixType::Zero(rows,rows);
37 matU.block(0,0,rows,cols) = svd.matrixU();
42 if (rows==cols)
46 MatrixType a1 = MatrixType::Random(rows,cols)
[all...] |
| eigen2_adjoint.cpp | 22 int rows = m.rows(); local
29 MatrixType m1 = MatrixType::Random(rows, cols),
30 m2 = MatrixType::Random(rows, cols),
31 m3(rows, cols),
32 mzero = MatrixType::Zero(rows, cols),
33 identity = SquareMatrixType::Identity(rows, rows),
34 square = SquareMatrixType::Random(rows, rows);
[all...] |
| eigen2_sparse_vector.cpp | 12 template<typename Scalar> void sparse_vector(int rows, int cols)
14 double densityMat = std::max(8./(rows*cols), 0.01);
15 double densityVec = std::max(8./float(rows), 0.1);
22 SparseMatrixType m1(rows,cols);
23 SparseVectorType v1(rows), v2(rows), v3(rows);
24 DenseMatrix refM1 = DenseMatrix::Zero(rows, cols);
25 DenseVector refV1 = DenseVector::Random(rows),
26 refV2 = DenseVector::Random(rows),
[all...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| unordered.test | 41 {0 0 0 {SCAN TABLE t1 USING INDEX i1 (~128 rows)}}
42 {0 0 0 {SCAN TABLE t1 (~128 rows)} 0 0 0 {USE TEMP B-TREE FOR ORDER BY}}
44 {0 0 0 {SEARCH TABLE t1 USING INDEX i1 (a>?) (~32 rows)}}
45 {0 0 0 {SCAN TABLE t1 (~42 rows)}}
47 {0 0 0 {SEARCH TABLE t1 USING INDEX i1 (a=?) (~1 rows)}}
48 {0 0 0 {SEARCH TABLE t1 USING INDEX i1 (a=?) (~1 rows)}
51 {0 0 0 {SEARCH TABLE t1 USING COVERING INDEX i1 (~1 rows)}}
52 {0 0 0 {SEARCH TABLE t1 (~1 rows)}}
54 {0 0 0 {SCAN TABLE t1 USING INDEX i1 (~128 rows)}}
55 {0 0 0 {SCAN TABLE t1 (~128 rows)} 0 0 0 {USE TEMP B-TREE FOR GROUP BY}
[all...] |
| eqp.test | 41 0 0 1 {SEARCH TABLE t1 USING INDEX i1 (a=?) (~10 rows)}
42 0 0 1 {SEARCH TABLE t1 USING INDEX i2 (b=?) (~10 rows)}
43 0 1 0 {SCAN TABLE t2 (~1000000 rows)}
48 0 0 0 {SCAN TABLE t2 (~1000000 rows)}
49 0 1 1 {SEARCH TABLE t1 USING INDEX i1 (a=?) (~10 rows)}
50 0 1 1 {SEARCH TABLE t1 USING INDEX i2 (b=?) (~10 rows)}
55 0 0 0 {SCAN TABLE t1 USING COVERING INDEX i1 (~1000000 rows)}
60 0 0 0 {SCAN TABLE t1 (~1000000 rows)}
66 0 0 0 {SEARCH TABLE t1 USING COVERING INDEX i1 (a=?) (~10 rows)}
71 0 0 0 {SCAN TABLE t3 (~1000000 rows)}
[all...] |
| /external/eigen/bench/ |
| sparse_transpose.cpp | 38 int rows = SIZE; local
42 EigenSparseMatrix sm1(rows,cols), sm3(rows,cols);
47 fillMatrix(density, rows, cols, sm1);
52 DenseMatrix m1(rows,cols), m3(rows,cols);
59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
81 GmmDynSparse gmmT3(rows,cols);
82 GmmSparse m1(rows,cols), m3(rows,cols)
[all...] |
| /cts/tools/signature-tools/templates/ |
| Table.st | 6 $rows$
|
| /external/chromium_org/third_party/WebKit/ManualTests/spatial-navigation/ |
| frameset.html | 2 <frameset border=1 rows="10%,10%,*">
|
| /external/chromium_org/third_party/skia/include/utils/ |
| SkMeshUtils.h | 23 bool init(int texW, int texH, int rows, int cols) {
24 return this->init(NULL, NULL, texW, texH, rows, cols);
28 int texW, int texH, int rows, int cols);
45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
|
| /external/eigen/doc/examples/ |
| class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols)
10 return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols);
15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols)
17 return Eigen::Block<const Derived>(m.derived(), 0, 0, rows, cols);
|
| tut_matrix_resize_fixed_size.cpp | 11 << m.rows() << "x" << m.cols() << std::endl;
|
| /external/skia/include/utils/ |
| SkMeshUtils.h | 23 bool init(int texW, int texH, int rows, int cols) {
24 return this->init(NULL, NULL, texW, texH, rows, cols);
28 int texW, int texH, int rows, int cols);
45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
|
